{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"createContainerWithFragments (cyclomatic 69): createContainerWithFragments has cyclomatic complexity 69 (threshold 15). Of this number, 58 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayPaginationContainer.js"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffda9f0bb4cf4fe323fcb52afa3540b3d99a385cbaba782601d2eaabf3cc4639"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 51): (anonymous) has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 1 of the 51 points is its own statement and the rest belongs to 16 function items inside it that branch (_setResolverValue, invalidateDataIDs, _isInvalid, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"600984fb54d53fb280bc84501111f8502adecc2c2977000c27884006ba230a0f"}},{"ruleId":"D1","level":"warning","message":{"text":"toPayload (cyclomatic 51): toPayload has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 1 of the 51 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 269, 250, 235, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/useRelayHandoff.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"88846680cf68e80a5e9ebdd8a40c85e68b0de62d646388c0fc14c032da781f52"}},{"ruleId":"D1","level":"warning","message":{"text":"schema_diff::detect_changes_from_schemas (cyclomatic 45): schema_diff::detect_changes_from_schemas has cyclomatic complexity 45 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa103b6d499765d691008d08694d4ed7839722874dcc4a26e26b4673d51dc0e1"}},{"ruleId":"D1","level":"warning","message":{"text":"createContainerWithFragments (cyclomatic 45): createContainerWithFragments has cyclomatic complexity 45 (threshold 15). Of this number, 28 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayRefetchContainer.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c9f6b96167653893b7e0ba352f458ba1785c29cc3d41d202362329bcbf9e5e"}},{"ruleId":"D1","level":"warning","message":{"text":"update (cyclomatic 44): update has cyclomatic complexity 44 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/ConnectionHandler.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70073615f846695ee23332daece86ec71c848a7ab2df8df7b1d62f7368130e7"}},{"ruleId":"D1","level":"warning","message":{"text":"_project (cyclomatic 43): _project has cyclomatic complexity 43 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 21 belong to 9 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/RelayServerHandoff.js"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7f1137e9b6ad3c9418dd30da7e00a0e7057aab3ae227bf27b849f3c8e21e10"}},{"ruleId":"D1","level":"warning","message":{"text":"schema_diff::diff_definitions (cyclomatic 40): schema_diff::diff_definitions has cyclomatic complexity 40 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d6b7e48722706ed87e690856a1c6b579c8cb13b915dee0763717b945707c96"}},{"ruleId":"D1","level":"warning","message":{"text":"recycleNodesIntoImplOptimized (cyclomatic 40): recycleNodesIntoImplOptimized has cyclomatic complexity 40 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/recycleNodesInto.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f60c330cf629abb07b94fd789af31db355c709646422708c6f8473e85ca199d"}},{"ruleId":"D1","level":"warning","message":{"text":"_traverseSelections (cyclomatic 39): _traverseSelections 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb96f026e62f6c70ad478fadf5efe9f4921bdb69b0f97ce3e3891e7f27333ca"}},{"ruleId":"D1","level":"warning","message":{"text":"InMemorySchema::build_impl (cyclomatic 36): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"6915dca0c25297e0106fd1185c7a0a65f1c07bfbf12685c736b4867d0c8f34ae"}},{"ruleId":"D1","level":"warning","message":{"text":"_traverseSelections (cyclomatic 36): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8f5b3fbdaa116d3c32a193d4490f69b3bef281626dec453094c82b8be6325b"}},{"ruleId":"D1","level":"warning","message":{"text":"readWithIdentifier (cyclomatic 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/FragmentResource.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca14a236a581d0d4d3c175ceb22f372050fbef64763b4a5ac0b4c808da60c0c"}},{"ruleId":"D1","level":"warning","message":{"text":"InMemorySchema::add_definition_with_field_names (cyclomatic 35): InMemorySchema::add_definition_with_field_names has cyclomatic complexity 35 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"340b721065b7553632d56314a25736091b3e4a32270ae2ec91979ead95e490bc"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 35): (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, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayPublishQueue.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"781cdc0ad53917632140d11d06701ca0a868dc943a466081fb76103d3799806d"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecTimeS2CDataChecker.toChecks (cyclomatic 34): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/ExecTimeS2CDataChecker.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5d2d9ecb922ea80163c9f4cde4d2348333bff36dabfe12edfdc0d6f60dedfe"}},{"ruleId":"D1","level":"warning","message":{"text":"RelayReferenceMarker._traverseSelections (cyclomatic 33): RelayReferenceMarker._traverseSelections has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to one function literal inside it that branches (line 286). 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReferenceMarker.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b94a887d2bd71efc971c1a2ee87c0c0ac3101dc6d311aae7a144b7dc45795b"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaChange::get_safety (cyclomatic 32): SchemaChange::get_safety has cyclomatic complexity 32 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/check.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d3a06c65fa6e0848556ad21506a44b76f2842c395a707a8f87bd58201bb671"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_graphql::extract (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/extract-graphql/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef36c6adef300a74471cbb0768830c89dbd46f1c11fd5762b28e75aec752d49a"}},{"ruleId":"D1","level":"warning","message":{"text":"_readClientEdge (cyclomatic 30): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c760c3606f7d8992c9a97e7ce0ed576860198271dc5953706177e532c7fde17"}},{"ruleId":"D1","level":"warning","message":{"text":"_readClientEdge (cyclomatic 30): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":3002}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8daabfa23928dfa2381330744759dfcb3e9bc9c3492043d4aa065a5d7722889"}},{"ruleId":"D1","level":"warning","message":{"text":"loadQuery (cyclomatic 30): 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, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/loadQuery.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3acce560e9b710efe36b96982066573291ee79818b9b05ce8f02d2a6586ce43"}},{"ruleId":"D1","level":"warning","message":{"text":"updateProxyFromSelections (cyclomatic 30): updateProxyFromSelections has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/createUpdatableProxy.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"989def600cbb64a80f4d1fdc9ee0facb953460c62117000a120f01f1901012c1"}},{"ruleId":"D1","level":"warning","message":{"text":"RelayResolverSpreadTransform::rebind_selection (cyclomatic 29): RelayResolverSpreadTransform::rebind_selection 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"be06f1be2dbdd5e07062b1a0d4b161d75a35dc6ad6bceffff69088b313ad1751"}},{"ruleId":"D1","level":"warning","message":{"text":"readFragmentInternal (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"775d2918426d3f83ddaaf18b601cd7a231ce2dbf4e76dc493a92ae06bdf633ae"}},{"ruleId":"D1","level":"warning","message":{"text":"recycleNodesIntoImpl (cyclomatic 29): recycleNodesIntoImpl has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/recycleNodesInto.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c918b2a9d93ffac74111802562498f5eae626feed363660e6103ba2ecd1c20f0"}},{"ruleId":"D1","level":"warning","message":{"text":"RelayResponseNormalizer._traverseSelections (cyclomatic 28): RelayResponseNormalizer._traverseSelections 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd45099c00a3afc8e5ba8e3b812f77ce7d4b0017c5e16534c13cc8393accbc8b"}},{"ruleId":"D1","level":"warning","message":{"text":"DataChecker._traverseSelections (cyclomatic 28): 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 365). 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/DataChecker.js"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"2026de0c3adb9ed21e318b869ea47836edd849ab72299916a99f427b46906a11"}},{"ruleId":"D1","level":"warning","message":{"text":"RelayObservable.subscribe (cyclomatic 27): RelayObservable.subscribe has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/network/RelayObservable.js"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5eb7d6d51ea472044b69b7d044dfa92e933cb5f34bb146f992e5e7d11af47c8"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor._handleNext (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bbf7a08b05a053c5acc107d87fe0bdeefa7e0c9baeccaac83739840281696d"}},{"ruleId":"D1","level":"warning","message":{"text":"RelayModernStore.notify (cyclomatic 26): RelayModernStore.notify has cyclomatic complexity 26 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3136f580f505ebc1a928f3b9fb186d1d2ac5c46de64cf60eb6a0f9f893d04ee"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_compiler::artifact_content::content::generate_operation (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3e87006b768a38c6d01aa5e7f24989d606af366b8d79e4af064259bacfbf57"}},{"ruleId":"D1","level":"warning","message":{"text":"RelayResponseNormalizer._normalizeField (cyclomatic 25): RelayResponseNormalizer._normalizeField 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba545710d541189052f3a3c0317c0af9232cf71d6b3598584834d22f029ba46"}},{"ruleId":"D1","level":"warning","message":{"text":"executeHandoff (cyclomatic 25): executeHandoff 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 12 function items inside it that branch (a function literal at line 385, (anonymous)::(anonymous)::publish, a function literal at line 475, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/useRelayHandoff.js"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61fb9721376690f2196d09e5838a65c4321a01e2890b1d68a792c8bac62b6a2"}},{"ruleId":"D1","level":"warning","message":{"text":"rangeDelete (cyclomatic 24): 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayDeclarativeMutationConfig.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9861393d66b0ddd7e7cf0395ed8a40a00c31a9235bdbe54ecce36832ae432249"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler::watch (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb387bfee50872a1df2d9d656d51bde2d731cceb56d6dfd9d7581504d9c14122"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_compiler::build_project::commit_project (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"0083995acd01aef689f25296466f7a989931c85f4178d8d49568662bf3314484"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_compiler::subschema_extraction::hydrate_output_types (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/subschema_extraction.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91770abfebc6098391bb9ce872e10c44db614698881cb4d140af173b310628f"}},{"ruleId":"D1","level":"warning","message":{"text":"FlattenTransform::can_flatten_selections (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/flatten.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e385b875771d8979c6e1565c305785015a9b1daa3dbacd3026f71113118df1"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionTransform::transform_connection_selections (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/transform_connections.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c890d2222dd3fee9a9b144e9b47a6f64285fb965d5eba143d723755137c9fdaf"}},{"ruleId":"D1","level":"warning","message":{"text":"readFromCacheOrEvaluate (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d0fceb6e407e7389223ae89ce70e80a4cc9f8a7f34aae7de2717499e560d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"_traverseSelections (cyclomatic 23): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"69943b3a0a8dcd11d1ea1abf6cd8fb5c8077c39b03248fee23b98668b642d8dc"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchTransform::validate_transform_fragment_spread (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/match_transform.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"424637115b14ff3f120b24d46aad68164ef684b3312fac4ea555671f3a8dcce3"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchTransform::validate_transform_linked_field_with_match_directive (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/match_transform.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b7dc9e425c6e2ab3446849920ade2625a30a4a3dd529819886b5370e9ac784"}},{"ruleId":"D1","level":"warning","message":{"text":"RelayModernStore.updateTargetFromSource (cyclomatic 22): RelayModernStore.updateTargetFromSource has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb52204263d937016f440ef83fd871a644abbedc65034b918fd59884c48da72"}},{"ruleId":"D1","level":"warning","message":{"text":"preloadQueryDeduped (cyclomatic 22): preloadQueryDeduped has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9544e88562f01154e3ac433bc7a153f73f3ee18515ead800b77dae27500e0823"}},{"ruleId":"D1","level":"warning","message":{"text":"SourcePrinter::write_span_with_highlight_style (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-cli/src/source_printer.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c519717da4f5411345c4a6b5dda9630b8856b88cf5e9855b584b56e1d53443"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclarativeConnectionMutationTransform::transform_linked_field (cyclomatic 21): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/declarative_connection.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5351bb79a2ea64c494076ef0f7092718201c3dfe14456fa3ea2a1d616aba7bc"}},{"ruleId":"D1","level":"warning","message":{"text":"SkipRedundantNodesTransform::transform_selection (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/skip_redundant_nodes.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6688997d5d051236451cc583d1d68528ab13f24aab31dddd7c2665cbec1bd9b8"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_typegen::visit::raw_response_selections_to_babel (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b99fce314d69eb4dc07494fb4e2819f2751c5845ba001cae6209e20b172ef9"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_typegen::write::write_fragment_type_exports_section (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bfaf5e9fba4668fbd1fc072c56907d9b8eb09abdab3605defbba06ad9ee60c"}},{"ruleId":"D1","level":"warning","message":{"text":"serverQuery.execute (cyclomatic 21): serverQuery.execute has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 359, complete, a function literal at line 372, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/serverQuery.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5527a09ddb3266d14506ebcc53f076c51d281fc737ded5da2ac248fa783f78e6"}},{"ruleId":"D1","level":"warning","message":{"text":"RelayDeclarativeMutationConfig.rangeDelete.\u003Creturned closure\u003E (cyclomatic 21): RelayDeclarativeMutationConfig.rangeDelete.\u003Creturned closure\u003E has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayDeclarativeMutationConfig.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2ba66e942146dbf73c1fd27119b536e145f4bb7ae08892da90c1b4f6426383"}},{"ruleId":"D1","level":"warning","message":{"text":"_collect (cyclomatic 21): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c7ae79d57a981304e879df0a5ce713df4c5bf97e99723ac0fc401d05a758da"}},{"ruleId":"D1","level":"warning","message":{"text":"update (cyclomatic 21): update 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"011cf9fbf894b6322c4b68751c5aba13e91b5742f17672e58ba6ef4ddc938569"}},{"ruleId":"D1","level":"warning","message":{"text":"graphql_ir::signatures::build_fragment_variable_definitions (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/signatures.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"638580a483d0a65b609cbe2c46754c9505ff068c2d37baf07aa4954097417305"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_optional_arguments (cyclomatic 20): 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\u0027s highest cyclomatic complexity: Parser::parse_directive_location (cyclomatic 22) is higher and carries no row of its own \u2014 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\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"08526a8500f36292e994662bbe148d25e965699bf5a0a43340c1f23ae9dde3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_codegen::printer::write_constant_value (cyclomatic 20): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/printer.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dad6ff2590b4262533f35242376623fd18d593d36b037e98293965cecd994b"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler::incremental_build_loop (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a17632efdbbcf2653d5a5fa15040f819a63e82d2f2fbe2797e0c01ec2fa847"}},{"ruleId":"D1","level":"warning","message":{"text":"updatePerf (cyclomatic 20): updatePerf 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d7a94728070953e9b3d1a509c5d6eeeb4473e43d07f2e9b8b8836b2c6d608d"}},{"ruleId":"D1","level":"warning","message":{"text":"_fetchAndSaveQuery (cyclomatic 20): _fetchAndSaveQuery has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/QueryResource.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78db53fad6e90aaed4a0512e0c342401f30fe29e5e43f00805ed7d809fd858d"}},{"ruleId":"D1","level":"warning","message":{"text":"LSPStateResources::build_programs (cyclomatic 19): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state_resources.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"93533f94ecb41f79fdfcf0828f5a4eb0c1d228bc3f63a5ccb0b1bcb045f3e3f0"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_lsp::docblock_resolution_info::create_docblock_resolution_info (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/docblock_resolution_info.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5382d67be77b4f4e6235a679091a44b758c8c8f74617c6fa5af4d26a4b4cbd7c"}},{"ruleId":"D1","level":"warning","message":{"text":"ClientEdgesTransform::transform_linked_field_impl (cyclomatic 19): ClientEdgesTransform::transform_linked_field_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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae6c0f46f6b6efc574db81c70c52c28a844e313297404dec7a37b3142cfc1fa"}},{"ruleId":"D1","level":"warning","message":{"text":"ShadowResolversTransform::validate_resolver_metadata (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/shadow_transform.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"db18fbec213a81be8f95beab7a79cba5ccf219f0daf6186392a3acf05a177c6c"}},{"ruleId":"D1","level":"warning","message":{"text":"RscResolverFieldTransform::open_rsc_field (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/rsc_resolver_fields.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7edb61bcee28cc40ee45517178afeb9756d927f6b685e85eda665bb92aefd38"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaSet::fix_all_types_impl (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0530b4e24fa3f00f92b1026bda5ba3d6af43cdb68365b7f2ae096997ed1928de"}},{"ruleId":"D1","level":"warning","message":{"text":"_propagateResolverMetadata (cyclomatic 19): _propagateResolverMetadata 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2878}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61f5667c954900a0829a7ea366ee44f2b69bd34b19b541b31ccc278b9d6276a"}},{"ruleId":"D1","level":"warning","message":{"text":"convert (cyclomatic 19): convert has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 93, 81, 108, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayIncrementalDeliveryConverter.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cac56b05a28b8681d0359b442053d96b2a252478f5263dae04321914b27c35"}},{"ruleId":"D1","level":"warning","message":{"text":"readServerFragment (cyclomatic 19): readServerFragment has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 21 function items inside it that branch ((anonymous)::next, a function literal at line 200, read, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/useServerFragment.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"818833793e97dc651e60d2b176f62f2279996e53163c8201ed8eccb0de66ccd9"}},{"ruleId":"D1","level":"warning","message":{"text":"ArtifactGeneratedTypes::from_operation (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/artifact_generated_types.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"02de54184aa3f23a7f1d90fc1f35ddb5d7bc41b1e80f26a0612475685afd2b26"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilerState::schema_change_safety (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4eb3bc2ad4d7b09866ab42153b030904a0535bb2feaadae2d8a615e677d0634"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_compiler::build_project::build_programs (cyclomatic 18): relay_compiler::build_project::build_programs 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab10e3512d5e5cc1f2214361a2f6e002e2d3c834344812813c066c76a2a907c8"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_compiler::server_daemon::socket::start_server (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/server_daemon/socket.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1b27f98dc08775412b578357b29567a839e0402efbc84af08efde4f4d0e523"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_lsp::completion::completion_items_for_request (cyclomatic 18): relay_lsp::completion::completion_items_for_request has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"76912656cef6e87e1d0b71c808140943f712f6fcecb892f12ec4c5c819315072"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_schema_generation::return_type_to_type_annotation (cyclomatic 18): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce255721fc38240f55598c04373a7188df5ef7160d83521ae35f86f6c7ebfc11"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_transforms::client_edges::validate_s2c_selections (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"20547dbd75e711d87073ef9e6d1a0a214f4ed1004e88f61c8dd05ae7452076e3"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_typegen::visit::make_prop (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d61e9dcf318e6894ce0d0139304bf0192f1f1acae71eb7999d94dfc5931a3d5"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaSet::remove_defined_references (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_remove_defined_references.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b180005a5b9d6d5c774cb601c32c8e60dc684b119081e605a16ae518a5736bc"}},{"ruleId":"D1","level":"warning","message":{"text":"_propagateResolverMetadata (cyclomatic 18): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02ab23e09117b835475835d844fca5f4f2d9e9ea4affeabd60e2d9c58d52b58"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 9 function items inside it that branch (a function literal at line 295, a function literal at line 338, subscribeToSnapshot, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d946101c7bc3a440286044372b3a5a0252c1b211cf1c8cff5df387c9031dbe73"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernEnvironment.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15b54620cf38faacf9fc21d2f14b5c8211a66144c9fb2eb760e1003c17eed92"}},{"ruleId":"D1","level":"warning","message":{"text":"CodegenBuilder::build_inline_fragment (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf9c5159811e218933dae1168c19c97a9b23daa5a5e6a479887d0ec1866e70e"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilerState::merge_file_source_changes (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0b055576737ea01d63c0abd8b4d8eef93012b539017802e39d8ca837d04e90"}},{"ruleId":"D1","level":"warning","message":{"text":"FileCategorizer::categorize (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/file_source/file_categorizer.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf9ffeb66c753794e3759d8520454a13816497f26d1874719ec125466ebdec2"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_compiler::graphql_asts::parse_pending_graphql_source_and_collect_removed_definitions (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/graphql_asts.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a803fad5c8abacffbf5eb82fc6d7c2d9e99bd30ffef67eff42ad66d5c13528"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_lsp::rename::create_rename_request (cyclomatic 17): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/rename.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3cb8cd2fe58cc212bbe7abc4922fe99e2621115fa8a2afe787d61ea3c9ee2a"}},{"ruleId":"D1","level":"warning","message":{"text":"RelayResolverExtractor::parse_document (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a988a4b3389267eee995bb414f5901216870be3ede0c5799e307948b62d940ab"}},{"ruleId":"D1","level":"warning","message":{"text":"FlattenTransform::flatten_selections (cyclomatic 17): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/flatten.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f3fa79f22a2b8620ac1bbffdb39bbbfd263a2e9ca98eee425f5e50bada8258"}},{"ruleId":"D1","level":"warning","message":{"text":"read (cyclomatic 17): read has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d5ec3a80896772ad3600fb07746b868cf3b98615d7003a6e28011a80ec39cd"}},{"ruleId":"D1","level":"warning","message":{"text":"createContainerWithFragments (cyclomatic 17): createContainerWithFragments has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayFragmentContainer.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb09c05393f22971e77bb5c8f75398b0874dbaa2acf47109166624eb0652640b"}},{"ruleId":"D1","level":"warning","message":{"text":"CodegenBuilder::build_reader_client_edge (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed030ce8483c2ac71f4680b74e00a3dfdb7b18f825512b25e4c26d85dd6917d7"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_compiler::compiler::build_projects (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f000d9e1ffd8adf130222941e76c3c6e6c262b56162d1a5cff84b0e462031c"}},{"ruleId":"D1","level":"warning","message":{"text":"ClientImplementorCases::transform_selections_at (cyclomatic 16): ClientImplementorCases::transform_selections_at 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_implementor_cases.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ae363ded4ffd609a1669af1ab4d79d2ebe541b0cfe01c740b6119206da4e74"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerateDataDrivenDependencyMetadata::extract_module_entries_from_selections (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_data_driven_dependency_metadata.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"52877b6e17dcb4db1898053ee6c3f68dc7dd8120ab6536cb56cbb93af5e1b954"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_transforms::generate_relay_resolvers_operations_for_nested_objects::generate_relay_resolvers_operations_for_nested_objects (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfc5313bbc6e7006b12fbcb0e3bf78e51c4b9ec117780f6ba1a17be1431beed"}},{"ruleId":"D1","level":"warning","message":{"text":"relay_transforms::server_documents::validate_server_documents (cyclomatic 16): relay_transforms::server_documents::validate_server_documents 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/server_documents.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79ad34e8984da889a54906d6d09ccea1f7b857955b037275d1e0be6ac97bf95"}},{"ruleId":"D1","level":"warning","message":{"text":"RelayModernRecord.areFieldValuesEqual (cyclomatic 16): RelayModernRecord.areFieldValuesEqual 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4d06307090d0e12807d60d6baa3130db090b408cbfd174091077340803c420"}},{"ruleId":"D1","level":"warning","message":{"text":"useFragmentInternal_EXPERIMENTAL.subscribeToSnapshot (cyclomatic 16): useFragmentInternal_EXPERIMENTAL.subscribeToSnapshot has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 295, 338, 288, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31d619c2a9238bfb2cd7aa28f354a75a66b9e18421f5631674638cf5a254514"}},{"ruleId":"D1","level":"warning","message":{"text":"_registerPlaceholders (cyclomatic 16): _registerPlaceholders has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/NormalizationEngine.js"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed29d4a564e09a50f48c507062556b671b7a155653a06f751d18c7ed20221b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"getSingularSelector (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernSelector.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5c38eed677e11c5790950261540dba275dc81ccd92dab5fdc2f1632d8482be"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useLoadMoreFunction.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8edf9b942edf877cb3ad820de419d01e280211756bbdf18a686bd8a718b3b13"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"710c712a741f79e37cbd675432f0a382a715d2fbe3cd3183cc0d4877550c8686"}},{"ruleId":"D2","level":"warning","message":{"text":"_readClientEdge (cognitive 96): _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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"13458534af699fb2763d63bd0404b2f57f0798045194ae9c491596d4e04bd6fd"}},{"ruleId":"D2","level":"warning","message":{"text":"_readClientEdge (cognitive 96): _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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":3002}}}],"partialFingerprints":{"codehealthFindingId/v1":"03df0a0124de300f46e66c6082fc93e90a2f1df5cf61a11b30a5ed28c9bc7a00"}},{"ruleId":"D2","level":"warning","message":{"text":"schema_diff::diff_definitions (cognitive 87): schema_diff::diff_definitions has cognitive complexity 87 (threshold 15). Drivers by points: if/else 14 (55 pts), match/switch 7 (20 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"21346e27a665d152f6fa36d09e3581c97852df12f1ee4b61340b3dd43c35cf77"}},{"ruleId":"D2","level":"warning","message":{"text":"update (cognitive 83): update has cognitive complexity 83 (threshold 15). Drivers by points: if/else 27 (52 pts), boolean chains 16, ternaries 4 (14 pts), other 1 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/ConnectionHandler.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b78664f2eff9a1fd0c059d1e3325f40d41172c23ac33ef57078f098a11022d3"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaChange::get_safety (cognitive 78): SchemaChange::get_safety has cognitive complexity 78 (threshold 15). Drivers by points: if/else 11 (46 pts), loops 6 (26 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 57). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/check.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed393fe72abc182081c6937de2a68ab0e3931ffe772a23a7df2bdd917a7cbd27"}},{"ruleId":"D2","level":"warning","message":{"text":"createContainerWithFragments (cognitive 77): createContainerWithFragments has cognitive complexity 77 (threshold 15). Drivers by points: if/else 28 (33 pts), ternaries 21 (23 pts), boolean chains 17, loops 2, other 2 (nesting depth added 7). Of this number, 66 points are the body\u0027s 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayPaginationContainer.js"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a8c49ad70ea6dc2b2d40441dd55e203bdaad020fbfd735c28e432f015c4750"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_graphql::extract (cognitive 68): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/extract-graphql/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2681f4d2361102f509a2e16a552bc154cdce8175c762265127391459f0ffe4a3"}},{"ruleId":"D2","level":"warning","message":{"text":"schema_diff::detect_changes_from_schemas (cognitive 66): schema_diff::detect_changes_from_schemas has cognitive complexity 66 (threshold 15). Drivers by points: if/else 11 (35 pts), match/switch 6 (19 pts), loops 3 (7 pts), boolean chains 5 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb46cc21a1358e50a60f8a45753943899aaaabd07ae24afc4b251e5f9f594536"}},{"ruleId":"D2","level":"warning","message":{"text":"graphql_ir::signatures::build_fragment_variable_definitions (cognitive 64): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/signatures.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca9f5bd071983fc5430cb74bd3290208c61cf93332a8ca6e07bb4482fd27a86"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::graphql_asts::parse_pending_graphql_source_and_collect_removed_definitions (cognitive 60): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/graphql_asts.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec68386d7c6f0c628d86cf0368c2e65f79535a87b448744d54356c92b6e22d04"}},{"ruleId":"D2","level":"warning","message":{"text":"_project (cognitive 60): _project has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 11, ternaries 6 (9 pts), other 4, loops 2 (3 pts) (nesting depth added 17). Of this number, 37 points are the body\u0027s own statements and 23 belong to 9 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/RelayServerHandoff.js"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cc9ce52eb962d03ff334505149916a620b34113565ee62574fbbe1963abb08"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::subschema_extraction::hydrate_output_types (cognitive 59): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/subschema_extraction.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48f318f8b911da08fc6ff5deea07a15b7aee934f948a2df6362a7182f5cf469"}},{"ruleId":"D2","level":"warning","message":{"text":"updateTargetFromSource (cognitive 55): updateTargetFromSource has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 2 (6 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 33). Of this number, 45 points are the body\u0027s 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0e60cfc97f1b799ae085591a39ead5bbd9191bce90745ebc50bb670866c1cb"}},{"ruleId":"D2","level":"warning","message":{"text":"toPayload (cognitive 55): toPayload has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 18, ternaries 7 (10 pts), other 3 (nesting depth added 8). None of this is in the body itself: all 55 points belong to 5 function literals inside it that branch (lines 269, 250, 235, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/useRelayHandoff.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a94fc17c02bccc1cf6ce16185be7854f280a06a664c5de78b20b0f6fc9806ce"}},{"ruleId":"D2","level":"warning","message":{"text":"recycleNodesIntoImplOptimized (cognitive 55): recycleNodesIntoImplOptimized has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 18, ternaries 7 (9 pts), loops 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/recycleNodesInto.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3b8dd135651fa30988cd754e6d006de48f1414f7af0eefe49b06e38f12642b"}},{"ruleId":"D2","level":"warning","message":{"text":"SourcePrinter::write_span_with_highlight_style (cognitive 54): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-cli/src/source_printer.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb82980d71865ae1ac7a273a60fa6d8f9b30bd669b923555f66c37546ece963"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler::incremental_build_loop (cognitive 51): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85813532946272db76b0e8f535b206c2e4ddd4e56685fe835fb3348abcb9a3b"}},{"ruleId":"D2","level":"warning","message":{"text":"createContainerWithFragments (cognitive 51): 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\u0027s 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayRefetchContainer.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be4ffbcae4733754fb01f449af341962817f040174b8a52d45385cf9e263b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenBuilder::build_inline_fragment (cognitive 49): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de04a4e7aa98306aa5e0975c89e335b26bb503c5ed582935eb3e7de3bb3cd96"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayResolverSpreadTransform::rebind_selection (cognitive 49): RelayResolverSpreadTransform::rebind_selection has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 5 (12 pts), boolean chains 5 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"becf3bf79b138d71dd0feca0f13e09882bf7213bfba017b9cc02063a81946133"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemorySchema::build_impl (cognitive 49): InMemorySchema::build_impl has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 7 (20 pts), loops 9 (17 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5d93ced07647df4e71f6b1b6fa759e9306e09395999143a34d59aa1ce92fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_typegen::visit::make_prop (cognitive 48): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2979909f14082b7cd6bcd23549385586c4fc3218d08b27b9f40a053c4987486"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemorySchema::add_definition_with_field_names (cognitive 48): InMemorySchema::add_definition_with_field_names has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 8 (15 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"1943820468c9cd329922d086d9d866c7d116865466fd74c681cbde536b327725"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaSet::fix_all_types_impl (cognitive 48): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f90c8d0cd6741b84927bba9b0a926794e05e985400cc3b9af6bf95603c52247"}},{"ruleId":"D2","level":"warning","message":{"text":"_traverseSelections (cognitive 48): _traverseSelections has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (36 pts), boolean chains 5, other 4, match/switch 1 (2 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0d7a9252132266244adaa3347e483543d4aeb19bf2bf363ed078d68b3efcb0"}},{"ruleId":"D2","level":"warning","message":{"text":"FlattenTransform::can_flatten_selections (cognitive 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/flatten.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"680fb9ee23df0cc9c1b60c955509f5ef8781e1cbfd76c1b142d34c33df03dcdf"}},{"ruleId":"D2","level":"warning","message":{"text":"readWithIdentifier (cognitive 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/FragmentResource.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccad9a958e6cceea9065b66e1b587b5c342b8458c4cfdc82905c0a6b5622acb0"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerState::merge_file_source_changes (cognitive 46): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e4a868251e49dc3e553382ea5b362c67ed12fa7033093b0102316db950e88f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 46): (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, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayPublishQueue.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bcf133eb6370c5ccc7df89ccb9944003ca6ae5159337124ad244c1b52bed55"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::build_project::commit_project (cognitive 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd35b39caf03909c10d4da274953e469fba8ef881f5935f64da025c8f57f51c"}},{"ruleId":"D2","level":"warning","message":{"text":"_traverseSelections (cognitive 45): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"799837f6e57384a6afd8d3a88e3f262efa23f2eb140a6d5a839f396d1642d66b"}},{"ruleId":"D2","level":"warning","message":{"text":"_collect (cognitive 45): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb5c1dd49be87c45c8ac8dcc22949e176e3e9c699366c5b9709ca6b45cfe42b"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler::watch (cognitive 44): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd9aacb7c027226129fe33c9c5c965d283c9cce5df263e7068e1c0844190cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"_handleNext (cognitive 44): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"932a8701ff20850afa85f8a2d579737a7bdf6c166687bcb9f749d25b9b010d28"}},{"ruleId":"D2","level":"warning","message":{"text":"loadQuery (cognitive 44): loadQuery has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 5 (11 pts), boolean chains 9, other 2 (nesting depth added 13). Of this number, 16 points are the body\u0027s own statements and 28 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/loadQuery.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"615e460a3d84d9e834050a66709d2d218240cd2b8c9ca426dd7677a59fb195b7"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchTransform::validate_transform_fragment_spread (cognitive 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/match_transform.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c107d1b0d767ec16797ee455e95c7e30da827f660ff01b161380cdd48ad5466e"}},{"ruleId":"D2","level":"warning","message":{"text":"readFromCacheOrEvaluate (cognitive 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68d3abfb3078cc330c6bc10aef484db8db5d2ba72bfc64e96f096701165c29d"}},{"ruleId":"D2","level":"warning","message":{"text":"_normalizeField (cognitive 43): _normalizeField has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (34 pts), boolean chains 7, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c48b794b5ff288031680b30be8876098fb3fc4d4743427b47c8de5312367a3"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclarativeConnectionMutationTransform::transform_linked_field (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/declarative_connection.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8c397f90b97da67292743ac059ea2c74ff442041459762ebf4bad88d418155"}},{"ruleId":"D2","level":"warning","message":{"text":"SkipRedundantNodesTransform::transform_selection (cognitive 42): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/skip_redundant_nodes.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"230b29c057fa14d25fcccc2b29a505c8ff960b1cd3aa8054dbd74c3feab54836"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_typegen::visit::raw_response_selections_to_babel (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cc3ba9f1966407a0eca91494e35db150741b63fa799cb30d85ca7ac1036729"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_optional_arguments (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"40316ddac81c2eb616fd32de3d5584949f10f87ea1dd293a7fc94fae8681b1e1"}},{"ruleId":"D2","level":"warning","message":{"text":"FileCategorizer::categorize (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/file_source/file_categorizer.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"04aafa7523532ebfc2f5e528efe6a6c8f365860bba7274c86b735ece69261119"}},{"ruleId":"D2","level":"warning","message":{"text":"_processFollowupPayload (cognitive 40): _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 1204, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"895efb1de36dd6ab628f86057cdf865fc7d8c7e7bb029e143f943002370e2ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateDataDrivenDependencyMetadata::extract_module_entries_from_selections (cognitive 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_data_driven_dependency_metadata.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b273d657765d1110d5ab137a7c61c367795f13fb660488312d11669a09595ff"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchTransform::validate_transform_linked_field_with_match_directive (cognitive 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/match_transform.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a8852da1cb5b447dd80f5b65e78fe44400382c021b8e92e3c85e60e3125bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionTransform::transform_connection_selections (cognitive 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/transform_connections.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d39aaa9fe8a7374c84668b9e8954f707e9918b6d3216befc5a271f6f0b7b73a"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionRequestBuilder::build_request_from_selections (cognitive 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c063acfeb4dcb80392416502f3e3ee2ef923e1345eaac906a68c1010b5d07e41"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_transforms::generate_relay_resolvers_operations_for_nested_objects::generate_relay_resolvers_operations_for_nested_objects (cognitive 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbb4de32f1b41d62a87f7f5c106e7f6e6d5091c1ecfa6b4d5ec6e8eefbdc9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_typegen::write::write_fragment_type_exports_section (cognitive 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"e357a284bd98f528ee5128e8ae2be9889b9acaca1b1e9ee0566c434f02c65c1c"}},{"ruleId":"D2","level":"warning","message":{"text":"FlattenTransform::flatten_selections (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/flatten.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4759c3597430925da40ce6fc7a9c652af59d4acba764ae4e75020013c1e533"}},{"ruleId":"D2","level":"warning","message":{"text":"_registerPlaceholders (cognitive 37): _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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/NormalizationEngine.js"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebbf771296847911b390f845de5c24b2b18b14372f2f1fb8c820f149de83e99"}},{"ruleId":"D2","level":"warning","message":{"text":"readFragmentInternal (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a34465c382bec450ead391fc0e2347e4998f0a4e0328f294f5cb90657b821a5"}},{"ruleId":"D2","level":"warning","message":{"text":"_propagateResolverMetadata (cognitive 36): _propagateResolverMetadata has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 3 (9 pts), boolean chains 2, other 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2878}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb7b98259cee459603a269f80b545ee467d767fcdecc50d9bc26f5da0367157"}},{"ruleId":"D2","level":"warning","message":{"text":"subscribe (cognitive 36): 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, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/network/RelayObservable.js"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"40aff57876bffb77c9cb4ce1e6ad27052cd268b2069d0b32c96e3f568adc8304"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerState::get_dirty_artifact_sources (cognitive 35): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7f38ea570e247cf97da3c2a09d013f407e544c83695e4cda25c61532b874b5"}},{"ruleId":"D2","level":"warning","message":{"text":"serverQuery.execute (cognitive 35): serverQuery.execute has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 5 (10 pts), boolean chains 3, error handling 1 (nesting depth added 14). Most of this is not in the body itself: 5 of the 35 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 359, complete, a function literal at line 299, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/serverQuery.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a59ad2c227f9fd1991d7857acd94d48199f62593567830be313e99f79d8730"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 35): (anonymous) has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 4 (12 pts), boolean chains 2, loops 1 (2 pts), other 2 (nesting depth added 15). None of this is in the body itself: all 35 points belong to 9 function items inside it that branch (a function literal at line 295, a function literal at line 338, subscribeToSnapshot, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ade5c66d0fe3ff7b8024e9df43624cbd4ce386d41fdc00fbda9a8807f4b28f2"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenBuilder::build_reader_client_edge (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3371a05bc2d1ebc3e4179e5cec94e6819239dacb64450acebfff531ac5e75e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArtifactGeneratedTypes::from_operation (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/artifact_generated_types.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf6549a54666d6e97662ff62a60923151af3faf79d0146c25c0b55e882af8a9"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchTransform::get_js_field_args (cognitive 34): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/match_transform.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87ce0377ec9cc78d4f68189f169201ce09d32a19615df514881ecd179c4069e"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaSet::remove_defined_references (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_remove_defined_references.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"140fb7e5f86d08caa239c1b4eb82e04263ae9270249bf0df55254fe3b22c694c"}},{"ruleId":"D2","level":"warning","message":{"text":"_propagateResolverMetadata (cognitive 34): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cda9ac67034e50b00baf6d3897cfbc4fe4474ec4eebfb0b5f946c815741210"}},{"ruleId":"D2","level":"warning","message":{"text":"_traverseSelections (cognitive 34): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"776a30bd0cfd84fa50b61370111fdf8351b4d1954764b4627b30332dc06424c5"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::artifact_content::content::generate_operation (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de9fe5593b2253bcf19a42d31bd57c434aef6ca50c9178e1ba8b3d6a8cb8908"}},{"ruleId":"D2","level":"warning","message":{"text":"RefetchableDirective::from_directive (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/refetchable_fragment/refetchable_directive.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e13e254e6c7398af5da8beef0bef408b598a22bad51ca211d5d177d8250952"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayReferenceMarker._traverseClientEdgeToClientObject (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReferenceMarker.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a297ae181f0e24230271663bb338e292b8bbd180c7d328ac0ab9cb0201f207c"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayResolverExtractor::parse_document (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2c11a1537b45029ec4ad4322d972b37293acf022acb9deaaa6c89cdd81ca5e"}},{"ruleId":"D2","level":"warning","message":{"text":"update (cognitive 32): update has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (16 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"71770edc51434015690cd2cae266245f4ee90a26c555c0396ee136b682d2f719"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayReferenceMarker._traverseSelections (cognitive 31): RelayReferenceMarker._traverseSelections has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 5, match/switch 1 (nesting depth added 12). None of this is in the body itself: all 31 points belong to one function literal inside it that branches (line 286). 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReferenceMarker.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac857d4b91351adb77efaa312c24cff3598155e490a2465f3189bc5cc3b4550"}},{"ruleId":"D2","level":"warning","message":{"text":"updatePerf (cognitive 31): updatePerf 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"9474f4e6a6acac21c7b9ae0d49af88c7e80c917c59acf8c2c82224e4de3dce75"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONPrinter::print_ast (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/printer.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2660552dcd4e995d44f8d2d9e5b5af3c2085c9cb40016692c1fdf9c401085438"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionRequestBuilder::build_request_from_arguments (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d4713b48882f46e33fe90f680073f33931c8f183efdcca2be6d3105e34e8c6"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_lsp::docblock_resolution_info::create_docblock_resolution_info (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/docblock_resolution_info.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"862d569b15816e8cf38c52f774ad38e4429434ce312a7a3b19d5e47b998299d5"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayResponseNormalizer._traverseSelections (cognitive 30): RelayResponseNormalizer._traverseSelections has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (18 pts), ternaries 3 (9 pts), match/switch 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4219a185adf2609467577ef60e9a8a0376a9fe86194c55c16e7229d730b7f8f0"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveResolverCache.invalidateDataIDs (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"596e24b2b1424e9379811f1f4f407609627a9b52f71a5671623a95508acce73d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::invalidateDataIDs (cognitive 30): (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee70ce8957e5371446e1fcc4b5071b57958169ff146f730948d6c8ccf9658004"}},{"ruleId":"D2","level":"warning","message":{"text":"executeHandoff (cognitive 30): executeHandoff has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 7 (9 pts), boolean chains 5, error handling 1 (nesting depth added 4). None of this is in the body itself: all 30 points belong to 12 function items inside it that branch (a function literal at line 385, (anonymous)::(anonymous)::publish, a function literal at line 475, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/useRelayHandoff.js"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d384d72771bf447ef57c651cc09eee45dbbef485c7866e9b23222fb6ace2a1"}},{"ruleId":"D2","level":"warning","message":{"text":"rangeDelete (cognitive 30): 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayDeclarativeMutationConfig.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cd8b0039bbb39e96ca3b075091a31e22e38fb0c7b0d80286feff0c4794eaa1"}},{"ruleId":"D2","level":"warning","message":{"text":"preloadQueryDeduped (cognitive 30): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a95ac260199403f3c0530cafc4deeb9a4e885575f3855a631c38a9d07404b05"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientEdgesTransform::transform_linked_field_impl (cognitive 29): ClientEdgesTransform::transform_linked_field_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3c97d8f2a1220efe60df074c1be986d02647b3de5db36c07a6e6cadb354450"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_transforms::client_edges::validate_s2c_selections (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e777c02f71b06fe59d2510a01eee2e828ece84acfd80fa818a091d1db84337"}},{"ruleId":"D2","level":"warning","message":{"text":"notify (cognitive 29): notify has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 9, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e8f0b9930334c8663f97a9520623e7513508e277e8aafc3f85f21beca6d718"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenBuilder::build_operation (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"071d5bbe0cffb27b6fb8d71af92e5cc381a2b492c628a47ef7322a5085275a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_transforms::server_documents::validate_server_documents (cognitive 28): relay_transforms::server_documents::validate_server_documents has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (22 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/server_documents.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fb93ef564aef330fe537a8f79d4c9da626cfd52e347751ed1ca9bd01faca7e"}},{"ruleId":"D2","level":"warning","message":{"text":"DataChecker._traverseSelections (cognitive 28): 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 365). 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/DataChecker.js"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc3fb0ec27e16957c55ea7cebeb32e82040a64470c90c51d30efb3e3b612139"}},{"ruleId":"D2","level":"warning","message":{"text":"useFragmentInternal_CURRENT.subscribeToSnapshot (cognitive 28): 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 301, 265, 334). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4342966a5ef90eda4a5f56fbaa4400327da1d6d424692e19e08e199530d0a292"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 28): (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 301, a function literal at line 265, subscribeToSnapshot, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9878c140a4a78cf08cd51ddde4e24fd29305798218b3abf327ff40e377e7639"}},{"ruleId":"D2","level":"warning","message":{"text":"recycleNodesIntoImpl (cognitive 28): recycleNodesIntoImpl has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 16, if/else 5 (7 pts), ternaries 5 (nesting depth added 2). Of this number, 20 points are the body\u0027s own statements and 8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/recycleNodesInto.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9142995f8ae4c560ab3161a9f074df6c63c97dde911251fdf12edf0c8aaecac5"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerState::from_file_source_changes (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0b6638d6f207efc485c238678e875d573eafc2e21ae7a8576f6b2e4d957ab9"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerState::schema_change_safety (cognitive 27): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b453f81a40f79e615ed0369bd472ff22fc7b4cf1c9831948d275dd80bfa54e4"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayResolverFieldTransform::extract_resolver_field_directives (cognitive 27): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b45486960ee322603be6dfc812b6ac1bcaa16df588de7d39e5ab1f95b3112c5"}},{"ruleId":"D2","level":"warning","message":{"text":"_fetchAndSaveQuery (cognitive 27): _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, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/QueryResource.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84919ad8886bcb02eb2b7fbfac5c9e309b8247860c2eb4671b533424bad8ba5"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::server_daemon::socket::start_server (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/server_daemon/socket.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44bbbcb0f88854c8597c6eb3c966b2f9d1dcfc96304ce36a1a09f30007f5adb"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolverIr::field_relay_resolver_directive (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/ir.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5aec24dde860478c4a5b1fb84bfa750eaf9ae4893916435daa7cc26b4ff5496"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_lsp::rename::create_rename_request (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/rename.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6ad70f0491e41e29a5e3a6b6929578880fdd633707031c824137a3054cf3f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientEdgesTransform::get_client_object_for_abstract_type (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98fb5eff22ef945ff56b9ce5a44977a894d06f44cfca170c038564d0c7cc2c0"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaSet::print_definitions_for_used_schema (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/print_schema_set.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"51492ef72fbdb70d43ca686c10427e238f5ebb5ff1f4e207ee5e17bb2ad3fdec"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecTimeS2CDataChecker.toChecks (cognitive 26): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/ExecTimeS2CDataChecker.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b968eb99ebed88d87760754de08a7b2840e72465aa2377f6f1678f66739bc3"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_setResolverValue (cognitive 26): (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b0dd8d49a863d061f2dccb0a0003743033be5a0909e0f5d4bd1701be492f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"dependency_analyzer::ir::get_reachable_ir (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/dependency-analyzer/src/ir.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fb7c178a8ad9b9a4e4d006a0043e74e48b865b6336fa5c145ed5474fd49d53"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::build_project::build_programs (cognitive 25): relay_compiler::build_project::build_programs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f4d6c6557bc90b915e0916e951d23517f1f30ba12151167d4f1f6a96e7ff8a"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_docblock::validate_resolver_schema::validate_client_implementors_of_server_interfaces (cognitive 25): relay_docblock::validate_resolver_schema::validate_client_implementors_of_server_interfaces has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/validate_resolver_schema.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39e5b7d7188f9f6541adf976f0098b931a99633428f1a1de2f0d0eaaa1d9b22"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_schema::client_implementors::collect_client_implementors (cognitive 25): relay_schema::client_implementors::collect_client_implementors has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 6 (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema/src/client_implementors.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbd3f7a23afb485aff11407359194e0ae2167f85e6760e46ff5a539e59e6870"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_schema_generation::return_type_to_type_annotation (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbb84904b01ed0ddcb0aa1b7f239ac84c95aada1a002d2317d97110975ba1b1"}},{"ruleId":"D2","level":"warning","message":{"text":"useFragmentInternal_EXPERIMENTAL.subscribeToSnapshot (cognitive 25): useFragmentInternal_EXPERIMENTAL.subscribeToSnapshot has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 295, 338, 288, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10ee1810da490681c58996aba18d2acd744582e2a92085fecbe3034be317a86"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayDeclarativeMutationConfig.rangeDelete.\u003Creturned closure\u003E (cognitive 25): RelayDeclarativeMutationConfig.rangeDelete.\u003Creturned closure\u003E has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayDeclarativeMutationConfig.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d029738d0e1823a5666c373b9d5ba165402f45b402e002bce2dda74e140618"}},{"ruleId":"D2","level":"warning","message":{"text":"createContainerWithFragments (cognitive 25): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayFragmentContainer.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24d168064f30d89534f8db55589a7b2eb4c35a5dd475076827c333fe3300e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenBuilder::build_reader_relay_resolver (cognitive 24): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13e43a1b6606aadee9697e221cf124ee973bfd2072f5ea0c4f19a8b17131ef6"}},{"ruleId":"D2","level":"warning","message":{"text":"LSPStateResources::internal_watch (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state_resources.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd9a16b7b458d44db191ac45b3b4a876c9776d4364f72ebb2135d08580500dc"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientImplementorCases::transform_selections_at (cognitive 24): ClientImplementorCases::transform_selections_at has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 5 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_implementor_cases.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b7bb4ebe36d33569a445d18721c3a920e89261805bae027f77901fa6c98334"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_typegen::visit::relay_resolver_field_type (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb7b29dd517bf32976dd7a90328c1e31c1b08a011f54fa2621c3ce86776d1c8"}},{"ruleId":"D2","level":"warning","message":{"text":"schema_diff::compare_fields (cognitive 24): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d3d5e7046d93ca4a729aaa65b99e6f1f75df02b407a4c06e38e08731562fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"updateProxyFromSelections (cognitive 24): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/createUpdatableProxy.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3e5721c1535e8c0648642d2d8a22bfb926257b00228f1d17a39480093b9dce"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_value (cognitive 23): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_to_text.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"725861063d45f17f3bdea9467c136d50beabd02821e272149e9b20f5db7a2d26"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::build_project::build_raw_program_chunks (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e944695d60440916befa903f146098fda23069db02bdd39704b06a03e6edacd7"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::build_project::generate_artifacts::generate_artifacts (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/generate_artifacts.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e01237f0ea379f5e55e44822d9b2625418123e178d9445b5605005de736020b"}},{"ruleId":"D2","level":"warning","message":{"text":"LSPStateResources::build_programs (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state_resources.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"979f492a9df10bcc9d98a16d4e49c9c688fbddc38d6f57492b7afe54e8b22833"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdatableDirective::validate_inline_fragments_with_parent (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8555437ad8ac78aa50d8efa43c73f90687f75b7751ca85804ed5398c24e7b7"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_typegen::visit::visit_inline_fragment (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"14746f2b18c06035a809af95d7af9a0a131f354d9a49fe45465472b5694bbc1e"}},{"ruleId":"D2","level":"warning","message":{"text":"schema_set::find_subset_violations::walk_directive_def_violations (cognitive 23): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"691fe07fab5e1593334ec49d7ccd83ee53dc0a44f43c39b067cb8e5ff1d288b9"}},{"ruleId":"D2","level":"warning","message":{"text":"getStreamTarget (cognitive 23): getStreamTarget has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (8 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/serverQuery.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c806bd5981dd102dee395d4d5efcd1840e5ddcb6e15c823804f1fee0bc34668e"}},{"ruleId":"D2","level":"warning","message":{"text":"validateField (cognitive 23): 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\u0027s own statements and 4 belong to one function literal inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/validateMutation.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a2f2292eacc82bc5d17b31f1262f1df4dda27a2d214606319b998c576e639a"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_constant_value (cognitive 22): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_to_text.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"5175b55b98db959f638ff328c42a3dcc8484edb32033eb1ac69167a2f5d6f326"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionRequestBuilder::build_request_from_directives (cognitive 22): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b83abee956e7870d745b5f90d08243292379ad64101f9973d6e1a8d3389e579"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_lsp::node_resolution_info::build_node_resolution_info_from_selections (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/node_resolution_info.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d7836a386d0159753f65e76459995ce3cf364acde695f1c58e9f22d42102e1"}},{"ruleId":"D2","level":"warning","message":{"text":"SkipUnreachableNodeTransform::transform_program (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/skip_unreachable_node.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d766d902f18228f5ddb629c728994c363af6455d63f1a78c1f45c106a5c732"}},{"ruleId":"D2","level":"warning","message":{"text":"DeprecatedFields::validate_directive (cognitive 22): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/deprecated_fields.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea2724354f6e204850d3c0ca7cfb32067073c524ccfb7e2b263d81fede750e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidationContext::validate_type_implements_interface (cognitive 22): ValidationContext::validate_type_implements_interface has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-validate/src/lib.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6211b9fcf7f3ac7d654da8dec87ecb61ee48d12bdeb945c29a08c7e7198323"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveResolverCache._setResolverValue (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c498be3f2b6465f0b8f7ac86621a77bca5c56434b71f7269104991736e3d5d85"}},{"ruleId":"D2","level":"warning","message":{"text":"convert (cognitive 22): convert has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 7, other 6 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 10 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayIncrementalDeliveryConverter.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3259bdbefc3bf18aba1c77df8b92d5a810bae8d54c5505e26588ac73e81d517a"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidateSelectionConflict::validate_field_in_set (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir-validations/src/validate_selection_conflict.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff67003a56502d0718eeae1fa5921186fcae847e20a64108734a5a431ea69f03"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_value (cognitive 21): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfb751a592f71b7ba2b2f1f665628d7d9ca837a099703d3c0d11612b29ed715"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyFragmentArgumentsTransform::transform_no_inline_fragment (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_fragment_arguments.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfc3a645d74364c43cb29f6793eea2610a042f551e3a85854f3ab461b67cafe"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayResolverSpreadTransform::rebind_on_server_interface (cognitive 21): RelayResolverSpreadTransform::rebind_on_server_interface has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), boolean chains 2, match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3be037d3b8ae8490b3a623ade36f43fb12616b2304a467f87f9b371772ed06"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 21): (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\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/MutationHandlers.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f220599c8d69ce8f4853605aad2f3762b5c26c3627c4c023022be2569d890011"}},{"ruleId":"D2","level":"warning","message":{"text":"FileCategorizer::from_config (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/file_source/file_categorizer.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"71796eacb208b34f1ef6294edf71eaaec198872ce8cf5ed78ed7b3dc91c732f3"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::compiler::build_projects (cognitive 20): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d1ba860dba22a4c7b62212a80bfafaf95b30d62e3077aa9feb532d6ba199c8"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayResolverExtractor::extract_function (cognitive 20): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04ab1bea28627459716d76007691dec61cc29d69fbe203fdd986ac905c3a9f5"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayResolverAbstractTypesTransform::transform_selections_given_parent_type (cognitive 20): RelayResolverAbstractTypesTransform::transform_selections_given_parent_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers_abstract_types.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d8bde7d567edd5a21105c85c70e43a98b4188cf3c6abd9eac356addc5bc9ea"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_typegen::visit::raw_response_visit_inline_fragment (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca130400ea0f05663d68fc5d4eeaab8415be1b8c419f0fcd808564b91554bae"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationHandlers.edgeUpdater.\u003Creturned closure\u003E (cognitive 20): MutationHandlers.edgeUpdater.\u003Creturned closure\u003E 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). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/MutationHandlers.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82a94ab86529ddc8b80faf57f8adef09e454fcedcf2cc1e56b34e6f8048cd77"}},{"ruleId":"D2","level":"warning","message":{"text":"_normalizeActorChange (cognitive 20): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"864532f64865473c03be4df455f4c9190c5989e6c7a541626f35f9a19996fde3"}},{"ruleId":"D2","level":"warning","message":{"text":"merge (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0db7277ae977d6926928438876566731cd321713e5ad307b41138808950e05"}},{"ruleId":"D2","level":"warning","message":{"text":"readServerFragment (cognitive 20): readServerFragment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 3 (4 pts), ternaries 3, loops 1, other 1 (nesting depth added 2). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 21 function items inside it that branch ((anonymous)::next, a function literal at line 200, read, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/useServerFragment.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a4563574e8efac566887b99e30ef2448c2ecf7b07d56e003c1c9696d609047"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidateSelectionConflict::validate_field_pair (cognitive 19): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir-validations/src/validate_selection_conflict.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0001b6f9465bfe05a4615a419e7ec91cc472d84a02f8930392ffdbd975bd1a02"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenBuilder::build_fragment_metadata (cognitive 19): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae5e7989f1c33a58e7a5d981117f9cc9bb1374be0fb3b4b8d36e7d2cbb5940b"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONPrinter::collect_value_duplicates (cognitive 19): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/printer.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"58069fc0d3d092290c47a9661b1f8de6bb2cd8833d8abae1e053e23e8abfd6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectArtifactMap::fmt (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eed373e83d40bccf94ac28cadd6a113556968e1945561c0b8e69424841d08ae"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_docblock::untyped_representation::parse_untyped_docblock_representation (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/untyped_representation.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb4fa106305306b68962aa8564af31523a8196ef9a9ddb165534facf54f347d"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayDirective::find (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_directive.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0321048b628537dd721a2a4c8d416fbc45e0d51d487b5cac6e4dbf614c925ac"}},{"ruleId":"D2","level":"warning","message":{"text":"ShadowResolversTransform::validate_resolver_metadata (cognitive 19): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/shadow_transform.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08adbb961b68e368859c535ddc29c2ff0e19f3f1cf63ccf61d2bdc53fdd65bc"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_transforms::connections::connection_util::assert_connection_selections (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/connections/connection_util.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a242f13615e9a849693d529209606d2f2837ed3a7c71b71fb0f48f930d85ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_transforms::handle_fields::handle_field_util::extract_handle_field_directive_args_helper (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/handle_fields/handle_field_util.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ceae831b9e54b4f4597d2a607e008999744ef826b68ac3d4b7169f3452444a"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowPrinter::write_object (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ed5ae6d4b78c0f21b4884bc3f6e7bb2aa17b5ba1c1a3af45996170af856eed"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaSet::touch_field_argument (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"012c413ac4eab3bb2c3faf0fcb4a6d6f704656b51c7ebae5081d1fa7fe1ab599"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayErrorTrie.buildErrorTrie (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayErrorTrie.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"98171f9448d2e3a22355625036cffd061e90906f82b5644ce024ca88bd3c52b9"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayReader._readInlineFragment (cognitive 19): 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. This shape REPEATS in the file: one other method here (RelayReaderOptimized._readInlineFragment) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"df876859ac3977cd42a23e5f3036323f26aba7f40f89c7bbb922b0d68d53c073"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayReaderOptimized._readInlineFragment (cognitive 19): RelayReaderOptimized._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. This shape REPEATS in the file: one other method here (RelayReader._readInlineFragment) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":3644}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff0211aeb1b4d2b7149d7495d7f00faa5bb18348a5284bbdb73796176c43532"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphModeHandler._populateRecord (cognitive 19): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayExperimentalGraphResponseHandler.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4cc975bb0bcd74a0d82e1c614ab365d1c6aa140b243a19b82b702b2a794674"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernEnvironment.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"954edf7a2065164e11c74a3c6aaf8cfe0a1a7e3a00fa10407ba93c6ac2940cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useQueryLoader.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ad617aae34b5e2787d5312f22bd5c2da423d4c0d0e19fabe5c49ef69eb42f1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (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\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/MutationHandlers.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6580352506c53a6946e1ecc641508a217cf9b8c7bd98112e8f45913197ebe25"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::compiler::get_removed_docblock_artifact_source_keys (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"14de8f2e15aff8ad4a8aedd3c8cb528d27538f72c896f3117656354448417320"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_docblock::validate_resolver_schema::validate_strong_object_interfaces (cognitive 18): relay_docblock::validate_resolver_schema::validate_strong_object_interfaces has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/validate_resolver_schema.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"721fc9c1d21a87c607ff00a9e2b734cc6782b030b03c87bb2ee088d21ef1cc95"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdatableFragmentSpread::validate_fragment_spread_and_mark_enclosing_linked_field (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_fragment_spread.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17a699a03b201370056dbe9e15f9e537427ce29dc49af42388a1e9c56b3cdaf"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientEdgesTransform::get_edge_to_client_object_metadata_directive (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"172e89e35b8898da1642af0214acd163ba8df1fb17d66a8b8685d7ece92b689d"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientExtensionsTransform::transform_selections (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_extensions.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1275862d2c08d43ef281a9ef50f7f7018021c1ebbfedb53a69079ff576ffa2"}},{"ruleId":"D2","level":"warning","message":{"text":"RequiredDirective::assert_compatible_required_children (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/required_directive.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e213c17904e6a72bbb5bac0534764dee4e44884c3a05565fb4721a0e597ee31"}},{"ruleId":"D2","level":"warning","message":{"text":"RscResolverFieldTransform::open_rsc_field (cognitive 18): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/rsc_resolver_fields.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8064c9767f31fc4bea0d72b1505f5ef843f6f0e065fe49a3609ef03a70dc848"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeScriptPrinter::write_object_literal (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/typescript.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c73970c30acd57d423bfaebfacf928594cd149df23dadd812b51d137f38e8a"}},{"ruleId":"D2","level":"warning","message":{"text":"UsedSchemaIRCollector::add_used_type_definitions (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/ir_collector.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a992d94d68dfb6db1cd23abcfbf990ae8358f81a419e68172f8a9f1571d732"}},{"ruleId":"D2","level":"warning","message":{"text":"schema_set::find_subset_violations::walk_same_kind_violations (cognitive 18): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3840cd25a3075f46f1b27dbd7ee905b7181f48dfd9e610895bd0fb54bbfc90d"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationHandlers.nodeUpdater.\u003Creturned closure\u003E (cognitive 18): MutationHandlers.nodeUpdater.\u003Creturned closure\u003E 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). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/MutationHandlers.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4e441a6280df7650b1c8fbfbf2b1657db53ca4c23e2aa323479df5006c45db"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 18): read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, other 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f6958613ed803909854ca5550d4465649fb119434ad2fe43573d1ce8804ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"_processPayloadFollowups (cognitive 18): _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 1066, 1074, 1085, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"25802865fcf28bc3396d8e84da94daf278439dd53561532dba5a2351d0ab51f6"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 18): (anonymous) has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, other 1, ternaries 1 (nesting depth added 3). Of this number, 13 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useLoadMoreFunction.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71e8c468ffc20e4af24e478f8f3af36786622e8b6770bf84b46772ee4dfe2bf"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 18): (anonymous) has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, other 1, ternaries 1 (nesting depth added 3). Of this number, 13 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70d712fdf22feac4d13f7bc1dd4476b5d96bfccbc92249fcf7576197f686838"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaChangeDefinitionFinder::add_type_changes (cognitive 17): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/dependency-analyzer/src/schema_change_analyzer.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3614f6bd9a36452eb81644d10e984f13e5d8a93f2446e387f0df4e01d6c34b"}},{"ruleId":"D2","level":"warning","message":{"text":"graphql_ir::transform::transform_list_multi (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a34d328cd712c2f0b07ba475da37f89763a62084e5a0fe36b8ab06ee9841c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidateSelectionConflict::prewarm_fragments (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir-validations/src/validate_selection_conflict.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00a1f7240a951c5607015a64f46b0a1d3078019dc9d59e4db6c70559ddea145"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenBuilder::build_selections_from_selection (cognitive 17): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc80ba21a74a1e82b9d267e72eea1dbc60e4f6c5da5529bd0189d900e5107890"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_codegen::printer::write_argument_value (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/printer.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2928be5d70340b7a36870536f7536f5fba42798dbbfee56067ad86c59dfe887"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::build_project::persist_operations::persist_operations (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/persist_operations.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36400ab5e52d38dde7553cb155062da67fad00ee5482686c44e099f3683d7da"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_docblock::validate_resolver_schema::validate_output_type_resolver_types (cognitive 17): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/validate_resolver_schema.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1ac56d0aa9acacd4a11e31f2f54496f60c9e27bd98016fd8494fcf5a0577b3"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionRequestBuilder::create_completion_request (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"086103a5530fb7265d4c7fce28f83f407463f92dfe886f10226d465475493e84"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_lsp::completion::get_abstract_type_suggestions (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"658fd285a6987eca4afeb852660405cd317dc68e89206bbcb12402f920740ce5"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_lsp::node_resolution_info::create_node_resolution_info (cognitive 17): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/node_resolution_info.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab99fe0e353e8208ad66d600b5bf3d109683e4d404587fc4376ef3a56f14608"}},{"ruleId":"D2","level":"warning","message":{"text":"ProvidedVariableDefinitions::get_errors (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/provided_variable_fragment_transform.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f31d75277f6dfb88865639a54dfa28107f8d392db0f8fdabdf08d88f06f08f"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidateOperationVariables::transform_operation (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validate_operation_variables.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4a65eec22291385013f553254fd7f96234049eae5ceef88650001dbf8da276"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_typegen::visit::group_refs (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada780d5ce7f9dd136010c1a458fe7e95230e95648793a7786374fc05d22a4b8"}},{"ruleId":"D2","level":"warning","message":{"text":"checkMissedUpdates (cognitive 17): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/FragmentResource.js"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b9035b3f34e9b3e3e7668a4e0f47374b1f060f6697f1ec65d327d94d5a9ae8"}},{"ruleId":"D2","level":"warning","message":{"text":"areFieldValuesEqual (cognitive 17): areFieldValuesEqual has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c4858673771c113abd07031f20ca226d8e5c45aab3d365693027afffb2a568"}},{"ruleId":"D2","level":"warning","message":{"text":"getSingularSelector (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernSelector.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74b4ad936c810c228ab522395fa22ad52ba3acc13948bbd6a003d8dd718b8ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Transformer::default_transform_program (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ecd34d137f4c499831bc08a5a07e3e83ec47d1bf9f23a453f2bcae21cec88b"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkedField::resolve (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/lib.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"e352dbf4f84e4406aadf041ecf8b5d4dfe14cf3d1bc969c96102415e53577648"}},{"ruleId":"D2","level":"warning","message":{"text":"graphql_text_printer::prettier_schema_printer::expanded_directive_doc (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d3b0f9749329d4d52866b74441ce4d6d0ce9b05b7afbbcae76487cbc9eac14"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenBuilder::build_module_import_selections (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":3172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad87e4491678381f9add78384f6f5164f2b8efca7b27a8c67a05caf3f5efa51"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_compiler::build_project::project_asts::find_changed_names (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/project_asts.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4ad09250f96042eab1934b2156320ed8a98f08633d7f462cfdd4d6fe36bd87"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_docblock::docblock_ir::validate_fragment_arguments (cognitive 16): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/docblock_ir.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b287831c80be62d3903ae03149e44570254749130c8f73863a578ab60ff4a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope::push (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_fragment_arguments/scope.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"20255585c466bc0e90cf3846cd108ec273ce47c049677f6d6e1de5f43e98fabf"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientImplementorCases::report_unlisted_refinement (cognitive 16): ClientImplementorCases::report_unlisted_refinement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_implementor_cases.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63117b35986eb9558e893e20207a3688edacfe90624ff5128b9a208de37f1b8"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayResolverSpreadTransform::clone_shadowed_path (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a3c99c825c49e6e1e5d40c17e1fa618dd2b4448abf8cc8f0e734f144a0a215"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_typegen::visit::raw_response_visit_selections (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5231969a0c0c11177d0874228a562cc6f0f39fa6f130f17eaa6d7873817ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"relay_typegen::visit::merge_selection (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c64fbf6b6d0a87930d51b052009b863c35bf8e4e3da9de3d16b8063b69ca74"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemorySchema::validate_non_repeatable_directives (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"152b8424057d97c36529633cd728a2c0a18bedf5866838951c3cfce45a35e272"}},{"ruleId":"D2","level":"warning","message":{"text":"schema_set::from_schema::convert_output_type_reference_with_semantic_nonnull (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/from_schema.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0a9ba29763e7b7434e58ee536b19764fb83f0afac15b16ed30c38998cd3198"}},{"ruleId":"D2","level":"warning","message":{"text":"schema_set::merge_sdl_document::build_output_type_reference_with_semantic_nonnull_levels (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/merge_sdl_document.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"822dd480b7a6372617af2e4f4c6ea0b880b9b04cdfa4d6a1a90dc9c2126903ae"}},{"ruleId":"D2","level":"warning","message":{"text":"schema_set::schema_set_collector::stringkey_output_type_ref_from_schema_type_with_semantic_nonnull (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66a953373083bfacd68513b32c09866ba4787753e2a2673a44cb52a3ba49ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"compileGraphQLTag.createNode (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/babel-plugin-relay/compileGraphQLTag.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3e258b7d9cb6f2edde6ebd93a04b50df70636ce41947e1666e0182c132fe1a"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayModernRecord.setErrors (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf38a7e39b8afb2d67aed74ee5823fb558271df733709c7494fa4a0bda5314c1"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayReader._readClientSideDirectiveField (cognitive 16): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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. This shape REPEATS in the file: one other method here (RelayReaderOptimized._readClientSideDirectiveField) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74b398947e01bc940b84c4e6d42cee259aec979aceea47166ac1d90b4ce3fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayReaderOptimized._readClientSideDirectiveField (cognitive 16): RelayReaderOptimized._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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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. This shape REPEATS in the file: one other method here (RelayReader._readClientSideDirectiveField) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2688}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fce5b6f05a55c1ea6a37a61f9a60b1e3f41e2c32c23e593c14cbec032174aec"}},{"ruleId":"D2","level":"warning","message":{"text":"RelayReferenceMarker.mark (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReferenceMarker.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cab89a84c1ddd5ac19dc8669357352f9764678fc4a8d66d93dc33e3afe30ec"}},{"ruleId":"D2","level":"warning","message":{"text":"insertEdgeBefore (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/ConnectionHandler.js"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ea66a092251c519227a6d6973446a838cf63064b8d467028056c99f6de61d6"}},{"ruleId":"D2","level":"warning","message":{"text":"commitMutation (cognitive 16): 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\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/commitMutation.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb239f8ccb7c0f2ce199f53cc5a31406fb702c3fc967504f0385377633a067e4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CodegenBuilder: ClassTooLong \u2014 2110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 72 methods, 2 blocks, lines 372-3439. The bar is 400 significant lines; this is 1710 over it, 5.28\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f234a98967437fa02766b19db2dbd8fc1dedc5f1b7fd95a01c06791383ae70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/visit.rs: FileTooLong \u2014 2526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 63 free functions. The bar is 500 significant lines; this is 2026 over it, 5.05\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"658deaee4c12dff495281cf38aa264fa3b70ad484da3404c8647dee8ee55b495"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/build_ast.rs: FileTooLong \u2014 2515 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: CodegenBuilder (2 blocks, 372-3439). The bar is 500 significant lines; this is 2015 over it, 5.03\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7a522047a65c3db54df2da5b8368d3b0b0bed2df24b912cce82fd02320b1c9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 150 methods. The bar is 30 methods; this is 120 over it, 5.00\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7b9684c48dda8f47ecd90a270e6d431852ef2d2ece9ec66abf489c242d5423"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/RelayReader.js: FileTooLong \u2014 2439 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1939 over it, 4.88\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"089a3237daf8635a946cd91fce6b5e7a985cd628c3497a3ae5b8faabb178fc13"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 1931 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 150 methods, 2 blocks, lines 53-3150. The bar is 400 significant lines; this is 1531 over it, 4.83\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e861f9aa242369296f150ef558c78bbcb86bf555a667e8b18922851d45881e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CodegenConstants: TooManyFields \u2014 135 stored fields. The bar is 30 stored fields; this is 105 over it, 4.50\u00D7 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 \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/constants.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1cbbc93367ed35ee1decdfd421ba35bdefef8945520ff8adf7dae413379ff7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 1994 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32b2ad6f6de7fdc2aad198772fdfc93ed26b84c6c19403dbd182e5ed272f4be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/in_memory.rs: FileTooLong \u2014 1940 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1440 over it, 3.88\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e485ff3c17e7f2af96e4d2769383cd5a96ccd6333c9ab3d7d8dd9f5d20a8c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_lsp::hover::with_resolution_path::get_hover_behavior_from_resolution_path: FunctionTooLong \u2014 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 \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 263 over it, 3.63\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/hover/with_resolution_path.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d8d01d5d7c7279aba1fa4aa3ee44f28fea42a17822ed8caf7dccac6f74d81b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Executor: ClassTooLong \u2014 1154 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 754 over it, 2.89\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d34dcde04ef12ac9cd86417809409410ae55a35a3da48941dd46e2ee179c7b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RelayReaderOptimized: ClassTooLong \u2014 1147 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 747 over it, 2.87\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce5a96b5500b21cb6a83a59bde13c5ecf65d141250cba5b66016184877372f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShardedSet.with_hasher: MethodTooLong \u2014 with_hasher runs 260 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 160 over it, 2.60\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/intern/src/sharded_set.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b165fdce006cfb900dd8d270c1426c15d0a5761891a3f3b74e6b19cca05094fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/OperationExecutor.js: FileTooLong \u2014 1297 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 (137-1846). The bar is 500 significant lines; this is 797 over it, 2.59\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9278c63caf754edcf5ca08e52d8222db8852787e1e613ae22683c043c354d31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1278 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 778 over it, 2.56\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"301442d56d0c3561ca6fab1ce5a04e3e1147bb987247b1e27984a239a5ac5bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InMemorySchema: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.53\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7aeb6330ea38cf6daef9e25b9fce8f3557b5797bc163b4a45bf3aac2df320a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compiler_state.rs: FileTooLong \u2014 1245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 745 over it, 2.49\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b8563f18e197652edbe3de78da9944ccc2d9317e7face43a80b6e78bf67669"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/client_edges.rs: FileTooLong \u2014 1221 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: ClientEdgesTransform (4 blocks, 372-1812). The bar is 500 significant lines; this is 721 over it, 2.44\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"279664378979a1a0f91c9aca9d846b642b2e401ee28eef3cfd229f35fda4f829"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodegenBuilder: TooManyMethods \u2014 72 methods. The bar is 30 methods; this is 42 over it, 2.40\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7974bdaa09d58f5abcee2fc1e84465af9194e5f38e2c06329138be63ac9f234f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConnectionTransform.transform_connection_selections: MethodTooLong \u2014 transform_connection_selections runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 135 over it, 2.35\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/transform_connections.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee239cc3f1b2b99a36cd3774b7a5063d8d56d5fe5b1e2b3f100a8f06c4fa3e24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 617 over it, 2.23\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1399600712126ed6708f4f649f44313e3c042ed431816de54e41ed6376049b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/write.rs: FileTooLong \u2014 1111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 611 over it, 2.22\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41612ab0439c590df63bbb0da933634966d464c607e65ae78d0acc92960091d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/completion.rs: FileTooLong \u2014 1076 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 576 over it, 2.15\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f4e1022d32a012f90f1fe51150125bbcd15aab6baafa155207ee41e54788cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: loadQuery.loadQuery: FunctionTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/loadQuery.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa2e657e349e3cfe7881dcade4c5aa6a809ede9ab063c511fdde19c75aef86b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 1002 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 502 over it, 2.00\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e751bd814b9897b4b8369bdc8ed7b340982cdc40ec84209c2549eb4e3ebf5602"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ir.rs: FileTooLong \u2014 999 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 499 over it, 2.00\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/ir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a684fbd07a42a43a9371e63eee4cf6b1780ec93e70197f8f6dcf5fc476e8d4d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: schema_diff::diff_definitions: FunctionTooLong \u2014 schema_diff::diff_definitions runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10b2c24c953ff079c82b4f9d95b57d436a24375ebbff7448e7424b290af4dc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: schema_set::build_in_memory_schema::build_in_memory_schema: FunctionTooLong \u2014 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 \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/build_in_memory_schema.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb59be92249af8c497b75fedabccbae1f3f866161951462c473da0e2f0498aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hover/with_resolution_path.rs: FileTooLong \u2014 953 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 453 over it, 1.91\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/hover/with_resolution_path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bed67de01ce2a9b67fa11d8d2f5a0f4ef912c115a6af809bd8497589c4b1fdd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClientEdgesTransform: ClassTooLong \u2014 755 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 4 blocks, lines 372-1812. The bar is 400 significant lines; this is 355 over it, 1.89\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"431f670ca10ba5e166cd6aec8601b5ad38d4767c68aec451e346d785c7b7b9c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_compiler::artifact_content::content::generate_operation: FunctionTooLong \u2014 relay_compiler::artifact_content::content::generate_operation runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2cbc67d1f2aa62ad7970600f735f1e798387db3c1a2844c4d42bdb16078d55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: schema_diff::detect_changes_from_schemas: FunctionTooLong \u2014 schema_diff::detect_changes_from_schemas runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5359dd7e42b69266db627bf972c086d0fb5b175e5d6caf7e4f98d2b432fe61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FragmentResourceImpl.readWithIdentifier: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/FragmentResource.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"289e6c0a3a9013ba063c2bf319a2c4dafe5c11dbe530967ed8d8f2da5871caab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RelayReader._readClientEdge: MethodTooLong \u2014 _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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a06dbf8ab2ee159f53d3296a4e7792754d6b54f02542f167f026cd9ca5cf69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RelayReaderOptimized._readClientEdge: MethodTooLong \u2014 _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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":3002}}}],"partialFingerprints":{"codehealthFindingId/v1":"c611f01c16872ba9c08e434d777a402ef7b3ccb9c2a4e87b6d77576488200251"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config.from_struct: MethodTooLong \u2014 from_struct runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/config.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a827351b2b0da7234e53f8001738af91ed837be022f46248a9c6e3495574720"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RscResolverFieldTransform.open_rsc_field: MethodTooLong \u2014 open_rsc_field runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/rsc_resolver_fields.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d91babe7c28c96b068a64744f0b5bb2178e5d5de1040e06d8294a134117e0a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: artifact_content/content.rs: FileTooLong \u2014 858 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 358 over it, 1.72\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85cc7d02f54d7c4a15fb0982f8e2fc332c863fd9364fcf781ff15a99c350dab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 853 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 353 over it, 1.71\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21eed6f7b52ba2cdfc62f4c38597c20440347a3f1b1f5d2fabef9c8ee1cd5104"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_compiler::build_project::commit_project: FunctionTooLong \u2014 relay_compiler::build_project::commit_project runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b042c165729cb8c2fd205396ac32d9e5cfab3509323f54e63e8b56f8fc1f49"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_typegen::write::write_fragment_type_exports_section: FunctionTooLong \u2014 relay_typegen::write::write_fragment_type_exports_section runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3546d7d3fe379b778d038b9550463d26d320a6cb9640b8f827a5e22c6c7013"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: match_/match_transform.rs: FileTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/match_transform.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b167af1da103f028891f42ab5a739be1ba32264cc1e19e29085ee779cf0a3a57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compact.rs: FileTooLong \u2014 820 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 320 over it, 1.64\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/compact.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d025d3157f6760daf8ae5af2517c83babee1cca38cf942960886e6ff57e141"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MatchTransform.validate_transform_fragment_spread: MethodTooLong \u2014 validate_transform_fragment_spread runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/match_transform.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd24ee1d5ab30df45bb9ecb2ebe0dee7114c1d48fc426710e1c40f0944ce0500"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RelayResolverExtractor: ClassTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 3 blocks, lines 137-1075. The bar is 400 significant lines; this is 255 over it, 1.64\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe49355b9164ad1bb4ba31c1d43344284c934aa4fc451b3f28bcc39a52a1971"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flatbuffer/wrapper.rs: FileTooLong \u2014 807 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 307 over it, 1.61\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acacda8225805ebe72b7750f97a5903ceeb7c81b7f2a07b264d36374b475b344"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SchemaChange.get_safety: MethodTooLong \u2014 get_safety runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/check.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afa8724c22c5146722bb58761f9bf8335ccc4a3b278c0fd17945caa642c9769"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_lsp::completion::completion_items_for_request: FunctionTooLong \u2014 relay_lsp::completion::completion_items_for_request runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b3d027a0a3bb812519e2a4bc23528cf4318a1ba8eff48ceb781096673e6d9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_typegen::write::write_operation_type_exports_section: FunctionTooLong \u2014 relay_typegen::write::write_operation_type_exports_section runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"349825a24c2cadbcb2fa6bf5326c278c12a897fe7062ec63b0eef1a8d43c6e07"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RelayResolverExtractor.parse_document: MethodTooLong \u2014 parse_document runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"565112c00a110cb2278cee7d54aa79c8b9dcdc3c5410e2041f79a4539ecb4eb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_typegen::visit::raw_response_selections_to_babel: FunctionTooLong \u2014 relay_typegen::visit::raw_response_selections_to_babel runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"8358e8fd4d0996d44493134d13a347ffc77ef853e5ec51507e55d359d1b68504"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/RelayResponseNormalizer.js: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: RelayResponseNormalizer (117-1061). The bar is 500 significant lines; this is 269 over it, 1.54\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a93b2f67a4beda5e88b5a20a3b68b3d2c1f97146de1d2fab515e7a7ad9ae2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/RelayStoreTypes.js: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 269 over it, 1.54\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayStoreTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de84d96bfc390f2a6d31d2616631bb7e0f93612039fc3fb8df5ab345ca559edd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_typegen::visit::make_prop: FunctionTooLong \u2014 relay_typegen::visit::make_prop runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"8478ebbf09a57f14e2f1734715f223b4f9045307331a6cff7172c1be0d2a8221"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MatchTransform: ClassTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 3 blocks, lines 117-1024. The bar is 400 significant lines; this is 210 over it, 1.53\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/match_transform.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"88193f17cc8cc253ccc93f5a536b53a00a6b9b28d19609b2c81c5e36d5e57bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/schema_set.rs: FileTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 259 over it, 1.52\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abc5000c66c926d20cb00a6fb5ca3b4693781d5b01f4ca8184201892727b103"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/RelayModernStore.js: FileTooLong \u2014 758 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: RelayModernStore (95-1086). The bar is 500 significant lines; this is 258 over it, 1.52\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c866d1bf2967119ca6c90a2863ca2c21ddc8fe1d20a281ef45b4f7deaf1383d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/schema_set_collector.rs: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d25628e90dd76fb5b0d1ab852af526cbe0c964ac1ac8ae30b37f1f5ec71d03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node/type_system.rs: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 243 over it, 1.49\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/node/type_system.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c78fda0107a31c7f2d7950c7ed8c11a8d8eceaa550dbd93d7af43243b28605"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DeclarativeConnectionMutationTransform.transform_linked_field: MethodTooLong \u2014 transform_linked_field runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/declarative_connection.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b887d516c979bcb8fc8d2f6c4096a846961a0535d05a1e901431331cb0c96f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_schema_generation::return_type_to_type_annotation: FunctionTooLong \u2014 relay_schema_generation::return_type_to_type_annotation runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0426813f2973c9f14e02f5d1cfee031229c57d9c6c39524786433bc465b9ccf7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SDLSchema: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/schema.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e900dd86a0f3a705100808fcc5169a7888ea3c00e60a4fc8c7ee439948fe0998"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeSystemDefinition.fmt: MethodTooLong \u2014 fmt runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/node/type_system.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbe3c061516d758928e1b38cc56fb328e56177496e4ca56acf3d839cfdb0bda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/printer.rs: FileTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 212 over it, 1.42\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/printer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec0975fcc08157da4cddf6fb0d9a3d401911590509edeb0f70f821a3ef9945"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphql_ir::signatures::build_fragment_variable_definitions: FunctionTooLong \u2014 graphql_ir::signatures::build_fragment_variable_definitions runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/signatures.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08be57ec12d4265c781693625456649a8924302c85e88ec69ad8c7a478e579d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/apply_transforms.rs: FileTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 201 over it, 1.40\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_transforms.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f35751d1c9e20892dd2baf5fffc644d78428891b7631a5d8720e94a8224785b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RelayResolverSpreadTransform.rebind_selection: MethodTooLong \u2014 rebind_selection runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60f95636015eb0631caf38d26ce76f11eb23b826187c5b8576fc0f8d0d5b48e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/docblock_ir.rs: FileTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 197 over it, 1.39\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/docblock_ir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ef5a2bfd17cb85bf33eb52b8fbc279c395256be6fb2848e15e86fd675d8da1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_transforms::apply_transforms::apply_common_transforms: FunctionTooLong \u2014 relay_transforms::apply_transforms::apply_common_transforms runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_transforms.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c8881023385a570440eb26ea5c73538894be9e82b70a9ad319e31f8ab08d62"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QueryResourceImpl._fetchAndSaveQuery: MethodTooLong \u2014 _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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/QueryResource.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c6b7a38e8e5d22ac5be1f03b9a6cec4808db8aa90cb043fabcc7f98129c3e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RelayReaderOptimized._traverseSelections: MethodTooLong \u2014 _traverseSelections runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee70540a68d9294421e737732808493c7501f07f40652f982e29127699878150"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SchemaSet: TooManyMethods \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6d7ff5deb61fcdb1319bc94344fef116f1cbbd2248cef340641ea4a34d2e7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/build_project.rs: FileTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 181 over it, 1.36\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92d78322de2200c2d87f10f2cb38ea1cddef1e887b4448832884295d008b05b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: live-resolvers/LiveResolverCache.js: FileTooLong \u2014 676 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 76% of them inside a single declaration: LiveResolverCache (91-951). The bar is 500 significant lines; this is 176 over it, 1.35\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0ed3dc2bb1321430b52c01cfdb3aed702cb87ee42860951f9460f5e8835cb0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MatchTransform.validate_transform_linked_field_with_match_directive: MethodTooLong \u2014 validate_transform_linked_field_with_match_directive runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/match_transform.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4212a4598ac9e3e5b80735e9998bf47150c36cad673137e23c18b70849fa07e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_compiler::compiler::build_projects: FunctionTooLong \u2014 relay_compiler::compiler::build_projects runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b1ddd6f53a379e25198722a4922a7dfebaa7c84a3da1a0e2b713a954cd4cb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_typegen::write::write_rsc_resolver_signature_type_assertion: FunctionTooLong \u2014 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 \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3325d63479c70bd6b9319f5b6b21e2bf602f576a2e4b63c41f8f71fd275ff90d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ConnectionHandler.update: FunctionTooLong \u2014 update 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/ConnectionHandler.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e412cd4f49e507500cb4dfcf74c2412e70fb159afdc765fb1240b8d2067fff9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RelayReader._traverseSelections: MethodTooLong \u2014 _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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c6956183a69aa43dae35eed65c92989e1880daba3d59cb9e6fdc53af88654a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FlatBufferSchema: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7e658232251ba53748c8d02d0e7c310601eda2c480146830fce2639fb4c382"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Config: TooManyFields \u2014 40 stored fields beside 20 methods. The bar is 30 stored fields; this is 10 over it, 1.33\u00D7 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 \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/config.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"8971b0c2b1f56d6c4760d1beb3a90d8f09d7d518c76285c0d4ade420e1fabdc6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LSPStateResources.build_programs: MethodTooLong \u2014 build_programs runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state_resources.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abfa2936fc0d6bc66acd3878113b9b8934d61349f62bd6122080fb3e618bf3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LiveResolverCache.readFromCacheOrEvaluate: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0e56fd0b82d3801068e336349b41902ebbafbd77922e653520977bad28ce88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Zero.new: MethodTooLong \u2014 new runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/intern/src/atomic_arena.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ca555a43990282976babbdc31fb97dd27797bdc0b67cef6e6fb531eafd86de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/prettier_schema_printer.rs: FileTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 146 over it, 1.29\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81999f9d73c1b5f3420d506a7a052edba8183d65cf005685c265f13e5613973b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Executor: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3915b2a835a13b3f2e9dea85e86adbafe6b4e278f14d304305887fe58dd48f07"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: FeatureFlags: TooManyFields \u2014 38 stored fields. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 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 \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/common/src/feature_flags.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d907e43ff9e92de21a53527fdb5c2a0ab5d7891084ab4657137dbe731b1235"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server_documents.rs: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/server_documents.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f63456744f582c4887276915e50e326bf5b95608f03aa27bdfdccae501e3a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodegenBuilder.build_operation: MethodTooLong \u2014 build_operation runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6428b6c38f34e4802bf764919efa02ca810ccb858040f5e6e62f86cf3d87adb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_transforms::apply_transforms::apply_typegen_transforms: FunctionTooLong \u2014 relay_transforms::apply_transforms::apply_typegen_transforms runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_transforms.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac7885a070241f03e72ec2331a3b1ced797258affe04f59eb7d815d38361cd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_compiler::build_project::build_programs: FunctionTooLong \u2014 relay_compiler::build_project::build_programs runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d734994bb791f4216f6abd16bd9de924fd59d9f33f5fc16e58c2f23c00a6003c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RelayResolverExtractor.resolve: MethodTooLong \u2014 resolve runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b78111894b852bf8fc04b15f98c0a642e5df47d33835bc4da6087c6930bdc4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: legacy/FragmentResource.js: FileTooLong \u2014 613 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 75% of them inside a single declaration: FragmentResourceImpl (202-883). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/FragmentResource.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f4c8f5b3cfb39ad36ddfddf77a53d10a73023b3c7efb06a2f47ee7180250ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_compiler::build_project::generate_artifacts::generate_artifacts: FunctionTooLong \u2014 relay_compiler::build_project::generate_artifacts::generate_artifacts runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/generate_artifacts.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f4022b09ec4f4b18d810c931a25d71bfdfbb5df879f6991286298c977b5669"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RelayResolverFieldTransform.extract_resolver_field_directives: MethodTooLong \u2014 extract_resolver_field_directives runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7522d62c07b3cfcb4e4e881ec374ecea4ed41e781200bfaefd16aa4415b40a64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/validate_selection_conflict.rs: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: ValidateSelectionConflict (2 blocks, 79-707). The bar is 500 significant lines; this is 102 over it, 1.20\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir-validations/src/validate_selection_conflict.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbcd82bc8e458e6ad95f7cb66fe9c647d863219d964e4d5874e2b331aeb8452"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Compiler.watch: MethodTooLong \u2014 watch runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86e469b83ce9e6a4996f03ea4f018f9d2527148d797f509d7672ef7e57211b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_typegen::visit::raw_response_visit_selections: FunctionTooLong \u2014 relay_typegen::visit::raw_response_visit_selections runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2bb738be313f9bc91073876be52e0e583f8dbe836ff66e410933aaf7908ae5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataChecker._traverseSelections: MethodTooLong \u2014 _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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/DataChecker.js"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"81996f77626714d8d487a599df3642b287fb87cd5c0f471927b970685c1dcc8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 98 over it, 1.20\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-bin/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc8d8294430806cc98d14b6358278a923d46b6b47f3dd2871d7b2a08ddfcda0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_lsp::rename::create_rename_request: FunctionTooLong \u2014 relay_lsp::rename::create_rename_request runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/rename.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3720f1b7dce246ff1c65c6e62eaa23e9bd924e4183d81318708ab0af565e2fd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_typegen::visit::visit_selections: FunctionTooLong \u2014 relay_typegen::visit::visit_selections runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8914359ffc422bef1402b22ab46a86d5637dfecabffc7626b56ac1efc1c14817"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodegenBuilder.build_reader_relay_resolver: MethodTooLong \u2014 build_reader_relay_resolver runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b0d0a1c2154c573d5977af5ebfc61e8322767c5ba3861f1b8975c9d1bc4fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RelayResponseNormalizer._traverseSelections: MethodTooLong \u2014 _traverseSelections runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34e7465600db8f6ae6f14030d34e49b3a0db85742007645ea579838110e76e4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config: ClassTooLong \u2014 468 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 4 blocks, lines 313-1610. The bar is 400 significant lines; this is 68 over it, 1.17\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/config.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe0041d92dc8145a13f610161e9865823e9b7040fc10270893a937946ef4e2a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RelayModernStore: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f18343d1684180d4d7123a0242cb8a24d9646aed0292506dd40cc5b2a18500"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: relay_resolvers/spread_transform.rs: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: RelayResolverSpreadTransform (3 blocks, 107-1009). The bar is 500 significant lines; this is 83 over it, 1.17\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19bfc84e876526cfcc68cd484065d442317fd69c4d71e878e0bf2e2c8fb3ab4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RelayResolverSpreadTransform: ClassTooLong \u2014 466 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 3 blocks, lines 107-1009. The bar is 400 significant lines; this is 66 over it, 1.17\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaa4f384d312eb6c0eeb1f5bc24fb21fa087d3c96ed3608e9b017606b510eec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/client_implementor_cases.rs: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: ClientImplementorCases (3 blocks, 367-942). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_implementor_cases.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46725bba34466e29b51a0e13c04d61824209743aa9ebe21d61a0c6089f59a22"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_optional_arguments: MethodTooLong \u2014 parse_optional_arguments runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e204feda4dc248404b6dda002759cf29e4f0a7ff2beca8b58e1ca9689454bc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/find_subset_violations.rs: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"141ed970a0579f31040ea43452b3a473e28e8c47a39aa9e797a3131a519f334f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir-diff/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dda116b62c73f772259eb908615dfb1241d54c8bdec0c76e1f535a8c22d4f2c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FragmentResourceImpl: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/FragmentResource.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7de9bdc25f7734e74e5f9988921b66d99b418cdb2dce1e9be71488c024b8159"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Serializer: ClassTooLong \u2014 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 2 blocks, lines 46-631. The bar is 400 significant lines; this is 54 over it, 1.14\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/serialize.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e2c197284d4ec8560838204b27a8ed247b5536c96e0795d0c131a9ad61d3d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: relay-hooks/useFragmentInternal_EXPERIMENTAL.js: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 67 over it, 1.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd6a731a392b38dbd2d1066c545ccfd639a48be0c5f9391977f42bb20d457f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rsc/useRelayHandoff.js: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/useRelayHandoff.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b409722d41601af2ec0bb6f2aa7d78eb8ee28f010e035d7b9b7f797a0524b39"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: createUpdatableProxy.updateProxyFromSelections: FunctionTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/createUpdatableProxy.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"81baadb38364aa9611ac10cb69f0887ed50431631f04e9d7596642f0c772e2fb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ValidateSelectionConflict: ClassTooLong \u2014 445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 79-707. The bar is 400 significant lines; this is 45 over it, 1.11\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir-validations/src/validate_selection_conflict.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e60be966721f6af2486216784d2ed5524bb9ef4e67fcfbb531fa13bc24da909"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/print_to_text.rs: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: Printer (2 blocks, 197-750). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_to_text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba4ce3b23654b5b69696d797040370348e7e0cd33caaf2fb7fd13352d8af571"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: react-relay/ReactRelayPaginationContainer.js: FileTooLong \u2014 555 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 73% of them inside a single declaration: createContainerWithFragments (319-904). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayPaginationContainer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"790dc120fc2f76cf661b1e9225a7b702864431c79642cfaf418ce0d76c2493cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/lsp_state.rs: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: LSPState (3 blocks, 175-759). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a16af288a02ec455ccecc91fa004527723ee26d3ffc16235a6c311c09e8e06"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/apply_fragment_arguments.rs: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: ApplyFragmentArgumentsTransform (3 blocks, 160-780). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_fragment_arguments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"152bd869149b6b0403adf6bc7f1045481f90e26aba5adbcbdf7568eb27ce6294"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClientEdgesTransform.transform_linked_field_impl: MethodTooLong \u2014 transform_linked_field_impl runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"822c9f04a1180d018d1752a11bcf545a89c83d08724bce7ab2bd5de16659f60b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRelayHandoff.executeHandoff: FunctionTooLong \u2014 executeHandoff runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/useRelayHandoff.js"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac7a906a41e15b1022404414f9f07a35cf9ac6c9634e1ac54f6ab7a7960b68c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/merge_sdl_document.rs: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 53 over it, 1.11\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/merge_sdl_document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b90b6dc2426c0d137ff258aaf03bc8618c227f6fe95ed499c51be274092992"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/definitions.rs: FileTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 52 over it, 1.10\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/definitions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5ae0f4740086fa76ad30f105320851f92bc87cd2368e7795f67fe83d79fa1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/NormalizationEngine.js: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: NormalizationEngine (101-894). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/NormalizationEngine.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"630c828e827b650c763208a50331fd483cee7163bf57f62928bb023b330dde29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodegenBuilder.build_inline_fragment: MethodTooLong \u2014 build_inline_fragment runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3e4688bf7b88aafc57d5bcf27102d02cb8495a3254a6b7fddc1c84a15b1d37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: readFragmentInternal.readFragmentInternal: FunctionTooLong \u2014 readFragmentInternal runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"11632760d69577d3ee5155889b64efdfd5cda14e62c27547c58f02813f64fc7a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphModeNormalizer._traverseSelections: MethodTooLong \u2014 _traverseSelections runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc6d7412abb1f2c129f7af598f0883a54f73c76f708a08f381e195b6b211fe8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Printer: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-print/src/printer.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1a9d15b3de45fe28d4d928a1c98eab30481b6d73304ecf066754f3276b2697"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_compiler::server_daemon::socket::start_server: FunctionTooLong \u2014 relay_compiler::server_daemon::socket::start_server runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/server_daemon/socket.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"152929a1296a21731bca23354ab360319f5bcc6ea3f1e697c2c10aaf0a09c0c9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LSPStateResources: ClassTooLong \u2014 422 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 57-669. The bar is 400 significant lines; this is 22 over it, 1.06\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state_resources.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faf16cb1f8a5cdbea9b4b1a25c58c9177323e16d85d1952441ba17f2b699984"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/build_schema_document.rs: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/build_schema_document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a53bcb4c27449b402b5c4c37433084543caf1d17c0524b349746b9031a04705"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConnectionValidation: ClassTooLong \u2014 421 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 3 blocks, lines 46-645. The bar is 400 significant lines; this is 21 over it, 1.05\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_connections.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"be86d8e2929a7658a714558bc63e7c960a6f3fb6ca02dcc5733658569219f998"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: ValidationContext (2 blocks, 94-747). The bar is 500 significant lines; this is 25 over it, 1.05\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-validate/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a014dcd4bc43e5d48987fe2ae5eb2c5156e8bd25f041df782844586f1aa59718"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/RelayModernRecord.js: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0266f496cf2f4bdfb2153f44f46e3756c6d3e73970f6f436436a44b22ecc5300"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ValidationContext: ClassTooLong \u2014 416 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 2 blocks, lines 94-747. The bar is 400 significant lines; this is 16 over it, 1.04\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-validate/src/lib.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4259481284dbe3225e45cfc04bb5a391ba406e43eb665d257d80efad94d6bf2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/set_merges.rs: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_merges.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dde111e098a0cc07907a6c831fc1ee916e443a258841387fb56743eef95d44"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShadowResolversTransform.validate_resolver_metadata: MethodTooLong \u2014 validate_resolver_metadata runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/shadow_transform.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fc90fc6d856d0012433222d544845598679c7d5843b9c42102aeb25c90242b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RelayReferenceMarker._traverseSelections: MethodTooLong \u2014 _traverseSelections runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReferenceMarker.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d035cdb81578ed869dced50255a1cfa4f5758f8dedf584c41840823035bf27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LiveResolverCache._setResolverValue: MethodTooLong \u2014 _setResolverValue runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ad9158bbbda659879730c2f5b52f59f83eeb4e96f7e0c0c9c78c10db1cbc7d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Printer: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_to_text.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1f3cec087ee2613bc649ee1c1aeeffd16a20e31b8c08ed60fb94b99fa35aa5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RelayReaderOptimized: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"a415e465863b9caed2d2642617f7ec9b20d0f3a9f8adb70b2d25218d55f7eec2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compiler.rs: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e517b3889c91e0ef65143e3ed32a68f8364db830d50f073cfc43c74d1ba268"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodegenBuilder.build_fragment_metadata: MethodTooLong \u2014 build_fragment_metadata runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"e872a78eb996d1e18854124045d265a03548c481829062f7338b4789bf5f1961"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_transforms::client_edges::validate_s2c_selections: FunctionTooLong \u2014 relay_transforms::client_edges::validate_s2c_selections runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ced398723a6ad72a331fc2f002c5f289aa6ad23f037e6bcc810590c6c35afe6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_transforms::refetchable_fragment::node_query_generator::build_refetch_operation: FunctionTooLong \u2014 relay_transforms::refetchable_fragment::node_query_generator::build_refetch_operation runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/refetchable_fragment/node_query_generator.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c439b80ace376e8649049e1feff81e1cda44b88ab8782e0551f627f832437c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: preloadQuery_DEPRECATED.preloadQueryDeduped: FunctionTooLong \u2014 preloadQueryDeduped runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f91dfcf925ed51beb88395a05c178eb3f26b80e62cdda53b056269d4d58a71b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flatbuffer/serialize.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 89% of them inside a single declaration: Serializer (2 blocks, 46-631). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/serialize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cde762d573c9c7e7cb7359eb84b5d120f7ffa4050e99cf99e1f731478e3bc03"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ApplyFragmentArgumentsTransform: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 3 blocks, lines 160-780. The bar is 400 significant lines; this is 8 over it, 1.02\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_fragment_arguments.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3fd62a553cd15e97f4450782c9e940da814490503ddc6edceebfd588c6eee3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FlattenTransform.can_flatten_selections: MethodTooLong \u2014 can_flatten_selections runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/flatten.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b2b847a8c510a7c6e2e7197f425d61eafd6bee2788d93fc36b57f395f769cd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Printer: ClassTooLong \u2014 406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 31 methods, 2 blocks, lines 197-750. The bar is 400 significant lines; this is 6 over it, 1.02\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_to_text.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd37e651af8e21e3410e8ebf2df87c1663f7657c6189828df571ed90b4261a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArtifactContent.as_bytes: MethodTooLong \u2014 as_bytes runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf0eec783a90cff5b6082ac09cd2892df02aadbc9ca6e95c1f8479d2fa6f7ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompletionRequestBuilder.build_request_from_selections: MethodTooLong \u2014 build_request_from_selections runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"53131a3433a78fb474765af790178278621cbe084b6c5d64910d88098cd568ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay_typegen::visit::visit_inline_fragment: FunctionTooLong \u2014 relay_typegen::visit::visit_inline_fragment runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d660f731bf6c71521251ace272d2f2c194419127f05992c45d3306a396a73ef"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LSPState: ClassTooLong \u2014 402 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 3 blocks, lines 175-759. The bar is 400 significant lines; this is 2 over it, 1.01\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59eb7bdd7d82ef440e99c381584099c60df67c3301b8e48c88083ef6a8ef2b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): compiler/crates/relay-typegen/src/write.rs:1274-1351 | compiler/crates/relay-typegen/src/write.rs:1371-1451 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5160eb0ad28ddfcabb05d76554039047164eb394e1428f8ac70d6eb40dda57"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (27 shared lines): compiler/crates/relay-typegen/src/flow.rs:234-309 | compiler/crates/relay-typegen/src/typescript.rs:279-348 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb9b566aa27b660f64cb357e6e9107ba4326eb20ed45e838451e33bda89bbd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/crates/intern/src/atomic_arena.rs:229-262 | compiler/crates/intern/src/atomic_arena.rs:626-660 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/intern/src/atomic_arena.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c35694a06ffb18cad78f694686634b652c2c05666fbabccd5dc3534902966a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): compiler/crates/errors/src/error_combinators.rs:29-57 | compiler/crates/errors/src/error_combinators.rs:64-99 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/errors/src/error_combinators.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e3fb472a5ffd669d9e48d334a83030409d31b9a1005e68e189b2d05485b0ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): compiler/crates/relay-compiler/src/artifact_content/content.rs:56-157 | compiler/crates/relay-compiler/src/artifact_content/content.rs:170-279 | compiler/crates/relay-compiler/src/artifact_content/content.rs:296-548 | compiler/crates/relay-compiler/src/artifact_content/content.rs:561-660 | compiler/crates/relay-compiler/src/artifact_content/content.rs:713-830 | compiler/crates/relay-compiler/src/artifact_content/content.rs:839-933 | compiler/crates/relay-compiler/src/artifact_content/content.rs:1118-1197 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"193ff278da69f584dfc483b06c4ff572966e6c772e594a9e781bc8aeab0eb9b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): 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:448-468 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:470-489 \u2014 These 6 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 \u2014 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 6 times. The repair is at the members\u0027 grain \u2014 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ecbeb294a2668f23e75fff97dfbc1c09ff6363779fbda6427cca824bfd18d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/from_schema.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bc0fa2bfa29c1b5e54e00b97e83dda257b05c68a9eb452376cb7ab7f7cfc6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler/crates/relay-codegen/src/printer.rs:216-241 | compiler/crates/relay-codegen/src/printer.rs:273-288 | compiler/crates/relay-codegen/src/printer.rs:295-310 | compiler/crates/relay-codegen/src/printer.rs:318-334 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/printer.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d813bd484b2aec2ff6bb1334f7960b6e22afb4c99926b2cee10808a9ed64995"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler-playground/src/lib.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe191c610afd8daa289eb85fd5c6b416f347709b0d2bf2af11495cbc516fe173"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler/crates/relay-lsp/src/completion.rs:893-931 | compiler/crates/relay-lsp/src/completion.rs:938-972 | compiler/crates/relay-lsp/src/completion.rs:978-1023 | compiler/crates/relay-lsp/src/completion.rs:1173-1220 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"211281d6dd8eaa1bb53f5164eb74b9face974c37e0d8377b9b9f4205c256ae1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): compiler/crates/relay-typegen/src/flow.rs:37-83 | compiler/crates/relay-typegen/src/typescript.rs:52-96 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ac9db989ebe9185530a5544f2b662e83ff4d909e52ea46aa0a5e39d7e550c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (91 corresponding lines): compiler/crates/relay-transforms/src/apply_transforms.rs:353-443 | compiler/crates/relay-transforms/src/apply_transforms.rs:698-796 \u2014 These two members are one piece of code written twice and then edited apart: 91 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_transforms.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aa02b5687fa819a77618c71b9be8fd4d0d94215004974b1e31bf419ecb2191"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): compiler/crates/schema/src/flatbuffer/wrapper.rs:648-725 | compiler/crates/schema/src/flatbuffer/wrapper.rs:731-789 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"c567725568d3ef57c2cc561b81834ee336c08e07370419e9fb3a5002d3bff5cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): compiler/crates/schema-set/src/find_subset_violations.rs:382-445 | compiler/crates/schema-set/src/find_subset_violations.rs:453-510 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e081a16f60ebc0cbc8bc33419f02fd8799e2c2bf60bbf9d0621b4f522e8071f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): compiler/crates/schema-set/src/schema_set_collector.rs:990-1052 | compiler/crates/schema/src/graphql_schema.rs:181-227 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6fef126038a8f923f4b8bc1a64d61cd790c900a7ee6ac9d52a8969af10c961"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): compiler/crates/relay-transforms/src/validations/deprecated_fields.rs:67-123 | compiler/crates/relay-transforms/src/validations/deprecated_fields.rs:151-200 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/deprecated_fields.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e8ff728bb1b5be3ccfb5ec0c9ae54714faea4ee776454987b955b766d1f8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/crates/schema-diff/src/lib.rs:354-392 | compiler/crates/schema-set/src/set_exclude.rs:757-783 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7bf798462a4227cbcc74425297f916e00add9e787b2c2c157ba6e790ff9590"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): compiler/crates/relay-codegen/src/build_ast.rs:1390-1427 | compiler/crates/relay-codegen/src/build_ast.rs:1490-1536 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b65ce4d6e0a945d29685b68f6f7a89da548a5c2cf940150c35ac78e60d629a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 53\u002B corresponding lines): compiler/crates/schema-set/src/schema_set_collector.rs:180-233 | compiler/crates/schema-set/src/schema_set_collector.rs:240-293 | compiler/crates/schema-set/src/schema_set_collector.rs:300-352 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 53 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"041d87f6e1a5f1dd0dada240f53412f17ac1362a8ac1d1ba4b3f33d03d70f600"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): compiler/crates/relay-codegen/src/build_ast.rs:1356-1388 | compiler/crates/relay-codegen/src/build_ast.rs:1448-1488 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b357b5b972e8623c238374743911033264535a9270b34ede7c369b971c7e33c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): compiler/crates/schema-set/src/ir_collector.rs:188-238 | compiler/crates/schema-set/src/ir_collector.rs:240-301 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/ir_collector.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"906c16c047ace67ae80f8a8cae53091812d63a148af34cdfc7712f72c7a51e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:888-928 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:935-971 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"dace678a2e21b42f04706236fe64365ff662417167f276c3c5429302fe59d5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/crates/schema/src/flatbuffer/serialize.rs:257-289 | compiler/crates/schema/src/flatbuffer/serialize.rs:340-363 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/serialize.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"959bc40516b964f234e4c62e5a8d521197cea727a48332fe542f9f8a4c1cf080"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): compiler/crates/relay-transforms/src/client_extensions.rs:187-219 | compiler/crates/relay-transforms/src/sort_selections.rs:92-124 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_extensions.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb3fc2cffdab353f2990a19a485b246a013480a9fe1a115d6b664b4a0e09ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/crates/schema/src/flatbuffer/wrapper.rs:385-409 | compiler/crates/schema/src/in_memory.rs:2523-2548 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3505347eac7c415b5c4ed592e95e165adc0a690f564d19faf44a1dd241f74f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 39\u002B corresponding lines): compiler/crates/graphql-ir/src/transform.rs:471-509 | compiler/crates/graphql-ir/src/transform.rs:520-568 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:425-466 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 39 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ed79cbb3bb74b393dcbe106c6a15886c90d4e9b35554f4d7efd7445fcea47e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): compiler/crates/relay-typegen/src/write.rs:311-348 | compiler/crates/relay-typegen/src/write.rs:1116-1164 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7723bc3202a2749abd6678d7cee592ccec2a75d488d2027f5a9b70a94c4ff6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): compiler/crates/schema-set/src/schema_set_collector.rs:652-690 | compiler/crates/schema-set/src/schema_set_collector.rs:698-733 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9149ecaf357ada37773f3f4115bf7dc4223d68e50b781f295f2336a94888213f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): compiler/crates/relay-lsp/src/completion.rs:376-419 | compiler/crates/relay-lsp/src/completion.rs:428-478 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"9accda991fb0dfdc011195d192ed35a07feaffff6f1a408ac88ed80a323d2916"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): compiler/crates/relay-lsp/src/server/lsp_state.rs:670-707 | compiler/crates/relay-lsp/src/server/lsp_state.rs:709-736 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"9099b577117ef09fdffd02e82526d35e9dbb552b54e7e5cf8e76df6aec6a8fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): compiler/crates/relay-transforms/src/flatten.rs:195-225 | compiler/crates/relay-transforms/src/flatten.rs:231-259 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/flatten.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb2ecb7ceed7a5ee48debdf92fd7cec6ee79db7e6dd14a8e9b756cb16e1ea71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): compiler/crates/relay-typegen/src/flow.rs:342-370 | compiler/crates/relay-typegen/src/typescript.rs:407-434 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c7e0c26a3882dcfc55dc71450221d315aa66f679a51f8087b5a27395125cf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): compiler/crates/graphql-syntax/src/parser.rs:2869-2908 | compiler/crates/graphql-syntax/src/parser.rs:2920-2949 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":2869}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61f2fe19972d6bca6804c2b6ba87cc639a181fb738f684ff3d4dc7cf0451fd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:139-161 | compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:271-293 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1aafbf461aa2106f747f47ee5c76d1416fdadec35666a66a55eaee320033169"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/crates/schema-set/src/set_merges.rs:353-379 | compiler/crates/schema-set/src/set_merges.rs:427-456 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_merges.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bcdf7f217fdea734c1a82a3b72a82cac5323195930983208baf3b895eba0c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 44\u002B corresponding lines): compiler/crates/schema-set/src/from_schema.rs:494-541 | compiler/crates/schema-set/src/merge_sdl_document.rs:710-753 | compiler/crates/schema-set/src/schema_set_collector.rs:936-985 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 44 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/from_schema.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b5af85f25be68d598f9b264043fc48d5f1b00c16dadb846ff0d391b07ac7f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): compiler/crates/schema-set/src/schema_set_collector.rs:808-839 | compiler/crates/schema-set/src/schema_set_collector.rs:841-871 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ec05b09d5c464bbccd9a7f3a0e55a45014c5cf8c5fdcd81363a4560692327d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 41\u002B corresponding lines): compiler/crates/resolution-path/src/lib.rs:233-275 | compiler/crates/resolution-path/src/lib.rs:484-525 | compiler/crates/resolution-path/src/lib.rs:1376-1416 | compiler/crates/resolution-path/src/lib.rs:1430-1470 | compiler/crates/resolution-path/src/lib.rs:1484-1524 | compiler/crates/resolution-path/src/lib.rs:1537-1577 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 41 lines, 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\u0027 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. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/lib.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c429a259cb7a86daa8ae9490fd08aab5371e18633b6f92a13b819c76ffdfb6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/crates/schema/src/graphql_schema.rs:84-107 | compiler/crates/schema/src/graphql_schema.rs:113-133 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/graphql_schema.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1813796a7cc23cab2837e9987f7be30f8ceaf69464e658dec27a80f4e43a92a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs:66-93 | compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs:95-122 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a45db61936d69e95528a77f8b3c4972facf528e431a6d391ff35f3af757f647"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): compiler/crates/relay-lsp/src/explore_schema_for_type/types.rs:210-258 | compiler/crates/relay-lsp/src/explore_schema_for_type/types.rs:295-325 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/explore_schema_for_type/types.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6a82f2d5a50e71a9d4259d4ccb8a04463cae45518114241bda2f97f2058ced"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): compiler/crates/resolution-path/src/lib.rs:1646-1675 | compiler/crates/resolution-path/src/lib.rs:1689-1718 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/lib.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ecdc5a007b2b5c52745a1f04e67a4dacd13d1f7f33b56993aaca38616ce57a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/crates/schema-set/src/from_schema.rs:461-487 | compiler/crates/schema-set/src/schema_set_collector.rs:894-929 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/from_schema.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b0282cda248e2cf048e4b6c7db5bbdf19b4cccce15fa95f10e8646b9a69edc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/crates/graphql-ir/src/transform.rs:350-369 | compiler/crates/relay-transforms/src/fragment_alias_directive.rs:296-316 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ea35f842603b9426f5ff90969d2e5536f1dc4707e169626d7353296cfa6ceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/crates/schema-set/src/schema_set_collector.rs:740-766 | compiler/crates/schema-set/src/schema_set_collector.rs:773-800 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"3265012e04cf732748441c443a8e45815306b3792a15ba8aa4fb5bd8e36f8848"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/crates/relay-transforms/src/client_implementor_cases.rs:874-894 | compiler/crates/relay-transforms/src/client_implementor_cases.rs:896-922 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_implementor_cases.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d627b0ff55762de6187190ea213085937eea6c89b54dbf7a6d9c2108913933"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): compiler/crates/schema-set/src/partition_base_extensions.rs:153-180 | compiler/crates/schema-set/src/partition_base_extensions.rs:184-211 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/partition_base_extensions.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da60ddc9452e310c9febf4edcc5c698a2c1e90d20d82302a1db26f1acf35d37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/crates/schema/src/flatbuffer/wrapper.rs:363-380 | compiler/crates/schema/src/in_memory.rs:2554-2571 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"3008bde05be88ec692698da0d10fd6729f15a2862d0597a0fedd0bada6cba13d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): compiler/crates/schema-set/src/set_remove_defined_references.rs:232-261 | compiler/crates/schema-set/src/set_remove_defined_references.rs:483-511 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_remove_defined_references.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdb5aa30a6fb534c7f1ea6e7b33968abfe9579d8e0705a11518102a3b7a5e8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/crates/schema/src/in_memory.rs:153-162 | compiler/crates/schema/src/in_memory.rs:2597-2606 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe7e7ea899d2bff30945fa6b3c24bba88ad3ceb010b40fff300cbac2371166f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 24\u002B corresponding lines): compiler/crates/schema-set/src/merge_sdl_document.rs:301-326 | compiler/crates/schema-set/src/merge_sdl_document.rs:335-358 | compiler/crates/schema-set/src/merge_sdl_document.rs:391-419 | compiler/crates/schema-set/src/merge_sdl_document.rs:456-480 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 24 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/merge_sdl_document.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e13081c50bb76405b29fe3921560466c4cbf5b6ecea0bda9a0b4c55c0c9229"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/crates/schema/src/flatbuffer/wrapper.rs:293-310 | compiler/crates/schema/src/flatbuffer/wrapper.rs:312-329 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ac0d81608535dc222d6fa0bf3fcfcf14a45101175ce456dcef70a748c9e965"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): compiler/crates/relay-transforms/src/relay_resolvers_abstract_types.rs:323-356 | compiler/crates/relay-transforms/src/relay_resolvers_abstract_types.rs:361-389 | compiler/crates/relay-transforms/src/relay_resolvers_abstract_types.rs:391-419 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers_abstract_types.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e8b151564c6f0a2c552693af48c15cecad70b3a82567cba573d730d5bedbb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): compiler/crates/relay-transforms/src/required_directive.rs:381-404 | compiler/crates/relay-transforms/src/required_directive.rs:409-430 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/required_directive.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"166f7d0063d10241a985c7957555f4ccfa90366f1ed3705c5114ab263dc1f697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/crates/schema/src/flatbuffer/serialize.rs:198-214 | compiler/crates/schema/src/flatbuffer/serialize.rs:237-255 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/serialize.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d780fc6405c182c6bed58375b531b3f67ca4d35765f98e4748e2aa27eb98107"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/crates/schema/src/graphql_schema.rs:139-158 | compiler/crates/schema/src/graphql_schema.rs:160-179 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/graphql_schema.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e269ef3bcdf4bc38d8b654ce92ddb9b3cb9239b426dd9df8575f349870f1f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 23\u002B corresponding lines): compiler/crates/resolution-path/src/lib.rs:314-347 | compiler/crates/resolution-path/src/lib.rs:660-682 | compiler/crates/resolution-path/src/lib.rs:729-760 | compiler/crates/resolution-path/src/lib.rs:1596-1632 | compiler/crates/resolution-path/src/lib.rs:1785-1814 | compiler/crates/resolution-path/src/lib.rs:1827-1856 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 23 lines, 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\u0027 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. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/lib.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42ad0ca5962bd4e21806d5a60728a3d464082f5a2b418b8afcdd56854ee2163"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): compiler/crates/schema/src/in_memory.rs:1331-1351 | compiler/crates/schema/src/in_memory.rs:1353-1370 | compiler/crates/schema/src/in_memory.rs:1372-1389 | compiler/crates/schema/src/in_memory.rs:1391-1408 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"825c5fe4576417074d28266c6a2dee3016a3b2ccd2a29f1a2056902ccf1ab07b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:209-223 | compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:225-242 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eee4474febe8dca643173f59bb22784ae38f6bcb9f3c5d581250c30a2dc3e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): compiler/crates/resolution-path/src/lib.rs:1283-1312 | compiler/crates/resolution-path/src/lib.rs:1325-1354 | compiler/crates/resolution-path/src/lib.rs:1738-1772 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/lib.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"112e151a282c5e2aba72bfdd1519e8ddc614d076c07af5b9c12bd580132ff3c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): compiler/crates/relay-lsp/src/code_action.rs:196-223 | compiler/crates/relay-lsp/src/code_action.rs:231-264 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/code_action.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19fc09512ddc8f538b38b3f737d23c3166ac90c5cfdef084353e33ece50a769"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/crates/graphql-text-printer/src/prettier_doc_builders.rs:169-186 | compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:341-367 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_doc_builders.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2115ec0f2ef21b11ce489df10faffbf8815e4f51fd34cae0ee8d506e6eb4b61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/crates/relay-transforms/src/transform_connections.rs:549-571 | compiler/crates/relay-transforms/src/transform_connections.rs:576-599 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/transform_connections.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b644f3f8b415d6182ae33f696a0b1eccd97e026851e495946fddeb933ab318"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:289-312 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:314-335 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:371-391 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:393-412 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"08072c984717f5e9bbcb48f64e4c4d31ea1ed2d3d5e49fa2b7b0fb988e816908"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): compiler/crates/graphql-ir/src/transform.rs:122-150 | compiler/crates/graphql-ir/src/transform.rs:163-191 | compiler/crates/graphql-ir/src/transform.rs:274-294 | compiler/crates/graphql-ir/src/transform.rs:306-324 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e388b7fd84cc766995da4eba8d6e1d9a224b30038355b89fea9d27da021e4a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/crates/schema/src/flatbuffer.rs:163-181 | compiler/crates/schema/src/flatbuffer.rs:206-224 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf438c3df2886d97d6cba2a7e6e2ac12c610ddaf8d3fc7e8b509fc1172443f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/crates/schema/src/flatbuffer/wrapper.rs:471-486 | compiler/crates/schema/src/in_memory.rs:2374-2395 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0dc844930c473adc6732d311bc0304dec4591d5e627e33ff9ceef3b20aaaad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/crates/schema-set/src/find_subset_violations.rs:607-625 | compiler/crates/schema-set/src/find_subset_violations.rs:635-655 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"7187c4f2b3f9f5356bd251930102580eea6f94a6b0c90dc58e0d588a6a507fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/crates/schema-set/src/merge_sdl_document.rs:367-382 | compiler/crates/schema-set/src/merge_sdl_document.rs:428-446 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/merge_sdl_document.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d14a101e029f46343700e2b81f204762bab6116c9f0d6f53aa80d53873f6bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:142-162 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:737-757 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe154c4c4bab64fcca50a1fd823a6e65941e184e39bfcff343cfafb0fc9dcc38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/crates/schema-set/src/set_type_reference.rs:61-87 | compiler/crates/schema/src/definitions.rs:260-284 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_type_reference.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d1bf3429421ba6b0f92055abfbf4ed3416b5782058a3072e46b1e398ca2764"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/crates/relay-lsp/src/find_field_usages.rs:201-216 | compiler/crates/relay-lsp/src/find_field_usages.rs:218-232 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/find_field_usages.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c5069a7dc2222a9354e09b1164022903a5bb046c75168aa149a1a27e72e3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/crates/relay-config/src/project_config.rs:599-622 | compiler/crates/relay-config/src/project_config.rs:648-674 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-config/src/project_config.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca468cf7cc36676221115dae8880d82c1cb172bf7780cdaf61f59ede59f0f2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/crates/relay-compiler/src/status_reporter.rs:615-639 | compiler/crates/relay-compiler/src/status_reporter.rs:641-666 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/status_reporter.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"4578d0ec57fd3d5bdab2de7f1f371758b2594e12ca7d96ad1de4bec09b90754b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/crates/schema-diff/src/lib.rs:301-318 | compiler/crates/schema-diff/src/lib.rs:321-336 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed7598f6d8151e54799909465a8a1239fcd579d889aac0d3acb0ea03be73e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 20\u002B corresponding lines): compiler/crates/graphql-syntax/src/parser.rs:628-651 | compiler/crates/graphql-syntax/src/parser.rs:852-873 | compiler/crates/graphql-syntax/src/parser.rs:962-983 | compiler/crates/graphql-syntax/src/parser.rs:1058-1081 | compiler/crates/graphql-syntax/src/parser.rs:1104-1127 | compiler/crates/graphql-syntax/src/parser.rs:1180-1199 | compiler/crates/graphql-syntax/src/parser.rs:1253-1274 | compiler/crates/graphql-syntax/src/parser.rs:1373-1393 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 20 lines, 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\u0027 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. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e23c1a9ce8d20de9a6a2f673c882725b98d0eceb2ca23ed83e8da58a8cc7eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): compiler/crates/graphql-syntax/src/parser.rs:1592-1612 | compiler/crates/graphql-syntax/src/parser.rs:1661-1683 | compiler/crates/graphql-syntax/src/parser.rs:1834-1856 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d90a6991ffa8d738a94ec48b9529d0e3a57c135b6ce07e1a9815c7e9fdca73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): compiler/crates/schema/src/flatbuffer/wrapper.rs:1039-1054 | compiler/crates/schema/src/flatbuffer/wrapper.rs:1056-1071 | compiler/crates/schema/src/flatbuffer/wrapper.rs:1073-1088 | compiler/crates/schema/src/flatbuffer/wrapper.rs:1101-1116 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"7444fe5c77a47aaa38f5326202682b87e5c15b6a06bf2a3506387c02dfbacb8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/crates/schema-diff/src/check.rs:482-496 | compiler/crates/schema-diff/src/check.rs:562-575 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/check.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"8974276e2d087cdb33fe6a70b4d1cbaa88ed9eb1ca7e3ee83fc4b735a33f71da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): compiler/crates/schema/src/in_memory.rs:432-441 | compiler/crates/schema/src/in_memory.rs:446-456 | compiler/crates/schema/src/in_memory.rs:458-468 | compiler/crates/schema/src/in_memory.rs:485-494 | compiler/crates/schema/src/in_memory.rs:496-505 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, 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\u0027 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc02f0bef6b34a178f09abc1734994ae6218f977cf980adc0d17d2a9f615fb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/crates/graphql-syntax/src/parser.rs:748-765 | compiler/crates/graphql-syntax/src/parser.rs:783-800 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"167b5856271493b37447a13f6734cca07dbca5585eb7ce5563f3e47a1734574f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/crates/relay-transforms/src/assignable_fragment_spread/annotate_updatable_fragment_spreads.rs:48-68 | compiler/crates/relay-transforms/src/server_documents.rs:130-150 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/annotate_updatable_fragment_spreads.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8fdbed4919ec874f8b23805fc328152dc9ec4a3062be78dcf4df8aed020193"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/crates/relay-transforms/src/validations/validate_relay_directives.rs:167-186 | compiler/crates/relay-transforms/src/validations/validate_relay_directives.rs:188-204 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_relay_directives.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8890cfbf266afa3674a6223d2068be13eb4a3bbb15d60fc427d1a1c4012a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): compiler/crates/schema/src/in_memory.rs:601-614 | compiler/crates/schema/src/in_memory.rs:618-630 | compiler/crates/schema/src/in_memory.rs:634-645 | compiler/crates/schema/src/in_memory.rs:653-666 | compiler/crates/schema/src/in_memory.rs:670-681 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, 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\u0027 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fda00ab24e3edba07022e3da33675bf86caa5011e13d0f2df2a5b60cef310d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/crates/relay-lsp/src/goto_definition.rs:242-259 | compiler/crates/relay-lsp/src/goto_definition.rs:266-286 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/goto_definition.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89a38520012bf514fa55e788e0f867a351f9d610ed6a8da133a88b395e7b70d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/crates/relay-transforms/src/validations/validate_required_arguments.rs:66-82 | compiler/crates/relay-transforms/src/validations/validate_required_arguments.rs:84-100 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_required_arguments.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9769b8fae56e237eb471a90d5c031d9dfb5ef18308bdaf8d5cdb76f9bca61580"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/crates/relay-transforms/src/catch_directive.rs:150-168 | compiler/crates/relay-transforms/src/catch_directive.rs:172-190 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/catch_directive.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64d53db78093ec6cd5638f60c3ea694f1eb85d13ebadbe4bf79c890757c3550"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): compiler/crates/resolution-path/src/lib.rs:702-718 | compiler/crates/resolution-path/src/lib.rs:1244-1264 | compiler/crates/resolution-path/src/lib.rs:2114-2135 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/lib.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb76bbc9ba080c850734c59261dc6adf0bd3bbd469ab19b9f005ea7a28af126d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:183-198 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:414-426 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:491-506 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:648-660 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9acd9991e2fa5e8194a2f49611f52002a13c209bfa24cfbe2a79e54627f0e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/crates/relay-transforms/src/validations/validate_connections.rs:390-410 | compiler/crates/relay-transforms/src/validations/validate_connections.rs:536-556 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_connections.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03557dde64337625210328a4bacdc52394bf47ec9e91aba20ccafd92de1f5cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): compiler/crates/graphql-ir/src/transform.rs:257-268 | compiler/crates/graphql-ir/src/transform.rs:332-343 | compiler/crates/relay-transforms/src/skip_unreachable_node.rs:184-201 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6487bc923b042c6c8988a6020b2353e8a25eb6b03d8284a1029f91490e68d271"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): compiler/crates/schema-set/src/print_schema_set.rs:257-282 | compiler/crates/schema-set/src/print_schema_set.rs:296-321 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/print_schema_set.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c32a372ecfdec1976611d70106639516b69fc554cdf498f607dee592cb55234"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): compiler/crates/schema/src/flatbuffer/wrapper.rs:1017-1026 | compiler/crates/schema/src/flatbuffer/wrapper.rs:1028-1037 | compiler/crates/schema/src/flatbuffer/wrapper.rs:1090-1099 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9286924e040b018d576619372a709b8a0db11bdb6c5e971f60659ca84a723c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/crates/errors/src/error_combinators.rs:117-132 | compiler/crates/errors/src/error_combinators.rs:144-159 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/errors/src/error_combinators.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7f6e524e0e13566ecfecb676c90ca8d8a6a7e285f080da249ed899540b451b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/crates/graphql-syntax/src/parser.rs:700-717 | compiler/crates/graphql-syntax/src/parser.rs:722-739 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c5becdcafa54b8fb20496d98561697ad2501963328db662153e9f3cf02d785"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/crates/relay-codegen/src/printer.rs:157-178 | compiler/crates/relay-codegen/src/printer.rs:249-266 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/printer.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6994582f17b598de417eb0bfd30748f68d1437be91806961a68dbdda978232ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/crates/schema-set/src/ir_collector.rs:135-158 | compiler/crates/schema-set/src/ir_collector.rs:164-186 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/ir_collector.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc29f8fb79cddae924fe51ea41f5b3d18a1c9de22f423c3556f3a3f85ebd11a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): compiler/crates/schema/src/flatbuffer.rs:242-253 | compiler/crates/schema/src/flatbuffer.rs:255-266 | compiler/crates/schema/src/flatbuffer.rs:268-280 | compiler/crates/schema/src/flatbuffer.rs:315-327 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"2476d0088b656c498840b24476f45cf8fe95e5b434646908a3ecd88a70b782ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/crates/relay-compiler/src/path_validator.rs:75-91 | compiler/crates/relay-compiler/src/path_validator.rs:97-114 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/path_validator.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"093eda8ab05094071bceed28b4652b64b4d60380d13e8373cc2a1f2c95a54877"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/crates/relay-transforms/src/apply_fragment_arguments.rs:731-743 | compiler/crates/relay-transforms/src/skip_unreachable_node.rs:293-303 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_fragment_arguments.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b6aba5439905553b88947d54f6923550801330062c91242b059eadc64eb0d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/crates/resolution-path/src/lib.rs:637-648 | compiler/crates/resolution-path/src/lib.rs:920-931 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/lib.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"294f18c4229de1fe1137ae02f79d331403893dc006f3a6862bf7ef39ed6a9127"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): compiler/crates/resolution-path/src/lib.rs:1873-1891 | compiler/crates/resolution-path/src/lib.rs:2000-2018 | compiler/crates/resolution-path/src/lib.rs:2031-2049 | compiler/crates/resolution-path/src/lib.rs:2063-2081 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/lib.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcddbad7184daf89a09dfb479b12d2cad9fd116e2f6887421b90cab69938d4a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/crates/schema-diff/src/lib.rs:92-124 | compiler/crates/schema-diff/src/lib.rs:732-755 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfedc32a3e90ee75c7a6b7506a4e11584ab00cd61159d5ad00c6356f439d75e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): compiler/crates/schema-set/src/build_schema_document.rs:663-678 | compiler/crates/schema-set/src/build_schema_document.rs:681-698 | compiler/crates/schema-set/src/build_schema_document.rs:727-744 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/build_schema_document.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"f705fe6127529765bc8134b65241774ce3be593b8644450a753adbd91d771363"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/crates/graphql-syntax/src/node/type_system.rs:821-836 | compiler/crates/graphql-syntax/src/node/type_system.rs:845-860 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/node/type_system.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6b405dfc45b55eb76fd6cadfc1406eedf1e67bed39e04e6a17506de75f3344"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/crates/schema-set/src/build_in_memory_schema.rs:575-586 | compiler/crates/schema-set/src/build_in_memory_schema.rs:592-609 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/build_in_memory_schema.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adb8de9115b66b11bb47d56136f9d4fd1a7f03c9c0e2780a4c2c7f77dd410e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:105-122 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:124-140 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"40facd9585eeab997a0e0cea27d25bb240de21b48373989315fd7991b60fe0b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): compiler/crates/schema/src/compact.rs:661-680 | compiler/crates/schema/src/compact.rs:730-746 | compiler/crates/schema/src/compact.rs:748-764 | compiler/crates/schema/src/compact.rs:796-816 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/compact.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"60da0e83ad64b96c35c1424cac6480973734e9af742352e5047c90782ecb36ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:69-81 | compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:178-188 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_ast_to_text.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9792ded5112d5704c0c67f6176cae073704c2c8f52210f11953f9d8b6b133b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/crates/relay-transforms/src/relay_resolvers/resolver_utils.rs:81-96 | compiler/crates/relay-transforms/src/validations/validate_module_names/extract_module_name.rs:44-64 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/resolver_utils.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3305577edd3e9685b4e62dec1c9dd66d272dd58fb2b50f791a30998f597f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/crates/relay-typegen/src/visit.rs:3305-3325 | compiler/crates/relay-typegen/src/visit.rs:3335-3353 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"019f840b28642a94dd8cab521ef6ab3daede728198098bcb2ff549ca5c8d0bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:86-100 | compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:134-147 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_ast_to_text.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9998d57192d00c6a8693d0dda2f6689729982a93f7d86ec97b0c634b2f4f57b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): compiler/crates/relay-typegen/src/lib.rs:150-169 | compiler/crates/relay-typegen/src/lib.rs:176-200 | compiler/crates/relay-typegen/src/lib.rs:209-237 | compiler/crates/relay-typegen/src/lib.rs:246-274 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/lib.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba1798aa0a067aa8120d23590904355ce7921d03d2875f28a655b222abc805c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/crates/relay-typegen/src/visit.rs:2811-2838 | compiler/crates/relay-typegen/src/visit.rs:2942-2962 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fe59aaa657653ddd2fa76f896005c641d12775f0a78e2aba4dbbaf2b3fe60c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/crates/graphql-ir/src/ir.rs:426-434 | compiler/crates/graphql-syntax/src/node/executable.rs:215-222 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/ir.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06a97d5e72ba837c29286a36864aa7e2c87005d7677c1d3ec724b816592b81b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/crates/relay-typegen/src/visit.rs:3445-3458 | compiler/crates/relay-typegen/src/visit.rs:3469-3480 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":3445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39140aa53fc6cdfb8a91d4c5a5110a93af987c626e43756f2f5e82804ed1342"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): compiler/crates/schema/src/compact.rs:393-407 | compiler/crates/schema/src/compact.rs:445-455 | compiler/crates/schema/src/compact.rs:473-485 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/compact.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"79eab969df817db0a6a7665af2356c90d53046be4a0c9e6acd3223846b5416eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 19\u002B corresponding lines): compiler/crates/schema/src/suggestion_list.rs:110-128 | compiler/crates/schema/src/suggestion_list.rs:130-148 | compiler/crates/schema/src/suggestion_list.rs:150-168 | compiler/crates/schema/src/suggestion_list.rs:170-188 | compiler/crates/schema/src/suggestion_list.rs:190-208 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 19 lines, 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\u0027 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/suggestion_list.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d937654c85a3006ce3d12c31def7aaccb67de6ca79e92a6c212e36eeabaf50a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/crates/relay-compiler/src/compiler_state.rs:1287-1299 | compiler/crates/relay-compiler/src/compiler_state.rs:1304-1316 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69f5bd76602a27ae7fca218bcdd5234f387c15b0ec27ae1cb5dd69c92754281"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/crates/relay-transforms/src/defer_stream.rs:322-337 | compiler/crates/relay-transforms/src/defer_stream.rs:356-371 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/defer_stream.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1eb10d6220d1a9c36dc607183db7f7d2125ba273877b68bcf76a9747de13d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:385-400 | compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:402-417 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"317ed2b387f6122fd4b562563beb63bbd9fce4cf4c0ee6c5f5378e017f50c617"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/crates/graphql-ir-diff/src/lib.rs:414-426 | compiler/crates/graphql-ir-diff/src/lib.rs:431-443 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir-diff/src/lib.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"6580fc84d38b868dce7834df0d107beabf55c3c0f34a6c6ce1f98aeba01bb42f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): compiler/crates/graphql-ir/src/node_identifier.rs:571-580 | compiler/crates/graphql-ir/src/node_identifier.rs:648-654 | compiler/crates/graphql-ir/src/node_identifier.rs:677-690 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/node_identifier.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc97ca9c8c0bb2b2088472135504c30bc823f7f8a2bb840c1fd1f6cabd50d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:428-442 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:520-534 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:536-549 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:621-634 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0dae7a2d0afe6064cdc4fff7098728052f4a3e0c5135a64458bdd68799d18b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/crates/resolution-path/src/lib.rs:891-904 | compiler/crates/resolution-path/src/lib.rs:1047-1061 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/lib.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb80be4db588a73a273eadf3c04b8cae3270a205cabed168d05e0219923e756"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/crates/relay-transforms/src/exec_time_variable.rs:220-237 | compiler/crates/relay-transforms/src/exec_time_variable.rs:241-251 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/exec_time_variable.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bb85e146e86e8ab141006ebf76531ae1d9fb513b213bb08745ddbb6373443d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/crates/schema/src/flatbuffer/serialize.rs:548-558 | compiler/crates/schema/src/flatbuffer/serialize.rs:563-573 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/serialize.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa74650d75ff958514c6a08355415f29d89eb91ba6dbeab3900e262f2c5530db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/crates/schema-set/src/set_remove_defined_references.rs:420-434 | compiler/crates/schema-set/src/set_remove_defined_references.rs:442-459 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_remove_defined_references.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3c1d0635817cff9e577aad874a9098ee3dd865d74e75ab4e23466fae222b68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): compiler/crates/graphql-syntax/src/parser.rs:818-833 | compiler/crates/graphql-syntax/src/parser.rs:928-943 | compiler/crates/graphql-syntax/src/parser.rs:1025-1038 | compiler/crates/graphql-syntax/src/parser.rs:1151-1164 | compiler/crates/graphql-syntax/src/parser.rs:1219-1234 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 14 lines, 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\u0027 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"341593e621e272b0eca61ca918f803cd6ca796d2126879f2e1e7a29de37a6809"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/crates/schema-set/src/partition_base_extensions.rs:215-238 | compiler/crates/schema-set/src/partition_base_extensions.rs:300-318 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/partition_base_extensions.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4032af0cf88891bbf501037d69b7a75720199d4035f20ff458588c4f9f147ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/crates/relay-transforms/src/client_implementor_cases.rs:438-452 | compiler/crates/relay-transforms/src/client_implementor_cases.rs:463-485 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_implementor_cases.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75f07a5b29d5cd499717a61a8d941fb709b3b583051a1ab716248cc06207055"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/crates/schema-diff/src/lib.rs:827-835 | compiler/crates/schema-set/src/schema_set_collector.rs:877-887 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1716c89ce1d2c3d1431f018dfc50fc8ee30a1ad348cbccc9518d1f54c584e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): compiler/crates/schema-set/src/set_exclude.rs:253-263 | compiler/crates/schema-set/src/set_exclude.rs:375-386 | compiler/crates/schema-set/src/set_exclude.rs:396-410 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_exclude.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f4343d8efa7884c1174f03d0d073b8b592c4a5edc4c09bc5d455cf5b977246"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): compiler/crates/graphql-ir/src/ir.rs:132-139 | compiler/crates/graphql-ir/src/ir.rs:184-191 | compiler/crates/graphql-ir/src/ir.rs:449-460 | compiler/crates/graphql-ir/src/signatures.rs:122-129 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/ir.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"682b5cb48b825d3b806b2202a408e4b4687345dc6abc962747f03d0fb65bbd70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): compiler/crates/dependency-analyzer/src/minimized_executable.rs:62-74 | compiler/crates/dependency-analyzer/src/minimized_executable.rs:89-100 | compiler/crates/dependency-analyzer/src/minimized_executable.rs:132-144 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/dependency-analyzer/src/minimized_executable.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4040389fbf1c7fbe2233bc0eefebb6ac954feec39b0e43d320c36ccba7a6e259"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/crates/graphql-syntax/src/parser.rs:893-903 | compiler/crates/graphql-syntax/src/parser.rs:1706-1717 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b1b2f6460dee89e58be641079ec134b6eb5236c8fd02d5ebe945c8e361f05c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): compiler/crates/graphql-syntax/src/parser.rs:262-271 | compiler/crates/graphql-syntax/src/parser.rs:273-282 | compiler/crates/graphql-syntax/src/parser.rs:284-296 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7ffa828e0157336540e912f64c47b50490b1e8356170c665bb13ae2ea968c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/crates/schema-set/src/merge_sdl_document.rs:106-115 | compiler/crates/schema-set/src/merge_sdl_document.rs:128-151 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/merge_sdl_document.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"947706201f3269fbefe7ad6dca568cd84ca7842d384b5855a8b6cd4917d7b031"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/crates/schema/src/compact.rs:766-779 | compiler/crates/schema/src/compact.rs:781-794 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/compact.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6678199b25dc4b908ac67145b850b359c370f1baefa05c2da5d4430cfdd2f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/crates/relay-transforms/src/relay_resolvers_abstract_types.rs:282-294 | compiler/crates/relay-transforms/src/relay_resolvers_abstract_types.rs:300-312 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers_abstract_types.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"117ee533a99c3edf464a87c030fdeebe60840066de273b4ecc4bfa85e97b2c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/crates/schema/src/flatbuffer/wrapper.rs:283-291 | compiler/crates/schema/src/flatbuffer/wrapper.rs:331-340 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a0a6ad9d6587908a187237dde5ae16fa903554481f911e1036bff572b4ed68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs:295-306 | compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs:308-319 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2f55609edf5e955b2c06a49b98da6c2abc37798b45f0d36912016c9d66a1c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): compiler/crates/schema-print/src/printer.rs:160-168 | compiler/crates/schema-print/src/printer.rs:170-178 | compiler/crates/schema-print/src/printer.rs:197-204 | compiler/crates/schema-print/src/printer.rs:206-213 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-print/src/printer.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6f941e6fb25ebd67ad3c625d0fb20de7579ba76b9728f38978f728918b5f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/crates/schema-set/src/build_schema_document.rs:318-327 | compiler/crates/schema-set/src/build_schema_document.rs:348-357 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/build_schema_document.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84dbb635b20fd37d563c0ecf16252b4add545586a5bb91ff1eb3ea9a949fca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/crates/schema-set/src/print_schema_set.rs:462-468 | compiler/crates/schema-set/src/print_schema_set.rs:471-477 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/print_schema_set.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"b993f34bbeb62c9a55bdc0ca1e50e298311561f90c9572f4ccae263cf8aeb06f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/crates/schema-set/src/set_merges.rs:680-690 | compiler/crates/schema-set/src/set_merges.rs:739-749 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_merges.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d5f5d6d099eaecf0aaabd7d69df94e02f90b16065c9a8a15337f325e6985ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/crates/graphql-ir/src/ir.rs:61-72 | compiler/crates/graphql-syntax/src/node/executable.rs:50-61 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/ir.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb222777c4e8a0781c7335e0198db212430674136091066353831ef80de1574"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/crates/graphql-ir/src/visitor.rs:68-76 | compiler/crates/graphql-syntax/src/visitor.rs:108-115 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/visitor.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d7b2da36301e9638a7c3a156822bde516e58b0d81c2f954476e804411f2894"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/crates/graphql-text-printer/src/print_to_text.rs:293-298 | compiler/crates/graphql-text-printer/src/print_to_text.rs:304-311 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_to_text.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"22254b568ea7b6165dd325149af00d896ef30f32f60f7699d8d3a7df47aad994"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/crates/schema-print/src/shard_printer.rs:40-45 | compiler/crates/schema-print/src/shard_printer.rs:47-53 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-print/src/shard_printer.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02eda9bee8d30dff7da121ff1a8bcdaa3d671030b3ad0bc9bc8c145d368c92d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/crates/relay-lsp/src/explore_schema_for_type/types.rs:191-203 | compiler/crates/relay-lsp/src/explore_schema_for_type/types.rs:331-347 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/explore_schema_for_type/types.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ae8d43bf35f36a72c7263ea0fec8092d45558f39af6001b4f4a797a0d242bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): compiler/crates/common/src/diagnostic.rs:65-76 | compiler/crates/common/src/diagnostic.rs:89-101 | compiler/crates/common/src/diagnostic.rs:137-149 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/common/src/diagnostic.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d9db818e8515302db1f7326b6d69aeb7cfceb8efb7dac01e1f83416bb25321"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/crates/schema-set/src/set_type_reference.rs:133-141 | compiler/crates/schema/src/definitions.rs:360-370 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_type_reference.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64127a926ba33d31245a05e5bd7b219b644326b24d4918c185ddc3a5b0f464e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/crates/relay-compiler/src/build_project.rs:255-268 | compiler/crates/relay-compiler/src/build_project.rs:277-290 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"08632548a820917e0cf09ed13f471e5cfd9db9f3f3f5e2db000cbcdf81be7638"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/crates/graphql-ir/src/visitor.rs:170-177 | compiler/crates/graphql-syntax/src/visitor.rs:196-203 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/visitor.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caa807c74c0fb1340e6e58bb16a84e0c921b2fd50d754a191bbc56f325b0c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/crates/relay-compiler/src/file_source/file_filter.rs:102-116 | compiler/crates/relay-compiler/src/config.rs:1098-1112 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/file_source/file_filter.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"180b9ffc4b749439e75837133707b14d521a7981597828b51675a0c73ae09151"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/crates/relay-typegen/src/visit.rs:1382-1400 | compiler/crates/relay-typegen/src/visit.rs:1417-1436 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e088f850612e5a3aa8f79bdb5f703335e2d9e28fa0cc5eefac1e50da7206424"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): compiler/crates/graphql-syntax/src/parser.rs:1859-1869 | compiler/crates/graphql-syntax/src/parser.rs:1979-1991 | compiler/crates/graphql-syntax/src/parser.rs:1992-2004 | compiler/crates/graphql-syntax/src/parser.rs:2395-2407 | compiler/crates/graphql-syntax/src/parser.rs:2410-2422 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, 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\u0027 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dfdf86691ca1771f31cc1113a9cd08fec4751ec1d4be901506e8aebdac69ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/crates/relay-schema/src/definitions.rs:153-165 | compiler/crates/relay-schema/src/definitions.rs:187-203 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema/src/definitions.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"33718978d0d62a898ab03def18d99f96c19cd91d1287faa9136b828c6260e62e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/crates/relay-transforms/src/catch_directive.rs:267-277 | compiler/crates/relay-transforms/src/required_directive.rs:574-585 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/catch_directive.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"85154391a7ee805126aaa79f601b2b72d6341b8e243162bd4084ed623d6d112c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): compiler/crates/relay-transforms/src/client_edges.rs:2120-2130 | compiler/crates/relay-transforms/src/metadata_directive.rs:27-37 | compiler/crates/relay-transforms/src/raw_text.rs:84-96 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1044903b03cf17d8a8f9985487a3ff13a607a13ec82de5df33482316cc088ad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:343-361 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:367-385 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:471-484 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:489-502 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/skip_redundant_nodes.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f0cf5084823b063b1abfe907629408a05e27e1ca2f87e9d36d4842c32dd670"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): compiler/crates/schema-set/src/build_schema_document.rs:302-314 | compiler/crates/schema-set/src/build_schema_document.rs:331-344 | compiler/crates/schema-set/src/build_schema_document.rs:361-374 | compiler/crates/schema-set/src/build_schema_document.rs:390-402 | compiler/crates/schema-set/src/build_schema_document.rs:434-446 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, 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\u0027 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/build_schema_document.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d755c893a0e5a7846a9364320a7abecd3a2773749737112e2394d3aa504eb5fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/crates/graphql-text-printer/src/print_full_operation.rs:157-165 | compiler/crates/relay-transforms/src/validations/validate_no_inline_with_raw_response_type.rs:93-100 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_full_operation.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a61c3b15b04cb10ba7d764f718cf9f950b3217deae5bde6cf27d0d350b299f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): compiler/crates/relay-transforms/src/catch_directive.rs:86-98 | compiler/crates/relay-transforms/src/inline_data_fragment.rs:37-48 | compiler/crates/relay-transforms/src/relay_resolvers_abstract_types.rs:49-66 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/catch_directive.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8217cc7b15e6bf92c43306014a7d634c7168003d25e4619a9cd25c40b27ea26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/crates/schema/src/flatbuffer/serialize.rs:474-481 | compiler/crates/schema/src/flatbuffer/serialize.rs:496-502 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/serialize.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4273d1816c9dfa7627fd015827f46cb863d0d80554b5016640fb829d852f15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 11\u002B corresponding lines): compiler/crates/relay-transforms/src/declarative_connection.rs:43-55 | compiler/crates/relay-transforms/src/fragment_alias_directive.rs:58-68 | compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:106-117 | compiler/crates/relay-transforms/src/relay_resolvers/spread_transform.rs:93-105 | compiler/crates/relay-transforms/src/required_directive.rs:75-87 | compiler/crates/relay-transforms/src/test_operation_metadata.rs:63-74 | compiler/crates/relay-transforms/src/validate_operation_variables.rs:39-49 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 11 lines, 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\u0027 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. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/declarative_connection.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc41a0d6680700ec50e420d5d9e4f73d4a4dce954ce5736beaed4e7991406c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): compiler/crates/relay-transforms/src/defer_stream.rs:52-67 | compiler/crates/relay-transforms/src/match_/hash_supported_argument.rs:30-41 | compiler/crates/relay-transforms/src/match_/match_transform.rs:76-89 | compiler/crates/relay-transforms/src/relay_resolvers/shadow_transform.rs:52-61 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/defer_stream.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86c486d3304c82f6259398df11648bec1263ce8d858e262493c00047a6b4740"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/crates/graphql-syntax/src/parser.rs:910-919 | compiler/crates/graphql-syntax/src/parser.rs:1724-1734 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a45bbf2c3e21e6e5084f20bb49ea1fcfdaacdd54b9d6e51eb0e5f15750d089"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/crates/graphql-ir/src/ir.rs:345-353 | compiler/crates/graphql-syntax/src/node/executable.rs:204-211 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/ir.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e864e151dc6782a9e671f1440af4fc5a54ce9c4d907e9c217bd3d65bfebedd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): compiler/crates/schema-set/src/set_merges.rs:239-247 | compiler/crates/schema-set/src/set_merges.rs:273-281 | compiler/crates/schema-set/src/set_merges.rs:306-312 | compiler/crates/schema-set/src/set_merges.rs:316-323 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_merges.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48107c089bbe7366fba78138813017e2b7e9b29ef87d3c6e02aabc89c7af58f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): compiler/crates/relay-transforms/src/client_implementor_cases.rs:264-272 | compiler/crates/relay-transforms/src/client_implementor_cases/pipelines.rs:156-165 | compiler/crates/relay-transforms/src/util.rs:65-73 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_implementor_cases.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efc4e71d8968efba824bf7f3ad6a292ea4fdaa50640628a8f75b1f6802db0cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/crates/interner/src/bytes.rs:170-176 | compiler/crates/interner/src/generic.rs:46-52 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/interner/src/bytes.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c4f2ee3fdd13e9924f76bdde6d1e9d7153fe08d3e65bdad3c91056c1ef1bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/crates/schema-print/src/printer.rs:124-130 | compiler/crates/schema/src/flatbuffer/serialize.rs:130-135 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-print/src/printer.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ea281ba97766974a6f45052ea797f290aee1c3fa915bfc75fb2b537b981bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): compiler/crates/graphql-syntax/src/node/document.rs:48-56 | compiler/crates/graphql-syntax/src/node/type_system.rs:752-759 | compiler/crates/relay-compiler/src/compiler_state.rs:128-137 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, 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\u0027 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/node/document.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a7762deae6f8bee7425d7ac084291680840a29174b1352464574bc33035045"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/crates/relay-transforms/src/generate_typename_union.rs:93-98 | compiler/crates/relay-transforms/src/refetchable_fragment/fetchable_query_generator.rs:226-231 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_typename_union.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"903bde6e5cb209c6cb8d87d6387aeb1dbfc62ec282cf78594616fae1749fec63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/crates/common/src/text_source.rs:153-156 | compiler/crates/relay-codemod/src/codemod.rs:270-273 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/common/src/text_source.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f6aab46e58e41ad3b2707739792e4759dd6421c965aa1901390c9db0bf389f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/crates/graphql-syntax/src/node/executable.rs:63-68 | compiler/crates/relay-compiler/src/graphql_asts.rs:91-96 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/node/executable.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5200f6015402808684cfb228ea57f765255f2346cd3db2961e3ade12b5f61433"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/crates/relay-transforms/src/client_edges.rs:2132-2139 | compiler/crates/relay-transforms/src/raw_text.rs:46-52 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbc8e5a4c105f51fa299eac41b9676644a75beb8d12648b1a35451bf594e4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): compiler/crates/relay-transforms/src/generate_resolver_operation_metadata.rs:66-71 | compiler/crates/relay-transforms/src/inline_fragments.rs:59-65 | compiler/crates/relay-transforms/src/match_/split_module_import.rs:35-40 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:127-132 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_resolver_operation_metadata.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd8c7160a5b9f448d74c88a9026a84a1ff21ab8c7d30babf399f0b8801c467b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): compiler/crates/relay-transforms/src/generate_data_driven_dependency_metadata.rs:34-39 | compiler/crates/relay-transforms/src/mask.rs:30-35 | compiler/crates/relay-transforms/src/skip_client_directives.rs:14-19 | compiler/crates/relay-transforms/src/unwrap_custom_directive_selection.rs:25-30 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, 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\u0027 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_data_driven_dependency_metadata.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"582057a22d6bd21673e52115b115a17587036170c58661b2d0a095baeed42da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/crates/relay-transforms/src/client_extensions.rs:287-298 | compiler/crates/relay-transforms/src/skip_client_extensions.rs:141-152 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_extensions.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c290514e9c2002d529c19cda6fa77c6d76f0106cab79eff26feefda610d52073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201336 lines \u00D7 2): compiler/crates/relay-typegen/src/write.rs:325-348 | compiler/crates/relay-typegen/src/write.rs:1129-1164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/write.rs:325\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f681939c53f9a2ca44f1f5d424c69233f29d718c670cbbc99d949354e417e9d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:501-536 | compiler/crates/schema/src/in_memory.rs:2450-2485 \u2014 before extracting anything, compare \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs\u0060 and \u0060compiler/crates/schema/src/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 112 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5f5a196cfc977deb6a00819e43bfd3e0f17785c28d9213cd7b43d583b67fdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201332 lines \u00D7 2): compiler/crates/errors/src/error_combinators.rs:30-54 | compiler/crates/errors/src/error_combinators.rs:65-96 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/errors/src/error_combinators.rs:30\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/errors/src/error_combinators.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c61640ba06297e5b230e3a76fc7f099532782a9a069070afe2080992d1d10d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): compiler/crates/relay-typegen/src/visit.rs:1857-1884 | compiler/crates/relay-typegen/src/visit.rs:1913-1940 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b64e80724e82b4dbda535b370be954f25af424ca51438961fb4da66feac2ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): compiler/crates/relay-compiler/src/artifact_content/content.rs:66-92 | compiler/crates/relay-compiler/src/artifact_content/content.rs:326-352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler/src/artifact_content/content.rs:66\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc314b2c04a30f4dee1fd6f66b384bcbd7fa3d947e2b9a12276583b3fa4e33b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): compiler/crates/schema-set/src/schema_set_collector.rs:182-207 | compiler/crates/schema-set/src/schema_set_collector.rs:242-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/schema_set_collector.rs:182\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c60a6a282f858e47c8d04d4ead2eec8b1757c1b89dbdfd297e979338ed7fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:416-441 | compiler/crates/schema/src/in_memory.rs:2492-2518 \u2014 before extracting anything, compare \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs\u0060 and \u0060compiler/crates/schema/src/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 112 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36e54d76707b81371264d993c26e260dce8f40198f03335c904741f24d21de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): compiler/crates/schema-set/src/find_subset_violations.rs:186-211 | compiler/crates/schema-set/src/find_subset_violations.rs:215-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/find_subset_violations.rs:186\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"497751600f402a18146345a0051174c1b9e30d4cb72449d986ec3becc31328d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): compiler/crates/relay-typegen/src/write.rs:430-453 | compiler/crates/relay-typegen/src/write.rs:600-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ebb29f2754c702f94846c5b2ce1b0ca8ef102545945ad9bafee359a14708fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:594-618 | compiler/crates/schema/src/flatbuffer/wrapper.rs:687-709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67a16b03fe82f8fbd062c8714189eba1f941e6c7bad314c33ff216c2ab6ef83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): compiler/crates/relay-compiler/src/artifact_content/content.rs:246-268 | compiler/crates/relay-compiler/src/artifact_content/content.rs:434-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/crates/relay-compiler/src/artifact_content/content.rs:245\u0060 calls \u0060print_updatable_query\u0060 and \u0060compiler/crates/relay-compiler/src/artifact_content/content.rs:433\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3857c01523432aa430eecd367fbc5ac78a3aff95996246e6bb8cb22615ab9d80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): compiler/crates/relay-compiler/src/artifact_content/content.rs:801-823 | compiler/crates/relay-compiler/src/artifact_content/content.rs:893-911 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler/src/artifact_content/content.rs:801\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"686ba76f396bf0bf8306ebb9f782a1bfe39233063a4cb9d7ddb5e849b9badf80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:444-465 | compiler/crates/schema/src/in_memory.rs:2574-2595 \u2014 before extracting anything, compare \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs\u0060 and \u0060compiler/crates/schema/src/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 112 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a9bb3807010e46f16154b8647d78b2221f10fb6ae0fabbb9d58458654ed4f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:63-83 | compiler/crates/relay-typegen/src/typescript.rs:76-96 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/flow.rs:63\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/relay-typegen/src/flow.rs:85\u0060 calls \u0060get_runtime_fragment_import\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs:98\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e6f09352a27ca0bc178b5cf79ca03e666cb55d52e8a67d4a5a85e9026449f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): compiler/crates/schema-set/src/partition_base_extensions.rs:246-265 | compiler/crates/schema-set/src/partition_base_extensions.rs:273-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/partition_base_extensions.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fd87d49b873f456d03837ec7c5a5f82c89dbfa98991ad5d0f1c50e3fbce5ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 5): compiler/crates/relay-compiler/src/artifact_content/content.rs:180-199 | compiler/crates/relay-compiler/src/artifact_content/content.rs:562-581 | compiler/crates/relay-compiler/src/artifact_content/content.rs:714-733 | compiler/crates/relay-compiler/src/artifact_content/content.rs:840-859 | compiler/crates/relay-compiler/src/artifact_content/content.rs:1119-1137 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40e15ce762bece020695debad619e9dc8d7627329afdbbe4c236fbbdb1d4a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): compiler/crates/relay-codegen/src/build_ast.rs:1369-1388 | compiler/crates/relay-codegen/src/build_ast.rs:1469-1488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-codegen/src/build_ast.rs:1369\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060field\u0060 to \u0060\u0026ScalarField\u0060 in one and \u0060\u0026LinkedField\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/crates/relay-codegen/src/build_ast.rs:1467\u0060 calls \u0060Bool\u0060, \u0060is_list\u0060 and \u0060compiler/crates/relay-codegen/src/build_ast.rs:1368\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"949f31ff4a103b8aedcc3254eeb3f39156cce0e4e867baa6b77a92945728855a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): compiler/crates/relay-compiler/src/artifact_content/content.rs:205-224 | compiler/crates/relay-compiler/src/artifact_content/content.rs:749-768 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler/src/artifact_content/content.rs:205\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c25564fac13c10df77d99bab184208b88e8f52bd436929e2e40c7d11411ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): compiler/crates/relay-lsp/src/server/lsp_state.rs:320-337 | compiler/crates/relay-lsp/src/utils.rs:217-236 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-lsp/src/server/lsp_state.rs:320\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bffaf8889e79e70ca73fc22cc61869087be58a2e1b0c0a01c5a22b7a2608ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): compiler/crates/relay-transforms/src/defer_stream.rs:128-147 | compiler/crates/relay-transforms/src/defer_stream.rs:232-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/defer_stream.rs:128\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/defer_stream.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd8e21dc36580788a81b7be6650836f82650374a91051864ebf43fb13daae28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/crates/graphql-ir/src/transform.rs:123-141 | compiler/crates/graphql-ir/src/transform.rs:164-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e060729eddd7746f458261398c230996375722c7129eac675ba9f655874fa018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/crates/relay-transforms/src/validations/deprecated_fields.rs:105-123 | compiler/crates/relay-transforms/src/validations/deprecated_fields.rs:180-198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/validations/deprecated_fields.rs:105\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/deprecated_fields.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b777eec06b2ce9331854ae9af6f6597313d3be9bb57c645fc08cb0f109c2ddba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): compiler/crates/relay-typegen/src/write.rs:409-427 | compiler/crates/relay-typegen/src/write.rs:835-851 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/write.rs:409\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09330be464205fbbf6d00dc01b83d7e008940d68a046734c55e73011a70a34f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): compiler/crates/schema-set/src/set_remove_defined_references.rs:239-256 | compiler/crates/schema-set/src/set_remove_defined_references.rs:384-401 | compiler/crates/schema-set/src/set_remove_defined_references.rs:490-507 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/set_remove_defined_references.rs:239\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/crates/schema-set/src/set_remove_defined_references.rs:487\u0060 calls \u0060remove_directive_usages\u0060 and \u0060compiler/crates/schema-set/src/set_remove_defined_references.rs:381\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_remove_defined_references.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d46ee9a716d7d13272a8d3ab8e4e38228214d3b38827749653a56212439af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:295-312 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:319-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:295\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64c6662ac519e1ef07a61a2c0eb70c7e8b2661c62ead7360d52c36bf8844806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler/crates/relay-docblock/src/ir.rs:457-474 | compiler/crates/relay-docblock/src/ir.rs:511-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-docblock/src/ir.rs:457\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/ir.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"951e2022cf70ad960d7e03f6df855b916af5cd59eb0d866d0c146745e1e9ebe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler/crates/relay-lsp/src/completion.rs:399-416 | compiler/crates/relay-lsp/src/completion.rs:451-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-lsp/src/completion.rs:399\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f850bb0ee463d86a826d92cf86ee74eb75bd95680ea1b1affafd55a43f3bc10b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler/crates/relay-transforms/src/apply_transforms.rs:312-329 | compiler/crates/relay-transforms/src/apply_transforms.rs:854-871 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_transforms.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2685526a4ecaca49cf3e2f6cef5d564020409d95835ffae774173a84c6fb0da8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201333 lines \u00D7 2): compiler/crates/schema-set/src/schema_set_collector.rs:420-450 | compiler/crates/schema-set/src/schema_set_collector.rs:455-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/schema_set_collector.rs:420\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e9008f62ff119d9c712375d78ccee38ec16bd0ed4442f7df9828c420105477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): compiler/crates/relay-compiler/src/artifact_content/content.rs:73-89 | compiler/crates/relay-compiler/src/artifact_content/content.rs:333-349 | compiler/crates/relay-compiler/src/artifact_content/content.rs:721-737 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler/src/artifact_content/content.rs:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e1421c4a7599b34bdff6892fe5f44f608b6de81f3e5a89d0f5f7baae9e4194"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): compiler/crates/relay-transforms/src/relay_resolvers/fragment_dependencies.rs:26-42 | compiler/crates/relay-transforms/src/relay_resolvers/fragment_dependencies.rs:77-91 | compiler/crates/relay-transforms/src/relay_resolvers/fragment_dependencies.rs:119-134 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/relay_resolvers/fragment_dependencies.rs:77\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/fragment_dependencies.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdeb6f0d99c093783cde60a07ff10112352d1ba61d825af89fac7fd39b5d2b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/crates/docblock-shared/src/lib.rs:47-63 | compiler/crates/extract-graphql/src/lib.rs:101-117 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/docblock-shared/src/lib.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef28d56b32f127b81564504706ae7645db28609c1c48bade03368d26e442a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/crates/graphql-ir/src/transform.rs:353-369 | compiler/crates/relay-transforms/src/fragment_alias_directive.rs:300-316 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-ir/src/transform.rs:353\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060condition\u0060 to \u0060\u0026\u0027a Condition\u0060 in one and \u0060\u0026Condition\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b8ce7b392c02983d5fc02bea935c200a041193f7769b746c009e270e532236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:145-161 | compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:277-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:145\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"413b306a4c257700a6d63924c910f08e0a353e0faf536f8456d133fdffcfa634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/crates/relay-compiler/src/build_project.rs:404-420 | compiler/crates/relay-lsp/src/server/lsp_state_resources.rs:496-512 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40317d9ca8f3a41ca057da85b20e4ef5ce42bbfb52eadc00f2790c6b3818828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/crates/relay-lsp/src/completion.rs:910-926 | compiler/crates/relay-lsp/src/completion.rs:950-966 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a76a280831f7854f074a8ac493e31573fc96ae174e9b8f4e33b9cb6814955dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/crates/relay-typegen/src/write.rs:1298-1314 | compiler/crates/relay-typegen/src/write.rs:1397-1413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/write.rs:1298\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e942bcd4ef6f9254b3e59af47219ee4e52333175679c35a0f7350c15b1dcae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/crates/relay-typegen/src/write.rs:1335-1351 | compiler/crates/relay-typegen/src/write.rs:1435-1451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/write.rs:1335\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/crates/relay-typegen/src/write.rs:1434\u0060 calls \u0060lookup\u0060 and \u0060compiler/crates/relay-typegen/src/write.rs:1334\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd8588694e86e99e16ba6fc94bb5d9d7cbacae5ed6132c25233f992a04f4eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/crates/schema-set/src/schema_set.rs:376-392 | compiler/crates/schema-set/src/schema_set.rs:410-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/schema_set.rs:376\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de6d985d68d3dfbba98cbe8579c49707a59bf264003d74ddfeed429650080fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): compiler/crates/schema-set/src/schema_set_collector.rs:217-233 | compiler/crates/schema-set/src/schema_set_collector.rs:278-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/schema_set_collector.rs:217\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda9e76859f24b81629955c3b73dc1259852aa2b237c4843b6a52ee4fa6fa4b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/crates/graphql-syntax/src/parser.rs:1506-1521 | compiler/crates/graphql-syntax/src/parser.rs:1538-1553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3640b2b13f5d455cded677017ad6eb5d41d7ccbd6e6268d38b6740ff8128e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/crates/relay-compiler/src/artifact_content/content.rs:264-279 | compiler/crates/relay-compiler/src/artifact_content/content.rs:533-548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler/src/artifact_content/content.rs:264\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da0654d6091df38da91080fa58626da1173936a8596a131738b8ae652b56806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:290-305 | compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:308-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:290\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"76538ef254d2dde8ebe3a984519f9237ccc589b6428e09321c6a2503c34ed6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/crates/relay-transforms/src/transform_connections.rs:556-571 | compiler/crates/relay-transforms/src/transform_connections.rs:584-599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/transform_connections.rs:556\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/transform_connections.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfef0fa45755a6ff362d4eb38241f8e50dbd5e838768e1096a49ff584e1c12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): compiler/crates/relay-typegen/src/write.rs:1316-1331 | compiler/crates/relay-typegen/src/write.rs:1416-1430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/write.rs:1316\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6705d0765ca6f4fc0b4baae81f975183c7e399d8dba44f95ad701a7c6c813ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): compiler/crates/schema-diff/src/lib.rs:979-993 | compiler/crates/schema-diff/src/lib.rs:1145-1160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-diff/src/lib.rs:979\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04f7da27ccf1cb8b0b4c1e5fdec6a06b09313735e7405a3ad036168ffa55e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/crates/schema-set/src/find_subset_violations.rs:333-348 | compiler/crates/schema-set/src/find_subset_violations.rs:493-508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/find_subset_violations.rs:333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"303fd1a7fa6224978b2f7083d7db663b51e58dffcaf8fb7b6b6b0927960473be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/serialize.rs:265-280 | compiler/crates/schema/src/flatbuffer/serialize.rs:299-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema/src/flatbuffer/serialize.rs:265\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/serialize.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5142eff4ddbf21b5f0648da6ab4bdc01b6323ccd54d24249f65c2874b1da8f94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): compiler/crates/schema/src/in_memory.rs:724-738 | compiler/crates/schema/src/in_memory.rs:963-978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema/src/in_memory.rs:724\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"4355225b95b893a503cacd3e323d0284ef7f30151788a9fcfb5486cdddfbc2e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:175\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060def\u0060 to \u0060\u0026ObjectTypeDefinition\u0060 in one and \u0060\u0026InterfaceTypeDefinition\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9572d73b5e284b4345950db07d994e90b9f3dd9e655775aede27131080d3084f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): compiler/crates/schema-set/src/schema_set_collector.rs:191-205 | compiler/crates/schema-set/src/schema_set_collector.rs:251-265 | compiler/crates/schema-set/src/schema_set_collector.rs:311-325 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/schema_set_collector.rs:191\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd1beefc25d42aaeee9113ad734416d8ae61a7b7165f5b8ccca5cdf3f6adfab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:377-391 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:398-412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:377\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8ffd21c2a785bdad4735ceaddeb9cd30c1983476eadc5494ac9ec1861efe0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:454-468 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:475-489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:454\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34402ec76887bca5add912ec0534c198e526d76e5d25045cd4e9e65af8ddfee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): compiler/crates/relay-codegen/src/build_ast.rs:1131-1145 | compiler/crates/relay-codegen/src/build_ast.rs:1245-1257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28384c61bddb58f32cdde1e1ed8b03c22ff25c4dfa45e6310d02eabc8590a7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/crates/relay-lsp/src/completion.rs:958-972 | compiler/crates/relay-lsp/src/completion.rs:1009-1023 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-lsp/src/completion.rs:958\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5d7538104c614d28fbfde7f269843f4e0d80d146cee6f8b62efff4a79bbe0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:260-274 | compiler/crates/relay-typegen/src/typescript.rs:293-307 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37010d31b036c3998d26d50fd2cedc9fa2ddb0c461f3da2e74ce304af64627e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:356-370 | compiler/crates/relay-typegen/src/typescript.rs:420-434 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/flow.rs:356\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd23cd0aac62fc9961873e2ef1475f7a1d669f90bf08c6748567f842b64f86d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): compiler/crates/relay-typegen/src/visit.rs:1637-1651 | compiler/crates/relay-typegen/src/visit.rs:1718-1730 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/visit.rs:1637\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5869c7279ebe72d817d5b2206b5e657602402aa1100f6ce7edb314ccf906f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/crates/schema/src/in_memory.rs:1872-1886 | compiler/crates/schema/src/in_memory.rs:1908-1922 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e19e6d13f27044965500fc94ddcf41895178216d6277e3e9a7990b6ad605f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 6): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/print_schema_set.rs:91\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/print_schema_set.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc96fe5006040ab6047be51515b665bfaeb1397aba900c1ad008265ffc103a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): compiler/crates/relay-compiler/src/artifact_content/content.rs:429-441 | compiler/crates/relay-compiler/src/artifact_content/content.rs:789-802 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/relay-compiler/src/artifact_content/content.rs:806\u0060 calls \u0060Some\u0060 and \u0060compiler/crates/relay-compiler/src/artifact_content/content.rs:445\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff264dca33377ec752352b10fa8f6d6259d152b62be2c78d162260f0a25930a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): compiler/crates/relay-compiler/src/artifact_content/content.rs:608-621 | compiler/crates/relay-compiler/src/artifact_content/content.rs:774-786 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler/src/artifact_content/content.rs:608\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"582454cd831916fd0604b6828910a6c3e6c32eec5204e903608149fa402cd3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): compiler/crates/relay-compiler/src/graphql_asts.rs:217-230 | compiler/crates/relay-compiler/src/graphql_asts.rs:313-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler/src/graphql_asts.rs:217\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/graphql_asts.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47b440803a8885da963bd408f3f93519ad81eb197b2b17ba25e4a371c232c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/crates/relay-lsp/src/completion.rs:918-931 | compiler/crates/relay-lsp/src/completion.rs:1207-1220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-lsp/src/completion.rs:918\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7440168e4c24f6f29e838be81503b397a5b8d912d0580d92fb70858dbe26d74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs:336-349 | compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs:357-370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"848439371cbbcc77f2e4b5b307bc89a104b17485d1d0ed219ee166837238f453"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): compiler/crates/relay-transforms/src/declarative_connection.rs:250-262 | compiler/crates/relay-transforms/src/declarative_connection.rs:338-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/declarative_connection.rs:250\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/declarative_connection.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"612b52987f07ca19391e8a57a13fc05c5cf3ebfaa490660c29094bb8bb772035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:257-270 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:324-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:257\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/skip_redundant_nodes.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"791dc64dccb57029619f756f3c6376b55f03ea747d8859345794d7a72e552b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/crates/relay-typegen/src/writer.rs:113-126 | compiler/crates/relay-typegen/src/writer.rs:183-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/writer.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7029790a9b260bd94bad9e7b9c15befa00b6050aa58b75ce020ab951c1c0a6a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/crates/schema-set/src/from_schema.rs:273-286 | compiler/crates/schema-set/src/from_schema.rs:305-318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/from_schema.rs:273\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/from_schema.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"8781851302838179f22fd793cbb72a346468b59155dc2f4ce81af71eaed8800f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/crates/schema-set/src/from_schema.rs:512-525 | compiler/crates/schema-set/src/schema_set_collector.rs:954-967 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/from_schema.rs:512\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/from_schema.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac44bd5ef880b10428cd404ddade1f8c1fbfc99c5d849ba0802e4462d46b6b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/crates/schema/src/graphql_schema.rs:140-153 | compiler/crates/schema/src/graphql_schema.rs:161-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema/src/graphql_schema.rs:140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/graphql_schema.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"062319e4523fa724a329855334d0d64347e46b0b9190eaa2b4bdac75ba45a915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): compiler/crates/relay-lsp/src/completion.rs:917-928 | compiler/crates/relay-lsp/src/completion.rs:957-969 | compiler/crates/relay-lsp/src/completion.rs:1008-1020 | compiler/crates/relay-lsp/src/completion.rs:1206-1217 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-lsp/src/completion.rs:917\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c150ac58646321457127361e9b3a0959685db335b680d6fdbb00a8656630375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): 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 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/generate_id_field.rs:104\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060field\u0060 to \u0060\u0026LinkedField\u0060 in one and \u0060\u0026\u0027s LinkedField\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_id_field.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e35bf5bf7fb1f88a396a93c2efe316548e9c129b8e25d7feffdd10ac8b7030d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): compiler/crates/graphql-text-printer/src/print_to_text.rs:555-567 | compiler/crates/graphql-text-printer/src/print_to_text.rs:620-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_to_text.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5972df855b94a79ca872b3fda2593ab1fce6a98200923c0048d3dca40a38081"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/crates/relay-lsp/src/completion.rs:510-522 | compiler/crates/relay-lsp/src/completion.rs:565-577 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-lsp/src/completion.rs:510\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"01df2285048646ac686b7ff6e820befa8c17b8b165d729b7e2973bb93877a50b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): 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 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/refetchable_fragment/fetchable_query_generator.rs:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/refetchable_fragment/fetchable_query_generator.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4083925b08c91b5bae06cf14f8ebecd461aa9c231bb6103b623e3e23225c6b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/crates/relay-transforms/src/validations/validate_required_arguments.rs:67-79 | compiler/crates/relay-transforms/src/validations/validate_required_arguments.rs:85-97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/validations/validate_required_arguments.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060field\u0060 to \u0060\u0026ScalarField\u0060 in one and \u0060\u0026LinkedField\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_required_arguments.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f84cfb16b341b3c072241ed0c3228019ecc26cf1f2b0b7a24836346f578681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/crates/relay-typegen/src/visit.rs:1265-1277 | compiler/crates/relay-typegen/src/visit.rs:1307-1319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/crates/relay-typegen/src/visit.rs:1263\u0060 calls \u0060visit_selections_fn\u0060 and \u0060compiler/crates/relay-typegen/src/visit.rs:1305\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a4189a61736bec6d9c9173c4af4603021137dc62449fbf06999e47cf881559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/crates/relay-typegen/src/write.rs:1277-1289 | compiler/crates/relay-typegen/src/write.rs:1376-1388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/write.rs:1277\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/write.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32a66fd86dcc14a45e66e8ef780d5f3f1a340a40dc0ac8dbf08124ed79c3d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/crates/schema-set/src/ir_collector.rs:203-215 | compiler/crates/schema-set/src/ir_collector.rs:259-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/ir_collector.rs:203\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/ir_collector.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ca0b8672e9d87c1847f8c0a86fe84bcc32787873c0b955b9355ef91f207470"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): compiler/crates/relay-codegen/src/printer.rs:230-241 | compiler/crates/relay-codegen/src/printer.rs:277-288 | compiler/crates/relay-codegen/src/printer.rs:299-310 | compiler/crates/relay-codegen/src/printer.rs:323-334 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-codegen/src/printer.rs:230\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/printer.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fb78823e22fe3ffa9ace0de6f5c96d2862291a273bfbadfeb83adb0976dc24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:298-308 | compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:316-326 | compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:329-340 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:328\u0060 calls \u0060is_composite_type\u0060 and \u0060compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs:316\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers/field_transform.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e769a2bcfc28611e0a777983d427a6cc10393329ffe7ddf758cc80cb2958b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/relay-bin/src/main.rs:712-723 | compiler/crates/relay-bin/src/main.rs:904-915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-bin/src/main.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"745b216d65770080d8b3cd370767fe86ccc77ee34cee75b0c4b4e8598988da9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/relay-codegen/src/build_ast.rs:2782-2793 | compiler/crates/relay-codegen/src/build_ast.rs:2872-2883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2782}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fd01a4a13d2b0be6bb5b9786cb4ea032c7d74e0911d2d68a69344139454011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/relay-transforms/src/declarative_connection.rs:213-224 | compiler/crates/relay-transforms/src/declarative_connection.rs:278-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/declarative_connection.rs:213\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/declarative_connection.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa66bfff2d4a1f2a8eaf914e0bf5480995082b3c6978e43599d26b30b9394bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs:77\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060field\u0060 to \u0060\u0026ScalarField\u0060 in one and \u0060\u0026LinkedField\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54a20db2b333f51fa4545488cf04d5b5898790288dff112bd8c06100913f7d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/relay-transforms/src/server_documents.rs:189-200 | compiler/crates/relay-transforms/src/server_documents.rs:236-247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/server_documents.rs:189\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/server_documents.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3e81023fd33cc732e4677fb0a30e2dc2aaa049bddc8b6bb05a8672b20fd2ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:238-249 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:289-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:238\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/skip_redundant_nodes.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a14826ddee8a1732c23a903f4d993fc6f1ebe109965ce9ee90231e7a88878de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/relay-typegen/src/writer.rs:446-457 | compiler/crates/relay-typegen/src/writer.rs:546-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/writer.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8325c9a6ada931cc2e315f75f7854ab4fa55496363adcd48da3ee9849038ca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): compiler/crates/schema-diff/src/lib.rs:96-107 | compiler/crates/schema-diff/src/lib.rs:733-741 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-diff/src/lib.rs:96\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3076690167a5f6bf44f53c66b078901ae5e8f645102f70c7b824a20067a506e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): compiler/crates/schema-diff/src/lib.rs:859-870 | compiler/crates/schema-diff/src/lib.rs:924-933 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-diff/src/lib.rs:859\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea89f994075f736877f3467e9de6c249b1dea43b5faa0000d0cd93bf5356d9bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/schema-set/src/set_exclude.rs:329-340 | compiler/crates/schema-set/src/set_exclude.rs:354-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_exclude.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"42423f6b9923f3a7bb95abc3af847dbad4b225172ee0eb34f7cadc858589867d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:210-220 | compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:226-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060field\u0060 to \u0060\u0026ScalarField\u0060 in one and \u0060\u0026LinkedField\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac0a5401846bfc25bc765ceeb6ec6a84f40ac37aac3f3559f35bf8317ad99e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/crates/relay-docblock/src/ir.rs:408-418 | compiler/crates/relay-docblock/src/ir.rs:1208-1218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-docblock/src/ir.rs:408\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/ir.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1892e03b2df06c7a56100038ad6625e9793c7efad5a65136eec20d6c00d40f97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/crates/relay-lsp/src/docblock_resolution_info.rs:78-88 | compiler/crates/relay-lsp/src/docblock_resolution_info.rs:90-101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/docblock_resolution_info.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8d58a864e2c62c5f52cffdcbcd4fd17747557694f77bc7b2ff9e539e1854fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/crates/relay-transforms/src/apply_transforms.rs:252-262 | compiler/crates/relay-transforms/src/apply_transforms.rs:839-849 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_transforms.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c2bfbeb561d5c37750d745b0bed79a1b0652dc21467bc5600fad7408fe7114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:295-305 | compiler/crates/schema/src/flatbuffer/wrapper.rs:313-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"806deb445aade05e6b542a6f3f27b414760994a5dc03d4b5e1267bcee450bc04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): 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:454-463 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:475-484 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:175\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060def\u0060 to \u0060\u0026ObjectTypeDefinition\u0060 in one and \u0060\u0026InterfaceTypeDefinition\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3852091e14025baae1d39ce3412574390e39a259ba735ee8aaa8c19d7cf7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/schema-set/src/from_schema.rs:253\u0060 calls \u0060default\u0060 and \u0060compiler/crates/schema-set/src/from_schema.rs:225\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/from_schema.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"58326177a4dbbdf278ce74444cf592805151a17eec6a3055ce12a664ab2eb04f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/crates/graphql-syntax/src/node/type_system.rs:827-836 | compiler/crates/graphql-syntax/src/node/type_system.rs:851-860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-syntax/src/node/type_system.rs:827\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/node/type_system.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4da445d5dc1d2a87ec7fc4006005ed367a5c9817f657d72088abb114d6b6eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/crates/relay-compiler/src/artifact_content/content.rs:171-180 | compiler/crates/relay-compiler/src/artifact_content/content.rs:313-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0735bcc690c0cf9678720f30be471670276c39ba12f99d615ff86f58c796234"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/crates/relay-compiler/src/artifact_content/content.rs:425-436 | compiler/crates/relay-compiler/src/artifact_content/content.rs:1168-1177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler/src/artifact_content/content.rs:425\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf4c6ac458be1899695c03bbfd2821eb88d1ac2faf177812eb4ccc11eb2977a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/crates/relay-compiler/src/build_project/artifact_writer.rs:105-114 | compiler/crates/relay-compiler/src/build_project/artifact_writer.rs:208-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/artifact_writer.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d74e6e4cda3f6f3bf0680b0e97629724527748077309e9f2b269c7cc7d72a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/crates/relay-transforms/src/flatten.rs:346-355 | compiler/crates/relay-transforms/src/flatten.rs:512-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/flatten.rs:346\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/flatten.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"468b64b7dcd47edab467493a8bc4b495ef316ae6974895eb1372549ad5ae78bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:340-349 | compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:406-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:340\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cb2c4947a1e582085c29022f81186306f570fe93f9405c77cfd4926d9af3b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/crates/relay-transforms/src/required_directive.rs:395-404 | compiler/crates/relay-transforms/src/skip_unreachable_node.rs:193-201 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/required_directive.rs:395\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/required_directive.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fd1ab800be6fd76b670b5120a82029b92e6c700b519191b0cee1b38df50c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:344-353 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:368-377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:344\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/skip_redundant_nodes.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"e244f4271302a551d42c21e7b0b6e7147bc0ff5f4c1866794df2301e0dc3f3e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201310 lines \u00D7 3): compiler/crates/schema-diff/src/lib.rs:1025-1029 | compiler/crates/schema-diff/src/lib.rs:1074-1081 | compiler/crates/schema-diff/src/lib.rs:1108-1117 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-diff/src/lib.rs:1025\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c908f8a5cc24c34c92e57971a49a95b228eb1b716acf3b5cabfe9d6edd7f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:545-554 | compiler/crates/schema/src/flatbuffer/wrapper.rs:579-588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84f5b8ee0ca0cbe20837ec3fb279ba06a11dfa535ed830d17c282bc4fcf8d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:670-681 | compiler/crates/schema/src/flatbuffer/wrapper.rs:753-764 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs:670\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ext\u0060 to \u0060ObjectTypeExtension\u0060 in one and \u0060InterfaceTypeExtension\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"03400afc8711a2dea7f36547fb7a6fcc16953c1fd2dfb782ea55881277d020ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler-playground/src/lib.rs:133\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler-playground/src/lib.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bd013a8e6683255259ed379b67ec8562509896b7c9a7fe9c3635559582ad36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/connections/connection_util.rs:246\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/crates/relay-transforms/src/connections/connection_util.rs:246\u0060 calls \u0060ScalarField\u0060, \u0060from\u0060 and \u0060compiler/crates/relay-transforms/src/connections/connection_util.rs:283\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/connections/connection_util.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d7e93e5074b7d7e8d83f37b6d72412fcbf57fc9b67a29f60c6a89d5da4635c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/crates/graphql-ir/src/transform.rs:492-500 | compiler/crates/graphql-ir/src/transform.rs:541-549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c8fa8d502189bdd83bde4646f6c420d09901f8e45f17f3b33827ff611ec6a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): compiler/crates/graphql-text-printer/src/prettier_doc_builders.rs:170-176 | compiler/crates/graphql-text-printer/src/prettier_executable_printer.rs:342-350 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-text-printer/src/prettier_doc_builders.rs:170\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060directive\u0060 to \u0060\u0026ConstantDirective\u0060 in one and \u0060\u0026Directive\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_doc_builders.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d0689aa108ebf66e667c3be81b0c795181bbeee98a08053069056c3d48495a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026LinkedField\u0060 in one and \u0060\u0026ScalarField\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:201\u0060 calls \u0060print_selections\u0060 and \u0060compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:217\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_ast_to_text.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc190ee48bd798770246ed9ce2df1b82fa223684328f8d567cc553c5705f61a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/crates/relay-codegen/src/build_ast.rs:1051-1059 | compiler/crates/relay-codegen/src/build_ast.rs:1630-1642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-codegen/src/build_ast.rs:1051\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf23ddfc5d032a6d22c64eba5f02ddfceda11521c9ce4cb3a175d8f874a718a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/crates/relay-lsp/src/completion.rs:1038-1046 | compiler/crates/relay-lsp/src/completion.rs:1052-1060 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-lsp/src/completion.rs:1038\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/crates/relay-lsp/src/completion.rs:1037\u0060 calls \u0060chain\u0060, \u0060iter\u0060 and \u0060compiler/crates/relay-lsp/src/completion.rs:1051\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35224d551ac9d922507c5175831aece36a59c7acd43775abbbace25961e9932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/generate_relay_resolvers_model_fragments.rs:81\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_relay_resolvers_model_fragments.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"334a5a9b683dc5703612c4faae7004e22ea0e57c98f771449cdedb88f75ef605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:57-65 | compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:101-109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de124303b5de42221d3d310131849191ba1320515f48375290c3695c8229aac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:263-271 | compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:301-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea15a044db772eed5b9aacb4ad62d4591ea8dcb5fa42a3497e3a0d6ac41d30e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/crates/relay-transforms/src/inline_fragments.rs:342-350 | compiler/crates/relay-transforms/src/inline_fragments.rs:410-418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/inline_fragments.rs:342\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/inline_fragments.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b425d28e9d88cf551b399211cea9a98c19c738fb30ab37999424b70980618c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:373-381 | compiler/crates/relay-typegen/src/typescript.rs:392-400 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2517f0f6bd0e7962be17badb23d7a4bcd97787c45e081f846b6b2b99efe6d853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/crates/schema-print/src/printer.rs:225-233 | compiler/crates/schema-print/src/printer.rs:246-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-print/src/printer.rs:225\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/crates/schema-print/src/printer.rs:224\u0060 calls \u0060update_writer_index_for_field_start\u0060 and \u0060compiler/crates/schema-print/src/printer.rs:245\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-print/src/printer.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8594ac1c0689308d99fd36c6d5401d6c2f54ba75fc768e9908545f8e4ee230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/graphql-ir/src/program.rs:45-52 | compiler/crates/program-with-dependencies/src/program_with_dependencies.rs:115-122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-ir/src/program.rs:45\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/program.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f89346bf1c5b48da0c9cb865a32d564eb1e44293758c352ac2f8e4c42a4a59f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:904-914 | compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:949-958 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:904\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"745e02d33dbc835ee0d524d94ddfda421ece878a7d72a1f7174630fe776362be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/relay-codegen/src/build_ast.rs:569-576 | compiler/crates/relay-codegen/src/build_ast.rs:605-612 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-codegen/src/build_ast.rs:569\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"20938a876cb0daec14b61ff57d064d6b520c3a0d0296feb65c3e5bb96954de1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/relay-codegen/src/build_ast.rs:2387-2394 | compiler/crates/relay-codegen/src/build_ast.rs:2439-2446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-codegen/src/build_ast.rs:2387\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb0d09f6faaca1e5c2594a85dde2b8d9ab86178c80a407580c532feefc4d577"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/relay-codegen/src/build_ast.rs:2490-2500 | compiler/crates/relay-codegen/src/build_ast.rs:2645-2652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-codegen/src/build_ast.rs:2490\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fc34beefbbda1aa3c7d84da7f8bd20456a85a1637df9aee80a77515b482742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/relay-compiler/src/build_project.rs:146-153 | compiler/crates/relay-compiler/src/build_project.rs:174-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c5f42b33bf59a7f24c86dc73899c4f4940f5f00482ff8f8e2d649292aead72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): compiler/crates/relay-config/src/project_config.rs:603-610 | compiler/crates/relay-config/src/project_config.rs:654-660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-config/src/project_config.rs:654\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-config/src/project_config.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3938668369a847e814065d233ccfe28cdbadbe726c8b21994a520081ae8de79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/relay-schema-generation/src/lib.rs:717-724 | compiler/crates/relay-schema-generation/src/lib.rs:1021-1028 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-schema-generation/src/lib.rs:717\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c2e911dd4bfc2dfe1cd9af431df4a3b7d02a2275d3e9a40b6413008def5953"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:312\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"07830402de58b8c17aa1757956f67bef846839f1a6ae04b9567ff23be26779c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs:68\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060field\u0060 to \u0060\u0026ScalarField\u0060 in one and \u0060\u0026LinkedField\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f89463de6161c7e3717587055b04052257b31007b66daad6baf3bcfb238e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:248-255 | compiler/crates/relay-typegen/src/typescript.rs:266-273 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcab255b6f5e566fa734aeba72b3c7672bf6f71b62d41b365edb0a6fa8af8ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/relay-typegen/src/visit.rs:1495-1502 | compiler/crates/relay-typegen/src/visit.rs:1782-1789 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/visit.rs:1495\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"83adc7431faf6d2f5fa52d28ba4144e755d2c06e459d8565aa36bbcbf834cabc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/relay-typegen/src/visit.rs:3446-3453 | compiler/crates/relay-typegen/src/visit.rs:3470-3477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/visit.rs:3446\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":3446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd1868fb88e335f23c3037d6d4f856441a43c1e3c2c827a5385054963223828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/schema-set/src/build_schema_document.rs:320-327 | compiler/crates/schema-set/src/build_schema_document.rs:350-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/build_schema_document.rs:320\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/build_schema_document.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2b93077fb987a5c37c4e1045220ae3598b81c6c99a52b89b9abe46b1ce1f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/schema-set/src/find_subset_violations.rs:400-407 | compiler/crates/schema-set/src/find_subset_violations.rs:468-475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/find_subset_violations.rs:400\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f365cec6710cbb618c754e936e40053af842d378bda64788796fda27d5da611f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/schema-set/src/set_merges.rs:240-247 | compiler/crates/schema-set/src/set_merges.rs:274-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_merges.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2384a2480e8deaf60e20a34f01e625dd94e3ccf95e7037cc31bc407065ded8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:373-380 | compiler/crates/schema/src/in_memory.rs:2564-2571 \u2014 before extracting anything, compare \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs\u0060 and \u0060compiler/crates/schema/src/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 112 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs:373\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"754c707310d58b141e612443ec0666d00ecc64448b0776db741702b26de119c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:402-409 | compiler/crates/schema/src/in_memory.rs:2541-2548 \u2014 before extracting anything, compare \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs\u0060 and \u0060compiler/crates/schema/src/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 112 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs:402\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0551054d4fafd1e098be1617bd876c1400dd6bdffb573425b78885617d168439"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler-playground/src/lib.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c90937e538fd0df2c045838021efe68d5ab6be01974ca4114871a5d4bcb0e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/connections/connection_util.rs:236\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/connections/connection_util.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af3559993390d1da6f54d338d57c3c3181a9e63180fff97a9d85f6b4b123bca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/find_subset_violations.rs:401\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5735b6511addd7c0e797362992bec18786d8e80c280426e0ec54b749e9eaa560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/graphql-ir/src/node_identifier.rs:79-85 | compiler/crates/graphql-ir/src/node_identifier.rs:125-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/node_identifier.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8971072f972e1eb12d00b46fe55d457e06343583799efdc66ed15527c673a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/graphql-ir/src/transform.rs:144-150 | compiler/crates/graphql-ir/src/transform.rs:185-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-ir/src/transform.rs:144\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ddff47f0086adad03021a4408ddcf2286aa62b3205a0728f22ebe33a57a2e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/graphql-syntax/src/parser.rs:1060-1066 | compiler/crates/graphql-syntax/src/parser.rs:1106-1112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-syntax/src/parser.rs:1060\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da2db273f1e639920490ec8e089e2e0d38d595bb4fb90e5e292315d320823cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): compiler/crates/graphql-syntax/src/parser.rs:2824-2830 | compiler/crates/graphql-syntax/src/parser.rs:2888-2893 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":2824}}}],"partialFingerprints":{"codehealthFindingId/v1":"6576effa0832ff9b83c6e7fbb4fb826b4893ddc0b5f8791b0bb19f913aef39ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/relay-compiler/src/compiler_state.rs:606-612 | compiler/crates/relay-compiler/src/compiler_state.rs:993-999 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler/src/compiler_state.rs:606\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"09261fca6824df83dd433722d942ca75e85b8288a5c4a0666594417dba87e56a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/relay-transforms/src/defer_stream/directives.rs:23-29 | compiler/crates/relay-transforms/src/defer_stream/directives.rs:53-59 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/defer_stream/directives.rs:23\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/defer_stream/directives.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"220655dc25c5cb71d2cf00c983b8fe1d3338bd87841211523780b2963de9b57c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/relay-transforms/src/generate_id_field.rs:71-77 | compiler/crates/relay-transforms/src/generate_id_field.rs:83-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/generate_id_field.rs:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_id_field.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2b8f8369577df6418415bd46a0b8af7476466c5698bb9806e32aca01fbac9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/refetchable_fragment/fetchable_query_generator.rs:240\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/refetchable_fragment/fetchable_query_generator.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db82cd51b45e091507a612d0348a01cba8f3661b41383c95624b42804d9e45d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:441-447 | compiler/crates/relay-transforms/src/skip_redundant_nodes.rs:450-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/skip_redundant_nodes.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac9f4425f74e26dc399d0f5d87aef23ee2dfb61ec0634815e18152d74c908d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/crates/relay-typegen/src/writer.rs:150-160 | compiler/crates/relay-typegen/src/writer.rs:208-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/writer.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f879ff52e2787fb1eba86a3f03732a00d7f3a549fa3fac022cece6af1f1c4180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/schema-set/src/set_exclude.rs:254-260 | compiler/crates/schema-set/src/set_exclude.rs:397-403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/set_exclude.rs:254\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/schema-set/src/set_exclude.rs:404\u0060 calls \u0060exclude_argument_definitions\u0060 and \u0060compiler/crates/schema-set/src/set_exclude.rs:261\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_exclude.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7070fab52c7f2e7489a0c4fca2ca4c169c9ea029cea3b63308e8020fccaabac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/schema-set/src/set_merges.rs:354-360 | compiler/crates/schema-set/src/set_merges.rs:428-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/set_merges.rs:354\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_merges.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd4827cb1880ff9de1ca34de181065e214620e884e5405f024959b78d867bfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler/crates/graphql-ir/src/ir.rs:133-139 | compiler/crates/graphql-ir/src/ir.rs:185-191 | compiler/crates/graphql-ir/src/signatures.rs:123-129 \u2014 there are 3 copies across 2 file(s) \u2014 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/ir.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6de881b8170c14a83e722b27c5dabba0c1d733ed80535252e3e16d01035f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/graphql-ir/src/transform.rs:452-458 | compiler/crates/relay-transforms/src/apply_fragment_arguments.rs:459-465 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-ir/src/transform.rs:452\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d25ab54a6b890a17d7d776b1df3f45fe6be41244d4c834bf64e952dfc6463e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/graphql-syntax/src/parser.rs:751-756 | compiler/crates/graphql-syntax/src/parser.rs:786-791 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0c7386c49dfd3ebd6189b0d5f80cd0c9540d9fad36de5b6e85b95701113555"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-text-printer/src/print_ast_to_text.rs:183\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026InlineFragment\u0060 in one and \u0060\u0026LinkedField\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_ast_to_text.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8e6344a2d6015a81977351d2007cc42e8763fc3eaedb179af2485e6cf9c5f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/intern/src/atomic_arena.rs:233-238 | compiler/crates/intern/src/atomic_arena.rs:631-636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/intern/src/atomic_arena.rs:233\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/intern/src/atomic_arena.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf60f531863443316e308d6822f969c7bb25404da803fd34f5f23c3106053fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:363-368 | compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs:429-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1017196ac6f54d41730a2c30103881f1ca2a2d7052db2a6fb37de73dfb307e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/schema-print/src/printer.rs:163-168 | compiler/crates/schema-print/src/printer.rs:173-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-print/src/printer.rs:163\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-print/src/printer.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5046ae642888cbe000354d3dd83ea9349b845d48f84c175218bb42a34269542e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/schema-print/src/printer.rs:260-265 | compiler/crates/schema-print/src/printer.rs:331-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-print/src/printer.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15c2cdbbcc9fb325a86508d969d92b3851ebdfdfb050c2e3b13fc678b1f667b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:284-289 | compiler/crates/schema/src/flatbuffer/wrapper.rs:332-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs:338\u0060 calls \u0060filter\u0060, \u0060contains\u0060 and \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs:290\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df9e73f8d55866c74b82704fddb99a308d840ff196e1dd3b8dfb3da2ee07d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:389-399 | compiler/crates/schema/src/in_memory.rs:2527-2537 \u2014 before extracting anything, compare \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs\u0060 and \u0060compiler/crates/schema/src/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 112 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs:389\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d27c98032779a54ff6822ec6d1299c2c62c8d29e65181b1e7e040905e236a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:649-654 | compiler/crates/schema/src/flatbuffer/wrapper.rs:732-737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ext\u0060 to \u0060ObjectTypeExtension\u0060 in one and \u0060InterfaceTypeExtension\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"4086286469b8f13c57637229d3e9b71ab19406fbca3355d4960973f311389a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/schema/src/in_memory.rs:1088-1093 | compiler/crates/schema/src/in_memory.rs:1110-1115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema/src/in_memory.rs:1088\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1335eda72cbb86fd9c0257130f297b80d19104b4c5cb7f3665859c9cd6c975f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema/src/compact.rs:1090\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/compact.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"7533554f60c36b64d4956256d0a5780091976d8d9212e974dac2e5c2e2007009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/dependency-analyzer/src/ast.rs:96-100 | compiler/crates/dependency-analyzer/src/ir.rs:403-407 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/dependency-analyzer/src/ast.rs:96\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/dependency-analyzer/src/ast.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fba459e5f1ab4773eaabe5fd4d257c7e7915c1582b965bf029a1c025b0dd6ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/graphql-ir/src/visitor.rs:69-73 | compiler/crates/graphql-syntax/src/visitor.rs:109-113 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-ir/src/visitor.rs:69\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/graphql-ir/src/visitor.rs:74\u0060 calls \u0060Condition\u0060, \u0060visit_condition\u0060 and \u0060compiler/crates/graphql-syntax/src/visitor.rs:114\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/visitor.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28a331a091eb4976bad7ea9a2633adda0dd3a9da2f3c52782a796b06674db30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/relay-lsp/src/find_field_usages.rs:204-208 | compiler/crates/relay-lsp/src/find_field_usages.rs:219-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/find_field_usages.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"580fd3e8d6723e4a25c5a14897a5f95847ca439e1e5b728782e68b8a10d454ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:292-296 | compiler/crates/relay-typegen/src/typescript.rs:335-339 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"478a7bb669f82ae2d59d40e3863caab1250aef16b4cf198c73263ca7666ebbd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/schema-set/src/find_subset_violations.rs:423-427 | compiler/crates/schema-set/src/find_subset_violations.rs:487-493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/find_subset_violations.rs:423\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee64bed82296c6a0edb8d7bff366473b43f7b313e15a1b28a81136a3d331212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/graphql-ir/src/visitor.rs:29-34 | compiler/crates/graphql-syntax/src/visitor.rs:57-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/visitor.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3568ef1952180718f984ff83b63f020681b063b76e81d46510162c658c55a279"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/relay-transforms/src/client_component_boundaries.rs:243-247 | compiler/crates/relay-transforms/src/rsc_resolver_fields.rs:618-622 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/client_component_boundaries.rs:243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_component_boundaries.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b322424be03befe35f995bd0b381179a0f69b90f54b65d3797a39191c4524a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/relay-transforms/src/client_component_boundaries.rs:252-256 | compiler/crates/relay-transforms/src/rsc_resolver_fields.rs:627-631 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/client_component_boundaries.rs:252\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_component_boundaries.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"923940aa1cb6901a9f69562fcc1b30e1dabbdc41b27250b00805fc7fcd605c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/relay-transforms/src/client_extensions.rs:274-285 | compiler/crates/relay-transforms/src/skip_client_extensions.rs:128-139 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060field\u0060 to \u0060\u0026\u0027a LinkedField\u0060 in one and \u0060\u0026LinkedField\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_extensions.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f501da28af2608c454a8ee5baced1f35add9864f31bf1b2b954da7ae105bb1ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/relay-transforms/src/client_normalization.rs:299-306 | compiler/crates/relay-transforms/src/server_documents.rs:604-611 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_normalization.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b78884230a77cc82821e5bb5cd30b6fd0ec5aa5153aab40c2932e433688396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:89-93 | compiler/crates/relay-typegen/src/typescript.rs:98-102 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/crates/relay-typegen/src/flow.rs:85\u0060 calls \u0060get_runtime_fragment_import\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs:95\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c347ca84bd479f4c71fc0cd363a68b2f4a105785609fc7ad7af7df2224562ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:95-99 | compiler/crates/relay-typegen/src/typescript.rs:104-108 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7835ba68f7170f4b105d6a5c4d4d7d2291bf07101215cccb49501b8e953d8d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:101-105 | compiler/crates/relay-typegen/src/typescript.rs:110-114 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"790aba0f093a8d8a8c4555157f1b07d4c8a4218f36de6b4a1c20f1cda5dc9b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:181-192 | compiler/crates/relay-typegen/src/typescript.rs:199-210 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f64ce001b8b45fe217b5775b4621b4810f2437c09661af12c33735d1f45bff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:207-211 | compiler/crates/relay-typegen/src/typescript.rs:212-216 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c346035c2049a9ec70a2902bbb1ae3e1a988760da0d0fe02fb8474d9593478"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:213-217 | compiler/crates/relay-typegen/src/typescript.rs:218-222 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"da92dfa0b11fe8c5d87c9ee418064f9afd35555f0d00e9e9a7b1a0f6282e20b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:311-316 | compiler/crates/relay-typegen/src/typescript.rs:350-355 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"90abc548b5bce5dd747e623c0da304f6ce7ea370d41ad262b57a6a22a91cf641"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:326-330 | compiler/crates/relay-typegen/src/typescript.rs:380-384 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/flow.rs:326\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5050e69627658f8aa965c86a30422d24fd5bd5c2c1682abe833d9e81aa527a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/schema/src/definitions.rs:444-449 | compiler/crates/schema/src/definitions/interface.rs:42-47 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/definitions.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3cd2db495196b2bd533abe9321798115c15c5850dd320c93da4a489ec1ff65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): 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 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_fragment_spread.rs:226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/transform_assignable_fragment_spreads_in_regular_queries.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca97cb70e8932e123851af7a30063faea84ffec4264ba73b080f68617ac6eff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler/crates/relay-transforms/src/client_extensions.rs:34-39 | compiler/crates/relay-transforms/src/client_extensions_abstract_types.rs:34-39 | compiler/crates/relay-transforms/src/sort_selections.rs:25-30 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_extensions.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1686a8e7e6f651e0db8839e816710f3034d375d00e2139e43caee7b26ed874c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/relay-transforms/src/skip_client_extensions.rs:30-35 | compiler/crates/relay-transforms/src/skip_updatable_queries.rs:15-20 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/skip_client_extensions.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edda0dfe8662062f8b8d7b456aab3734024760ce54908cc86311b1af5c8ab8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/schema-set/src/set_type_reference.rs:38-44 | compiler/crates/schema/src/definitions.rs:242-248 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_type_reference.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cb5a99f93acd95cecf771e7f2a2529f45f629861bd606fba864235faa4903e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/schema-set/src/set_type_reference.rs:113-119 | compiler/crates/schema/src/definitions.rs:308-314 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_type_reference.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73416efac204d2db7123e04514fb7f80ae708d893841930c662215b5c467951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/crates/relay-lsp/src/code_action.rs:202-220 | compiler/crates/relay-lsp/src/code_action.rs:245-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-lsp/src/code_action.rs:202\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/code_action.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d37516d50deff680987333ccfb8cd71d57be48946450d4987f8dd4938dd0444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/crates/schema-set/src/ir_collector.rs:143-158 | compiler/crates/schema-set/src/ir_collector.rs:171-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/ir_collector.rs:143\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/ir_collector.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a39b71c37107b9fc79a247b0931442c880f586aca4cf4807191483a7d6e35d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/crates/relay-compiler/src/status_reporter.rs:620-633 | compiler/crates/relay-compiler/src/status_reporter.rs:647-660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler/src/status_reporter.rs:620\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/status_reporter.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad58d1fbe666628dd9267fd56e301732355444f6a4ca928bcb68a93aedbb7e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/schema-set/src/set_merges.rs:362-373 | compiler/crates/schema-set/src/set_merges.rs:436-447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/set_merges.rs:362\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/set_merges.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f668302fbbf87dd3f8070a6640c1c262fe941f547c93d4e5508dcd0dbfb30be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/crates/relay-lsp/src/goto_definition.rs:247-257 | compiler/crates/relay-lsp/src/goto_definition.rs:274-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/goto_definition.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7e2d8d89b53609e04d2a319be5a6be665af6f748c676f54b5e8f3032e3ef45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/crates/relay-transforms/src/skip_unreachable_node.rs:117-127 | compiler/crates/relay-transforms/src/skip_unreachable_node.rs:152-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/skip_unreachable_node.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b2c9430f0ac6162b26b9138960f6e95af4ce7808676817268e165e0349434f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/crates/relay-lsp/src/server/lsp_state.rs:251-261 | compiler/crates/relay-lsp/src/server/lsp_state.rs:355-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-lsp/src/server/lsp_state.rs:251\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e382554f56ad93c234640da005ad1f9f69b4beefe7ba118a3a13863f9eb782f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs:525\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ext\u0060 to \u0060\u0026ScalarTypeExtension\u0060 in one and \u0060\u0026DirectiveDefinitionExtension\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_schema_printer.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"febe40b9b6608976740eef772b91e9638812a63180665759f800a343b3176947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/crates/relay-compiler/src/config.rs:714-723 | compiler/crates/relay-compiler/src/config.rs:727-736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-compiler/src/config.rs:714\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/config.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"161698934d7746ffecba37b742b652505cb6336ede4ed704010da96e0bf2f46e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema-set/src/find_subset_violations.rs:202\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"88152d0dbd0f15498cd420b226ad457460f2e0359a73b8a09859fd6570691d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/crates/graphql-syntax/src/parser.rs:1184-1192 | compiler/crates/graphql-syntax/src/parser.rs:1378-1386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd847bf3421c4473c07b32d72d201f9462c9e133fde46f6b1dc507988642ce15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/crates/schema-set/src/find_subset_violations.rs:778-786 | compiler/crates/schema-set/src/set_merges.rs:752-760 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/find_subset_violations.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"140646a162b4c240c0e5fe9dfa0401a70068e1ce31fb42ea7158b410b952eaa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/relay-transforms/src/match_/match_transform.rs:638-645 | compiler/crates/relay-transforms/src/match_/match_transform.rs:648-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/match_/match_transform.rs:638\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/match_transform.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04b637568abd6fdff4c19342873d9e0ee093da334ad39335952451ca37a2148"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/wrapper.rs:202-209 | compiler/crates/schema/src/flatbuffer/wrapper.rs:238-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs:202\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc1ca2e3a78fa85485988f300915a1bbac1aafcdd74cefea8b98e0d595fe8d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/schema/src/flatbuffer/wrapper.rs:202\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf6b5e46f1c367d6cbc7c01f279fd21f00127e38f6d83d8f0a611461e24f91b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-syntax/src/parser.rs:859\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"6007d2d63ceb3ce8903596f0666ec8ac62f7eafd197f0367440aaa7e63644082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/crates/graphql-syntax/src/parser.rs:968-975 | compiler/crates/graphql-syntax/src/parser.rs:1259-1266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb30452afd1d3dbeaa072c9660fdf7f09d25d239ad9879bb27d2a6f84ffa1ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:276-282 | compiler/crates/relay-typegen/src/typescript.rs:318-324 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-typegen/src/flow.rs:276\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/relay-typegen/src/typescript.rs:327\u0060 calls \u0060write_indentation\u0060 and \u0060compiler/crates/relay-typegen/src/flow.rs:285\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f6933e5578f5194224205b15a95a39f661703830287ea67ad73cb7b383ba7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/schema-print/src/printer.rs:274-278 | compiler/crates/schema-print/src/printer.rs:305-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/schema-print/src/printer.rs:310\u0060 calls \u0060print_new_line\u0060 and \u0060compiler/crates/schema-print/src/printer.rs:279\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-print/src/printer.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0353a28512217034244ea1bfc53af33f5a43904e4e14d074a76104280a792418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/graphql-ir/src/ir.rs:427-431 | compiler/crates/graphql-syntax/src/node/executable.rs:216-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/graphql-ir/src/ir.rs:427\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/graphql-ir/src/ir.rs:432\u0060 calls \u0060Condition\u0060, \u0060write_fmt\u0060 and \u0060compiler/crates/graphql-syntax/src/node/executable.rs:221\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/ir.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"286c6483d5e313e7d824fe3991390c17a5fab9bf7bf814c2e5ea0da1245ee559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/relay-transforms/src/server_documents.rs:355-360 | compiler/crates/relay-transforms/src/server_documents.rs:386-391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/relay-transforms/src/server_documents.rs:355\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/server_documents.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c93d72097b5aa3f43d41ac0852e5e31e778cd329d83f18d120fb0c56846d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/crates/relay-typegen/src/flow.rs:42-53 | compiler/crates/relay-typegen/src/typescript.rs:57-68 \u2014 before extracting anything, compare \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"421de7251bea90a5afe3b370a5c05cafcf7f4ae51f5df50e40dd25d14e3d3f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/crates/schema-set/src/print_schema_set.rs:463-468 | compiler/crates/schema-set/src/print_schema_set.rs:472-477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/print_schema_set.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad57f2de22a3edbb64d4a1fef77da83a19840b1b27bb5fb6f27d2cf89243f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/schema/src/flatbuffer/serialize.rs:282-286 | compiler/crates/schema/src/flatbuffer/serialize.rs:329-333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/crates/schema/src/flatbuffer/serialize.rs:334\u0060 calls \u0060Some\u0060, \u0060create_vector\u0060 and \u0060compiler/crates/schema/src/flatbuffer/serialize.rs:287\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/serialize.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ed67c8b9ac0f2952db1456171ea4efcc23de9df17f59c3be046ca0fb799c27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/crates/project-fixture/src/lib.rs:151-165 | compiler/crates/project-fixture/src/lib.rs:175-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/project-fixture/src/lib.rs:151\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/project-fixture/src/lib.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c277a8f919faa8f916ae2d2a1fb26337ffe46e1ed17aa79f2daba74e71127121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/crates/project-fixture/src/lib.rs:141-145 | compiler/crates/project-fixture/src/lib.rs:171-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/crates/project-fixture/src/lib.rs:141\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/project-fixture/src/lib.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"79acc115c0ce4160c0d6f81cf9f21e88ec88db6c79d5f14f475d81d750bbeac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/crates/fixture-tests-macros/src/lib.rs:245-254 | compiler/crates/fixture-tests/src/main.rs:236-245 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/fixture-tests-macros/src/lib.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5b329a852a9c958407fb83d8dda462b756319b2d88280c39a31ca80c24fff0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SchemaSet (LCOM4 5): SchemaSet\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74650d7156d933a8dae1a73efd1fafb2b88b3f109695ae2a9fa85b4c3ed6b1e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EnsureCatch (LCOM4 4): EnsureCatch\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_client_schema_extensions_use_catch.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf739540e8bc721bea85e397015947d91202252cd7339c8e7cf0a45a623598c"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 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\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: suspends then updates when the query and component load: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/EntryPointContainer-test.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a43d72a860bae3e4a0587a5b07f1beec9d0fc472b6169d3514dd8e99c99808"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: warns if the entryPointReference has already been disposed: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/EntryPointContainer-test.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ecdd138bd0f3987ef4bec52a9c0b9615de9b91a0c4097f0089857586500aca"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: suspends while the query and component are pending: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"722ae0e7768fd6dcd63b8f82cf197c578c1f7c1662c586f82b7f25d713ccc6bd"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: suspends while the component is loading: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b745cf964696af20d61b3994f5234ab7b5ba881651bcbd608acfd8dc94edcdc"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: suspends then updates when the query and component load: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"305610157dd891e13639b5a7bb279a673d69b401760f10e03bedbfe312d85b62"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: re-renders and reloads when prefetch params change: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/LazyLoadEntryPointContainer_DEEPRECATED-test.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"0266f01deb6432c4ef628433fe66012302f75b59b697d17603e81144614fae4b"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: does not suspend if pagination update is interruped before it commits (unsuspends): Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useBlockingPaginationFragment-test.js"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3e7d0e27b833759448745c9446ee936902e2acaf1d3ddef64df5a4b4664dd4"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: loads more items correctly after refetching: Skipped \u2014 switched off by xit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useBlockingPaginationFragment-with-suspense-transition-test.js"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9cae90d15c5ebd8cd366f17de86ad6f992ed235080c08f90d67822898fda0a"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should handle errors : Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useLazyLoadQueryNode-test.js"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec0f9d8a25d69d0df248e7af86afc567e38e5b432f421c7d2a54f6ad2eb620d"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: simple fetch: Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useLazyLoadQueryNode-test.js"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"7184f0ca03786731c712a3fa1b49f22fe0e79a8eff0ba991375be8e93463aa62"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: log when switching queries: Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useLazyLoadQueryNode-test.js"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ff83909df205c1fcd9f5889af3569b343918bd51c144eaded5c8134e806c67"}},{"ruleId":"D10","level":"warning","message":{"text":"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: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useQueryLoader-live-query-test.js"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ec341834154961cdc4f008782ef152bb32b6453f08932b4711c599e63953e9"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: releases and cancels all queries if the component suspends, another query is loaded and then the component unmounts: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useQueryLoader-live-query-test.js"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e546d75d7a5b51c0ed0010074978847882265ac5af0507000593d3b0e5f1fd8"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: releases all queries if a the callback is called, the component suspends, another query is called and then the component unmounts: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useQueryLoader-test.js"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc49ae239606b0ca1e048f868d5023ca16835ba04157923d087299c5fdf64b0"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: releases all queries if the component suspends, another query is loaded and then the component unmounts: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useQueryLoader-test.js"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42877dc5fe807db3b272c130f51badd4ba6c87ab82051cd4257da8903522e1e"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: renders with the results of the new variables on success: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__tests__/ReactRelayPaginationContainer-WithFragmentOwnership-test.js"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d70852f07cecabe8f20da283936209a6e8a48c84b9f87941f4cf8be650bf13"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: paginates with the results of new refetch/overridden variables: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__tests__/ReactRelayPaginationContainer-WithFragmentOwnership-test.js"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"312ba04af4a09587a19e34bd2baeefdc258cb6e07d881ba32ddc798573854580"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not throw when expected warning is fired: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils-internal/__tests__/warnings-test.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edc64ae7dbf25a68c8fb49cada052bb4062e30c84623d4cc9da8fffaf233249"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: matches contextual warning: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils-internal/__tests__/warnings-test.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf7324bfcec18d637a21ed8bffed93c2abd749d7e07b6f734fedc8f37ea7168"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: matches contextual warning first: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils-internal/__tests__/warnings-test.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a915d0679de6b2ee9d175077b222017b9143a5a3ee7a33083964419e977035"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: matches multiple contextual warnings first: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils-internal/__tests__/warnings-test.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb5fbcd8b51ba0728f0942226f374c4656a34cccf1b299b5456a1183d0a1d15"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: loads where WeakMap is missing: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/DataChecker-ExecTimeS2C-test.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"72054ee9f45f210e4a2a3e92ab54b7d8066e9c3b5fda34f5fae07ef8c53ff8af"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): still subscribes for resolution when it supplies a name: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/LiveResolverSuspenseDisplayName-test.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"209a72876e81fcfe58296be60fb0900371fd38852bdef03de1df960b402a1c5e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not error on non-cyclic structure: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayModernOperationDescriptor-test.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e17417793eb1ed46b276d248a7eae7c710817d6c9de0bac3cacb965c72f671"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not error on cyclic structures that are not part of the query\u0027s used variables: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayModernOperationDescriptor-test.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"24564e1282ffab249b2b5499d0c688ab83d7fc7ae3ac8f560ca7ff6d21f1dcfb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should warn if run() is called during a run(): This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":2364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67c9574960c33409747c79083e4c95f819c665f6c15051e83fdb4a20501240d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: warns in __DEV__ if payload data is missing an expected field: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb90550046e505b76eeb8fc269cf37d43cb6c890cda53b3d5f4c5fbc7116da7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not warn in __DEV__ if payload data is missing for an abstract field: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e965c9a7cf1ef9ea3ca0eeaa612dd1fcad5b6fdb98b6f0d43450fbc64d53dc8c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: warns in __DEV__ if a single response contains conflicting fields with the same id: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"be39b080f0d99c79e5daeb4389fdfb8a8319417031948019482f105316389f25"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not warn if a single response contains the same fields with the same id: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js"},"region":{"startLine":2776}}}],"partialFingerprints":{"codehealthFindingId/v1":"897fc9f63e23e7912ce8a20f7b9c853960df61745500a92a32ba50bd97135a00"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not warn if a single response contains the same scalar array value: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js"},"region":{"startLine":2832}}}],"partialFingerprints":{"codehealthFindingId/v1":"3052e7114631400a9a0e779521b83d062e17389ed01c0078d917fa9ffe93d57f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: warns in __DEV__ if a single response contains conflicting fields with multiple same ids: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js"},"region":{"startLine":2888}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adb40a59b0f2a36558b511d1a34d69c5c721b6e864fa3b1a6b20c9d141bc9ed"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: warns in __DEV__ if a single response contains conflicting linked fields: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js"},"region":{"startLine":2968}}}],"partialFingerprints":{"codehealthFindingId/v1":"593b81cd19b433f4a37876ef74e40364632cb4cff6696f5331e369dd23db5012"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: warns in __DEV__ if a single response contains conflicting linked fields with null values: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js"},"region":{"startLine":3066}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e09c195672300daae102399b4ce46780cc76f6a66f6077f3e32c36235c04bb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: warns in __DEV__ if payload contains inconsistent types for a record: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5424d8b2a7ffa7071600e2e20132fafafde825bc944dc2875184db3cb90d85"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not warn in __DEV__ on inconsistent types for a client record: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js"},"region":{"startLine":3249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6400c25fbbb51711dcfe83af0abcfd592f57438b8f2db0fc9984baef5bb8a4a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not warn if a single response contains the same fields with the same id: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayResponseNormalizer-test.js"},"region":{"startLine":3497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24e34652b7a75e9abca912c7031657c0b3d7681089f4648cb4055beb52f059a"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): empty test to prevent Jest from failing: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useBlockingPaginationFragment-with-suspense-transition-test.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fd6f4545b8ea29d2300d456fc9a114839aa9dde4d31ff8506856038077ebd9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should warn if fragment reference is non-null but read-out data is null: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useFragmentNode-test.js"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"3073ecb0d80382d788f4b0d650179f5fc3890105301b85658b7ea73599b5bf09"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should NOT warn if plural fragment reference is non-null and empty: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useFragmentNode-test.js"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1db057bf7d53ccbe3fbbef33c000ccedc45dbd4da9fd43a1f4f73b7f3715f62"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should warn if plural fragment reference is non-null but read-out data is null: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useFragmentNode-test.js"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5923a07e24637d8a890c24d55b3ffc7bb11e5d110b6b99c1bd0ba283956721"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: warns when variable provider is an impure function: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/usePreloadedQuery-provided-variables-test.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f09f91ef5f8271c63140637dd0d998dc702985d401bcf7a063662d006d5a0da"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): empty test to prevent Jest from failing: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useRefetchableFragmentNode-with-suspense-transition-test.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17e10e76e19700d3bbb96131015344e6c68fd5c4dafcb2aaa12cfc6c657f83a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should compile a query with complex object type: This method\u0027s 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__tests__/ExampleWithOutputType-test.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b465628be21ae1d01fd92d7cffc157b3a36a168a0f19fb65a97f9587c205c2f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: applies payload on @defer fragments in a query with modules: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayModernEnvironment-CommitPayload-test.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"033b95b69226d58f7a351a6de6ee35e538c8b7a25fff70345e0410ffab49c2af"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: publishes the source to the store: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"2802c1e2cc240894f196f6a4c3703b638a47e38d19158685a0194e0389f34174"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: invalidates the store if invalidated via updater: This test sets up 6 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d4f1f6c18ae3e9df6fa83006facd4f4423d409644c2863a3809241645e8b21"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: invalidates any ids marked as invalid via the updater: This test sets up 6 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b47bb9885cfb6443ac36e9330a4b0a3f7f621f1b78ec42bb416bcdecb76970"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: publishes the source to the store: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"880a3ca075ae01027c3553fb69fb6c249b96041faca24073b64e7ac5416bf7ea"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: publishes the source to the store: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"d581dae7dc4142d0342cf44ede4a5b64af995be40dde3758ca22fbdd425e9286"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: invalidates the store if invalidated via updater: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"817b1b3f8a6251827269b69f6062a37851db65e5b711f0bf400349193b13c621"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: invalidates any ids marked as invalid via the updater: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"9377de6be43242c38c490ab44948cc25f573d7dfb08e1cb55957d3d422d4db14"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: publishes handle field payloads now, notifies on the continuation: This test sets up 6 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"c407b3bd5a12616f5a36ffbfdd82427d9bb28bb74ef2a5fb8610faade59a1ed2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: records the operation when it publishes, not when it notifies: This test sets up 6 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"622ac3bb489860566afe612103dfdfbdcc19dc7f97d124cacf249bc5e483e7f5"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: records every publish sharing a flush, not just one of them: This test sets up 6 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"30483f27510c55ea4ea7c324e59d24fb151227c9ea9c9ce25383546d8a1e385b"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: holds no state in the continuation: extra calls no-op: This test sets up 6 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bca2894306dbb671d5cbf61ae14716429da81396753e02423f27cada939896a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: falls back to the next run() when the continuation is dropped: This test sets up 6 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da8c95e4ec2f9259a26249fe9c98684fe1633fcb2045076fe9cd728eef7afea"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not notify the store if no mutations have occurred: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"285c07f14e8237976df0f740c97bb71c262d60e151638078e1af07abf34e320f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: notifies the store if an optimistic mutation is applied: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1108e4f3df67f1f3290f07fc5775ee7e41e76406fa441567e08d7d93c768fc9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: notifies the store if an optimistic mutation is reverted: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9497f202ce41ae28a8d1ccec73f771b7c081d6ab49d1442d12d5fa98de730080"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: notifies the store if a server mutation is committed: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"11db6e423bf1ef9dd8effec966d28b95ef440fb5d0cf7de2197093f11ee5275b"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: should disable CG if there are any applied optimistic updates: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3940c75a153210c928dab7d617db9e6f95478577e7cb846a4a322bfaa6d3205"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: should not disable GC if there are no optimistic updates: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":2261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c310bef0ba8c43d5eb38f5f125a32463dbcee9927be5e0156dba146f13f4b830"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: should dispose gc hold, when there are no optimistic updates are in the queue: This test sets up 6 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"7527af55afdfb44f894c85e41472aa629926202aa174fef43fdc6368c1276e75"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: should release the gc hold when that is the only work left: This test sets up 6 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8d04b715011641683b637e173d4d9c0c151033be97750af9e5431b7338dd15"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: Cleans up when unsubscribed: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/network/__tests__/RelayObservable-test.js"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99fcdb00f54fe824bd6186a72c062b18d2a8c038135c1091b27f28345f5bb26"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: Calls next and complete when the promise resolves: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/network/__tests__/RelayObservable-test.js"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"f850fe4e1f0cc9ad63e02c0f0f012948fc582df98820d35555e8758398c289bc"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: Calls error when the promise rejects: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/network/__tests__/RelayObservable-test.js"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5e5ac2e13fd9636a565e8d445b79e49499c9d7a92a59c9fe29df6d0681f248"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: send a network request with actor specific params: This test sets up 4 test doubles (for example \u0060jest.fn\u0060) 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/multi-actor-environment/__tests__/actorEnvironment_execute-test.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d413c736ecc232050afcf6f4fe276d2d411491b10da3d39ea037852ff300c5"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: loads correctly when ast is loaded in between calls to load and initial query ref is disposed: This test sets up 5 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 10 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/loadQuery-source-behavior-test.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fe83b2a22c3b323aaedf5878886bb37bfe43013bdccc8727c141d6f8085f2a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: renders with the results of the new variables on success: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__tests__/ReactRelayPaginationContainer-WithFragmentOwnership-test.js"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"62065828e9a2faf3642ee9676fa962a7027481c6a947194408c2550826498de1"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: renders with the results of the new variables on success: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 10 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__tests__/ReactRelayRefetchContainer-WithFragmentOwnership-test.js"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d865910043d18acec06e4b1e6bdba2e46e5821725405769dae473e5e23bc74d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: renders with the results of the new variables on success when using render variables: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 10 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 \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__tests__/ReactRelayRefetchContainer-WithFragmentOwnership-test.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade883a4de46c6238f3af055ee4b911664c7dabed71b0e5ddce861c091c77977"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/relay-runtime/store/RelayModernStore.js: packages/relay-runtime/store/RelayModernStore.js changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in RelayModernStore.notify at line 484. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- packages/relay-runtime/store/RelayModernStore.js\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ebe35b39ab6c961b095498cab193a07eff3298e3b2a90e0fc69052d4603d23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/relay-runtime/store/RelayReader.js: packages/relay-runtime/store/RelayReader.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in RelayReaderOptimized._traverseSelections at line 2507. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- packages/relay-runtime/store/RelayReader.js\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc311ae18d8fbc24a16b408b41e707c5abb797bfeb2e3fcd5f8e87e0017c43cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/crates/relay-compiler/src/artifact_content/content.rs: compiler/crates/relay-compiler/src/artifact_content/content.rs changed 11 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- compiler/crates/relay-compiler/src/artifact_content/content.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4195452383d00231c5e2de482af6b12bb2ca0f7b9b91889c2b656c0158b81e0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/crates/schema/src/in_memory.rs: compiler/crates/schema/src/in_memory.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in InMemorySchema::build_impl at line 832. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- compiler/crates/schema/src/in_memory.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d0c3a0c5a13b6fd06008ca69f6249d6d008cd66d327231530188c42870acdc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/crates/schema-diff/src/lib.rs: compiler/crates/schema-diff/src/lib.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in schema_diff::diff_definitions at line 418. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- compiler/crates/schema-diff/src/lib.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/lib.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ba1f2c29fe4ac33177f517bccc44fb377be1846490b2a0608a17c0b3ccd70d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/relay-runtime/store/RelayResponseNormalizer.js: packages/relay-runtime/store/RelayResponseNormalizer.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in RelayResponseNormalizer._traverseSelections 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- packages/relay-runtime/store/RelayResponseNormalizer.js\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bdeb1a423f21cb81793e18160557aefe4251677060c66009d36bc723821c7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/crates/relay-compiler/src/compiler_state.rs: compiler/crates/relay-compiler/src/compiler_state.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in CompilerState::schema_change_safety at line 830. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- compiler/crates/relay-compiler/src/compiler_state.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1cc42479f266a30ae5da78a7f8aeb050db883cfcb6353adf7ad3716286d5d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/react-relay/relay-hooks/loadQuery.js: packages/react-relay/relay-hooks/loadQuery.js changed 6 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- packages/react-relay/relay-hooks/loadQuery.js\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/loadQuery.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df6597257e8d42ad433d7482f52cc085030f851d5b5c4a916e79ccdc9c34dfa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/crates/relay-compiler/src/build_project.rs: compiler/crates/relay-compiler/src/build_project.rs changed 6 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 600. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- compiler/crates/relay-compiler/src/build_project.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c5d8686579a6aabc12acea2dddcd6537ddb081da92b51bd581deb0f2d82d21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/crates/relay-transforms/src/client_edges.rs: compiler/crates/relay-transforms/src/client_edges.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ClientEdgesTransform::transform_linked_field_impl at line 1276. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- compiler/crates/relay-transforms/src/client_edges.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_edges.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1c8b69dbe21596a4e6be860b5810d7c785df0a808e166fd3a960c5599851b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/relay-e2e-test/__tests__/fixtures-test.js: packages/relay-e2e-test/__tests__/fixtures-test.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in (anonymous) at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- packages/relay-e2e-test/__tests__/fixtures-test.js\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-e2e-test/__tests__/fixtures-test.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39c4e1c39f5b4861a02d049424481318d535a5c3a9b915f9ef24905403d5ccb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/crates/relay-lsp/src/server/lsp_state_resources.rs: compiler/crates/relay-lsp/src/server/lsp_state_resources.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in LSPStateResources::build_programs at line 423. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- compiler/crates/relay-lsp/src/server/lsp_state_resources.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state_resources.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b8fc4aac9c3c37643a3200e9d61086ad6aa508ee562d7e3b12330765c2df74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/crates/schema-diff/src/check.rs: compiler/crates/schema-diff/src/check.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in SchemaChange::get_safety at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- compiler/crates/schema-diff/src/check.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-diff/src/check.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba32829f42b4ab51d83bec119585143f3fde0daca8dcbed008390abfe736cd4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/relay-runtime/store/RelayModernRecord.js: packages/relay-runtime/store/RelayModernRecord.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RelayModernRecord.areFieldValuesEqual at line 747. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- packages/relay-runtime/store/RelayModernRecord.js\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f091b17003057f85485d91205f597134f83296587fdef99ab6af33fa99f81f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/react-relay/relay-hooks/rsc/useServerFragment.js: packages/react-relay/relay-hooks/rsc/useServerFragment.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in useServerFragment.readServerFragment at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- packages/react-relay/relay-hooks/rsc/useServerFragment.js\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/useServerFragment.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"817b5dfe84f8001afcea45d87be8dc167240d8df3fc946e920ecd52314859023"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/crates/relay-schema-generation/src/lib.rs: 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- compiler/crates/relay-schema-generation/src/lib.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dc4ed1de90d835b0bd18bd47feb59f9c444841dfcfebdf7fe67eaddae6a7b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/relay-test-utils/RelayModernMockEnvironment.js: packages/relay-test-utils/RelayModernMockEnvironment.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in RelayModernMockEnvironment.createMockEnvironment at line 180. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- packages/relay-test-utils/RelayModernMockEnvironment.js\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/RelayModernMockEnvironment.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3f234a0c2b3979899bb2065226adf5cfb5d52ccec457e57eb18cb333dfe614"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/react-relay/relay-hooks/rsc/serverQuery.js: packages/react-relay/relay-hooks/rsc/serverQuery.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in serverQuery.execute at line 266. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:45:18 -08:00\u0027 --until=\u00272026-11-13 16:45:18 -08:00\u0027 --full-history --no-merges -- packages/react-relay/relay-hooks/rsc/serverQuery.js\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/serverQuery.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"02aac17dfa26f21c6fcef651a92c7faf213b2bcb4da2f20502a170e812ac5653"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 6 significant file(s) lose their only recent owner: 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1861d17952159c12b385676ca5bce17c087406f00f502805639f52f6552424c2"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 4 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. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"beee620f07f2038c16e85f31dd9a590249e0f7302b1c9dbfe96068faa4ef1d62"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 3 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/build_project/build_resolvers_schema/ir_to_schema.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5879d56365caad3c7d33b1f27877085638332bdddfc435831d1e84081091c09c"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 6 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (23 single-owned of 342 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; 342 of the 445 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)) \u2014 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/relay-lsp/src/server/lsp_request_dispatch.rs, compiler/crates/js-config-loader/src/lib.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: change to contravariant? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-validate/src/lib.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"5231935587c7a58925dd4185f11e50f5afd1e067ca62fe50dc3c59d53f59d3c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: validate default values? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-validate/src/lib.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4301b44abcc7cce095cf6026996282a9c97b88d768e338dc061006c4d02e0f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle legacy style @connection fields with client-defined schema extensions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-set/src/schema_set_collector.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb39a5cfccea8597214d7ab0759a72b59ba3db022017849a0ccf4a1e9ae42282"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: These should be replaced with error codes or by unifying the parsers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/errors.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c19eef213e9898d266e6fdfa6ce5777b54d403fecbc697a9ff33438de87f7aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: we probably want to replace this with a proper \u0060Unknown\u0060 type. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d3fd6856a13d52c70fa48466e3073a7a43d854e4b25d6645397e4ee8bba390"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: we probably want to replace this with a proper \u0060Unknown\u0060 type. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/schema.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"666f8edb1a55e877d7ca73263dd3c0128e6e2ff5dfc340f0c248985102b4e149"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T63941319) @skip and @include directives are duplicated in our schema \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/in_memory.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e77ff73351e38b8bf7b77766c0ebd588fe757f7fdefc864c6f8bb3d7a44b520"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(inanc): Also check if the parent type is fetchable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"152ccfdafe950c93ff7929792b1337e3e995cf42a5d3565eab2b4ca0746701dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: T195687167 This is currently duplicated in flow and TS - export this to a common place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/tests/generate_flow.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d4f151b6f4fb5f2849bcaf2b3c16ca4e71135e30e6a05aff69fe8430e449cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: T195687167 This is currently duplicated in flow and TS - export this to a common place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/tests/generate_typescript.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"413d501234911140875620fa897b59cc49fc5b0aeb9f0dbf1cf2ecd64a94bcce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check whether the field is \u0060node\u0060 or \u0060nodes\u0060 on \u0060Query\u0060. If so, it should not be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc6becdbe1207788d08929ef7b99feb4c5b713b1de981094e57e66ced08afdf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could implement custom variables that are provided via the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56d07b7e5abbfe2eac85977968fb91d7fd5c24a99c05e638d3728e371325b48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: T85950736 Fix these clippy errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"08df2fbed78b22fc52aa50978dd2a100797daf293810bc4de5ddee864d352cc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO consider reading the id field from the config. This must be done \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/visit.rs"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9a0e09f287bbcb17f2031c14d80a8de1e2fbb6a6062768fa571218ed482b88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO update globals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_fragment_arguments.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc96b00ad766556a17b55ca0a1c8d2ed955eaa9d7448cd2f2916760b4d56b15c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T63388023): Returns a typed directive \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_extensions.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67b32cb80570147dbaf9068b96ff3d5bc39787f6f7f500571c60ae59c4abbe5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: path or connection field locations in the error messages \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/refetchable_fragment.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf0e3cd2cc4a14d8da29b3b89628400a443059b4d18ef00cb98bb341b1048d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add Support for FullData \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_resolvers.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1678bb6440a7376d68b95a4c79440e28f5fa68a545c21961f5edab5d44df983f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T70172661): Also reference the location of the inline fragment, once they have a location. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/required_directive.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bd7249f1699573da75e2c79bcaedd1f44f4a2536520251af42d871a1a2bc19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T63388023): Use typed directives/metadata instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/transform_connections.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"14703223d36ee0fb26ae3c9add125ddc8863ef9f164345894cf64a50a1a2a9bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T63626938): This assumes that each document is processed serially (not in parallel or concurrently) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/transform_connections.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"036b4bd4389db74a64dee2c8f6fad395ed019c82f2a89579e9e1261c05dfb4da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T63626938): This assumes that each document is processed serially (not in parallel or concurrently) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/transform_connections.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d836212d99dbb367260c68437a0b9c6df41d2354c7f9732fc1bd690ed306b2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T63626938): This assumes that each document is processed serially (not in parallel or concurrently) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_relay_directives.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa9b2b91350ddaf0f97cc24f67abaed9e8d3507661c3774716f7f21b65c80f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T63626938): Shouldn\u0027t need to do this when transformer infra \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/transform_connections.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cb650d242dad55b4d6ff694c4305138c404aa209867a6eaec1da5a2982f0b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Deprecated enum values inside deeply nested constant objects/arrays \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/deprecated_fields.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4eac70745203cb15a0045e44ddefc052504e2641f1e9f2bf7d975e220764d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This implementation requires the edges field to be a direct selection \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_connections.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77c2121f1571d6ef749fd28ae50ea7cb600447e43631c397f6c3e6b83a0ea0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: T71484519 re-enable this line when queries are correctly named in www \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_module_names.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7a5fa50ca6eb0cce956be92d745485ff0dde9b36faa96f4cdff23c6f302fda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO have a global list of directives...? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_assignable_directive.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b5337853786ec7041051f137f83b3a553a9c156c2d809048fc54630c94e4a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO have a global list of directives...? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_directive.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"57126e913bd328e8852f1532e5d3a1148e3ea1bdbcc57a43fd408c6344d1cbab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle unwraps \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d66822761bdc438c05421b915d4b6414e52a28ce526b9265a31de9e354bb0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this generates the IR but not the runtime JS \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1676ac485b4442542f281c2503ce7d1b64c03b70c8e207293e94ff480375a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is it possible to error in the config file? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema-generation/src/lib.rs"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03ca919ca86f9cb90e5a11abc71524bdab5bca0857ac78e04c66d50f3a5cfe3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brandondail) handle when the completion occurs at/within the start token \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/completion.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dc3841d899a5b693784e3d7cf1bbaa1dff589d93db2159ec8ad4f2cecc63b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brandondail) we should always be able to parse as a Uri, so log here when we don\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/diagnostic_reporter.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14ddd3686bbdcb4d97b0a41f4bb092856e782276fc3376cd2bbc7a06c4321ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could provide location mapping for the @weak docblock attribute \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/docblock_resolution_info.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c271e95b51b4b9c7bf6b79f697009882ecbff6252da1fefdb3a393ab7560de82"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO these should not be expected errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/explore_schema_for_type.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3ac9439adcbc0bf6652a356f648c7a3cbb3fa08ff0f5b92393a501cab6f3b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO these should not be expected errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/explore_schema_for_type.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"358d1297b355579e24820be84590546e89fc73b65a8f8b9b64866e05935f40c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add go-to-definition for client fields \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/goto_definition.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8748714eae57b3c5bf613ff298bc5672123780c32beb4c794b9614fb678eb7ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement support for types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/references.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6245ebceba674052165e81eebf3c447695a809a87b880cc47ca0766ac9c08e36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO resolve enclosing types, not just types immediately under the cursor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/resolved_types_at_location.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75ab5c9908f465c575633ae2440992e02323658f445bcd5dbebbb435b990697"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle response from the client -\u003E cancel message, etc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d439dd331a4691ea1e76c82a40f4d363877f331172bef5dcb36a9cbcf7a817"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe reduce this after adding filtering arguments \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/type_information.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6fc539bdbb1b23b34562c0e53e85becfc79809f28803c929e238a9f3abe320"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO propagate these errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_notification_dispatch.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be59d67cd3b2ab4b2f0eaa54cbe56c585aa90ab3a7c0f441060bd0d4a6ead5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a better place for this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"71363ad14b7c6b4507b5b9d2646ec73a593419d736a783c8b0631980e96aa6e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The very last character is problematic for some reason \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_state.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e403b2505b0d39d0fbf3df168a090b946b12529113b8f32bb5b2c16d973b4745"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brandondail) log here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/node_resolution_info/type_path.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"07485cc5158513a1fdfca64c057b6422c22297c8342b1513aca1f42d0ac3ce25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brandondail) log here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/node_resolution_info/type_path.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d5073d136e984014ea6babfdd57488c72324814e5ea1d595989e6e9b931301"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brandondail) log here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/node_resolution_info/type_path.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2464b69b72c9163240e0fa353c7df940c432c8328de3ebd70fa4a87f3678bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO eventually show information about whether the fragment spread is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/hover/with_resolution_path.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"3729653226657420301fa42e98fc4690ea7245bbdf620b0aea10d30f6397657f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add \u0060FullData\u0060 mode for this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/ir.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c3e732ffaa90c146d86f65f94f9ce6da3ca12f140e3405aef8965026a62b5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ensure this type does not already exist? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/ir.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afca0d8fb17371d36721120541939f69a986642e524accc1b2cbc7f29411d4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO pass base fragment names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/tests/compile_relay_artifacts.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7844d21045c90b949ef5b4ac7bf590c1dbdb13f8af471f1830a8cb54cc0b8542"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO pass base fragment names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/tests/compile_relay_artifacts_with_custom_id.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3355f899ddaab1b1bb5fd91e6d614eb88db444cbb6dd1970d9e24533f4de81da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: possible optimization to only set this if the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler_state.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c5310eda6c9be2402c10a71011203acb7a5906a46f82ab9c7fc0e2c09a24cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// - TODO: injected code to produce additional files \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/config.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17bced670b9006c6234bb9cc52a358655e0b72ef4743673143eca376e77a4af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: parse name instead of the whole graphql text \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/graphql_asts.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"488707958f1c487017206a763a6ae439bfa607ef9af89c64990c3a37c0879c6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: refactor \u0060parent_documents\u0060 to include ArtifactSource and not ExecutableDefinition \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/generate_artifacts.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"12de9e182e923366e0ac287b81e4a487e31218367a1121b29af2d67d9da9be1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T64459085): Figure out what to do about unnamed (anonymous) operations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/project_asts.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb66668f5144f8fcc231953ec7c6b04d2f94c25883fe803a8a69c719146b0a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use the base project\u0027s schema config where needed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/build_resolvers_schema/ir_to_schema.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2c749ae959685da85faf0bf38d97be4f3d3efaeeb24ea3796c99a22d6acadc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Move to relay-docblock crate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/build_resolvers_schema/ir_to_schema.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4d3115d8a4da8d4874585d3cdc62549701d71661e7a30ccbc968c8032ad07e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add/investigrate support for provided variables in updatable queries \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"870574970c7bb78558cf6e8ec990fb513a2fee012a16c25eb3463943b69b2533"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support force_type for TypeScript \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc03f7e7704f3a91f93fe386645046fea997f26b27240be02784b270f8668857"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T63388023): Use typed custom directives \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac6705d3521a3115716a5089446cfc49acef46f075565fd7539e2e8c84c987c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T63559346): Handle anonymous inline fragments with no directives \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2795}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5ebf03eff96ed53c0e48ef7c38180ffcefce2f66c232369404503c921d98c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T63164787) this will produce argument_definitions in a different order than our JS codegen \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43ae1ad57dae3ad5d5c050f2f01727ec12bb2ef4a695a9cca402d6d738af1a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T63303966) type is always skipped in JS compiler \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":3004}}}],"partialFingerprints":{"codehealthFindingId/v1":"141ed8ba909babe13edf7e0b61264537d6ae4aba9d657ee409e8e857536e3cab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(sbarag): this specific codepath needs to force-relativize under commonjs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/printer.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"372064fe65d1e6a32d940b91600c9b6778e36163b01c1efaa6dc3b08b0e9f142"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Make this dynamic on the default branch name. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-watchman/src/subscription.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"222c5189c39b2f33db08e913d840a799620bc115e82c5bb9d9b1e3b4d1ab0075"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/parser.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9edc368118391ea24765f16ff5d6f50b4f80a9d880145fb31d987c78132ece4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Nested lists is allowed to support existing query variables definitions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/build.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d30dcac5c5f82d1b98ffe6c35ce329c45abbd546d164d0e1dbdd9a9e093d4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We didn\u0027t use to enforce types of @args/@argDefs properly, which resulted \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/build.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"43af190a1620ca2ae3fb8ee2a728018421a8102c616bff3086b95c0801518291"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: print joined \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/errors.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c893dbb1d388bfa2239bf39ec659f37d762d77e002fb2aa01547a4da917dca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should push 2 spaces for emojis, unicode-width crate might help \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-cli/src/source_printer.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c73d1838ee0ba8372e7a8815e45b90e165186cd9a68087cdb421aee3efc4819"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack for template literals containing /*, see D21256605: \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/extract-graphql/src/lib.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4ec51ffc1c818b2f0c3c0aec9fcd839859fec3ce07fbe30f740bb4545badbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test without using snapshot tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/dependency-analyzer/tests/ir.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05471141013d86bc70b0ee2fa6e960d1be370aed3c61ab290497ba4092a73af"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060relay-compiler\u0060 is a command-line package (\u0060bin\u0060 in \u0060package.json\u0060) and neither \u0060packages/relay-compiler/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-compiler/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"564106bd27cbeab2136f11179dfc44b12749ef24662c99e64d7e79d585e675e4"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060relay-test-utils\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060packages/relay-test-utils/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdc17a1cca22d41b82b5eb2abb7cbdf41d54bff127f0194990fa4a77b58370b"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060relay-test-utils-internal\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060packages/relay-test-utils-internal/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils-internal/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b16e975d7a59ced137803b03b19c4cd68c5c569b1a969941e23fc6800fbd90"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set new environment\u0022 repeats the code it sits on: 3 of its 3 words (set, new, environment) are already in \u0060const newEnvironment = createMockEnvironment({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useBlockingPaginationFragment-test.js"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"754129ebf46f572079a6e0e1dbba114a002465a94b071b0aeb56bd599c229908"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set new environment\u0022 repeats the code it sits on: 3 of its 3 words (set, new, environment) are already in \u0060const [newEnvironment, newFetch] = createMockEnvironment();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/usePaginationFragment-test.js"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba38814c199b9a8e5cd285dad722cacf24dc4728f1afd4985eb4cd8a2046930"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set new environment\u0022 repeats the code it sits on: 3 of its 3 words (set, new, environment) are already in \u0060const newEnvironment = createMockEnvironment();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useRefetchableFragmentNode-test.js"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"820814902e93e86ae3e15f4f893b45bd5579dbccfbca62e02633eafe52875215"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set new environment\u0022 repeats the code it sits on: 3 of its 3 words (set, new, environment) are already in \u0060const newEnvironment = createMockEnvironment();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useRefetchableFragmentNode-test.js"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fdb55a4d8e71083be31774d9c7d9b45cebb00bd06cc1e332f81ad073a43447"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set new environment\u0022 repeats the code it sits on: 3 of its 3 words (set, new, environment) are already in \u0060const newEnvironment = createMockEnvironment();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__tests__/useRefetchableFragmentNode-test.js"},"region":{"startLine":3222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e53b5f51ebb46adaee47b28b693d850d65c2258865d88c8edbe82280eef72f2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A server fragment read as a promise.\u0022 repeats the code it sits on: 4 of its 4 words (server, fragment, read, promise) are already in \u0060function serverRead\u003CTFragmentType extends FragmentType, TData\u003E(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/__tests__/RelayServerHandoff-test.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c5b5f67b37c2932709018619d5479e5ddf64d1686ada43fc0a609a0aa0eb94"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A server fragment read as a promise.\u0022 repeats the code it sits on: 4 of its 4 words (server, fragment, read, promise) are already in \u0060function serverRead\u003CTFragmentType extends FragmentType, TData\u003E(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/__tests__/serverQuery-test.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f20274091cdbfe6d6ab9a188e96c16decef4b332e076ba9f4d1f21698525c9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Suspend if a Live Resolver within this fragment is in a suspended state:\u0022 repeats the code it sits on: 5 of its 6 words (suspend, live, resolver, suspended, state) are already in \u0060const suspendingLiveResolvers = getSuspendingLiveResolver(state);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d037a739f29d19d6c187dd79e221459a61b814770665af610124551ad0b4c29f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Suspend if a Live Resolver within this fragment is in a suspended state:\u0022 repeats the code it sits on: 5 of its 6 words (suspend, live, resolver, suspended, state) are already in \u0060const suspendingLiveResolvers = getSuspendingLiveResolver(state);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4514daee81709cc7fb798ca775661c0cbe175503c3eb33186e76c603f73f0cc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Symlink node_modules from project root\u0022 repeats the code it sits on: 5 of its 5 words (symlink, node, modules, project, root) are already in \u0060await symlink(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-e2e-test/src/setupTempDir.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83e7f8858ffcb4b106900fad624c257a1757470f1c87b23c0c58de80da7a825"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022RelayRecordSourceProxy\u0027s other methods reach records through these.\u0022 repeats the code it sits on: 6 of its 7 words (relay, record, source, proxy, methods, records) are already in \u0060expect(ownMethods(RelayRecordSourceProxyOptimized.prototype)).toEqual([\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/__tests__/RelayRecordSourceProxyOptimized-test.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"669d697d06129f652146d87059ea75a7845d511642e6a922bce851b3cb65cd1e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022This is a new \u0060ownerIdentifier\u0060 that is affected by the operation\u0022 repeats the code it sits on: 4 of its 5 words (new, owner, identifier, operation) are already in \u0060this._ownersToPendingOperations.set(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayOperationTracker.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3c4ee7d5b0b4d7cd66e05cf80a1f99a4d5b271074e8a2f5ad867267bb91c42"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Filter out any Relay Resolver records\u0022 repeats the code it sits on: 4 of its 4 words (filter, relay, resolver, records) are already in \u0060if (\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayRecordSource.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db4c59bc1e97db03c6880e7494923007ad5d28b4a3590987ee005048844eb1e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mark all @outputType record IDs\u0022 repeats the code it sits on: 4 of its 5 words (output, type, record, ds) are already in \u0060const outputTypeRecordIDs = getOutputTypeRecordIDs(resolverRecord);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReferenceMarker.js"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb89466f6ff611db0c88dd43c24abfb9d1c70f69003f0ff1715d741dd1cbc004"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022noInline fragment data is present\u0022 repeats the code it sits on: 4 of its 5 words (no, inline, fragment, data) are already in \u0060const selector = nullthrows(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayModernEnvironment-NoInline-test.js"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b67f6c751dae2961c2595667c86c4c9b1d0b66a85e8483becb64421a14a974e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022There is one more operation that is affecting the owner\u0022 repeats the code it sits on: 3 of its 3 words (operation, affecting, owner) are already in \u0060const updatedResult =\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayOperationTracker-test.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb0e720e52c8570ffa76dd69a17aa97c12b7a6cf2ec8cd6f3bf6588b22a0d6a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Query payload sets name to \u0027zuck\u0027\u0022 repeats the code it sits on: 4 of its 5 words (query, payload, name, zuck) are already in \u0060queue.commitPayload(createOperationDescriptor(NameQuery, {id: \u00274\u0027}), {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayPublishQueue-test.js"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd8f4de01cc10a28f6ff53ecac7ca8c9e33ebd59fd29bfbda93c0cbc004cb5e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The call count of the resolver used in this test\u0022 repeats the code it sits on: 4 of its 5 words (call, count, resolver, test) are already in \u0060UserConstantDependentResolver._relayResolverTestCallCount = undefined;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/__tests__/RelayReader-Resolver-test.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"332b3ec5268a91a2638fcedb640aa48599752c2b56d555c329ef5563e27c6a5e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022This will get default values for current selection type\u0022 repeats the code it sits on: 5 of its 6 words (get, default, values, selection, type) are already in \u0060const defaults = this._getDefaultValuesForObject(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/RelayMockPayloadGenerator.js"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b87ec814ba66353220bac8b931dccc451ef6364bfb7280a520a270e094d693e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Second, defaults for abstract type of the selection\u0022 repeats the code it sits on: 4 of its 5 words (defaults, abstract, type, selection) are already in \u0060defaultValuesForSelection = defaultsForAbstractType;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/RelayMockPayloadGenerator.js"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87b0db197cf9374ec2a7496119927ee588d15309afb7b98b0452db1b131892e"}},{"ruleId":"D26","level":"note","message":{"text":"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 \u0060compiler\u0060 (148200 LoC, 1013 module-visible types across 76 directories). Review these for cohesion \u2014 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3c5d3262642571eb86fb6dc739cbea7d01bb98f44e21f0cc3f4e745944454d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fdace52517967069682f4d541cf1db103d249850b9ff9e28bca1b7ce09cb58b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6a6d49203805cdb679d421a8043ac39e7b032144f8312d45a17e6946daaafca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e8a627e7020ac8119c8ec6c60ce9a9f6a161d947c9dd66552a2bad9e055ffb9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d20d5484e3d8277d58c5e682057bd6b1904f0e084c9ee1d8b57c31e441c0f02f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b562a86ba4fad32d6ccdcd6ca2d4c34c2236a59e5d8276adbfb83a1790cdee0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54641d69f9fd310e1e6e109eb8c8c7bbf100e9cca02deb9ddcf89f516439975c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab979ab2dc46515c14a5a4f004fc991e04e40404eedb88f91aeaa5242f0df4a2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f716a87483fb3f919d01a2f6ee876ad3cac7f9134e64e33fda52e74d7a281f8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4014e7719155abad9ee780737c6a29d8c31bcf1e70b94286734d74edc799576"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9da5ff26bb9af4074fe03f7e7cf2644a6e084be31aadc793b9438eb66ec6ddaf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ba1bd8cd7cc00ffea37dae7b5e07643f624b23874e3cb0759fc3e4878f73406"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03edbc1ba025ae440af1a72851857226f14994db0a18cc6e9de69ca6c2ec6882"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fe915542e9ef9e0e2030d13e5e967c9edc93ad44e0043112709e63c307bce8b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2cc22f851d8564eaa76884757ab224f3ffbefb607db993d85c935b00aff39c5a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e9323362030c11a89ee75d7211b2720333c55d8869ae68ed4aebea060c08384"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f5ccad42fd15b1de9b5359708e5519cfe5e70b8c835c694dbbf717f705bc5828"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e80dc921a2fdc5ac55935de1a07d97d3b67da674418a9239d069b16881d400e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0bbde41a3826ce93ba4eea8123d6d184897129bf1dfc70c3b68933e675679113"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dcfa4da9215284db6a6355a359d46e54ece6d33a8e6548e02570fa88e565fa20"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbb3016e08588da0295feed2d3c1aabf07e14aa98db895f7d8608ac6dac5e7fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a772131f8c59faa280eebfb6e94ddfc026c59b33c7a0f8f3d28a29986f454eec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f57d1d312afdbea5e586f5c4277469ac5784f32d5ade2a108c78d246b6a0be52"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8e8b172cf327825d1cf42b544ee79199814e271b1cab65813357983ba6a8730"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4af17c2699f15d319f250a9e3015d66b6ddba774fbe1c98f445c426bc7efa3b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75a453b3669e7eccf96e1c1132e7a5954f24f5d079b0c29c4868e4537437f325"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d82c4333539a19ca5c108f55ff4d7b1319eb666b261c25f68380d2601e8601d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cae9beef05f16ef267c8bd62780784d287aa827c8cfbbf0b7f80076ea841222d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"365cd0d9be76d82b2b98fadc0ddbbba71a01c739338b2bf1f73b7865366e3b86"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68b09184ad046803d056c9f9eace76b8e4e6f5c06a1248d333660ad336a6eb80"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7ec9ecfc498ca861918be61a6934cea6e7180197a46aac817263ec9281040dc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44b78b7c6611c3c5d2832a455ef12054350394e2ceba890152f3f33421ac69a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"439c9aa348d477eb4bac935ff7b190b275a42a982b90a897e1ecc5c9cbce867e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd68a1dca1721f87b9850690da90221386eb8db919b58dce8df013c56ad73e1f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99bd26fb308ebb9cecd76d389a4b918879e50b4a530a80338a872445236d5205"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46d49aeae6d2924b40cfe52eb8275c367b3f9025e205d8cb91837251afe74730"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b704e9f334ac03c903609f3c0679b7dc7747e450328f0158638e1919b77662a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26dc17c7db25eda2822186ed20d1dd7ff5fc562323c94b0dcb8d79fbfd25148b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c88cad329cb94e23bebc40053ed8da1409f3b8680590213e6d7da397865ffb0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7cc87d7a85bac1a91da3d1a29f086bd9ab23bb57f5a1370a0ab0629ea0e30e10"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2072d1c44d91df0d19f1d2c217385ad4ebefc000d4ee6c55e64d85482bd2385a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce3b137595913a6e208e95dd4f08e2222d36b7d2dd9c2bde145e52f4499c93dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5652e68cee593d2f86cd43723534b8e0c0a1030d16f258c3fe6d6d14b35fbcc3"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"867c3f6213a2551628267070f63d16cd88a05957d69faf9cdb16eb87a90aae9b"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a82fc01a565e9e68e552e502abe84669e303654b570a68a0fdbea9e5fbfba23f"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8159ed5cb5c4db4b31aa500172ecda8360dc0f10bcf0270ce66a7a173976d52f"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e8d8de5efea5d7a4f5a87f1d10cf4bfcd0592cdbe1fb6d87f7cbbcfda3bae92"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61f13df7895b0ce078d9f6decf66f627ff3e412b7b28934b9a788e32345ca846"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf32782a2105c58df9dd6f807976aaf3d164c2358424d6307923d752b53b1af3"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42315e8ce59937a8dd2b1d8742f304f25f1cdfe945d882214b8c7cf9ac430d6a"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5926feae28e3156201dc3f9e6a41e24077fa630907618ec83318015e35e41d54"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d27cb830aba0429026c12d4e1a519f8f4720921525d213cbc381dd37677a6093"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e14ab929e35bffbbdbbc405b6635960c6a1b46f0c4473b23099e3e59452c2823"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"884ac84d2bc35465aaf49cca72ae3238b3bcb624cfebb6c25af433472e431dde"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89ab8b7649c2153934c20945426676c44d7b777816ba4491bf06cf685bd045e5"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b6fab283664c0152686bb1e73f97eb4bab63d17c85476459491a9b2cb207f49"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b24abe8f3673cf094657868491a7e2af116f014f278a7702a55d847183e77ff8"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59c27b1cd3aceb11e2a8f9a191c6945388ac6220d5bf2d103a3de140b5f641c7"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c833ea6779c827264bb6f9f00fbd652091fb4e594cc6d857072dcff907607b49"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a31e854ac97748659751d3fd3c200e0025127108402f7c900ef839819fc5aa7"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c975f43ee389492c58d9d30206fb43f4039f1997dce8ebd164ab3acad6f76efb"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfb9f5835ebd6a276795973ffdca7f007ef0f6f7def6b703abfe98d01e62ac85"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d41f750a3a0272ab920c7f08f876364add29879ae8c100ad853af45e7078cedd"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08cfb8eedb84178aef87c3c3cadd9377fee1a5b53fd59f140ba5baa31e7c8209"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65594142ac97d1868ad4940989be69647b2b90e8c19bf631ed458da9236b35bb"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba6229d3bfc0a3af900951d4de6b927cf6d5455a7a07509e6a1859a5456f47bc"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5d71659505d1504b0d887562c8d34fbbda2322e95bb19404452c7050c33d19e"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b742e1d09a71ffc857bfb79b48e1bfbf1d50bd3542005507365e1eb1ff91269"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69e87f2fbe3404e773e9c8d87ce0208da4d977179c205cfdf8e82746d200ed4e"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07387b86a0132ba02e67b50b1ffe8dccd127d76c20d6d33914dd8aa346562790"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5453fe27c142de1cc7dbb2a197bd815e87cf2a4403e3badb4261cbed84d115e7"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"007d1409d104a4fa86e562e2d4a913760810284a4e3f7d29e11fed7e4e2a9ce2"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71a17b6da4706ab379d94127b19cfbc17eae1341fc6eea529fd9b78eb26f7665"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"139fcb327bf652e027f20e27dbfa02840b1ad3d5dc20fd5289c4ab5e17083cc6"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45821e3dc01917dae8b5a60712730241205c12d8e69be2ea4cf224a29f36b9ee"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9321f3ead7c0e0dd769c3483143021f7dabfe4da41f0073e378215cb857f0c0"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a282f2cebbc8c1f38b04423886fc99a540c383e24a444707695d3b5e5c3c9ac"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f8369445fd4e31bd5c883037faeddb25971655ea19b44fae0753590d734cde5c"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fc6f58c51506d084525dbba49012449168a9e9938433bde6e9a3928dee997ba"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f8cc62dd7f4bbfcc8ac4d9f116695d9f68c2f9d4617489742bc4cf4085f9d1f"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"799f3df571beb30354e80cc42c7201e167245ac785045f684776d70d0ef20f43"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76b8f51bcbdeca1f94469c6f4488eae158b272fa801f1da816d1a36370924b03"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"795f5e1ec2c65d1d4bae5c7da58541e9139ea0ab875896235575005b76cb9cce"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7442b12cb8f17452f9b7dc5a8a2ab436d488276271264f6db558207c1cacad21"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8101edcc306a6fc7ff34893e121bd1f4f49340f240dad7f8160590fdc67255e3"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f65a5ad3969f1589af0ff53be0e092d7209951762af13f71f47e451110e4443f"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63d72b90df8e7fd3c0b2332ae0196b55c0460bc281d71998199d20bc2a3e402c"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d7c314c9ff8a37f03917119a90b0b7756037ee190fa5742cc7ef69cc2f95878"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b58ac6ed026cfd5e9f0c37aeccdcf0496c1445743088b45e7957a5a59d3d332"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2f2f726c13e2b9f45f033333ba33078312c0dda964c1920557692ad7ee2e585"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b340c60b23710b12573d537af90a8e7428d17d18ce67c5d61f6ff160819fc05c"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9c9ab6fc51f36eb999e32680554cf32dc392a5800977c02787da00c0cdcc840"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eceb263f95d9bcd6fa12e1d7f88ed4586322f98e8148b5d888a14d349f52be6c"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4f3b90611367ddcda10dae834252ff1733ab8cd36616cf80e3a26cbdc79f5f8"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1eaa422e632b38f4e8e9800469df30381f57a09dba568ec55d731cf448b7b476"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"085bf72987ff4698a0f39766a316f4605206aafe2012d46b15b9bc4e1c9ed8d0"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f52ebba5472caf220ee5fde7ecfa533d41856145d9f1078d8018e696a5ca841"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fd49972f82a3a392cf5c7f70bcec12b0c8c54c4e7fa8c4e05e7102d5cdf5273"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4338f4684dd69e1b8fae2d67d59fbaaa19c606a78f1e2f7622bf10cf23cd5a5f"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f047768d654538dfaec1b6fa796ec887db805b855ff56752ac1206b8f5fc417"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf176f1249bd111f5dda7b79bc1e270bcc919479d1bb84b9ee1a733c3d00c780"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25c79403607a1622dfa2961fea9bfc7a6bf33120918b9764f1d558038702799a"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03af5b3649645b3311251a26ab8300385a0eed7963d106bc33389e506cc0467d"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"489cd08fef17df2aff04c749390c88ac8b14095f83b6ae760b40df12e936bef3"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c63c522c15d6057ac97bafabb15ce53696685284defb5c955d64bbb50c171ecd"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"370d76d25aeb34421af5a76368de41af51678d6a217d0ec7066908655eb1c868"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ba149d717e1abbe1d9688786a40c69bfeb2d3ae90a4cf83cde74bcf6aa3d503"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42d8a670070a68e83e45cac11d55bada8023d9ba12a735ee677e13e28405d327"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da198797d1fb4b524bdb60a377d40679ba4ea4efe32a5e3cc30c05a0e03f5044"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61c8cda6941aaa5f9d0f0a0bb8ff76b4a46636d1ce7dc58e914acbe54d38c375"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"271d32736292f645623fc618de1c2dd3ca533f687106accb02be6fc1008da482"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"449801b62c6ebf3952dd34523f58088e4ea5fcfa688f8ca39a71e345f35eb9a9"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f47bd76fb0623002437b59dd76a1d615d34402a82c7a90c78fd16948f1b26fa6"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db2b3ed595a8365b0c21fba35afe418d534e789f04e79fb122b6f4e3ad50a99d"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e60a748cb451cc00336e93c2b88cb6f618c72429bd0ca5d9af5b79dd38ab34a"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4d77a810fa24681db971ea9e4819d30f37ee801ae1fb150a88c6ac91c1fd865"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"682799ae35ae2ad3fc9a4f2f64362cdb3f1c1b99e219e9558cce01e7f8524500"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0749682073b1695228746c36ca278803b217a20d829c38f0ff63458bc713973"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a94cc2e0b1950e72e379266bc4e62ae178105985e227c4c6f50f51fbfc9c98fe"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af22dfb99569c7e8c02c6a691841c626d1c3138975d1a0b0a1adc526ae8f151a"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4093416bbfeb95115006ca7e7a81b130bcb52e4ea375a0926b8d9c563cd832a3"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c885d82130a520bfc15e1d4a6fc82667dde038303d84ed892317dfa6246085d9"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fdea0d5e6c83ff7b0543bf889512fbae67a224a6fbf6378a344d1db46c7efb8"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65209c3c8d3cfee322dc612c5c316562c9e97c361f5b0f9c4a1e3b2b214208cf"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b8413382105efd3a41b8b0be2b94590e5f323362d65f7386f2204dc589fa54d"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29701d1431945bc7a46c1a7c9785577f78cf219fed4e87859be28558ee21c393"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0943b5dc0301d7751d2977c8e071a3646af98d71ace73651e28d68cb0edf41cd"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f044f6e55f1f64a62174137fff1a547cb4f940757b6a7ced592a1ebf6cb53746"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80d31f659be4cdeddf615de8a6f57219055d15c418c680fc9b0185fe8b466902"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7add7e6df91550e5d33040bb8938e95cd8b58d53228a683e80e9a63d8386fda"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a702cbed5c795399172c1b063fa11e795d4219cc57848e01713d9cadd3adc0e"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a97f232d5ca2ae51a21541981775fa1d721722ff13dd957d34fac90068ca5eb"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89904682b64d6413f17fad6f1354adba60f43507b981a8d74e950c0c154c1da3"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf9a0eb628cae5b30ea4dc055134565d5778ed22998eba758d904a4397fa4714"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"687a6c1c17d64f8fb986eda432a08885746e69f66a8254c7ea125c1585dbc9d6"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f66d6a48496e79e4cb8831ea0194e13d64381bc81a6933be682215332d903853"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"921d4a7f61cbe580151baf2dd1dbb68e8ae4cf73e871dc1108ad29ce5aa0c9dd"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fafa08b770c83b9aedaaefa9368a162a17e13cad8ae9927f22211a68c862ca4e"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3afdbfd5a7ffa52d195f6fb89d2dffad7428a86c4d343d418815b059862ce36e"},"properties":{"dependency":{"package":"wee_alloc","version":"0.4.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2022-0054"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1832fff5de810fcf303cffa4dab7cc73a432059253ebc9ab01c924b6720d58f1"},"properties":{"dependency":{"package":"form-data","version":"4.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b4a7618f88f38e9d209fad3cdca807b69f6aa652fc5853bb6b1ca48d81c5e43"},"properties":{"dependency":{"package":"browserslist","version":"4.26.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b9d2ec7bac484676928339b40710fc4cb020b69b81d045c3fd08fffb5e8d4a2"},"properties":{"dependency":{"package":"js-yaml","version":"3.14.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf07dcfd772af5c526faa1c8ee52da53ca4ec832e439e83b21194e5b0b77249e"},"properties":{"dependency":{"package":"@isaacs/brace-expansion","version":"5.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9210c6bd30caf8eb812261eec037e2054c97ad7719c8787516baba031b27dd31"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25391c174a5bd61dae40ead7fdb5261adabc4233abe5ddd283885ac5f28d1ff1"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68cde0b83a4cb54339b51a16284d29046aae3f4bf27883b96d2853a69637afb5"},"properties":{"dependency":{"package":"braces","version":"3.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e42fd9e3e1e90b9f9ca643824ae41d6fb4388a2e3646008c3c1bdc5011b7e2d4"},"properties":{"dependency":{"package":"cross-spawn","version":"7.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97993c468ca330d9ded5e3ed57dc43962657223b72ab43d3d28f4755ec440eda"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45bce18514280324b3ec3861dc241eb9cccbef5b633ff898f070c1f242c7447c"},"properties":{"dependency":{"package":"flatted","version":"3.2.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e24cbb359d7c334fa0d0c63faa2bbde067633e6dbb00623d809f66b10227292"},"properties":{"dependency":{"package":"form-data","version":"4.0.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03b0dbaaac462eb743a243d52e26d6654ea108fb1f905627f470c105672d6806"},"properties":{"dependency":{"package":"glob","version":"11.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b9a131f1fa41d1af51c6adf36e4b9e30701d8754f0751f266282b56a9c1b970"},"properties":{"dependency":{"package":"js-yaml","version":"3.14.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0287d56bb2ea9c2aaccf5da2b9f9d0825d233a57de949b135451ce9e64750674"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"045a87a5d0ab60af31260906a7f0803f3f84abb52ad6fa6d77a22144a0388e17"},"properties":{"dependency":{"package":"jws","version":"3.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68dd5c4b2156b1187672e58c64ccbdf58d10ad3053945cc9d349d5de5141dcac"},"properties":{"dependency":{"package":"linkify-it","version":"5.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf40b7788255d47d19bbfff5e49a5fb25317dc3c1062c7fcee2c3d031ebf74c3"},"properties":{"dependency":{"package":"lodash","version":"4.17.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a61ebddb9c9abe78b6e210b01ea8afe7279143443bb96ce361b04b5f4437a01"},"properties":{"dependency":{"package":"markdown-it","version":"14.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"322c7ba75db15089d79c363ff3134e7d1029bb8544be97176e17d1d5cba3ddb6"},"properties":{"dependency":{"package":"minimatch","version":"10.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9aead98e4f590fd3afdb27f312750b877bf9a6e7f6f982be30d16135a36b6f34"},"properties":{"dependency":{"package":"minimatch","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"790983ed47c5d8b73c172f47dff35157e277fd1a40b9f59b32fa04a10e79b031"},"properties":{"dependency":{"package":"minimatch","version":"5.1.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b71f74e9763999399d4e76fe6e3b1c3811f76effb1b063654fdf6071f19b67c6"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22e2c56b5fe34675da859ff8a16b7322f0e13bc2a099b94eda57fb1e89300dc5"},"properties":{"dependency":{"package":"semver","version":"5.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f8c4029db2e232a235df448302ed7bc10fc0d45121db4c6afda9e5e5fd172f2"},"properties":{"dependency":{"package":"semver","version":"6.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1172d2390370f7c3801fffc86b32f0629207a1590c054b1aec6dedbbf5c0992"},"properties":{"dependency":{"package":"semver","version":"7.3.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba467ec5620369e85005a0427292a8816974fc08a796944da0862650e438c854"},"properties":{"dependency":{"package":"tar-fs","version":"2.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"513cc2b3ca462fe4f7ebd5baa2214e33000f7e5c4d50b1cab3b42d6cf96dc271"},"properties":{"dependency":{"package":"tmp","version":"0.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14e41e451b5e07974cf790d16897fd6553b8cca83a9b9ab66ef9aa21afc2e17d"},"properties":{"dependency":{"package":"underscore","version":"1.13.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f1d3e7b89d9226840b5bdd13bc6fe4e670524984723cceb0fdea017efa6b42d"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac411de09cd06e49dbecf770347c1ace67108c28363065b811c0d97e4681188c"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fbd26b9eb4f3b76e93659d9bdf7520879a6efc249060f4c7df0cc4be26c369e"},"properties":{"dependency":{"package":"braces","version":"2.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ceed0867f99b3264b81e7598164941e2b1bb627eda63f66aa4a91b0ce19aea3"},"properties":{"dependency":{"package":"braces","version":"3.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"516168152bb5dba93c5dbb03351418a2c72ea2c9ecf10f18a6ade72fa55dd0a9"},"properties":{"dependency":{"package":"browserslist","version":"4.21.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dc8c676846dbff9e08b830e846df23b25a1893f391f4fb8f538f9b6a084b15ae"},"properties":{"dependency":{"package":"browserslist","version":"4.23.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00d2d5be798274ff569c0b8b6f23611b25200161b2b400499ce826f2f2a5ac0d"},"properties":{"dependency":{"package":"browserslist","version":"4.28.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fac6db659a9da8df25d40a5be2c1ba9f774002b846b0232b88b1fa9a8477cb91"},"properties":{"dependency":{"package":"cross-spawn","version":"7.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88d6edd37098557a47aff180cdb78dc20cfeb67faa4badeab2d57a968dbe84fd"},"properties":{"dependency":{"package":"decode-uri-component","version":"0.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5f026b778a645342f8c861f004f562368528368fb499e9ae9eb64c233f429dd"},"properties":{"dependency":{"package":"flatted","version":"3.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8551343a455849fc5616830b4bf1c4631f2d9b63f581741ea2452b582f417c70"},"properties":{"dependency":{"package":"js-yaml","version":"3.14.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e1dbf4663395e41fcee3e45822ba98674be61bc311144ffce9c3d3fc91faa6a"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"340e8b8f0fee29d6d6cb45ccd0437e64701d655771d019c853915389e8336f74"},"properties":{"dependency":{"package":"minimatch","version":"9.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f0c3a7501199f4368f0e46a136371d49e382cf0acb95bb6112a2135387fcc99"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f2d187c0aecd13cd2ed938e1695600a9f6f01360ffc12d0eb483616f40c0cec"},"properties":{"dependency":{"package":"picomatch","version":"4.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3109fe12da6c70d79185eb39354b9d91447102db38ac52ce8247c411d12173b8"},"properties":{"dependency":{"package":"ws","version":"8.18.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6224dfa7f3811cdd581153738a5672f290f3702a83b2e56008cbc81d693f2bf7"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f293c7d522c246a1133c3b7f19af3646018861dc7bde7ed0b9b064c64a7cb4b1"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f6627755a3e4b7094c2b32e684fe872fe381ab05116db145e7ed5f3b09eeebc"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.8","advisory":"RUSTSEC-2026-0204","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04368efd90f076d6ee2425b901d03cc462ac987ee0439ee852452b288e924c0d"},"properties":{"dependency":{"package":"instant","version":"0.1.12","advisory":"RUSTSEC-2024-0384","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"383d7ae5f84c1bd84bd6359416eefc0264601ec7fc1791ee4606ef83478d8c75"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"RUSTSEC-2026-0097","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"52280307eabc94bec02a5ac155aa3128781c008c50bd4dd0dc7feab07639bcf1"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.8.17","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"675e0c2d5ca46005908e6a3ac12c4bd7aa2e6a37172d96f634148f43ce09994a"},"properties":{"dependency":{"package":"ajv","version":"6.12.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e04d34364d2da9cbc1f44a8c35b975b34024858e2eaac14dcb89075f80f2041"},"properties":{"dependency":{"package":"ajv","version":"8.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74b438215417002cb315f0c11d8370e6a2386c3fc8cf78a422b1e0aa3554b280"},"properties":{"dependency":{"package":"esbuild","version":"0.17.15","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b830edbc53af60c73cd3f102ac588d3043598aeda981562e97fc4c6b616207b5"},"properties":{"dependency":{"package":"micromatch","version":"4.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cadcc63921175a15b807051f3c060acc2faf5c02080b6a62e715a92294f54ba5"},"properties":{"dependency":{"package":"qs","version":"6.11.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6e2e0ecf85a108b628df4c20f8b8a75d29958d1dfd7969b05f804797c245f14"},"properties":{"dependency":{"package":"uuid","version":"8.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18755dc4dc85f54aa727714e2ac7441cdd2a18af42d9b95aab5e0c6d0043bd7b"},"properties":{"dependency":{"package":"word-wrap","version":"1.2.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a60b15828a85cba6a685b472e0f043b430c81501f3f45136aca410da211491e"},"properties":{"dependency":{"package":"@babel/helpers","version":"7.25.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7699ad63442c000a85c344d2efc782ad8bebc5046411aae064306eb8ff329cb"},"properties":{"dependency":{"package":"@babel/runtime-corejs3","version":"7.18.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9978ff6a45a1ea4d8d54f09694d7e6d709b8fb4a211963e2a192951a63b799bf"},"properties":{"dependency":{"package":"@babel/runtime","version":"7.18.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"gulpfile.js","line":20}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac806cd64e393b5efed7b6aa9e7236e14c625ac7c1f9220eaf85fd38ecaf6973"},"properties":{"dependency":{"package":"@babel/runtime","version":"7.25.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"gulpfile.js","line":20}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1efa621b4c88062290ccee195a73f745d2265617defef9bf57fa373a34cb1aec"},"properties":{"dependency":{"package":"ajv","version":"6.12.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74d283b56ab06c2db3b17f07aa0a2bfa0c5e9822225961861e13ea10f5c698da"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.9.19","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1c900160a7dd09649177b54113209479f9e101a410cdecdcec6dd676fd6cb28"},"properties":{"dependency":{"package":"micromatch","version":"3.1.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd356efee4e7abbb74ec9821c758338f8fc1b3b94298e7fca731ef369c51de65"},"properties":{"dependency":{"package":"micromatch","version":"4.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00ed707afe41e4cd07a94968cefd27f126f4df7d9236a735a4ac504710221974"},"properties":{"dependency":{"package":"yaml","version":"1.10.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37bf2a185ea898177b6e0017e7a6623f0eb71a06c781a885e3b8e20fd0d00113"},"properties":{"dependency":{"package":"@babel/core","version":"7.28.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"packages/babel-plugin-relay/__tests__/transformerWithOptions.js","line":14}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"696950c1aa4ac8042480bf39cdfbb11060aa9dd830b45962f66317e71dac10ad"},"properties":{"dependency":{"package":"@babel/core","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c3b5e506ce2842c7c3c97f26df41d0d9f9646a57f69abd5bb1f88f5a0ad1b36"},"properties":{"dependency":{"package":"@babel/core","version":"7.25.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f8a3ea6bd5bc95f6c80a6d6760a1a911dee29ed0294dbde28364c6443346d7d2"},"properties":{"dependency":{"package":"@tootallnate/once","version":"2.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b055c65404bc0c8fcb9780a1ee5fced26a176eadf2c50d33140be0f4ffe07ee"},"properties":{"dependency":{"package":"deepmerge","version":"4.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf7089680723cc061c6419f11d02591d42996c661f85e30b9f2bf8a55298269a"},"properties":{"dependency":{"package":"es5-ext","version":"0.10.61","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/test.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a7225d3dbb3195563c921a262de7d46eceeabae4f33347c4f7305aa029fecc"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir-diff/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7433ca41f437d148e5541c9aee1b090cffab016d6c7b3a50aed9d3c05a1f0d3"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_connections.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"273dbb28173dd707ddff89463e5be77a12f20cd3e87c59cfb81cd14a84c3ee2a"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_relay_resolvers_operations_for_nested_objects.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a9de518bca254ba00ed0b88d1ec6d9727fa2cbfe5ee20f1d1f17694ee62ffe"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/rename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4277cc49755cc4cb1d61c0aabb3bb8e1b5cc639c03a8d79089cbf419f30ac004"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 74 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: compiler/crates/graphql-text-printer/src/prettier_doc_builders.rs, 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 (and 66 more) (79 orphaned of 344 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; 344 of the 445 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_doc_builders.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46460f36a8d6e5f77b18a4aaaa2a8715d4bb23410c6326552b3c6ab1e202b1b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/common/src/diagnostic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bb1b0432f8749d9a496cac946b6db64ccf07b006ee1a0666538a61571ecb25"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/node_resolution_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f7cbfebbdd984027b21044ab1293373a5d5ed30c0d06d8f4cdfbe44adabf15"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_updatable_fragment_spread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d742d59757f5d98090ec78f28b9f95f9613d7fe5775b9ec8e945cdc95e8c0a05"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/suggestion_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2b1f9dabfce3205798e7b251d003467706ea4c4594d20ba3f9103dd338d52f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/definitions/interface.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16321a0ea0070d62688d48b17bb63b752e381f70f2290a21f7563e233ebefc80"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/transform_assignable_fragment_spreads_in_regular_queries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aa786288b8fe7087717a4e64a7d5fc74a4c7f382ae5dde76e3a9a3ef29220e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/code_action.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e6a0bc9edd6bfe4a8082d0fa04003bcc035aacb73d06ab68597e6fed8ae587"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/graphql_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61688a7a541c2960feee45c0be22a477eafb3dfa4f4cc83ea5417c08b9a8c25"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/constant_value_root.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4198ae6e608ed9d88c344869e7bc29a4a0e683982818b72d7e032e380aa13a5e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/code_action/create_name_suggestion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec20d44aad9cb15fd6ff84fb1dba9371731f259ab8e17a07c41c80e6b6ac7085"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/subscription_transform.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ca73812405c968f4261b40816b69936c6b448d95f5352ca89663c66faa7c6b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/find_field_usages.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"794d924fa65ffd775c631d4f273b2a1c91902b499dbf134f3f2a7b844c3c20fa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0925b828720cda0e4b88eca1b96d842c88028c20f2c0c8609c9df584786a62b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/node/executable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e9d8d48fa05238d6fda7a0519ce961584141baecf4c769854fc5466f426fe7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/interner/src/bytes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb84fb8d2f142cde5e059b2ce2c9da0da1dfd39c1222418668e58454f5303015"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/sort_selections.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68af077bf2633e948866177c430e250216200a52332f93ecd607aa94797335ea"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/print_ast_to_text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92728105663b8841581f4eff5438d07466bf255383f0766d30d564ce8fe2766b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/intern/src/small_bytes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77edc173bff1fbf56947fdcda361aea92f41c3de8913c42022145d147d12a1d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"584948dab9c5aac6a6aa7c31390f97fde7910e05d0072647bffc2f106561b40f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/dependency-analyzer/src/minimized_executable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bccf1f03bb629a9070276f0338b7dc9408100586631cb5c1ce01d29ab5f2ef8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_typename_union.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c316ad443bc481c60752df5c829e89a7269aa775c18a46cf9917d4c8ad80e0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/refetchable_fragment/refetchable_directive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3c74787fa9815e7909c16f7eb9c55593cba57a0f99f295c51d181518753b5d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-docblock/src/untyped_representation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03d2bd3a546754554ea33ce77ab6780e421fa8404526ede7629a738af82c983"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/intern/src/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"741ce7b0bba31aa7034969d945fa8e313bc8911dcadc3881077a40167f0e67d7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/argument_root.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efceef2b948af9fe53049253fa8934aeef880073555341e68ba3e30060403c37"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_module_names/extract_module_name.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d7bfbeb42210d276df37c3c412d14a3a2473834bcd3b51c236929d8e70a7d2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/resolution-path/src/variable_definition_path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63682e8229e912b76f1817ad1e10f7861c41b29c7507a244898263ebc0d29b6a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/associated_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"787d4c96eb3bb3a598546268dbb469b1e4452381e2a950f7e0024ef8501cae41"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validate_operation_variables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab63de3dff2681b5292ec9a3f2dba05dc76c9ebb9a40caffbd159de368e58cec"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/refetchable_fragment/validation_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6379652ef4c19966bb0b3f1550f683d8ffba205f1dbfaf4a6e5a1d2ebac34883"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-cli/src/source_printer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf2dce8d20ec697de0bd8c87383cf338bb4785c117e2ccfb3e9df369f7eea46"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/ensure_discriminated_union_is_created.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad31da5433be604a13a897e93d3508e322dd08cac48f6fcfbbb1e360afd3275"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/validation_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdef1f793a254cd2de7e96b59e9a033f51e29b8a003dd36b3caf9f4cceb20f6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/disallow_non_node_id_fields.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d0a6df59e5b1294aa61ecc5bce7b418ac5c51b7a7bc8d86b63fae9bc61e090"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/common/src/diagnostic_check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d7926afb7be8df417ba6ada42b6599bcd46634d1e9d544f8f71957a0c9021b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/generate_relay_resolvers_model_fragments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a425da4762175931c1a48d8f2b973c30cbc47dba6f07058da922d1c263a7626b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/intern/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"460405cb007c2eb0360bfe465813a9102665f9f9e11ddd37f52163796cfd568a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/daemon.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28e6aa52c02d9c77e2b6d47fec2f7a680263708fe15e080cd0c363dbe3ca711"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/typegen_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ebd281324825bfa985caf883a3138670d20e75afef2b87c0c08e4f82c0de74"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/hash_supported_argument.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"743842b3a7454253037a16e9a11f15fc579d1e2b5ff4a7352ff0222b0f066a26"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/source_control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acfceb98cf6799ec48fdd5127966053524d807e9b2e674db5b2f6b33ea2b752"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-watchman/src/subscription.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b22cefff1a58e4b8fb13a13613c0a92e3220a4bef3773038ce2bb8fe3293799"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/handle_fields/handle_field_transform.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c89f6cc53f3e30171339d5b71a670edda993c7171c47e47b3009a5d8442e9c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/errors/src/error_combinators.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce3bdd89f634baef47a7ea395fc69cdef45aeaf77e99d325af697f881746d24"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/hash_arguments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48535b3a05d1b552e6773b9beb8b83e81494b26ab28550ca574819173ff150c0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/transform_assignable_fragment_spreads_in_updatable_queries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"864bd8ce4cc9987079e31b5e1cc16404eeef7cef029dc8ae1366cd1c001865fe"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/apply_custom_transforms.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d843da039725ff71c587452b674ebab461eb61faef3c58e8e245db4d6d74286f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-documentation/src/sdl_schema_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06a4026e702a6ebbe8513ba3452aee7a837d4d8cdf1d106f9c4b4efe20a12fb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/resolved_types_at_location.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c3705c99af75de24138482e52a34851c54fbfbf7986fdd6b08410dce03ce42"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/file_source/walk_dir_file_source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a93574f5ccba75c53bc51d2e05f78ff284690c8b17304a89f639727e90191f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/interner/src/generic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c12b260af926effe708fa785223d80f1e6397f5bef6aabe5148b83cb8029137"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/node_resolution_info/type_path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b959bad953bef4a5aa68a90ef9e78adae93835b492404d5d208667f506be310a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-cli/src/diagnostic_printer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a909174e5316cdb361c95aba6f116aaad4ebdd3b7e3a4cd946fd69539dda09a3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/hover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a541cb5c938a20bf6e433126a057f7c15ab90f9cc92ea5b96ec211a919ded434"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/lsp_notification_dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6a11ebf5423c85b4fce6c20c85af8afc1fb6e6daf7a4eb6700310657a47b7d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-text-printer/src/prettier_document_printer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0932b6f4ab158a92c8fb897a2393885efc4e052277504ea95219fba9dc4528f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_module_names.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"537910528345893a5d8b183d74f04892da7e4df3642e25840f6a47be5a2bb5ae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_static_args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15565f3f6b5352c6361e186ebe8b59b403b3350c6f1c7270bce93a6d4d527c69"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/artifact_content/content_section.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55530ab21e3b36ecea968515ad63694ad35d6887b4c09eb9083730fc512e9018"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/relay_directive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"055cccf15b002ed7e64bf9e856e6551d17f9d82dc278c10b90a5ec4765d66f23"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/server/task_queue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78230c85f4e20e449dbe82402d39ff5440fda732879b196dd5f9feea03acabd4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/assignable_fragment_spread/validate_assignable_directive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7a0187964faf8d1ce211395151bbd8bb1683d9ed05fb1d699f4e94d6e6a1c0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_unused_fragment_variables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e968e1626af032a7553cb6f9b72d3faaf8ff10831eb657ff026adecdf481fab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema-documentation/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b9caae71ce27e11429a35f46dbb7ce87d59886aa67f9cc675fe54e031b10bc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/validations/validate_no_unselectable_selections.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec4a25718a67931baa9919a150be8657e760d73f05d2ff2a87073c9774954b8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/murmurhash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d22fce030103824552122ff8c4653f13462d35652adc4627a5dade2c42ee2b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/remove_base_fragments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f04d5e8baff34ba5d765238ed854f2e43e28ad0ff4d59b7200e03313ed9a5a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/match_/split_operation_metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47384fd0f24f51a70a633b1c21840d18fc79c44a3da89279ed0ec24eddfc0263"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/print_operation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2e8743c5ec07cb5cabf156314c0e951878f6b81e35423a8589bbfe35d780b0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-syntax/src/node/value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba82bba76319c2ab72a357678605f00f1c521dd97aeab0eb895931bfceb2fa1b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/defer_stream/directives.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd3ccebc9cde27686fc7f4617be2d6e211f602ff5ce7d359e2dc578cefe6ea5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-lsp/src/text_documents.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40ab955d8c60430e5c136ec0e4e2daa2d196c7d62543c3239321cb530ba8e6d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/connections/connection_constants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8092d06565c0dec2efed4f1d663303b459770423df36d3565d4fff4ae7b473b4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: useEntryPointLoader.js \u2194 useQueryLoader.js: \u0060packages/react-relay/relay-hooks/useEntryPointLoader.js\u0060 and \u0060packages/react-relay/relay-hooks/useQueryLoader.js\u0060 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\u0027s 10,000 most recent commits rather than its whole history \u2014 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 \u2014 a sibling reference still needs an import \u2014 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 \u00608c30f80f\u0060 A couple grammar fixes (#5008); \u00601fb4eee8\u0060 Add type Annotations to the source of sync\u0027ed relay code [4/n]; \u0060bc2aa934\u0060 Revert D70524672 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useEntryPointLoader.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c71e1ea682e4a4a1087a85e90d1e6b163f9aafa1ef3d63ddca5a7351b56486"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: flow.rs \u2194 typescript.rs: \u0060compiler/crates/relay-typegen/src/flow.rs\u0060 and \u0060compiler/crates/relay-typegen/src/typescript.rs\u0060 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\u0027s 10,000 most recent commits rather than its whole history \u2014 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 \u2014 a sibling reference still needs an import \u2014 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 \u00600b4433d0\u0060 Make GenericType accept more than one type argument; \u006000eeeb48\u0060 Resolvers that return @weak objects; \u00605892beae\u0060 Make everything sorted by default \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-typegen/src/flow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ca3124522d4796050dee4ff8c82d3d09040334b1ac529b18e6f8367dddcc4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: docblocks.rs \u2194 utils.rs: \u0060compiler/crates/relay-compiler/src/docblocks.rs\u0060 and \u0060compiler/crates/relay-lsp/src/utils.rs\u0060 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\u0027s 10,000 most recent commits rather than its whole history \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u0060b645a05d\u0060 Small ownership change; \u0060e8f5e8fe\u0060 remove project config legacy resolver syntax feature flag; \u0060b26f3bef\u0060 Remove @outputType feature flag \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/docblocks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc0217a50c17448ce028cdb19bc0048c53d1105051028e0e3e1002e58fff76c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: docblocks.rs \u2194 lsp_state.rs: \u0060compiler/crates/relay-compiler/src/docblocks.rs\u0060 and \u0060compiler/crates/relay-lsp/src/server/lsp_state.rs\u0060 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\u0027s 10,000 most recent commits rather than its whole history \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u0060b645a05d\u0060 Small ownership change; \u0060e8f5e8fe\u0060 remove project config legacy resolver syntax feature flag; \u0060b26f3bef\u0060 Remove @outputType feature flag \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/docblocks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcc0312852eae4b1595f91d42236cb4f293cbcfdefc12b7a4d9d0bb58d27cd2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: RelayRecordSourceProxy.js \u2194 RelayRecordSourceSelectorProxy.js: \u0060packages/relay-runtime/mutations/RelayRecordSourceProxy.js\u0060 and \u0060packages/relay-runtime/mutations/RelayRecordSourceSelectorProxy.js\u0060 change together 65% of the time (11 of the 17 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\u0027s 10,000 most recent commits rather than its whole history \u2014 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 \u2014 a sibling reference still needs an import \u2014 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 11 shared commits counted here, the most recent 3 are \u0060b5387f72\u0060 xplat/js/RKJSModules/Libraries/Relay/oss/relay-runtime/mutations/read\u2026; \u00600c57cd2f\u0060 Rename readUpdatableQuery_EXPERIMENTAL to readUpdatableQuery; \u00608b9470c5\u0060 add readUpdatableQuery method without removing readUpdatableQuery_EXP\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayRecordSourceProxy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0705dbb0c6e23cd98c5e026833120f3d106330ee188f59f3fbc155ff0bc3f73b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: validate.rs \u2194 validations.rs: \u0060compiler/crates/relay-compiler/src/build_project/validate.rs\u0060 and \u0060compiler/crates/relay-transforms/src/validations.rs\u0060 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\u0027s 10,000 most recent commits rather than its whole history \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u0060207b6d0f\u0060 Emit disallow_required_on_non_null_field as compiler warnings; \u0060572a90f6\u0060 Validate that client schema extensions within @throwOnFieldError have\u2026; \u0060ad262841\u0060 Make required-on-non-null-within-throwOnFieldError an LSP warning \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/validate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fc5507b56a8250cc860b4081ce1dda9ce6c62486848216d5217739bdfebcbf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: build_schema.rs \u2194 lib.rs: \u0060compiler/crates/relay-compiler/src/build_project/build_schema.rs\u0060 and \u0060compiler/crates/relay-test-schema/src/lib.rs\u0060 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\u0027s 10,000 most recent commits rather than its whole history \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u006030321ada\u0060 Rename build_schema_with_extensions to build_schema_with_extensions_p\u2026; \u0060d2718289\u0060 Transform semanticNonNull into regular non-nullable at schema build time; \u0060d80203a8\u0060 Add locations to server sdls in build_schema_with_extensions (#3860) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/build_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a86f3f4f6d87692ac3faceefdc5e72da976d97f72cfed874d8126f1492e333d"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 18: packages/eslint-plugin-relay-internal/package.json declares Node.js 18 as this project\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/eslint-plugin-relay-internal/package.json"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6648803ca1184d1b831cc0935c1131320f0ac2f71c390fad75199d5bf2e7db6"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 6/12 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060compiler/crates/fixture-tests\u0060, \u0060compiler/crates/persist-query\u0060, \u0060compiler/crates/prettier-format\u0060, \u0060compiler/crates/schema-validate\u0060, \u0060packages/relay-compiler\u0060 and 1 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 717 plain JS \u2014 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 (\u002B711 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (1253 matched lines \u00D7 2 locations): packages/relay-runtime/store/RelayReader.js:128 \u00B7 packages/relay-runtime/store/RelayReader.js:2050 \u2014 the two spans are one implementation copied and then locally edited \u2014 6112 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3504239c1cc53b8f6f937e4f45030bfec670887a2df98b31ef6bc819a3c8963d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (508 matched lines \u00D7 2 locations): packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js:62 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js:74 \u2014 the two spans are one implementation copied and then locally edited \u2014 2467 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"da869e7908805aa3d69eb306269b8b376f9f3179f5a3bbff7a5dafedb4e46fd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (265 identical lines \u00D7 2 files): packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js:16 \u00B7 packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js:15 \u2014 these 2 files are line-for-line copies of one another \u2014 265 lines are identical, in the same order, in every one of them \u2014 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) \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f32ccb81f41db40aeee734afbcdab0c04dd0afb5ecd1120030bb6df0e3b915"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (221 identical lines \u00D7 2 files): packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js:14 \u00B7 packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment_EXPERIMENTAL.js:14 \u2014 these 2 files are line-for-line copies of one another \u2014 221 lines are identical, in the same order, in every one of them \u2014 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) \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bb7dceb3e1a435305841bd11030e9d5e44650c10a9f98f8d885d2c675f497f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (119 matched lines \u00D7 2 locations): packages/relay-runtime/multi-actor-environment/MultiActorEnvironment.js:278 \u00B7 packages/relay-runtime/store/RelayModernEnvironment.js:233 \u2014 the two spans are one implementation copied and then locally edited \u2014 484 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/multi-actor-environment/MultiActorEnvironment.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"006e457e1da5909eaa912f77ecc3aac62c8de4a731f2b0b69b8651047da52677"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (101 identical lines \u00D7 2 files): packages/react-relay/relay-hooks/useLoadMoreFunction.js:14 \u00B7 packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js:14 \u2014 these 2 files are line-for-line copies of one another \u2014 101 lines are identical, in the same order, in every one of them \u2014 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) \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useLoadMoreFunction.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a1ae2093bf7557e1b817aa5a84893d73532ba39f21994cfb11e4d2280368b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (81 matched lines \u00D7 2 locations): packages/react-relay/ReactRelayFragmentContainer.js:80 \u00B7 packages/react-relay/ReactRelayRefetchContainer.js:136 \u2014 the two spans are one implementation copied and then locally edited \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayFragmentContainer.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f69872297670744d0671fb623327853d61761cebd5b4db8b866b7925bb8cd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (72 lines \u00D7 2 locations): packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js:32 \u00B7 packages/react-relay/relay-hooks/__flowtests__/usePaginationFragment-flowtest.js:32 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"55507c4c844398311370bdd8159c47a8211777237f9daedd2fab3db1cccb6b94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (67 lines \u00D7 2 locations): packages/relay-runtime/store/RelayModernRecord.js:360 \u00B7 packages/relay-runtime/store/RelayModernRecord.js:835 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c312df41675f58d6a583b3629293f335ba0c7438e73b6d25c761ee55651e11b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (56 matched lines \u00D7 2 locations): packages/relay-runtime/store/NormalizationEngine.js:423 \u00B7 packages/relay-runtime/store/OperationExecutor.js:1591 \u2014 the two spans are one implementation copied and then locally edited \u2014 320 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/NormalizationEngine.js"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13c0c1e71eff0ac9a7eb7d4e146320b7d012cdd2958aea6e2fa6929af570ba3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2 locations): packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:99 \u00B7 packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:82 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"800a49076278f4534d573321a881d181eed66447d2c361b5141e8841bd03bfeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (51 matched lines \u00D7 2 locations): packages/react-relay/relay-hooks/useQueryLoader.js:49 \u00B7 packages/react-relay/relay-hooks/useQueryLoader_EXPERIMENTAL.js:37 \u2014 the two spans are one implementation copied and then locally edited \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useQueryLoader.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39dcd34472799d733f6a54cb010cc0010821b3c39f5fc62627b8911ca8a64d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (49 matched lines \u00D7 2 locations): packages/react-relay/relay-hooks/useEntryPointLoader.js:112 \u00B7 packages/react-relay/relay-hooks/useQueryLoader.js:177 \u2014 the two spans are one implementation copied and then locally edited \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useEntryPointLoader.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"58969e23bffda07d3bdf302642f7e4d9962426e8c5e1cb2d9fc8e3863308fe37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (49 matched lines \u00D7 2 locations): packages/react-relay/relay-hooks/usePaginationFragment.js:34 \u00B7 packages/react-relay/relay-hooks/useRefetchableFragment.js:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/usePaginationFragment.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"42de3a8fe5963302b64d30af20c108002eaf0b647cf999b4c5d2266e52605d4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (47 matched lines \u00D7 2 locations): packages/react-relay/relay-hooks/legacy/FragmentResource.js:639 \u00B7 packages/react-relay/relay-hooks/legacy/FragmentResource.js:769 \u2014 the two spans are one implementation copied and then locally edited \u2014 179 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/FragmentResource.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"f841719f409555759c483b2b329ebf55985789ab7fcd353c30d14ee278a6ec9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 3 locations): packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js:77 \u00B7 packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:99 \u00B7 packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:82 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3592968119ca5ed8433b0d546bfb52a21213c3a7c5f04d3de486980a31a17f20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): packages/relay-runtime/handlers/connection/MutationHandlers.js:107 \u00B7 packages/relay-runtime/handlers/connection/MutationHandlers.js:185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/MutationHandlers.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad3cc6832e30b950d4375c91afa7f655f8e1ca3651e73e7c3ab39ebba32cb85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (36 matched lines \u00D7 2 locations): packages/relay-runtime/store/NormalizationEngine.js:320 \u00B7 packages/relay-runtime/store/NormalizationEngine.js:832 \u2014 the two spans are one implementation copied and then locally edited \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/NormalizationEngine.js"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c94e76fee81c7b7c669c4a4d659ff26c6650f459d80432528e250f6365137c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): packages/relay-runtime/util/getPaginationVariables.js:34 \u00B7 packages/relay-runtime/util/getPaginationVariables.js:70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/getPaginationVariables.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"708fdf0f582e059b757153f197d07d17608d3c353c3efc67d60e3f4542f61852"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:89 \u00B7 packages/react-relay/relay-hooks/prepareEntryPoint_DEPRECATED.js:49 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeabc64f703c391dbcd414746b52d23f38fe31899c8382bfd24256094b053b11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:64 \u00B7 packages/react-relay/relay-hooks/loadEntryPoint.js:25 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6ee201c8346d8dc38a568d6ada40e11fd22398eea06d093ddc0719b20e7b86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): packages/relay-runtime/mutations/RelayRecordSourceProxy.js:176 \u00B7 packages/relay-runtime/mutations/RelayRecordSourceSelectorProxy.js:132 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayRecordSourceProxy.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfb2cb32d51e8cfb69fe857f52909ca8a71f9eedecb00faf24fe376fc87da3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): packages/react-relay/ReactRelayFragmentContainer.js:168 \u00B7 packages/react-relay/ReactRelayPaginationContainer.js:463 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayFragmentContainer.js"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"79316b237ce451860f150e753c39c5cda0c4ec03494bea0a4684c6ed79c21794"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:25 \u00B7 packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:24 \u2014 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 \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f98994fa28b96ebe2a77f60e4becc38f5939916b9374ca5a2bcc5646b639b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): packages/react-relay/relay-hooks/readFragmentInternal.js:183 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js:416 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65ecf0ba11d9fe5d0a900c8dae951d344d319648ebdd50777e43cd6300969c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3 locations): packages/relay-runtime/store/NormalizationEngine.js:154 \u00B7 packages/relay-runtime/store/NormalizationEngine.js:307 \u00B7 packages/relay-runtime/store/NormalizationEngine.js:819 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/NormalizationEngine.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c05ae41ecd3c8e219bd466a300d309b0445f2e681e9c35addbb3c116c2623a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): packages/relay-runtime/store/cloneRelayHandleSourceField.js:33 \u00B7 packages/relay-runtime/store/cloneRelayScalarHandleSourceField.js:32 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/cloneRelayHandleSourceField.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"feafb14064d8d225629b733677a1ee5a0acbb22210449c0b3abe8b746ad48d5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3 locations): packages/react-relay/relay-hooks/readFragmentInternal.js:265 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js:711 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js:833 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"f115f744c8b31e35b2dbf234e4b0c406b3edf8060b4cb5f36f53607a9d7727c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/relay-runtime/store/OperationExecutor.js:1440 \u00B7 packages/relay-runtime/store/OperationExecutor.js:1467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21c5204a7a72b79de5ed53faf3ac9727c9e2c18fd28ae9225b3c235419cb1b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:576 \u00B7 packages/relay-runtime/store/live-resolvers/LiveResolverCache.js:621 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff06f151f600de843857703c2b5e47e59ac34c7d2bfd1169c533bfaa171eeb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/react-relay/index.js:101 \u00B7 packages/react-relay/legacy.js:62 \u2014 the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/index.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3f1aacd383efa0b7c953de1a7fdd631444082c3b46faa474d954259b1fc747"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/relay-runtime/util/recycleNodesInto.js:24 \u00B7 packages/relay-runtime/util/recycleNodesInto.js:85 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/recycleNodesInto.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2f2bce30f6e5d6c64483b9d6c8e2738f286c7576c5efbca1997eb89de8a711"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/relay-runtime/handlers/connection/ConnectionHandler.js:333 \u00B7 packages/relay-runtime/handlers/connection/ConnectionHandler.js:437 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/ConnectionHandler.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd90565904a1d96e613d9f2839b911b7d71a894f4b1c304566a8c021077333c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 5 locations): packages/react-relay/relay-hooks/readFragmentInternal.js:60 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js:77 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js:98 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js:89 \u00B7 \u002B1 more site(s) not listed \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cbe982e277ea321eabcefc50ea538b8a56c2360b44d890b8fb8abd4e3d2c19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/relay-runtime/store/RelayModernSelector.js:264 \u00B7 packages/relay-runtime/store/RelayModernSelector.js:367 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernSelector.js"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a491e8dac4208f25649b6869d9ed41d7ca11d673f540fa83ec8f0a3f6dba749"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/relay-runtime/store/RelayStoreSubscriptions.js:156 \u00B7 packages/relay-runtime/store/RelayStoreSubscriptions.js:177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayStoreSubscriptions.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd21b9a1b153ee1673e8ff9b942cf7dd5389069d8fff528b39dd244cc642cc5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js:47 \u00B7 packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js:32 \u00B7 packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js:31 \u2014 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 \u2014 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 \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e96f30e0a5e52fb912871981a2b7bbb522f479004981666b6e78c3f62974df6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/react-relay/relay-hooks/EntryPointContainer.react.js:55 \u00B7 packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:218 \u2014 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 \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/EntryPointContainer.react.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ede2fb631e0771aebb75d1af03700e8693baed554383ef789ed99b24d03296"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): packages/relay-runtime/mutations/RelayRecordSourceProxy.js:108 \u00B7 packages/relay-runtime/mutations/RelayRecordSourceProxyOptimized.js:61 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayRecordSourceProxy.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"183cf2b14c0317ce928a488ebf771c8cec4326bed1090e79196b8fb6b7685f30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/relay-runtime/mutations/createUpdatableProxy.js:300 \u00B7 packages/relay-runtime/mutations/createUpdatableProxy.js:351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/createUpdatableProxy.js"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9966af537f84e7b13e4dc32219a2a8db20801884360062e383105fd7be4c244b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/relay-runtime/store/NormalizationEngine.js:184 \u00B7 packages/relay-runtime/store/NormalizationEngine.js:851 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/NormalizationEngine.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aff52a141e458c703f51c96675ed479d4e599fd75bfe1916e66145866d5c09a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/relay-runtime/store/RelayModernFragmentSpecResolver.js:157 \u00B7 packages/relay-runtime/store/RelayModernFragmentSpecResolver.js:174 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernFragmentSpecResolver.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f699cf4dad81f328555ecb877bf1fcf3e56b902a591c7ea6faedc12fba1b82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): packages/react-relay/ReactRelayRefetchContainer.js:378 \u00B7 packages/react-relay/ReactRelayRefetchContainer.js:407 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayRefetchContainer.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"01350807893dc103b78c4d570c9e7c9624affde990922f2c1bce0bdbf4ec84a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/relay-runtime/mutations/RelayRecordSourceMutator.js:209 \u00B7 packages/relay-runtime/mutations/RelayRecordSourceMutator.js:235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayRecordSourceMutator.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8607cccf95b4ce2b52ff3d1602226828e32914ffda1921e85e4323563fba291c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/relay-runtime/query/GraphQLTag.js:78 \u00B7 packages/relay-runtime/query/GraphQLTag.js:100 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/query/GraphQLTag.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83e3972b7f9ec389de73c964fb1d77b68381b1716a81bada72c060445362da5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): packages/relay-runtime/store/DataChecker.js:240 \u00B7 packages/relay-runtime/store/DataChecker.js:276 \u00B7 packages/relay-runtime/store/DataChecker.js:318 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/DataChecker.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"280028fa2f3cba24cee9a326d3832d591e172e8ec1cca7a586b532e8390dd5cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/relay-runtime/store/hasOverlappingIDs.js:18 \u00B7 packages/relay-runtime/store/hasSignificantOverlappingIDs.js:21 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/hasOverlappingIDs.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a57acca7ddcb964f176a0321c05f951064d2af908a3f70c5054340b3b77b2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): packages/react-relay/relay-hooks/readFragmentInternal.js:100 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js:224 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js:242 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61d5665a97d91ad237038127ce8f642aca91a1192c5049f91bf9c482a13fc7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/relay-runtime/query/fetchQueryInternal.js:230 \u00B7 packages/relay-runtime/query/fetchQueryInternal.js:274 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/query/fetchQueryInternal.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f765d95f135905c086ce0333e63002f3b56cfa33e1d1f23411b259db598d123d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/relay-runtime/store/RelayModernRecord.js:658 \u00B7 packages/relay-runtime/store/RelayModernRecord.js:689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"801323652a04ddad8bb5f24bf2373e357c79b7dc5789a70763d193040a95d69a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/relay-runtime/store/RelayReferenceMarker.js:554 \u00B7 packages/relay-runtime/store/RelayReferenceMarker.js:571 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReferenceMarker.js"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a730d1be8efb95805952460ae1e7e4f992fa27af65265e0861c8927fd156946b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/relay-runtime/mutations/RelayRecordSourceMutator.js:165 \u00B7 packages/relay-runtime/mutations/RelayRecordSourceMutator.js:187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayRecordSourceMutator.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f27369da3553e209c8a7c46a0aab751bccadce6436f6575b08f31f42b6d0ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): packages/relay-runtime/mutations/RelayRecordSourceProxy.js:94 \u00B7 packages/relay-runtime/store/RelayPublishQueue.js:376 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayRecordSourceProxy.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e64ee0359ed4ecfa614565e4736736afa9619a989a3bd34af57968ab6b7125"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/relay-runtime/store/DataChecker.js:459 \u00B7 packages/relay-runtime/store/RelayReferenceMarker.js:345 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/DataChecker.js"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dd25e8d2feaee0b692d7127d5e2a5b76ba032a755f5057e7ed6e0171d117a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): gulpfile.js:123 \u00B7 gulpfile.js:137 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gulpfile.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceceb7960af7d7e78470251461f8edf97d874e4f035a78756290922a4c593ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/react-relay/relay-hooks/readFragmentInternal.js:238 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js:604 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js:662 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe444acae76456d822f39402b975b0e67025fc6d638e33f47d152c19bdaa1ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/relay-runtime/multi-actor-environment/MultiActorEnvironment.js:328 \u00B7 packages/relay-runtime/multi-actor-environment/MultiActorEnvironment.js:363 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/multi-actor-environment/MultiActorEnvironment.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f71997382817b48f2e80b2a9890a9d500581494f4bc1dbc378a7017a2086100"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/relay-runtime/store/DataChecker.js:559 \u00B7 packages/relay-runtime/store/RelayReferenceMarker.js:537 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/DataChecker.js"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecc19271fca73cba76afda42583bd266190801306c51bcd3d7a0c2930274bc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js:182 \u00B7 packages/relay-runtime/store/RelayResponseNormalizer.js:233 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f03ab3c6ecc7bafc5d4d066b74c4ac7530b44813094bc67975ac85922ce4d03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/relay-runtime/store/RelayResponseNormalizer.js:286 \u00B7 packages/relay-runtime/store/RelayResponseNormalizer.js:424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cdcbd83286292c939423cd50ce454a70b938ecce300e9a1398d1f7d1dfda85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/react-relay/relay-hooks/legacy/FragmentResource.js:758 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js:188 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js:202 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/FragmentResource.js"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"13314af2fe3adca5b0cb1421143f3c4e582d8f705a659a951bd93f454628b9ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/react-relay/ReactRelayPaginationContainer.js:462 \u00B7 packages/react-relay/ReactRelayRefetchContainer.js:225 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayPaginationContainer.js"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"573aaf95cb2d6c9aa769267c10f019ec07a30924813421c23379670e27e407fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js:271 \u00B7 packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js:307 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66664131f76f0133ebaf334c58d56df4a8ea55bfbe274820fcf8c4a987ade32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/relay-runtime/mutations/RelayRecordProxy.js:64 \u00B7 packages/relay-runtime/mutations/RelayRecordProxy.js:85 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayRecordProxy.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fe7b11c106b85b1410c367372551770a478a98fe0e3cc944fc05ef5c3416ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/relay-runtime/handlers/connection/ConnectionHandler.js:225 \u00B7 packages/relay-runtime/handlers/connection/ConnectionHandler.js:234 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/ConnectionHandler.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d575878077a2c6d25b265e1af2b1bd53841d12219332b1574807b1ddebbb572"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/relay-runtime/handlers/connection/MutationHandlers.js:94 \u00B7 packages/relay-runtime/handlers/connection/MutationHandlers.js:167 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/MutationHandlers.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43352965d10cb6bc155c19bdfd94a15705e8fb04e644f475b654bca1b025624"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/relay-runtime/store/RelayRecordSource.js:64 \u00B7 packages/relay-runtime/store/RelayRecordSourceOverlay.js:67 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayRecordSource.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f25b85e50e7cc1ba936e1f09eba8df9a1835dec48233ff521b8984c8afda91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/relay-runtime/store/RelayResponseNormalizer.js:871 \u00B7 packages/relay-runtime/store/RelayResponseNormalizer.js:937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34bddf663b4c004038683bc9a3e25d0ebcba0a088e9a8fbf2bed80bd1de60e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/rewrite-modules.js:63 \u00B7 scripts/rewrite-modules.js:76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/rewrite-modules.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"26053ebe161ba93e7626df45e6ad0f619d826cbe21f85549e94d738233caa9dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/relay-runtime/store/RelayModernRecord.js:720 \u00B7 packages/relay-runtime/store/RelayModernRecord.js:914 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"472c3008fd88403325dc7cacaf1077d5fd5fca5e90806e31fea1dd93f48a888b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/relay-runtime/store/RelayResponseNormalizer.js:215 \u00B7 packages/relay-runtime/store/RelayResponseNormalizer.js:291 \u00B7 packages/relay-runtime/store/RelayResponseNormalizer.js:429 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c20362e4d5acd5d00c421d1151203dc255b29bd2735ddbc7c99bf4fed713d87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/relay-runtime/mutations/RelayRecordSourceMutator.js:186 \u00B7 packages/relay-runtime/mutations/RelayRecordSourceMutator.js:235 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayRecordSourceMutator.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b0fb6cae6c26a63c2abb5e78cb61756911688dbfcf6b4c720c33436cbdf740"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/react-relay/ReactRelayPaginationContainer.js:14 reaches into another package with a relative path (../relay-runtime/network/RelayObservable) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayPaginationContainer.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"643439902beb2e47e08da0fbf116ad3673d637621098ba303f2b2cd05b46a7e5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js:13 reaches into another package with a relative path (../../relay-runtime/util/RelayRuntimeTypes) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/LazyLoadEntryPointContainer_DEPRECATED.react.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"33779cc821236415f856aee93f6fc05857b95ffceb3c7e3157cea1e9a358b478"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/react-relay/relay-hooks/loadQuery.js:14 reaches into another package with a relative path (../../relay-runtime/network/RelayNetworkTypes) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/loadQuery.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b850852b9b099135285cfeabf66ee254460edf7d659ede9c561a4a7a0ff974f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js:14 reaches into another package with a relative path (../../relay-runtime/network/RelayNetworkTypes) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"567f8842c3ae7b5b0bb8a55e8ac7c5e487daede414989851a7c1f27cf218d857"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/react-relay/relay-hooks/prepareEntryPoint_DEPRECATED.js:13 reaches into another package with a relative path (../../relay-runtime/util/RelayRuntimeTypes) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/prepareEntryPoint_DEPRECATED.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccd91521651621e81e1d1164eb869fd867c56c81edbd160a6482338587da979"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../react-relay/relay-hooks/preloadQuery_DEPRECATED) \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa28c0263c6e70ceaa3390afe59d4523cc643a7a0012ca69900e3774a72e22f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../react-relay/relay-hooks/RelayEnvironmentProvider) \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5015f4c148ffd2c024f87b716b915238ad93304d2eb3409a8bdb14c53e2fee0a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../react-relay/relay-hooks/useFragment) \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89232a0f93ac815be34fe680592bf1db7f533c6ca1556516c54d8af9b245bb4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../react-relay/relay-hooks/useLazyLoadQuery) \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"095b55206ce535af60a513a99b1a968ed7f1ab1220e6c0f2a1c7414745d5650c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../react-relay/relay-hooks/usePreloadedQuery) \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/__tests__/RelayMockEnvironment-test.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a654dac14db9bbfce3e9983559685577d5a965098b136d8fb87400df1f476c88"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/relay-test-utils/__tests__/RelayResolverTestUtils-test.js:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../relay-runtime/store/ResolverFragments) \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/__tests__/RelayResolverTestUtils-test.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f24bd8530155a0fe6cfba0ce876276e4eaad474e431eb549a055d015cd4560"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createContainerWithFragments (cyclomatic 58, cognitive 66): createContainerWithFragments has cyclomatic complexity 58 and cognitive complexity 66; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayPaginationContainer.js"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4bb3c38d28c0841ffb604c8e25680b3bec09cdac935010876a505debd46e40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 56, cognitive 69): (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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/RelayMockPayloadGenerator.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9882b17fadff5b53622537365fd2867a5ab15460a0de5f1fac17a474a99031"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 44, cognitive 83): update has cyclomatic complexity 44 and cognitive complexity 83; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/ConnectionHandler.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ffe5eb173aa6e6b0acec122f64f3ddac917f989b149b197089b3b3e8c5bc0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recycleNodesIntoImplOptimized (cyclomatic 40, cognitive 55): recycleNodesIntoImplOptimized has cyclomatic complexity 40 and cognitive complexity 55; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/recycleNodesInto.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7a9e70aeb0112d3252dd80969f5debfa7f536c0ad942401b8bdf540337d640"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _traverseSelections (cyclomatic 39, cognitive 48): _traverseSelections has cyclomatic complexity 39 and cognitive complexity 48; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fef2b8de5f7f7a727c98e185171e31da94bbcfec252209a444db13cbe262704"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 39, cognitive 42): (anonymous) has cyclomatic complexity 39 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/useRelayHandoff.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5473e67632130a24f429c04db9830ead8223b74d9d7e45ceb4be5463a73859"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readWithIdentifier (cyclomatic 36, cognitive 47): 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/FragmentResource.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"580acf3052d7f79654e23d74a901028c7a54f4466301e121c13c82e72383af32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _traverseSelections (cyclomatic 36, cognitive 45): _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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"2518723fc8a4576e8c030a8df2247f1a93a8c3f7b4c28c22561c9551fb817d2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 26): (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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/ExecTimeS2CDataChecker.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"465fe960325a83df9a04d8d0bfb662f7b7a38901fc8cc3342d0b9660bcdd50ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 31): (anonymous) has cyclomatic complexity 33 and cognitive complexity 31; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReferenceMarker.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfebc389d6914d0f2f77a11e15d66f64a16d366876ab04b5cc9fd96c6a29b68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _readClientEdge (cyclomatic 30, cognitive 96): _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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a61e0df3fe79e748b7e10249b159d4697c26ff7ed6b28dacff5cfaa0462992"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _readClientEdge (cyclomatic 30, cognitive 96): _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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":3002}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7a4fe9444ed93646562ba6422fc44eefa9aad3135d2ecd59211503936ceca7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 38): (anonymous) has cyclomatic complexity 30 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-e2e-test/__tests__/fixtures-test.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"133a0d00914c52b62db07c0b51db300da42952cd1255f52c623c63b754a4ffd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFragmentInternal (cyclomatic 29, cognitive 37): 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fba2130188e1cafcc4c7ebf1c472c1543f906207d17d9425a03e20d77064491"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createContainerWithFragments (cyclomatic 28, cognitive 34): 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayRefetchContainer.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a033e1f1d4f9d8c3ceb1ce10c1d7c434bc785ef228dfb24e23c92def9f9eee05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _traverseSelections (cyclomatic 28, cognitive 30): _traverseSelections has cyclomatic complexity 28 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c557498b36e311b0aacfe196edaaf7e9cc1f360a349dfdeb471de8524a671703"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 28): (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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/DataChecker.js"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c34152655bdb461386e939cef1740028a46b8d8632dd8579c66bd372961c1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateProxyFromSelections (cyclomatic 27, cognitive 19): 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/createUpdatableProxy.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ada4b43130b7f1913ebf800046db7dcfbe2eb4a95d534b377d750e4ff47ec95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _handleNext (cyclomatic 26, cognitive 44): _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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"323d65d7d660d4ee38edb73a4e3da52687be9595e0b409b7664117530588a594"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function notify (cyclomatic 26, cognitive 29): notify has cyclomatic complexity 26 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2537e855a0eb4aea94bd6c1c969c175cb9c8bebd1258025188b6613f79f75124"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _normalizeField (cyclomatic 25, cognitive 43): _normalizeField has cyclomatic complexity 25 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6735cfd760db2a204ae775ea69e506a1f09e3e3a07fd8e46e85bdd32e8fef1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFromCacheOrEvaluate (cyclomatic 23, cognitive 43): 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"629fac6554f191f87dd5f50e1143deb14237c2e158df77bf8152ba2f8f85738d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _traverseSelections (cyclomatic 23, cognitive 34): _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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1100a69670551223c94ca72a64218462e686451017994b2e7dc9323297c31d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recycleNodesIntoImpl (cyclomatic 23, cognitive 20): 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/recycleNodesInto.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9834985dbbc7a415a6417eab953f369ea35f6df103b8ea82042ecfa9e94906ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _project (cyclomatic 22, cognitive 37): _project has cyclomatic complexity 22 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/RelayServerHandoff.js"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8f5da6cd8f6f2a55248c9ca0dd4985afddb86376dddb3c7d627c1e2ac36d77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _collect (cyclomatic 21, cognitive 45): _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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"879dd17620216cfc3398c960e117d4c894bf833d8db9c776221c613d8bc1bcf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 21, cognitive 32): update has cyclomatic complexity 21 and cognitive complexity 32; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"07454ecf1d82aa50cbc2d11fa068653af0e59b33714956fb387ff564e43f2898"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updatePerf (cyclomatic 20, cognitive 31): updatePerf has cyclomatic complexity 20 and cognitive complexity 31; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cec749b4908a5050bb218cee96eecae51dc9b9f3203513949897ae41ec8f8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _propagateResolverMetadata (cyclomatic 19, cognitive 36): _propagateResolverMetadata has cyclomatic complexity 19 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2878}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc3d5449b8048f0507f807bf07106088e14766cb8106ab907c1aa77a240c98c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preloadQueryDeduped (cyclomatic 19, cognitive 23): preloadQueryDeduped has cyclomatic complexity 19 and cognitive complexity 23; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/preloadQuery_DEPRECATED.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b757f511ab0ec40c4b2ed6a225026bb0f7e750ac1f9e1250a82e1540985dca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateTargetFromSource (cyclomatic 18, cognitive 45): updateTargetFromSource has cyclomatic complexity 18 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5af35440cbf3d091fb4bf4b25ae0dee3a0cf05852ebc34693b4875e74b576b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _propagateResolverMetadata (cyclomatic 18, cognitive 34): _propagateResolverMetadata has cyclomatic complexity 18 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f7354f34f2802d911447339e9b1b7d864570178b5d33c4ce9650336cad07e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 18, cognitive 19): constructor has cyclomatic complexity 18 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernEnvironment.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"76680baadaf9f2a05fa96dc2332e0c3a2b33f60c17c71757ddbf28a3b6328882"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStep (cyclomatic 17, cognitive 24): parseStep has cyclomatic complexity 17 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-e2e-test/src/runInteractions.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"057065abc71c18e4e8a19f01bad75c48194db35457a0272984e8a8327a62e0e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 17, cognitive 18): read has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"2622b84325154cdb663f3193e8005d0c4549c515a790ff812bbde7129ea02d5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createContainerWithFragments (cyclomatic 16, cognitive 24): createContainerWithFragments has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayFragmentContainer.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db450a9842d2487f5bfc3892bf8de041ee8512edb844f78d912620f9739df79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 19): (anonymous) has cyclomatic complexity 16 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayDeclarativeMutationConfig.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"896b390685f8ab3f174192d7ef8a65f5f353ec484c35edbb43a1b5d0f00b36ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _mockScalar (cyclomatic 16, cognitive 18): _mockScalar has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/RelayMockPayloadGenerator.js"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a3602da25c619cb8f368516cbf053017389173bceefef309c27790295fce0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function areFieldValuesEqual (cyclomatic 16, cognitive 17): areFieldValuesEqual has cyclomatic complexity 16 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"a928be29e1a2c8aea32385d67f98feded5fa02af6a984a914d331f1d9d71445c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSingularSelector (cyclomatic 16, cognitive 17): getSingularSelector has cyclomatic complexity 16 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernSelector.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3482120b9a1661795f010ab96e14dce5972a83e458c087525f864268d094920f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _registerPlaceholders (cyclomatic 15, cognitive 36): _registerPlaceholders has cyclomatic complexity 15 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/NormalizationEngine.js"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f97d67df4b69287d46a9a4a736b88a7cced2a88ae53bec1f8ced5871bb92e01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _setResolverValue (cyclomatic 15, cognitive 26): _setResolverValue has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fc214d054d9ab6ec291c9c934aa9686cd3f779b0020bb6ac2cf8df29025deb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printASTImpl (cyclomatic 15, cognitive 23): printASTImpl has cyclomatic complexity 15 and cognitive complexity 23; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils-internal/printAST.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"615e87f086b8a577a69bcd978f7190f97f731545dc9d7af39239222599cded97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _handlePreNormalizedPayloads (cyclomatic 15, cognitive 15): _handlePreNormalizedPayloads has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff20df0bdd8c4f524709407eac8da38020d7e6fbf1c5916305aab88a2c373534"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _updateSubscription (cyclomatic 15, cognitive 15): _updateSubscription has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayStoreSubscriptions.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b160ef420b6e995e30094fd31cc816149ce2610f037251f5a081fb1db678908a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _traverseClientEdgeToClientObject (cyclomatic 14, cognitive 33): _traverseClientEdgeToClientObject has cyclomatic complexity 14 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReferenceMarker.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7f27402ac70f160477ec14fc6c5324ec30036f3e59952c11c17449a6f01670"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 21): (anonymous) has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/MutationHandlers.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08c49ed92610b3c05ffa0a1587a04f7abffe2aad9946e4862d43dfbaa1f0f01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function merge (cyclomatic 14, cognitive 20): merge has cyclomatic complexity 14 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ff82427ecce2f11fa3b71ed8a18356d5ede44ff36fd716e5a2192250dbc12b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _normalizeActorChange (cyclomatic 14, cognitive 20): _normalizeActorChange has cyclomatic complexity 14 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a0b2a7dae45a3747ea6f2e75720825ab8930184ed136089bbc7bcdc43414c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _readClientSideDirectiveField (cyclomatic 14, cognitive 16): _readClientSideDirectiveField has cyclomatic complexity 14 and cognitive complexity 16; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04623982f786f1743a7640237c45234f3c48eb387d25063be4a1f33ffe5a033"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _readClientSideDirectiveField (cyclomatic 14, cognitive 16): _readClientSideDirectiveField has cyclomatic complexity 14 and cognitive complexity 16; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2688}}}],"partialFingerprints":{"codehealthFindingId/v1":"56998b1ffea280b9ecd84d6e3bb397d9c003d22b76179b5a9fa1fff9ea9f375d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 14, cognitive 15): read has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c563c7330da4473cdfc4382118b975df054a17a71be3343b9aec612470712458"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPaginationVariables (cyclomatic 14, cognitive 15): getPaginationVariables has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/getPaginationVariables.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e49c157bf77ef890ef0cbbf686efe2fe4416eb2a94aac96748eeb8e75e5fdce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _mockLink (cyclomatic 14, cognitive 13): _mockLink has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/RelayMockPayloadGenerator.js"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2eddff0d2429ce9c0becf41820d051609f485770062f8910ebc562af22825e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRscStep (cyclomatic 14, cognitive 12): runRscStep has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-e2e-test/src/runInteractions.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b6ade9808d4fc2572eea58f3167964ec8a01fce73eea960535c563076dd93c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 13, cognitive 31): resolve has cyclomatic complexity 13 and cognitive complexity 31; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernFragmentSpecResolver.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab89b629611a295f12cac45ad2237fb68baf76434dcef50439654404c28e818"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getStreamTarget (cyclomatic 13, cognitive 23): getStreamTarget has cyclomatic complexity 13 and cognitive complexity 23; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/serverQuery.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a3e8e4b3e80c6da1c6731ee194d6ddd8aa48aa0c7f2aab5c8b8a8ea5fe2ace"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) has cyclomatic complexity 13 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/MutationHandlers.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b885ab264b66d8a09cbc1fb6a8984e1bb7201cb58dff96a9b2554eeae23954aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 15): constructor has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4770764dcb3b2c7628ef6d9304c08843ee1e1ee32d8bf234933a72948eb4f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _processIncrementalPlaceholder (cyclomatic 13, cognitive 14): _processIncrementalPlaceholder has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d442c4e9ea60340b681a8da443c9eb47a4dbbee481993aadbd0cfeff0f8f0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRelayHandoff (cyclomatic 13, cognitive 12): getRelayHandoff has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/RelayHandoff.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84ff522d8cc83366cc77277f332e7916b1b4ee9801fdad5d33450127d30f31d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _normalizeStreamItem (cyclomatic 13, cognitive 11): _normalizeStreamItem has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/NormalizationEngine.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc254b88ce02f199086291170baaa9a09fbd44009ea485993b6b7ffea89090e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _readInlineFragment (cyclomatic 12, cognitive 19): _readInlineFragment has cyclomatic complexity 12 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"b860b4b0e8642b6134c38b1009a73cab2a96caf9c50fda906afec1af43059d46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _readInlineFragment (cyclomatic 12, cognitive 19): _readInlineFragment has cyclomatic complexity 12 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":3644}}}],"partialFingerprints":{"codehealthFindingId/v1":"671f28bc27994294d6d946d91e06d3d48ede330215f32f36594d656e279f3c6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFragmentIdentifier (cyclomatic 12, cognitive 18): getFragmentIdentifier has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/getFragmentIdentifier.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cd1ed24b194d1226bea9da0bfaf23070e8aadfe5e9d66b5ab54dcddee54fad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleFieldErrors (cyclomatic 12, cognitive 17): handleFieldErrors has cyclomatic complexity 12 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/handlePotentialSnapshotErrors.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3c7028b7be54219834c2163f861e6d211aff86950818f013ff6b75a6d97c56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d9d1b104cc9bd0ce2ac1e5d5794ef94c4f3bee35912098c51f42ee1fb37e0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayRefetchContainer.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f952ff9bea70ee0b501322d885e7a831267f792faa62d88eaa3d465b6fcf2667"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _fetchAndSaveQuery (cyclomatic 12, cognitive 11): _fetchAndSaveQuery has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/QueryResource.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ede2d400822c0f901ac92c44f0546b50c92198287bb5e5524a95603eaa0906"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _populateRecord (cyclomatic 11, cognitive 20): _populateRecord has cyclomatic complexity 11 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayExperimentalGraphResponseHandler.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ee10bcfd4e6e22b3af1725ab7de16926b9a72a3117a857c063174104e8a383"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateField (cyclomatic 11, cognitive 19): validateField has cyclomatic complexity 11 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/validateMutation.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba539af7498c11835d9927f46e1c1fe0c4ab3add5a7a745b1933320edf051dd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runInteractions (cyclomatic 11, cognitive 17): runInteractions has cyclomatic complexity 11 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-e2e-test/src/runInteractions.js"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefc25dd48c5c105d4fc6d5158c2b0ae2aea0915834644fefaf9c826c093a442"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadQuery (cyclomatic 11, cognitive 16): loadQuery has cyclomatic complexity 11 and cognitive complexity 16; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/loadQuery.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ccf330f976afb32d9990f07a3c4a4746bbfe0ad390f32a1a36bd6f433ab211"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createNode (cyclomatic 11, cognitive 15): createNode has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/babel-plugin-relay/compileGraphQLTag.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1838f93611d37ade6bb62a5128c871b37e51554891d845f1c3812ad6a0f090b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _runWithoutNotifying (cyclomatic 11, cognitive 15): _runWithoutNotifying has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayPublishQueue.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a154025aa21a30ecdbb3a0a2c2c15f43e3c0b39bbabca7f3610b6968f61eef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _catchErrors (cyclomatic 11, cognitive 14): _catchErrors has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a3ed6fa43eb105eda71e1815b6a47ba4192bcaf6293bc4f77d633fd3138f35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _catchErrors (cyclomatic 11, cognitive 14): _catchErrors has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cc4f057cd63c464dc479b5b4c05a3737722dbdb3580329f082aca1443c5183"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function act (cyclomatic 11, cognitive 13): act has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/jest-react/internalAct.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"deed47551a11764bb5e908ff16e891a4f95f41622b9af72d62f3a5982898ab3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useLoadMoreFunction.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"06aaa8ae27a1103d7b565f4b005903cdcf3e816d40ed202828b61613551120bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e232729aa8f7f745f92d126fe993a06f469832680ef16db4d70cea9eaf8e44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _validateRecordType (cyclomatic 11, cognitive 13): _validateRecordType has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e7be9730b8bf01d624edf4526809777e17088eb4ffb5c19392ad21b6281ecd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getConnectionState (cyclomatic 11, cognitive 11): getConnectionState has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/getConnectionState.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e30d709e98b76f8bc0d76d02d6a879c0c20fda5179362e0b93e51423c9717ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 11): (top-level) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-compiler/index.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e1ad7191f5e22be86beed0a7a41e10671a20f21fb00f7d762a1e4cbfea336e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function subscribe (cyclomatic 11, cognitive 11): subscribe has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/network/RelayObservable.js"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ee70d01e9018fffa352978711508b9de1668cba47cde85f121ed41a73d998e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 11, cognitive 11): check has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"107e0a187d5fa089b84d6d17dffb08979ff858f8f9418b7771478b72261c276a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _maybeReportUnexpectedNull (cyclomatic 11, cognitive 11): _maybeReportUnexpectedNull has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"248a9775d9bce8c04afa1d724fb86b77ea02415368be770567b65e6570aed67b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _maybeReportUnexpectedNull (cyclomatic 11, cognitive 11): _maybeReportUnexpectedNull has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"db88f93687ac8144ec2c9d29f71395922b11cc95d774e60a7f4384f3cdac1c0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 10): constructor has cyclomatic complexity 11 and cognitive complexity 10; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/multi-actor-environment/MultiActorEnvironment.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"28091667756325922f8711f887f1aaf34f6c251bdaf459665a7a419de8900bd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateDataForField (cyclomatic 11, cognitive 10): generateDataForField has cyclomatic complexity 11 and cognitive complexity 10; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/RelayMockPayloadGenerator.js"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b48b59b612610d28ca71c955efd5f4756f16f76aba631a4aba5562e7ba7fbbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSameValue (cyclomatic 11, cognitive 9): isSameValue has cyclomatic complexity 11 and cognitive complexity 9; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/RelayServerHandoff.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"971c3da5d149a7bfd9220cfbfe415eb1f86b48971b964bf32929a01a1f9e2dab"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/RelayReader.js: 3664 lines of code: packages/relay-runtime/store/RelayReader.js has 3664 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReader.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff9535c2d211adca68129a6d39c8fac07865f00d0824048958575f4cde88357"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/OperationExecutor.js: 1818 lines of code: packages/relay-runtime/store/OperationExecutor.js has 1818 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/OperationExecutor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0df70f5e807a6f8d499ba83383d1f72ccdd55e86f0ecb14584180a5d2872961"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/RelayStoreTypes.js: 1526 lines of code: packages/relay-runtime/store/RelayStoreTypes.js has 1526 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayStoreTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cdf647564b1d171fad99cb22343db696c4ad626b33d79b8b652f3eb57753c3"}},{"ruleId":"R3","level":"warning","message":{"text":"flow-typed/npm/jest_v29.x.x.js: 1235 lines of code: flow-typed/npm/jest_v29.x.x.js has 1235 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"flow-typed/npm/jest_v29.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceccad33254c25815f66867f899260d7b8dd1a9108cc80088411cce9737848b5"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/RelayModernStore.js: 1177 lines of code: packages/relay-runtime/store/RelayModernStore.js has 1177 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernStore.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a35ce33ecc688aac0c72ee99b3663ffe6367d7d3c1274aa1bddbe1986a8e17"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/RelayResponseNormalizer.js: 1027 lines of code: packages/relay-runtime/store/RelayResponseNormalizer.js has 1027 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayResponseNormalizer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"804594e168b55af12a9a1da9497607472fab03b17775f7ccaa3dbdc46586eb95"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js: 1016 lines of code: packages/relay-runtime/store/live-resolvers/LiveResolverCache.js has 1016 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/live-resolvers/LiveResolverCache.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1902c67504a3cce298acbb87d8e1c17788c9fdf561b768d9417c2942c49c075"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-test-utils/RelayMockPayloadGenerator.js: 991 lines of code: packages/relay-test-utils/RelayMockPayloadGenerator.js has 991 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/RelayMockPayloadGenerator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d98390b0438e998a832700fc7e21e46826db60d25b2d299a829440f63871630"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/RelayModernRecord.js: 906 lines of code: packages/relay-runtime/store/RelayModernRecord.js has 906 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernRecord.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5277c2504994a4e3367fe8c7d7bb2638a4577dadd3342449504f7c4a282091"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/ReactRelayPaginationContainer.js: 874 lines of code: packages/react-relay/ReactRelayPaginationContainer.js has 874 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayPaginationContainer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5737b349a8a85933198eac5af44781dda4b8a279efacd36d3d0fd1aace4a7572"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/relay-hooks/rsc/useRelayHandoff.js: 867 lines of code: packages/react-relay/relay-hooks/rsc/useRelayHandoff.js has 867 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/useRelayHandoff.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62228ccefdd8dfecc7a8204d6437a1f33424bda13697c1e07c38b4ca8bf36249"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/relay-hooks/legacy/FragmentResource.js: 848 lines of code: packages/react-relay/relay-hooks/legacy/FragmentResource.js has 848 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/FragmentResource.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e555af38c23ff1fab798e8280dd29f306d7217a3c4c6f5d5e9d2bc479b51cb6a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js: 833 lines of code: packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js has 833 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d0b3dfc86cc02b343f8ecd27625ec85cdca04d8504d3bec0d15616a7cbaee1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/NormalizationEngine.js: 829 lines of code: packages/relay-runtime/store/NormalizationEngine.js has 829 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/NormalizationEngine.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5b73c0f40ef0567fba6fb8e33c452584ddbf83891fd280edf574342c69df6d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js: 708 lines of code: packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js has 708 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90db88ec7f435d912f3cb41b4f30813e6fdb10996a1c88bb3e033da183c95d0"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/relay-hooks/rsc/RelayServerHandoff.js: 682 lines of code: packages/react-relay/relay-hooks/rsc/RelayServerHandoff.js has 682 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/RelayServerHandoff.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05aea951c24ae2d5e17da2cffdcf713b1767cd980107bf5a7c26ac88fbda3561"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/DataChecker.js: 648 lines of code: packages/relay-runtime/store/DataChecker.js has 648 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/DataChecker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1a181f7bb0f511f8868d5d7efe2bfe2c4dd6acc3aee8f51768fabb8097f140"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/network/RelayObservable.js: 608 lines of code: packages/relay-runtime/network/RelayObservable.js has 608 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/network/RelayObservable.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76143b81b367b0ca2a82faa47ab156f3be2852ce95bd03cb90351291ad407d3b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/handlers/connection/ConnectionHandler.js: 592 lines of code: packages/relay-runtime/handlers/connection/ConnectionHandler.js has 592 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/ConnectionHandler.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfb726a67f01f1811cc74a5fcd11127df5db1beb1b621091b12ccca0eb752c0"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js: 591 lines of code: packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js has 591 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54748ac84820708cf627cca57e0868be8c906b80ea3c9253377a039aa4cd9cf1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js: 580 lines of code: packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js has 580 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f68e14feebb7d4369430cd36b58b20136120fe1d76758afed0f1a4f542078d6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/relay-hooks/QueryResource.js: 574 lines of code: packages/react-relay/relay-hooks/QueryResource.js has 574 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/QueryResource.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf2de372f4237324513abb246898325667d3fbc771d1acdf7fca890ca52173f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/RelayReferenceMarker.js: 573 lines of code: packages/relay-runtime/store/RelayReferenceMarker.js has 573 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayReferenceMarker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90151a6c6a9e5cc4c41daa00dd1117c76324f1598732801459b9dcd94fe868fc"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/RelayModernEnvironment.js: 560 lines of code: packages/relay-runtime/store/RelayModernEnvironment.js has 560 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernEnvironment.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d47b29713d38c809294a432d621dc916aa491cf6b4cd846d0fa812bf02deee"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-test-utils/RelayModernMockEnvironment.js: 560 lines of code: packages/relay-test-utils/RelayModernMockEnvironment.js has 560 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/RelayModernMockEnvironment.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa312ad8ba434d9b68465a2757807a25b5f50000077f496b0902f138618802e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/RelayPublishQueue.js: 530 lines of code: packages/relay-runtime/store/RelayPublishQueue.js has 530 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayPublishQueue.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d2e89ec59153e1096e1f49a60d7880bcbd53a86039d94af26340c62e6f84a1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/RelayModernSelector.js: 518 lines of code: packages/relay-runtime/store/RelayModernSelector.js has 518 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernSelector.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e335492d963bd60d3834d8572f65d1a540e6979c1c44a414243bdb8a851f57"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/multi-actor-environment/MultiActorEnvironment.js: 487 lines of code: packages/relay-runtime/multi-actor-environment/MultiActorEnvironment.js has 487 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/multi-actor-environment/MultiActorEnvironment.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a9933a2f0ee1c184410427dbdea7d8cbb16edb0564ac49ae4ce1d1f388c1dd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-e2e-test/src/rsc/rscClient.js: 476 lines of code: packages/relay-e2e-test/src/rsc/rscClient.js has 476 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-e2e-test/src/rsc/rscClient.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64068dd43e97737204c211a21c6cb84182d869e98e12040810d173e417a00fe5"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/ReactRelayRefetchContainer.js: 464 lines of code: packages/react-relay/ReactRelayRefetchContainer.js has 464 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayRefetchContainer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"046196ef9cea9acfca66199065af51791596e152997db016dc88d100d23f5683"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment_EXPERIMENTAL.js: 453 lines of code: packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment_EXPERIMENTAL.js has 453 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment_EXPERIMENTAL.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbdf37696ab556bf91026fa4ff8555187262c4530580d66151590b002de5aa8"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js: 453 lines of code: packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js has 453 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayExperimentalGraphResponseTransform.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97a857bdecc2d8e5b1dd2625c9e03623a7fc99f1558a6c28d935721d7b716c3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js: 452 lines of code: packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js has 452 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de70337856654c7e58630cffaa1de0fcde72f86d2c0b0148e06d10cce91f81ce"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/index.js: 448 lines of code: packages/relay-runtime/index.js has 448 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adddf0196f7d585858475c355ef6c7e6ee94c543004cbc864f30635ff49bd775"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/relay-hooks/loadQuery.js: 446 lines of code: packages/react-relay/relay-hooks/loadQuery.js has 446 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/loadQuery.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a2c3fdd38f359e2255f849b60329b622236a8e957897e055cb3d840b1d0f52"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/store/RelayModernFragmentSpecResolver.js: 442 lines of code: packages/relay-runtime/store/RelayModernFragmentSpecResolver.js has 442 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernFragmentSpecResolver.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b426a879436fa17a26d6202ef79f32c5d9a0ca60e4caa4673f8d2370fcf673a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/react-relay/ReactRelayQueryRenderer.js: 440 lines of code: packages/react-relay/ReactRelayQueryRenderer.js has 440 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayQueryRenderer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4b23dc8a4fc0b62b06096545e1a692dfebb512cfe08653dcc255cb8ed8a16d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/relay-runtime/mutations/createUpdatableProxy.js: 427 lines of code: packages/relay-runtime/mutations/createUpdatableProxy.js has 427 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/createUpdatableProxy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4da44988a8b6ba6b214847550000560f8c24a1b727879d172b1f2b1f4ec525"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayStoreTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e452e2df8fbf23a8bbd4c462a3b02b1af550475408e79c22678142e285662893"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"flow-typed/npm/jest_v29.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccf4e74dcdf682af894ea770570a29b72054b72e21360c2b44e443bfa17b6ff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment_EXPERIMENTAL.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc829b5d6ddfee79021027cff02617ba032813b6a850628bbc776a26f5744700"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/ReaderNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fa148418ab7579e7cf05272898206285fe3055265777e237168f1670405ab1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/NormalizationNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d7a41b043a62da70441cd03424e7898af888478a2040250c6d60ece5b47c47"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/EntryPointTypes.flow.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db392ca3cea1807c0f468f5fbd9fa78fef39c9cf3591419f8449e8d3a3666aad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/multi-actor-environment/MultiActorEnvironmentTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a4dc27ce1811222a99ad734b0187d880fa5be510725cabf7c4417b8b872e42"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/RelayModern-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df45b5cef32b20f5f18d06490cf5ce15a7c0197a91d774264c9011dcdeb33eef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/network/RelayNetworkTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a055c945a5bb6662326144c3dbfef74144bdb0704ff357251a6ac373bb38325"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/RelayRuntimeTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cf354db9062111547fbbf6a129a64bff8b96f39240725b7bc1cf8153350f3f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"flow-typed/npm/chalk_v4.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b028524168d98607ebff78070f55d61a320c5fc137d4195ef5e69e8ebdea7dec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"542d8ba71733844e08ac65378bf1a4082dae15e3d3b9b98ea39ba1744b1092a7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dc0f352bd351a9e38853086e15e2880dc62aae30a3b10e51df44659e9a6482"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"231a518ee61ac76082935ea5bc3c56099cf909aeed5d0022b5b8875674c5df6d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdf55d88e68114450c46eb33e82280e7b6b12c0f841d00ba981ea5c7cc7fca5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51293e0c4a4ceda3bfabdca05b3b5a186de546d83fc65c3d9a8a2f0e6ef09ab3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/usePaginationFragment-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2f4f2d5b2463570c7a98956c183c6d8a8c3fe0f41bbd1eff67da4e552598f8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/NestedEntrypoints-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"290772afe978ff8fa33b58b6c5a23e32b672328a75e6525eb34916aeb6849f16"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/useRefetchableFragment-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e23f2ba6cfc7ee2b25e2f5812a86df94748e99ba1297260ef9a929f0df7210"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6df0177492bf7e77c5f4cf4d6daa9f770de32976f5d754ac9685bfceda1afa3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/ExtractQueryTypes-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f752882727dbc5575b3a9ebe6eb87f89d591b89ce336f40c716b19ccfcab53"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/useFragment-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db070c20e9341a3428d6e62e6644d10273f13bbb74ea351fd399ab2573f352e9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/multi-actor/ActorChange.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af908cbbf9b3323007549d1364634cf32041c000f1b3b01b1ef50058f08b2c49"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/EntryPointElementConfig-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fb2805be0df6b62965a627c2ba5837ee9cbec236fb6d0269970c2d1af9fc66"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/multi-actor/useRelayActorEnvironment.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28967eec088fe26aef08abff91d3ab9a7bd4b2a5b3070b41a7c0805269100b7d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/babel-plugin-relay/BabelPluginRelay.macro.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef24e1ab4fa8cead7f2a9ed2d98acd3005fb87c5484a9707f3df0c60765c0de"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/NestedRelayEntryPointBuilderUtils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3c6348002ed29a0da6ce3342b56ae50a8db57713b90b2d4eeb0e252166ef5a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/InternalLogger.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24943ffcb35fddf6404baa5cc5c99517d62ad9fc195a5207c45d992746ca87e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/generateTypenamePrefixedDataID.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a387da0b74c90e9d119b1c39090402ae79e9f265e30571f84f260d240a52c5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"flow-typed/npm/invariant_v2.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0680c04c244935ccde8122eeb6a72a5c770cbad9721360a3eff12460031b49a2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/RelayModernFlowtest_badref.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f144bdfce5e83f64c6e3816161d42dcf9640bb9eda151f2fe97bd1e91c963fc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/RelayModernFlowtest_notref.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9511fb32028e99d01cfd5102d869d85dbcc615e6089076206162cd0f4db4f13e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/eslint-plugin-relay-internal/lib/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd24391c60d41104e49be38bc4b4a5a818ba75a7c1031cda590746796a228a43"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/RelayModernFlowtest_user.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7372b8aa0b10183d5549a4e17f13c339985bbc413905e0adaea48b7f41f07e36"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/RelayModernFlowtest_users.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c60762ad6a760f2ba08f7c0ccd2dd589b90c463cb10ca481944cbd6a1fc52a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/JSResourceTypes.flow.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03b3ccbe71aae1a3a52b537fcf12ebcfd46b293d33c2ec0cba9dd29f541625e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"flow-typed/dev.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a776abb89357380d3d40a7d74cc7c131221dd9eae6a43df4593c743380fd42ac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: 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 \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/multi-actor/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b988b0731906d194da848760c9e215d3964f955eb77ee5fb680b35d034d03b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1278 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"flow-typed/npm/jest_v29.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"522d4f4bd7d044251b94797471415df644f4f1e032e42536e919c2325ebd5f97"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~487 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment_EXPERIMENTAL.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c4e467e513532c1e5660ec18e6483a81d226eaa52af2bd82fc3869468bcc27"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~265 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/RelayModern-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5919acc1d9a47c24077318863c1faf8a7a2f3f60c72db7c8c69006d195dd2f3c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~259 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-notes/App.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9548eb691de4ce131775adba3e5d1d3ec4571fd01e2bad9da99bb1d13ec28324"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~175 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"flow-typed/npm/chalk_v4.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03ebb22ab85cb16e103a3a156f6a13a319d530d752a407874421d948ceac3e8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~171 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7db76aef455a9304284d1f52fd3f8f5cb15da691f5bada482f5b78741990ba"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~154 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3766d9c9eb9020e1ff78e15dac9b924d6bd151406a6d6b9644790c55abd7feb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~146 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7516f8e4be22f054a2285f89a842d04ee05a4bb972c40aba2899c651995d5fc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~145 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/useBlockingPaginationFragment-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a6847af16b87ddbb3ac15b62351312c5d802be69f8de14f3144db77ca23867"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~143 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/usePaginationFragment-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afad4211a23f77e7336ac4d62f766d715a2bdb1a2c5ca893896279b4a09f48bf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~124 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-notes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a838ee3dc570b5a1db35f35e850283658e69c0b6bfedb8b9f8b981c6d3d74eb0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~106 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/NestedEntrypoints-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"676b83971d7c9551c8cf6478420c6aaf2055ad88ea2d9c7c438006ad4488a0b7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~100 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/useRefetchableFragment-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de511be6a1b2edfd07480a33887023856d5b76344d4d6e1fb5472130a106842"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~94 LoC): no import path from any entry point (38 application, 105 tooling, 459 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) \u2014 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"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ed5f7a4c4293fb23e27da98e8c83a78be5431e21b4f57ae06dd23cba1110dd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~90 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/ExtractQueryTypes-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43d88ef5f95ff5620ca9e9ce6afaaae14b7c0d82f1e71bb082d852a778873cf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~81 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/useFragment-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd71fc8a416343af32555e315936e857b2f4c081eea490ff561f0f659bfcc261"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~56 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/multi-actor/index.js) \u2014 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"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/multi-actor/ActorChange.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6459c08011bf3beaccc3b180c34b4d04b539394b05c27d5088ac61f9c8bb18cc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~52 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/jest/preprocessor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba16768c34ff9ca42722560b821d3540303a3f336e7845e86d6472245d3d94a3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~50 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/__flowtests__/EntryPointTypes/EntryPointElementConfig-flowtest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1eb34ac5cb1d5fedc3431e2f3facbc6c844f358b42d388f17da7b493bb3d134"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~47 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/multi-actor/ActorChange.js) \u2014 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"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/multi-actor/useRelayActorEnvironment.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaeb66e9c6fba733fde68f5370d762ed8890c0ef284a7c22832e40d55856ae9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (38 application, 105 tooling, 459 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) \u2014 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"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/NestedRelayEntryPointBuilderUtils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"530491ee5f758e8d6683f600c5fb212c142abebfb6f4afeac21e633bf9c3663a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/InternalLogger.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5385beaeb88e22f98f732f04d5625bf30a6f40c68a6080f90886ad31b7b425f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/generateTypenamePrefixedDataID.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ee5920e06e1008ba6e7679f2e0872868f1a0ccd410498f50c76c789215df45"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"flow-typed/npm/invariant_v2.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d66bd3924cd6eb5b49803fc0c5447ff19fa82c6d8c89af39f03e88b5a5280c1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/__flowtests__/RelayModern-flowtest.js) \u2014 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"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/RelayModernFlowtest_badref.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6ebf284af172276a262d081e5869d3aaf647d55e4e1551edaa137631c21aaf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/__flowtests__/RelayModern-flowtest.js) \u2014 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"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/RelayModernFlowtest_notref.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"999f4e620781a6534cb737dcf2984cd3ecc3035b2ff5dcabff747d28abde1d65"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (38 application, 105 tooling, 459 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) \u2014 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"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/RelayModernFlowtest_user.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c0dcbe520f8ecad4b223457ad4b591b03f736321dd0b3aaf048ea951906585"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/react-relay/__flowtests__/RelayModern-flowtest.js) \u2014 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"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/RelayModernFlowtest_users.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2166a2e14e4c68a60ef6df0c20acbf10e7286c5454ac7f89246b6fd82a93975b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"flow-typed/dev.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"801d6a0967d052ccf3e411d1b28ff77e37865f9af4e1c453b9beeec17fe843f6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (38 application, 105 tooling, 459 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/multi-actor/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2952665dd018549da8a4fb1c085b020542630674b033fef3f4f5c6139505449c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unlisted import \u0027JSResourceReference\u0027: 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 \u2014 but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/EntryPointTypes.flow.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3148fe98527cdd962f86ae44629a59790af8d0fa4bd93c422226a54947055bc1"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027areEqual\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayFragmentContainer.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f21b654b69257e169b7370fd6572d50f8e0cc6eeb88c518861bf4cba0452893"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027scheduler\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__tests__/ReactRelayFragmentContainer-test.js"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b712486a474b3731fc5a0317e16f0383f93927e1f89e36a976a8224f4e1e4bc4"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027warning\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayPaginationContainer.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63d980f718f0767edb0061165469faf8d1b64650b23321cbf125a9ef46040a4"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@babel/plugin-transform-react-jsx\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-e2e-test/jest-transform.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40ba9b5acd4ddbe2d6de72307be5a972bd8b37402afe0f84b120179e83728f3"}},{"ruleId":"R8","level":"warning","message":{"text":"Unlisted import \u0027JSResourceReference\u0027: 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 \u2014 but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/util/NormalizationNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52b297860ce9ec4306bdc784641402ca41d135c46effbfab8229c0d253edf97"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027areEqual\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/RelayModernFragmentSpecResolver.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"666c4053ae837c8b6eed452fc8e4fbb5573eedac302d182d657308fef1633ed1"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027warning\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/handlers/connection/ConnectionHandler.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73f816d5656879016849e5da605ffac485fa639b567b4aeede82f4a65d0ae0b"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027areEqual\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils/RelayModernMockEnvironment.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aca37f3aa0df139f0c4004d8e1417c2fc704a363457e5a44b47ab3e67ab03d5"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027warning\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-test-utils-internal/Matchers.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fc132b36e590322167769be30413c0ee3ab4677bd2cf72b35bd75a5be2574c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027flow-bin\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e489aa32732f14227ea41116bd0521da34905261deab9ed427c0db5f02d55d68"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027gulp-chmod\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"59f6ed1ed7a47fb4843f6906684095c3da7f28982226cc7058b23ab78db9f634"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027nullthrows\u0027 in production deps: Only test files import it (first: packages/react-relay/relay-hooks/__tests__/loadQuery-test.js:41) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d6c23f63afbd94512513e6e775f265500890709e70791a80f6309b3668ba05"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027react-test-renderer\u0027 in production deps: Only test files import it (first: packages/react-relay/__tests__/Catch-test.js:16) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f97cfc3b333a4a9047ab92e84676475af487461defac82e0f495d485f10cd4"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027nullthrows\u0027 in production deps: Only test files import it (first: packages/react-relay/relay-hooks/__tests__/loadQuery-test.js:41) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/package.json"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e391c6717e00ed3f0d07a5c05cf16b9df28f75a495f8f153a4dfcbde5b654be"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/common/src/rollout.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d72f4d88dafac3c173faa7019a0cd9299106638a28cb4c86e8c518236a2ee9"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/common/src/rollout.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37c12b56bab789920259b3ac315a0d68652a9c953abadeb6f6c63249acb4be4"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/docblock-shared/src/resolver_source_hash.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8164ac73737c9366504a8027d955722bffd2d6bbc64253bf85c601f119e0df90"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-codegen/src/build_ast.rs"},"region":{"startLine":3610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c2dfac8a80bc63b5398723ed9e1724ddc80efbca27035e6dc051f9e692ad1e"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/artifact_writer.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eba80c68d7ec9bc346d9d1dfe792bd9460857748afac470e1f8b46360eaed2a"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/artifact_writer.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd726ee3294a4606d3e5ddc68cf7d5699505846d1879843e99060a2cf2f479e6"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/artifact_writer.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bacd0e5042568c45da5c4ea4b67555f50856b1c7fc22ea7cb366ce5b7a1260a"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/build_ir.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9345e295fe27590ebde2bbf5502fa1fde5ba1f2fb1b7352a5f72e369ceb42c"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/build_project/persist_operations.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d985e09276edbd3a92836f930e8aa5a98947d103f175f6a3ed0c10b93c71a276"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/config.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"138f297730bfe353347f44505ee745a063a2abd8004f2c065ab65b1a60e2b066"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/config.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a167ed874f4885cf9520f8bcd5b907d00bd97315c531f0f86b4a569d30b1d05e"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/config.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bc90155f17a4ec9a7be8f0cd53ce3614e4d1bbdeca8e2d8b6b28d8884aac33"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/operation_persister/local_persister.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d13c00ed1b1c5f2186ef2a68042bde423e5efc1d06e3daf70e2d651655e99f"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/operation_persister/local_persister.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dbb9a673a1575c6a22baa1a86e704ec085e62dd9adb38f421375aedeb60af4"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) 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 \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/signedsource/src/lib.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d288b3cfb06632c73d85ac08afe8eb3896df7299d68bd88ff95cd85dcf6671b5"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: compiler/crates/relay-compiler-playground/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler-playground/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0058898e1f0e32664457c3cc74ccbfa6ee1e8bb901bc5bb385366b3284ca9403"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!fragments.hasOwnProperty(key) \u0026\u0026 !isScalarAndEqual(nextProps[key], this.props[key])\u0060 appears character-identically in 3 files \u2014 packages/react-relay/ReactRelayFragmentContainer.js, packages/react-relay/ReactRelayPaginationContainer.js, packages/react-relay/ReactRelayRefetchContainer.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayFragmentContainer.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"041251266da98d38a852531d15433c7a0ecb40bb32d1a361e7238c27d8af4bb4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isLoadingMoreRef.current \u0026\u0026 !isLoadingMore \u0026\u0026 !isRefetching \u0026\u0026 !disablePrefetching \u0026\u0026 !hasPrefetchErroredRef.current \u0026\u0026 hasNext \u0026\u0026 (sourceS\u2026\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js, packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"394f34731342de2e74257dcdd3c3a1689e9f863c51fa3d00b3d64490dd773410"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isLoadingMoreRef.current \u0026\u0026 availableSizeRef.current \u003C 0\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js, packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"607f2f56c082dc7f8c98d24ca066703488475adeda060822fac04842752854e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isLoadingMoreRef.current || availableSizeRef.current \u003E= 0\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js, packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0956514c13dbffaaf019137ec011f0347d409a1331c9f5c1fde2171e67066925"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060RelayFeatureFlags.ENABLE_RELAY_OPERATION_TRACKER_SUSPENSE || environment !== previousEnvironment || committedFragmentSelectorRef.current ===\u2026\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js, packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"727ce710724eb487e89c40284450f4bc786964109e6d795b149fa5d4043894ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060RelayFeatureFlags.LOG_MISSING_RECORDS_IN_PROD || __DEV__\u0060 appears character-identically in 4 files \u2014 packages/react-relay/relay-hooks/legacy/useFragmentNode.js, packages/react-relay/relay-hooks/readFragmentInternal.js, packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js, packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/useFragmentNode.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"901181a552cefdd68f65e855222232cb5ffb1f05bc2baf842f3c0828df5a8c2a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cacheConfig != null \u0026\u0026 options?.metadata != null\u0060 appears character-identically in 2 files \u2014 packages/react-relay/ReactRelayPaginationContainer.js, packages/react-relay/ReactRelayRefetchContainer.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayPaginationContainer.js"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe9cb3bbf08facd09126c1ad47dcc9e4fb524c5fd61d0abc2d1c1765c5f0b72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060environment !== mirroredEnvironment || fragmentIdentifier !== mirroredFragmentIdentifier\u0060 appears character-identically in 4 files \u2014 packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js, packages/react-relay/relay-hooks/useLoadMoreFunction.js, packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js, packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc3977766de2bc75ac7918f674c212aedeaf0e557898a48684b020451493000"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fieldPayload.dataID === parentID || fieldID === parentID\u0060 appears character-identically in 2 files \u2014 packages/relay-runtime/store/NormalizationEngine.js, packages/relay-runtime/store/OperationExecutor.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/store/NormalizationEngine.js"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4811ccfba3328a05c6b08f92746637f828b268b0155c52c413d964a60589d5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fragmentNode.metadata?.hasClientEdges === true || RelayFeatureFlags.CHECK_ALL_FRAGMENTS_FOR_MISSING_CLIENT_EDGES\u0060 appears character-identically in 3 files \u2014 packages/react-relay/relay-hooks/readFragmentInternal.js, packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js, packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"211a8a6d9c9de6f630d0d6f225d6e11cbd385f0a39c1518974921c85d59694b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fragmentRef != null \u0026\u0026 typeof fragmentRef === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/rsc/RelayHandoffSeam.js, packages/react-relay/relay-hooks/rsc/useRelayHandoff.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/RelayHandoffSeam.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5961129bd06001bce8daed3871dfe31ea1939237931dff8fc109517045376ae3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fragmentRef == null || (isPlural \u0026\u0026 Array.isArray(fragmentRef) \u0026\u0026 fragmentRef.length === 0) || fragmentSelector != null\u0060 appears character-identically in 3 files \u2014 packages/react-relay/relay-hooks/readFragmentInternal.js, packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js, packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ec71776e888defebb277ddfe0ea4da9198142edcef8817dea81598b927ee63"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fragmentRef == null || Array.isArray(fragmentRef)\u0060 appears character-identically in 3 files \u2014 packages/react-relay/relay-hooks/readFragmentInternal.js, packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js, packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/readFragmentInternal.js"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a29fa3bcc57e8808aa9c6baedcb863b0953b20b0071b7f53b0a132bbdbc9fb7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fragmentRefPathInResponse.length !== 1 || fragmentRefPathInResponse[0] !== \u0027node\u0027 || id == null\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js, packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9ee0941c9cd00b73eccfd8139e2f1382407289c6be62da07a9016974b4e2cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fragmentSelector != null \u0026\u0026 fragmentSelector.kind !== \u0027PluralReaderSelector\u0027\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/useLoadMoreFunction.js, packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useLoadMoreFunction.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b2e38a8a78f1e3e1e03b0162aa8feb469591097453016c1543d96b9341f88b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060identifierInfo != null \u0026\u0026 !providedRefetchVariables.hasOwnProperty( identifierInfo.identifierQueryVariableName, )\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js, packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"572d01086be7b68424253ec1e43fdb30e03a2a060710b385ce6e95e0d37b7833"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060identifierInfo?.identifierField != null \u0026\u0026 internalFragmentData != null \u0026\u0026 typeof internalFragmentData === \u0027object\u0027\u0060 appears character-identically in 3 files \u2014 packages/react-relay/relay-hooks/useLoadMoreFunction.js, packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js, packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useLoadMoreFunction.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2796c0e6d34d51bc79ff4ae32d8122df06b47cc549c536eb37ae988f20a34cd5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060internalFragmentData == null || isParentQueryActive\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/useLoadMoreFunction.js, packages/react-relay/relay-hooks/useLoadMoreFunction_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useLoadMoreFunction.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb13d433f733e5b8aa5bbadf034301d9d111ae47d393be71374acab296c76042"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060maxFetchSize != null \u0026\u0026 maxFetchSize \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js, packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/usePrefetchableForwardPaginationFragment.js"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f35446195c0cb95a6902ad47e2ffc1e15131e02c4eb9494dfad11f313ea96a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060observer.complete \u0026\u0026 observer.complete()\u0060 appears character-identically in 4 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayRefetchContainer.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d1e78f01850d624e836ab4da586d6011a58f5e7d9d8eea6b543e04bc374529"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060observer.start \u0026\u0026 observer.start(subscription)\u0060 appears character-identically in 4 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/ReactRelayRefetchContainer.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a965f22f155d9a0eec72a44ea74717ed74dbb46d24da35471682763983aa03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options != null \u0026\u0026 options.hasOwnProperty(\u0027__environment\u0027)\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/useQueryLoader.js, packages/react-relay/relay-hooks/useQueryLoader_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useQueryLoader.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f187f56016713dd7051491910a5c48564474a63e822e73c56eadeeba3c2b88"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previousIDAndTypename == null || refetchedFragmentRef == null\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js, packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41d852c8d36e19b9ae2433af0d609f2d1b5294364a2c78516eb0fb12be187a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0027darwin\u0027 \u0026\u0026 process.arch === \u0027arm64\u0027\u0060 appears character-identically in 2 files \u2014 packages/relay-compiler/index.js, vscode-extension/src/utils/findRelayBinary.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-compiler/index.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9631efcf4f346fe38e65b3adab829e8d4ab56dd63a41ddbc2741f3ed275e4aaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0027darwin\u0027 \u0026\u0026 process.arch === \u0027x64\u0027\u0060 appears character-identically in 2 files \u2014 packages/relay-compiler/index.js, vscode-extension/src/utils/findRelayBinary.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-compiler/index.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fd5ef835590a4f8876e2d50fca6501ad6a9c2fae3e9cf48c5989b496c62b0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0027linux\u0027 \u0026\u0026 process.arch === \u0027arm64\u0027\u0060 appears character-identically in 2 files \u2014 packages/relay-compiler/index.js, vscode-extension/src/utils/findRelayBinary.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-compiler/index.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"05adab45516af6653bcdaa2993b192a72dd30dda90c035020db51519c4199dac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0027linux\u0027 \u0026\u0026 process.arch === \u0027x64\u0027\u0060 appears character-identically in 2 files \u2014 packages/relay-compiler/index.js, vscode-extension/src/utils/findRelayBinary.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-compiler/index.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4152ce8878f75f1f484b6990c0541227154f55e9c0f57b696ee01d23c9797872"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0027win32\u0027 \u0026\u0026 process.arch === \u0027x64\u0027\u0060 appears character-identically in 2 files \u2014 packages/relay-compiler/index.js, vscode-extension/src/utils/findRelayBinary.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-compiler/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac9a034510265bd844acb31bd2546ff33bf23e341671b9e41eec2af4b5c1498"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060refetchQuery != null \u0026\u0026 queryRef != null\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js, packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d2b30a5b444f67bf68ffea3b7d8c229dd3eef7762d529dc2b5c3c812f914be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reqLen \u0026\u0026 optionalProp \u0026\u0026 optionalFoo \u0026\u0026 missing \u0026\u0026 defLen\u0060 appears character-identically in 3 files \u2014 packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js, packages/react-relay/__flowtests__/ReactRelayPaginationContainer-flowtest.js, packages/react-relay/__flowtests__/ReactRelayRefetchContainer-flowtest.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/__flowtests__/ReactRelayFragmentContainer-flowtest.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"776a396de36ef04211b7a333d99c22a226857f58ce87a69672bb363059b6e69f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.params.id == null \u0026\u0026 request.params.text == null\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/QueryResource.js, packages/react-relay/relay-hooks/loadQuery.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/QueryResource.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e85188b020caedee4ca0919e639aae6a84239135e6e10bf2c09665d2be61bc5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resultID != null \u0026\u0026 resultID !== previousIDAndTypename.id\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js, packages/react-relay/relay-hooks/useRefetchableFragmentInternal.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/legacy/useRefetchableFragmentNode.js"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fe0cacdc29bc610925a716030f88e1d90cb96188e9d19988c296304307d6d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.kind !== \u0027bailout\u0027 \u0026\u0026 state.epoch === HYDRATION_EPOCH\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js, packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed712b087c85610767be70da72842b211a4fd15d45bf0bc09470909e14efb5a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060suspendingLiveResolvers != null \u0026\u0026 suspendingLiveResolvers.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js, packages/react-relay/relay-hooks/useFragmentInternal_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useFragmentInternal_CURRENT.js"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f75bfa7241e269791c6b35f949fc8154e050168cd1a5c4f952c644179ceb39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this._handlerProvider \u0026\u0026 this._handlerProvider(fieldPayload.handle)\u0060 appears character-identically in 2 files \u2014 packages/relay-runtime/mutations/RelayRecordSourceProxy.js, packages/relay-runtime/store/RelayPublishQueue.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/relay-runtime/mutations/RelayRecordSourceProxy.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6506b75c0f2a45fc16b2b0030ac090fa955d2672e0a687322d2e4cd30d304a17"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060undisposedQueryReference.dispose \u0026\u0026 undisposedQueryReference.dispose()\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/useQueryLoader.js, packages/react-relay/relay-hooks/useQueryLoader_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useQueryLoader.js"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"532465354018ef35b7ae5be9efcd1678747ac1dadd8063047ea927beb53eb4af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060undisposedQueryReference.releaseQuery \u0026\u0026 undisposedQueryReference.releaseQuery()\u0060 appears character-identically in 2 files \u2014 packages/react-relay/relay-hooks/useQueryLoader.js, packages/react-relay/relay-hooks/useQueryLoader_EXPERIMENTAL.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/useQueryLoader.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4139cb042a99692da1e73c7e7fe0511d5e4b4c9319847fd8ec6e6327d94c63"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value == null || typeof value !== \u0027object\u0027\u0060 appears character-identically in 3 files \u2014 packages/react-relay/relay-hooks/rsc/RelayServerHandoff.js, packages/react-relay/relay-hooks/rsc/useRelayHandoff.js, packages/relay-runtime/util/stableCopy.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/react-relay/relay-hooks/rsc/RelayServerHandoff.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"914934e3ba091d7cebfd6252ddcd1bbcdfe83a8701b7ff34671b38f00d4b8146"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060condition.value \u0026\u0026 value != condition.passing_value\u0060 appears character-identically in 2 files \u2014 compiler/crates/relay-transforms/src/client_normalization.rs, compiler/crates/relay-transforms/src/server_documents.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_normalization.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd7dea252d14a44664ed3ae26bae2ad484f11f34071e98b6a380895dc5b5a08"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fragment.type_condition \u0026\u0026 self.program.schema.is_extension_type(type_condition)\u0060 appears character-identically in 2 files \u2014 compiler/crates/relay-transforms/src/client_extensions.rs, compiler/crates/relay-transforms/src/skip_client_extensions.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-transforms/src/client_extensions.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaaebed64fb63d0bc4090f9d65fe98a144d7d2b54122df7d39db7f9900319e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060project_config.base \u0026\u0026 compiler_state.project_has_pending_changes(base)\u0060 appears character-identically in 2 files \u2014 compiler/crates/relay-compiler/src/compiler.rs, compiler/crates/relay-lsp/src/server/lsp_state_resources.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-compiler/src/compiler.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"9173abfdae782a2d3b1dd3848d37d431f101cde94db072422c315a826e070dcc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060remaining.starts_with(\u0022RelayResolver\u0022) || remaining.starts_with(\u0022relayType\u0022) || remaining.starts_with(\u0022relayField\u0022)\u0060 appears character-identically in 2 files \u2014 compiler/crates/docblock-shared/src/lib.rs, compiler/crates/extract-graphql/src/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/docblock-shared/src/lib.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f425bfc063097528bccd9534a212167381a4410c9325f6c3066dc49df1fd005"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selections.should_keep() \u0026\u0026 condition_value.should_keep()\u0060 appears character-identically in 3 files \u2014 compiler/crates/graphql-ir/src/transform.rs, compiler/crates/relay-transforms/src/apply_fragment_arguments.rs, compiler/crates/relay-transforms/src/fragment_alias_directive.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16377c7c745f449350bd773fa37e5025e9c79adcb4d3a936f55281b13cc982c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selections.should_keep() \u0026\u0026 directives.should_keep()\u0060 appears character-identically in 3 files \u2014 compiler/crates/graphql-ir/src/transform.rs, compiler/crates/relay-transforms/src/required_directive.rs, compiler/crates/relay-transforms/src/skip_unreachable_node.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/graphql-ir/src/transform.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"38267003585195735550fb8d00d57de0555eb33271b6de05e72ac63bfc39b443"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type_.is_enum() || type_.is_scalar() || type_.is_input_object()\u0060 appears character-identically in 2 files \u2014 compiler/crates/schema/src/flatbuffer/wrapper.rs, compiler/crates/schema/src/in_memory.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/flatbuffer/wrapper.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"2296f3aea069819b798ac405004c9a5097212b64e88e7b9595ba997dd1afdc97"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060weak_object_instance_field(schema, member).is_some() || is_server_value_object(schema, member, id_field_name)\u0060 appears character-identically in 2 files \u2014 compiler/crates/relay-schema/src/definitions.rs, compiler/crates/relay-transforms/src/client_edges.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/relay-schema/src/definitions.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"426ca1971191bc8ead39d255dfd140457a3b9b8775a2f74ae3a5020b62b39f31"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060count\u0060 is read from the bytes being parsed at line 834 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 836 \u2014 and nowhere in its scope is \u0060count\u0060 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 \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/schema/src/compact.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e6b7a8cb9af5ae34ea08681bb9a70b24715e73e7fb8fb9a6dd85ad95e969b9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sanitize_endpoint\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Cinvalid endpoint\u003E\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/crates/persist-query/src/lib.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2102a1e2bfef01f727e5904fdbe2b7688d6e7a6e986c738afd307b59c85239c"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-457","guid":"b62874fe-6222-8b5b-8ade-9527ad1cbb4a","name":"CWE-457","shortDescription":{"text":"CWE-457"},"helpUri":"https://cwe.mitre.org/data/definitions/457.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":221,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}