{"$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":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"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":"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02: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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"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":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"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":"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":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"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":"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":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"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":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"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":"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":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"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":"Builder.build (cyclomatic 59): Builder.build has cyclomatic complexity 59 (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":"lib/graphql/schema/build_from_definition.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88034a52feda6d1bd5d168d753b854a16c9f5d28668ea0c9007a1370d4f601c"}},{"ruleId":"D1","level":"warning","message":{"text":"InputValues.value_from_ast (cyclomatic 42): InputValues.value_from_ast has cyclomatic complexity 42 (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":"lib/graphql/execution/input_values.rb"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0120ac37d288de10e7cc028107923e3f0aff81d115c021ad35e1403fe8456b19"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.definition (cyclomatic 42): Parser.definition has cyclomatic complexity 42 (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":"lib/graphql/language/parser.rb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"315a330bd0eeabfeb17e4814344bea850c4644005a5bf564dc998c8b6c874371"}},{"ruleId":"D1","level":"warning","message":{"text":"Field.initialize (cyclomatic 41): Field.initialize has cyclomatic complexity 41 (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":"lib/graphql/schema/field.rb"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aea794d4c653bdca08c81b1e218cfb0321b9fac60b75eb02926af651df79ca4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.sync (cyclomatic 37): index.sync has cyclomatic complexity 37 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 17 belong to 3 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":"javascript_client/src/sync/index.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5f52edb41f82fae4466ed06fe20836cb16ed7073546c4e2c4ef0943e642ea4"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldResolveStep.resolve_batch (cyclomatic 35): FieldResolveStep.resolve_batch has cyclomatic complexity 35 (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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"a877d07e8d945d2d9e7a8b12f716e618e48a7ff292000dc5ac12352872999c67"}},{"ruleId":"D1","level":"warning","message":{"text":"Addition.add_type (cyclomatic 35): Addition.add_type has cyclomatic complexity 35 (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":"lib/graphql/schema/addition.rb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1eab5f585ebe0bb2b8e62f4c3b5c729ade4fb1903afffcf51b86082efdb1f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Finalize.check_object_result (cyclomatic 33): Finalize.check_object_result has cyclomatic complexity 33 (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":"lib/graphql/execution/finalize.rb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a414ee47239101bdbcb100765c0b09174f36468954e42bcf28b95969be3716a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.continue_value (cyclomatic 33): Runtime.continue_value has cyclomatic complexity 33 (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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d676788636602cc1a81b8a531574b8f8489893ce152560a62f12a5a652cead"}},{"ruleId":"D1","level":"warning","message":{"text":"Field.resolve (cyclomatic 31): Field.resolve 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":"lib/graphql/schema/field.rb"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2252baa3c8edae9e4781de2135a36f80d5d5fa643bb859fc5c3a268691673668"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.continue_field (cyclomatic 29): Runtime.continue_field has cyclomatic complexity 29 (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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33852d139045c1bd384e1f2594cfc53914e8f020d7c1f3e3fd31ec7b7117d2f"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.advance (cyclomatic 29): Lexer.advance 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":"lib/graphql/language/lexer.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bf7a83fce93f322f584c7cf74f4666be32759555733a8ddd7cdccc0851e1a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Visit.visit_each (cyclomatic 28): Visit.visit_each 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":"lib/graphql/schema/visibility/visit.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d392265dd66038ecc83f1798e77896cce0459317e17fd22991dd982281d106"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.begin_execute (cyclomatic 27): Runner.begin_execute has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/runner.rb"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8bcb6dc8a6a5f9b413f2afd798fabaa9a8ffaa681860be9562a6a7f3c726f2"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldsHaveAppropriateSelections.validate_field_selections (cyclomatic 27): FieldsHaveAppropriateSelections.validate_field_selections has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/static_validation/rules/fields_have_appropriate_selections.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d11d66db114aa367176400eaaf96c43d30128b4fe79eae8494cf988984967b"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldResolveStep.execute_authorized_field (cyclomatic 26): FieldResolveStep.execute_authorized_field 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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4580fcee533066c2946926edbdf2260a364decfb056ed91f6a3981b3e4f40d0"}},{"ruleId":"D1","level":"warning","message":{"text":"BuildType.parse_type (cyclomatic 26): BuildType.parse_type has cyclomatic complexity 26 (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":"lib/graphql/schema/member/build_type.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af53c118c426afeaa843e45080decc491b82fb18ea66bab1363f4a580126653"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldsWillMerge.find_conflict (cyclomatic 25): FieldsWillMerge.find_conflict 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":"lib/graphql/static_validation/rules/fields_will_merge.rb"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"689105098d90a47b7301420f6236e086d3c5fb747cbd16418ca699a79ff07a08"}},{"ruleId":"D1","level":"warning","message":{"text":"InputValues.argument_value (cyclomatic 24): InputValues.argument_value has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/input_values.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a14447ae1c354894c533bf50e35c54fde4f5258ab084883cf88ce366e5d1f3"}},{"ruleId":"D1","level":"warning","message":{"text":"PerfettoTrace.payload_to_debug (cyclomatic 24): PerfettoTrace.payload_to_debug has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/tracing/perfetto_trace.rb"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"6723292c3e3cadd56731b9dff216543e66967aa88d575495dfb9fe0c1af134ce"}},{"ruleId":"D1","level":"warning","message":{"text":"Serialize.load_value (cyclomatic 23): Serialize.load_value 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":"lib/graphql/subscriptions/serialize.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b30c5797b5e020cca0ffcb2a16284292233f892b844ca72287e2da2cc65616"}},{"ruleId":"D1","level":"warning","message":{"text":"Serialize.dump_value (cyclomatic 23): Serialize.dump_value 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":"lib/graphql/subscriptions/serialize.rb"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb954be9af0a80034d8422c6f48dcf207f3309daf745da7fc15974439e616a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Field.calculate_complexity (cyclomatic 21): Field.calculate_complexity 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":"lib/graphql/schema/field.rb"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb261f307c37b806550b23a3fa9932251250226b66d4036e1f1e85e76c58220b"}},{"ruleId":"D1","level":"warning","message":{"text":"NumericalityValidator.validate (cyclomatic 21): NumericalityValidator.validate has cyclomatic complexity 21 (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":"lib/graphql/schema/validator/numericality_validator.rb"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c557376cc4e3a481528c46275119d700ae756c5bb156bebd09c8570161cd20e"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.run_all (cyclomatic 20): Interpreter.run_all has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/interpreter.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"877c03d2c72bdc07edcbc0d55e9f17efc93a8d1cdc653dc7fc815e6b75931751"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.execute (cyclomatic 20): Runner.execute has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/runner.rb"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ee0fae352f3c315a9cbd6f4a56c1f859d5f4a9e56d0e1d742b55b65903568d"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockString.trim_whitespace (cyclomatic 20): BlockString.trim_whitespace has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/language/block_string.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedace1aeccdc11bed18ce932c3ee175255f6660f9e6e83457bd65d990b547da"}},{"ruleId":"D1","level":"warning","message":{"text":"Addition.update_type_owner (cyclomatic 20): Addition.update_type_owner 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":"lib/graphql/schema/addition.rb"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fbef0d6a182b91ceabbe7eff0a23cedd312434a0045dfac0d7d2d855dcbbb2"}},{"ruleId":"D1","level":"warning","message":{"text":"PerfettoTrace.initialize (cyclomatic 20): PerfettoTrace.initialize has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/tracing/perfetto_trace.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb4d33145f4d5003cc9cc45eb78071033eb8a64c2e84273852b135239c63036"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.gather_selections (cyclomatic 19): Runtime.gather_selections 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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b122d6942fc8fa59e3d436669006272113f778f5427f6d79f862b2fb17f1690"}},{"ruleId":"D1","level":"warning","message":{"text":"Finalize.check_list_result (cyclomatic 18): Finalize.check_list_result 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":"lib/graphql/execution/finalize.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bed391a1d85f0ab9aecdd7a05d2f54e717ba4a8b5d51910a2ccbe27e78ac5a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Language.escape_single_quoted_newlines (cyclomatic 18): Language.escape_single_quoted_newlines 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":"lib/graphql/language.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5fa98a7e163ab348a5cb1f157cc3f73717eb818b26277f3b88b6d2dd961749"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.call (cyclomatic 18): Resolver.call has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/schema/resolver.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa70a98fbe0e97c2d5932862740d455f112a0986169358ab5adc7f34a7268be0"}},{"ruleId":"D1","level":"warning","message":{"text":"RequiredValidator.validate (cyclomatic 18): RequiredValidator.validate 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":"lib/graphql/schema/validator/required_validator.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9aa1e450516157f4d4e77517d647750db6ff93be279c19a01eabd3c828dd55"}},{"ruleId":"D1","level":"warning","message":{"text":"Visibility.load_all (cyclomatic 18): Visibility.load_all 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":"lib/graphql/schema/visibility.rb"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"16874e17f4546b37020271acc1bd40df5705687df61513450324ccda6412b9d8"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallGenerator.create_folder_structure (cyclomatic 17): InstallGenerator.create_folder_structure 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":"lib/generators/graphql/install_generator.rb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8e4c84afa501765ed07061506d208ad0491f1e91303d837971fa3117f4ecdd"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayConnection.load_nodes (cyclomatic 17): ArrayConnection.load_nodes 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":"lib/graphql/pagination/array_connection.rb"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"12208c1d107617b47a0d8ce4ff8aaba0683fd87dc8a42e9e8671ce656774035a"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldsWillMerge.collect_fields_inner (cyclomatic 17): FieldsWillMerge.collect_fields_inner 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":"lib/graphql/static_validation/rules/fields_will_merge.rb"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b298dfefb29f251e32a05a8be881708b193b233b0b10f77ae67f6a2b3b496f4d"}},{"ruleId":"D1","level":"warning","message":{"text":"VariableUsagesAreAllowed.on_argument (cyclomatic 17): VariableUsagesAreAllowed.on_argument 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":"lib/graphql/static_validation/rules/variable_usages_are_allowed.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a448115e0695dadc1ea304db01f40af7fdbf786e58d3054e39136a12bf56c2"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldResolveStep.build_graphql_result (cyclomatic 16): FieldResolveStep.build_graphql_result 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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7c333dd3264b885fe8418dc6366d35ea1b8640e390c47a5c8799d2fb49aeca"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.evaluate_selection_with_args (cyclomatic 16): Runtime.evaluate_selection_with_args 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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bf50bdf4f69539e9c1666ed6cc52c7abf99ed2c6a8c58d9e4a1df110108605"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer.print_schema_definition (cyclomatic 16): Printer.print_schema_definition 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. This is NOT this file\u0027s highest cyclomatic complexity: Printer.print_node (cyclomatic 40) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/language/printer.rb"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13e8c1e98524a0735554580f8927ccb1c9a8f1966026e2053c9bfa565b17cfa"}},{"ruleId":"D1","level":"warning","message":{"text":"Query.initialize (cyclomatic 16): Query.initialize 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":"lib/graphql/query.rb"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db160b5fe4a43640ac36bc088d9b8de28fe331e3b80c66e26f4a4a52e564b91"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.add_linked_types (cyclomatic 16): Builder.add_linked_types 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":"lib/graphql/schema/build_from_definition.rb"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"db546da864ced1f5e1c1de46d7186b6e6e54af84c9ab26f4ff49dd94c1ed817b"}},{"ruleId":"D1","level":"warning","message":{"text":"Directive.initialize (cyclomatic 16): Directive.initialize 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":"lib/graphql/schema/directive.rb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e6420ba2b2eb36f2143e50281283956149c8ff57c26728f3ec0b55b70950d4"}},{"ruleId":"D1","level":"warning","message":{"text":"InputObject.validate_non_null_input (cyclomatic 16): InputObject.validate_non_null_input 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":"lib/graphql/schema/input_object.rb"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff9d33d57ba482bc2a9a0db0597052266b2076274fd40ad2c81d052ffbdc56e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.definition (cognitive 73): Parser.definition has cognitive complexity 73 (threshold 15). Drivers by points: if/else 21 (39 pts), loops 4 (13 pts), ternaries 4 (11 pts), match/switch 5 (9 pts), boolean chains 1 (nesting depth added 38). 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":"lib/graphql/language/parser.rb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39a57539ff1d8ab9093e3f37e793e804df124f780c897aca01b83557d5d87b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Addition.add_type (cognitive 73): Addition.add_type has cognitive complexity 73 (threshold 15). Drivers by points: if/else 30 (62 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 34). 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":"lib/graphql/schema/addition.rb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"14397796340a30635a05326e8b8ec7d0b64722e7f55b224129fd8121dbd78e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"InputValues.value_from_ast (cognitive 71): InputValues.value_from_ast has cognitive complexity 71 (threshold 15). Drivers by points: if/else 30 (56 pts), boolean chains 13, ternaries 1 (2 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":"lib/graphql/execution/input_values.rb"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8e11f5d11688cc0e3ee7698046f7e5e1eedf60afb614995e059035bc99583d"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.build (cognitive 69): Builder.build has cognitive complexity 69 (threshold 15). Drivers by points: if/else 37 (53 pts), boolean chains 10, match/switch 3 (5 pts), error handling 1 (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":"lib/graphql/schema/build_from_definition.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"60136179829f5f77e7cc315204b05574004658b696df55b16a8fa5ab240fafa7"}},{"ruleId":"D2","level":"warning","message":{"text":"Field.resolve (cognitive 69): Field.resolve has cognitive complexity 69 (threshold 15). Drivers by points: if/else 25 (42 pts), error handling 6 (15 pts), ternaries 2 (8 pts), boolean chains 4 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/schema/field.rb"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4f47909f15586e37d7613ac49098b5cebd5152cf78a8f13b808cd548d7a186"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.continue_value (cognitive 68): Runtime.continue_value has cognitive complexity 68 (threshold 15). Drivers by points: if/else 18 (37 pts), ternaries 2 (10 pts), boolean chains 8, error handling 2 (6 pts), match/switch 2 (4 pts), loops 1 (3 pts) (nesting depth added 35). 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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a104727fe209c1d8a30dbcd3e7fa053772c3842d40c951de58cbee3f8301f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.continue_field (cognitive 67): Runtime.continue_field has cognitive complexity 67 (threshold 15). Drivers by points: error handling 13 (39 pts), if/else 13 (21 pts), ternaries 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent 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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b47834c0e959839af8b041be898c5822c294a9ef2e05317006c27c55a09da4"}},{"ruleId":"D2","level":"warning","message":{"text":"Visit.visit_each (cognitive 66): Visit.visit_each has cognitive complexity 66 (threshold 15). Drivers by points: if/else 12 (43 pts), boolean chains 7, ternaries 2 (7 pts), loops 3 (5 pts), match/switch 1 (4 pts) (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":"lib/graphql/schema/visibility/visit.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8753c0769fc4a5180407fa5cec7024b7ebd0d7155142c73d68fff521fc4ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldResolveStep.execute_authorized_field (cognitive 65): FieldResolveStep.execute_authorized_field has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (54 pts), error handling 2 (6 pts), boolean chains 5 (nesting depth added 36). 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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"813b2276e3b7da413f31e1749ea42b7f68db53085769f342f71c0f1668a5440f"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldResolveStep.resolve_batch (cognitive 64): FieldResolveStep.resolve_batch has cognitive complexity 64 (threshold 15). Drivers by points: error handling 13 (38 pts), if/else 13 (20 pts), ternaries 3 (5 pts), match/switch 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent 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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ac27ad6daeeead3c5bc9bc9ce9ba98abc10d59021a5874783e80fc53e04e8d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.sync (cognitive 58): index.sync has cognitive complexity 58 (threshold 15). Drivers by points: if/else 24 (32 pts), ternaries 3 (9 pts), loops 3 (8 pts), boolean chains 6, error handling 1 (3 pts) (nesting depth added 21). Of this number, 20 points are the body\u0027s own statements and 38 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"javascript_client/src/sync/index.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8890ee929bef076671d8543a97544771f6cf2f45a5393cfd0b7c3748467decab"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.begin_execute (cognitive 55): Runner.begin_execute has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (43 pts), boolean chains 5, error handling 1 (4 pts), match/switch 2 (3 pts) (nesting depth added 28). 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":"lib/graphql/execution/runner.rb"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ef453773c3599d4f5489977bd858d27936b9a92e601eea7e82d8eb92fd1090"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldsHaveAppropriateSelections.validate_field_selections (cognitive 54): FieldsHaveAppropriateSelections.validate_field_selections has cognitive complexity 54 (threshold 15). Drivers by points: if/else 25 (39 pts), match/switch 4 (12 pts), ternaries 1 (2 pts), boolean chains 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":"lib/graphql/static_validation/rules/fields_have_appropriate_selections.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5977ab73b2d188485676f8927930c606eea0c3a2682c32af462d59780be3d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Finalize.check_object_result (cognitive 51): Finalize.check_object_result has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 10, ternaries 1 (3 pts), match/switch 1 (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":"lib/graphql/execution/finalize.rb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f58a682a28bcd79607bba946dcd60f44ba9b8887d6a6126397995dfcc054cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"Field.initialize (cognitive 49): Field.initialize has cognitive complexity 49 (threshold 15). Drivers by points: if/else 27 (30 pts), ternaries 6 (10 pts), boolean chains 8, match/switch 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":"lib/graphql/schema/field.rb"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cf8990ad9723902858a03da5502828727d4344f63335278e51f576610a7c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.gather_selections (cognitive 47): Runtime.gather_selections has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (41 pts), boolean chains 4, match/switch 1 (2 pts) (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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b721a24822452746967668556c0fef93c26c62035fab19169ffe97bb688fcdf2"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.advance (cognitive 45): Lexer.advance has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 7, ternaries 2 (6 pts), match/switch 2 (4 pts), loops 1 (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":"lib/graphql/language/lexer.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6996a6f958e7e11d2f362c9b3e0c149efb5851c595d5b732d097ef911e84ff2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Serialize.load_value (cognitive 45): Serialize.load_value has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 5, match/switch 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 22). 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":"lib/graphql/subscriptions/serialize.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ae34507b3bd191a77994b34a8934a03520503d96d8c01974ff7fc131d2926e"}},{"ruleId":"D2","level":"warning","message":{"text":"InputValues.argument_value (cognitive 39): InputValues.argument_value has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 7, error handling 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":"lib/graphql/execution/input_values.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"de769f724085f594f8498d90c024e25db9cb0a3db66344421ca88a725152e205"}},{"ruleId":"D2","level":"warning","message":{"text":"Field.calculate_complexity (cognitive 37): Field.calculate_complexity has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 8 (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":"lib/graphql/schema/field.rb"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"972c05ba3ac4ba0e556354feddffdaa74c9d850fa6b70aa3878da2d39b3b033a"}},{"ruleId":"D2","level":"warning","message":{"text":"Visibility.load_all (cognitive 37): Visibility.load_all has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (37 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":"lib/graphql/schema/visibility.rb"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f595fc114ac9ef4810b34e27988ae866740ca011872852ceddd22afb324e07ff"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldsWillMerge.find_conflict (cognitive 37): FieldsWillMerge.find_conflict has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 12 (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":"lib/graphql/static_validation/rules/fields_will_merge.rb"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"4493cb8df52491d823af80300ac93422b73f1b7cdcce14fe3d44be138c0e6929"}},{"ruleId":"D2","level":"warning","message":{"text":"Addition.update_type_owner (cognitive 36): Addition.update_type_owner has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 4, loops 1 (3 pts), match/switch 1 (nesting depth added 16). 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":"lib/graphql/schema/addition.rb"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"202643abb8dd88172ef2347a9cd1a026a93c61524932bfdcaa6943c6d528c494"}},{"ruleId":"D2","level":"warning","message":{"text":"RequiredValidator.validate (cognitive 34): RequiredValidator.validate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 5, match/switch 1 (2 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":"lib/graphql/schema/validator/required_validator.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fb5ceb2e053e8fceecd1ad5ae7def10bc391a69b98033dc760983c0b015657"}},{"ruleId":"D2","level":"warning","message":{"text":"VariableUsagesAreAllowed.on_argument (cognitive 33): VariableUsagesAreAllowed.on_argument has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 16). 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":"lib/graphql/static_validation/rules/variable_usages_are_allowed.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"86007835b3c9debc841980859082d7de1659d4eaa609dd707d9dd8b7e511366f"}},{"ruleId":"D2","level":"warning","message":{"text":"Field.authorized? (cognitive 32): Field.authorized? has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (32 pts) (nesting depth added 20). 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":"lib/graphql/schema/field.rb"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"85482865033cdf5d382242bd9e515ce542df633999eede9cebd3097d244f55f0"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionsStep.call (cognitive 31): SelectionsStep.call has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 19). 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":"lib/graphql/execution/selections_step.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"711cc5d157a9de04f7b2e7c7719aac79f321744319774a751c2c1205297f1483"}},{"ruleId":"D2","level":"warning","message":{"text":"Serialize.dump_value (cognitive 30): Serialize.dump_value has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 8, ternaries 1 (3 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":"lib/graphql/subscriptions/serialize.rb"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9c7dc8d04ac44fde60f02a169baaf58af590b0f48867f2e29424918cb47142"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentLiteralsAreCompatible.on_argument (cognitive 29): ArgumentLiteralsAreCompatible.on_argument has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 4 (nesting depth added 16). 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":"lib/graphql/static_validation/rules/argument_literals_are_compatible.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"da79146b3bba64b197fb918af25e6a58f78bf0b34b421dfbb7c3c6777cf26107"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldsWillMerge.collect_fields_inner (cognitive 29): FieldsWillMerge.collect_fields_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts), match/switch 1 (2 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":"lib/graphql/static_validation/rules/fields_will_merge.rb"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fd95609c2a031440ffa33241f97ad832483c6998c7e0f1c6f591a3e3d7c777"}},{"ruleId":"D2","level":"warning","message":{"text":"PerfettoTrace.payload_to_debug (cognitive 29): PerfettoTrace.payload_to_debug has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 2 (3 pts), boolean chains 2, ternaries 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":"lib/graphql/tracing/perfetto_trace.rb"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7fbc0f51972723fad0b04e31f212ece4b443b3ecda3639b53f8cf5178050ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.run_all (cognitive 28): Interpreter.run_all has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), error handling 3 (5 pts), boolean chains 4, match/switch 1 (nesting depth added 6). 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":"lib/graphql/execution/interpreter.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"839a92c710882b1dce2aa8af14a13446769abd0087c01b893732d680b998bec8"}},{"ruleId":"D2","level":"warning","message":{"text":"Language.escape_single_quoted_newlines (cognitive 28): Language.escape_single_quoted_newlines has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, ternaries 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":"lib/graphql/language.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b938b0d70c5648648298e1d0dc6c4276f421a98d1af324aef291c0f8020fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentObjectLoader.authorize_application_object (cognitive 28): ArgumentObjectLoader.authorize_application_object has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/schema/member/has_arguments.rb"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c85384e4825df702e3631223924bf41371a3a42c0465ad641c36b23765843d"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.call (cognitive 28): Resolver.call has cognitive complexity 28 (threshold 15). Drivers by points: error handling 6 (14 pts), if/else 10 (11 pts), boolean chains 3 (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":"lib/graphql/schema/resolver.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7734d0fe6ef0242b96c57802bf4470acab86012744f84a32306af1722764c49c"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldResolveStep.finish_extensions (cognitive 27): FieldResolveStep.finish_extensions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 1 (5 pts), error handling 1 (3 pts), boolean chains 2, match/switch 1 (2 pts), loops 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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f139321c5d1ff410e3ffd23988d2fa06dcc64bc9d31401314fe6a46a843afe"}},{"ruleId":"D2","level":"warning","message":{"text":"Visit.update_type_owner (cognitive 27): Visit.update_type_owner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, loops 1 (3 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":"lib/graphql/schema/visibility/visit.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d1e35797e181925ce39cb9278c5150f30ba47e1e20ba17de8981f65843220b"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildType.parse_type (cognitive 26): BuildType.parse_type has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 4 (8 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/schema/member/build_type.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd5f7a652f927dd0db44cdafe94d882a044f8e85521fba939a1462e2c98bd1e"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallGenerator.create_folder_structure (cognitive 25): InstallGenerator.create_folder_structure has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (23 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/generators/graphql/install_generator.rb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87e0fdc5b848776d88cc066c8ecd5ad68a3d44961a2fb5d73107ac9f79da5c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Finalize.check_list_result (cognitive 25): Finalize.check_list_result has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 3 (nesting depth added 5). 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":"lib/graphql/execution/finalize.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dfcbfbc217239cc341e020434687c7e6b7210dff8a4167731be95ca87ea297"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.selection_set (cognitive 25): Parser.selection_set has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (9 pts), match/switch 1 (3 pts), loops 1 (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":"lib/graphql/language/parser.rb"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b9a278a15ae76711fd0dae3b15e725835f32969e140f5d26a5fbdc60d54037"}},{"ruleId":"D2","level":"warning","message":{"text":"Directive.initialize (cognitive 25): Directive.initialize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 1 (3 pts), boolean chains 2, error handling 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":"lib/graphql/schema/directive.rb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"614d15446e7b7290fcf82450da3096402691070ee4abf58f9b8a1a0ef6f75e82"}},{"ruleId":"D2","level":"warning","message":{"text":"DefinitionDependencies.resolve_dependencies (cognitive 25): DefinitionDependencies.resolve_dependencies has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 2, 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":"lib/graphql/static_validation/definition_dependencies.rb"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0333c067dc2c7c1f96e12f803212af4c4e1da53d26550da2fe1f922c91aa7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldsWillMerge.find_conflicts_within (cognitive 25): FieldsWillMerge.find_conflicts_within has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 7 (10 pts), boolean chains 1 (nesting depth added 12). 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":"lib/graphql/static_validation/rules/fields_will_merge.rb"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c63b9e1c1c83df3dc491910b5478f5de3ed0b3aeaa5ac1b4afa3d867411a558"}},{"ruleId":"D2","level":"warning","message":{"text":"Subscriptions.normalize_arguments (cognitive 25): Subscriptions.normalize_arguments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2, 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":"lib/graphql/subscriptions.rb"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17d5aaa3f9628f08ce3675b83ab3577d1983bb2a85f3b7242ad58f77fac6065"}},{"ruleId":"D2","level":"warning","message":{"text":"SentryMonitor.instrument (cognitive 24): SentryMonitor.instrument has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4 (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":"lib/graphql/tracing/sentry_trace.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"10958ee0138755d7e94d4111679888bf5c2f4032a30ffdb6ab2e91ecfef67699"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldResolveStep.build_graphql_result (cognitive 23): FieldResolveStep.build_graphql_result has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, loops 1 (3 pts), ternaries 1 (nesting depth added 6). 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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d71aef2ba90ba364fafff3718173ff3ef78b8d58f1c5349b163463e3d7bf62f"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.run_eager (cognitive 23): Runtime.run_eager has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 3 (4 pts), boolean chains 2 (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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38930334631cb88df042171b9343d70dc928d3fc44561793e750231c19e0e53"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.execute (cognitive 23): Runner.execute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 3 (4 pts), boolean chains 3, loops 1, 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":"lib/graphql/execution/runner.rb"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d965cf8bb518351c49ffad564c9262dfa3ff3a2e385f46d792784c917b554f"}},{"ruleId":"D2","level":"warning","message":{"text":"InputObject.validate_non_null_input (cognitive 22): InputObject.validate_non_null_input has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5 (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":"lib/graphql/schema/input_object.rb"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"363a61f1480bec505eacb9183b35c2968594797703f7dc89c8427fd659ce12c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataloader.run_pending_steps (cognitive 21): Dataloader.run_pending_steps has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 5, loops 3 (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":"lib/graphql/dataloader.rb"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"44752907d728a700178bd0240d207085255e639bc2b1169959aad40af98f993e"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockString.trim_whitespace (cognitive 21): BlockString.trim_whitespace has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), loops 3, ternaries 2 (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":"lib/graphql/language/block_string.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6008ddf60ee8505b488e12508bab260dfead9138f258c01f5bbea7a52bfec4ec"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayConnection.load_nodes (cognitive 21): ArrayConnection.load_nodes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, ternaries 3 (5 pts), boolean chains 4 (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, 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":"lib/graphql/pagination/array_connection.rb"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"753b3bae300b6b50af6f5be96a1ff1d55373a7261ff13f342b190982a2950c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"Warden.visible_and_reachable_type? (cognitive 21): Warden.visible_and_reachable_type? has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6 (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":"lib/graphql/schema/warden.rb"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"7366ed54016d23f927f2d3114f47de390d6b492d5bfa1d2b71c3d634922e7c50"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldsWillMerge.legacy_find_conflicts_within (cognitive 21): FieldsWillMerge.legacy_find_conflicts_within has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, 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":"lib/graphql/static_validation/rules/fields_will_merge.rb"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"2882a7bc9fe51384d0350473c98edb7b327b4c5b861dca6d757d3fe2740c0fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"Helpers.run_graphql_field (cognitive 21): Helpers.run_graphql_field has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (4 pts), ternaries 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":"lib/graphql/testing/helpers.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aa250ba21a56650c2874d757fe7c89c8002487194431540dc0bc097510f7ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.gather_selections (cognitive 20): Runner.gather_selections has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, 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":"lib/graphql/execution/runner.rb"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11d11a6c5e4bf75572d3b173ce757740f18c81cec46ea2f9cad553c57fe0572"}},{"ruleId":"D2","level":"warning","message":{"text":"VariableValues.coerce_input_object_value (cognitive 20): VariableValues.coerce_input_object_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/variable_values.rb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eeed13c98379be86a1bba114da6cb6d9c5118c5b22a1fef95ebdb626715fd97"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer.print_schema_definition (cognitive 20): Printer.print_schema_definition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6, ternaries 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":"lib/graphql/language/printer.rb"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0b3a16f25faddc2fdcf4a0bba163d6cd22793e937c80523ce2153fcc71d8a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.query (cognitive 20): Schema.query has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4 (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 (Schema.mutation) 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":"lib/graphql/schema.rb"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee313012c9f8b271ba350a62bd78a8fcbd8f1214855ed09f130f8b07995e856"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.mutation (cognitive 20): Schema.mutation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4 (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 (Schema.query) 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":"lib/graphql/schema.rb"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"872e9a8bd51a403a5d0943ec87fcf853f4ef56acd90470156ff3aae6e1d7fc6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.subscription (cognitive 20): Schema.subscription has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4 (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":"lib/graphql/schema.rb"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"827c1329f607a73e63b014b1a8ec4b8911a30ba9790303e58a9e5c31fc388f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeExtension.after_resolve (cognitive 20): ScopeExtension.after_resolve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 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":"lib/graphql/schema/field/scope_extension.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ebda10349ab6b14e0a992bf1f9c0720693fed7d8fcc8fe1cc58d3a947f8455"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericalityValidator.validate (cognitive 20): NumericalityValidator.validate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, boolean chains 9. 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":"lib/graphql/schema/validator/numericality_validator.rb"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8dddf4ae1e99b11644c3ed4a0fb1d6cb1f7f7bdcbf30df603db6f26d899aac"}},{"ruleId":"D2","level":"warning","message":{"text":"Event.stringify_args (cognitive 20): Event.stringify_args has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (4 pts), boolean chains 3, 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":"lib/graphql/subscriptions/event.rb"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"428a42617aa189c4ea17b51d6fb524a2323280afed9e20e741dd5e0815347ccb"}},{"ruleId":"D2","level":"warning","message":{"text":"PerfettoTrace.initialize (cognitive 20): PerfettoTrace.initialize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 8, ternaries 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":"lib/graphql/tracing/perfetto_trace.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ce901e47711f97144a584070cf67fdb84d25ad07fa11b706eb25b84c2ef08b"}},{"ruleId":"D2","level":"warning","message":{"text":"graphql_highlighter.highlightGraphQL (cognitive 20): graphql_highlighter.highlightGraphQL has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 3 (9 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":"tool/docs/assets/graphql_highlighter.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09a4484ce3e87ac40addbaf2bfdce62e804bd7b517f34614f61d30f0032a713"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncDataloader.run_queue (cognitive 19): AsyncDataloader.run_queue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/dataloader/async_dataloader.rb"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1986712ba1cee3a56b9a864271b1d6d44fb9373a81aa695a021971de1c19bf"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldResolveStep.execute_field (cognitive 19): FieldResolveStep.execute_field has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), error handling 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ab0499e452e82cbb1899a8fc0d7d6144f03bc8e1af9c7a85e567c95ce28c85"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.after_lazy (cognitive 19): Runtime.after_lazy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 3 (9 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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81b92aac28d23386a251388ca2e332bcc9f0163b654d40e02dbb4b7c1bc6fc5"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.possible_types (cognitive 19): Schema.possible_types has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (3 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":"lib/graphql/schema.rb"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"251cfd3c8a5af6b4553f70d5f646abe3797d816fa70b8d1c4de789d999a52e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Query.initialize (cognitive 18): Query.initialize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 2 (3 pts) (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":"lib/graphql/query.rb"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01410a931ab4c5948e1a3598e440c96d6eedd895d8e981ee609ed2ef6031e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.get_type (cognitive 18): Schema.get_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, match/switch 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/schema.rb"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bda1e3446da3fa69825c42bf2eefef6299e110f0493ab2568bf2c656f38b51c"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.add_linked_types (cognitive 18): Builder.add_linked_types has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, ternaries 1 (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":"lib/graphql/schema/build_from_definition.rb"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea7fdee24c75f4023baa8bd24d1b85d576dd5033995338f236d2fc02c548dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"HasInterfaces.implements (cognitive 18): HasInterfaces.implements has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (7 pts), boolean chains 3 (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":"lib/graphql/schema/member/has_interfaces.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"226008f44b452fc81dbb1d4e63fa2a48d009657148511a292b1602b9f035be78"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.resolve_with_support (cognitive 18): Resolver.resolve_with_support has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (18 pts) (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":"lib/graphql/schema/resolver.rb"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e30f068d49655686c5e41a58acb2909e714e528489146427e69669cfe966f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Profile.compute_type (cognitive 18): Profile.compute_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/schema/visibility/profile.rb"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fee640d775dabf995c1c65727861d026f5ef40bb97bf9e28ed8361752bf134"}},{"ruleId":"D2","level":"warning","message":{"text":"Warden.check_visible (cognitive 18): Warden.check_visible has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/schema/warden.rb"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"885e36081c299ece7309d314bb73622bc14b560c8321454b940577912eed1df1"}},{"ruleId":"D2","level":"warning","message":{"text":"Table.rows (cognitive 17): Table.rows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 1 (2 pts), boolean chains 1, 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":"lib/graphql/backtrace/table.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da080614e19aaeceace74432572d147b1cb789a1dbb1080a54b6ce3e3962421"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldResolveStep.enqueue_next_steps (cognitive 17): FieldResolveStep.enqueue_next_steps has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"df96d3970181e5990748204e119371b80499e77f8ac452f35c259172ebfdbc32"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.evaluate_selection_with_args (cognitive 17): Runtime.evaluate_selection_with_args has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebb05f58c11f37274060e8fa326dc8a2f4b7db71ea31aecee36ce83d300397f"}},{"ruleId":"D2","level":"warning","message":{"text":"RelationConnection.has_next_page (cognitive 17): RelationConnection.has_next_page 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":"lib/graphql/pagination/relation_connection.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3536434bb07e0b84bef2e36726a0d4e1292d2d2fa660c885eff4904f50ababa"}},{"ruleId":"D2","level":"warning","message":{"text":"Argument.load_and_authorize_value (cognitive 17): Argument.load_and_authorize_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 pts) (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":"lib/graphql/schema/argument.rb"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afacb8e2294c190d83fe958e476e38c4950b347987be94c17988dcdf164a924"}},{"ruleId":"D2","level":"warning","message":{"text":"Profile.possible_types_for (cognitive 17): Profile.possible_types_for has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/schema/visibility/profile.rb"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece6c13264921f9f650f481163e1c35c5ade7c975ecf82887716d7566a8e63a3"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldsWillMerge.legacy_mutually_exclusive? (cognitive 17): FieldsWillMerge.legacy_mutually_exclusive? has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 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":"lib/graphql/static_validation/rules/fields_will_merge.rb"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"30724d66a1ddc15b8e0d4ca29a95144f87a676b5892be01f2ddc789eaf2a4468"}},{"ruleId":"D2","level":"warning","message":{"text":"SubscriptionRootExistsAndSingleSubscriptionSelection.subscription_root_fields (cognitive 17): SubscriptionRootExistsAndSingleSubscriptionSelection.subscription_root_fields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 1 (3 pts), boolean chains 2, 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":"lib/graphql/static_validation/rules/subscription_root_exists_and_single_subscription_selection.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd34b59671915f5d96376332dd368cde35a296a25f33c7f8450c64a5e2354fe"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultSubscriptionResolveExtension.resolve (cognitive 17): DefaultSubscriptionResolveExtension.resolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/subscriptions/default_subscription_resolve_extension.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f7d4a444341c1be0f60192254bd24f7e07b5598d7996af3b24eb39adc5edcf"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkChecker.check (cognitive 17): LinkChecker.check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/docs/link_checker.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4655fce02a157265230e6879afd71fe8da408b8d95dc9e55476a900d39465c"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldResolveStep.call (cognitive 16): FieldResolveStep.call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 1, error handling 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, 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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97ffbd20ee646a28dce56f0a89e712030ea03c358fa92861f4169b208331af3"}},{"ruleId":"D2","level":"warning","message":{"text":"Finalize.initialize (cognitive 16): Finalize.initialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), match/switch 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/finalize.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf101967769af75da1fe5373d05e509149ad0c40699d82a8617cd579c2f75d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Lookahead.find_selections (cognitive 16): Lookahead.find_selections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/lookahead.rb"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9749ad7f2a8dcc9d2c803d25d850181a85fc7b834d48fa0bb0b91adb02d0d7af"}},{"ruleId":"D2","level":"warning","message":{"text":"RelationConnection.calculate_sliced_nodes_parameters (cognitive 16): RelationConnection.calculate_sliced_nodes_parameters has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/pagination/relation_connection.rb"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f19240fb9e2eaaf099a72c962a86c4fe9b8af30f15e2da26901ea0e9cc82cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"HasDirectives.get_directives (cognitive 16): HasDirectives.get_directives has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 4). 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":"lib/graphql/schema/member/has_directives.rb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc78878d3474e6be9013d6dfe9a74eb7732d130066083ee12079fcd27904598"}},{"ruleId":"D2","level":"warning","message":{"text":"HasFields.field (cognitive 16): HasFields.field has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (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":"lib/graphql/schema/member/has_fields.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d266486cafeef756c5ae26597a27e331fae32273b580853fbd91aa337fd987"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator.from_config (cognitive 16): Validator.from_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, match/switch 1 (2 pts) (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":"lib/graphql/schema/validator.rb"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ee0bd02bbd152af91ba6799d89ba011cdabc6bfda9da899c5651ed9030b578"}},{"ruleId":"D2","level":"warning","message":{"text":"Profile.compute_field (cognitive 16): Profile.compute_field has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3 (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":"lib/graphql/schema/visibility/profile.rb"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1fb95d3d7df3cea92066869aaa7ee6650108185118b84c97066ad63a748dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldsWillMerge.selections_may_conflict? (cognitive 16): FieldsWillMerge.selections_may_conflict? has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 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":"lib/graphql/static_validation/rules/fields_will_merge.rb"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae06c7f4670c8c562c3260bec6d699b71b9bf739dd3920d2a77ef452c4bec44"}},{"ruleId":"D2","level":"warning","message":{"text":"createAblyFetcher.createAblyFetcher.\u003Creturned closure\u003E (cognitive 16): createAblyFetcher.createAblyFetcher.\u003Creturned closure\u003E has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 57, 62, 67). 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":"javascript_client/src/subscriptions/createAblyFetcher.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"246c2be28e9bd4059acbb1ed81b970159ca77406b0c152bd59499562556c2bde"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Schema: TooManyMethods \u2014 147 methods. The bar is 30 methods; this is 117 over it, 4.90\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":"lib/graphql/schema.rb"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc6fb3baf2801905951da75167fb39944b8e9dd34519b430256e0c1ab3c77e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: language/nodes.rb: FileTooLong \u2014 1715 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1215 over it, 3.43\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":"lib/graphql/language/nodes.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1aa2f63615fbcd4da3372d3616d2d2d3d5d2a6ff4fbb187250a67513e3f9158"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphql/schema.rb: FileTooLong \u2014 1425 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 925 over it, 2.85\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":"lib/graphql/schema.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ff4cb461681a5a8a8a0896203a7976608ea3439065ed7e83f2658fcd7d3e81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpreter/runtime.rb: FileTooLong \u2014 866 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 366 over it, 1.73\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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4249a0d0294e40f823b394df6372a48cc4f1491bc00c4988478dbc1fff9997"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: execution/field_resolve_step.rb: FileTooLong \u2014 822 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 322 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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3265755f848a9d3c0dd199a1a9025e8ad5c2b7bbc415634e4a991ef793914a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/field.rb: FileTooLong \u2014 794 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 294 over it, 1.59\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":"lib/graphql/schema/field.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d69d050bc98cba108e60716afb07a60a12951b1336c3952209b36ace66046f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: language/parser.rb: FileTooLong \u2014 785 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 285 over it, 1.57\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":"lib/graphql/language/parser.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"729c4544d3124374f8157bc70641ca560b0b4123a22d974ee85d651e7a1216f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.sync: FunctionTooLong \u2014 sync runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\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":"javascript_client/src/sync/index.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e946ad8b745f3c29b0afbf61da00988baec8d4e11e3a96035203c63e5d0dfe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/build_from_definition.rb: FileTooLong \u2014 736 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 236 over it, 1.47\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":"lib/graphql/schema/build_from_definition.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a276dd6f626cdd44898645f41b311203d06ffbf749c49d01ca3997feb7ce08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tracing/perfetto_trace.rb: FileTooLong \u2014 691 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 191 over it, 1.38\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":"lib/graphql/tracing/perfetto_trace.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03010ba31addd93c31d8dffaff05c2b7cc1afcd8e38e5152e590a72f02ef80d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Query: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"lib/graphql/query.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32ba7f944b2c8b186462fb7e67c92523b82bcb7842dad28d33edd65343d0d25"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Field: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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":"lib/graphql/schema/field.rb"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"497c8ac625e5fcde748c50deee4355977f3c9f010da0747a50982df2623467e0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Warden: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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":"lib/graphql/schema/warden.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec70e8784dddc15a3cccab2e7c25920d462441bf9566c27d693a1b5753a9e52"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PerfettoTrace: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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":"lib/graphql/tracing/perfetto_trace.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a48698d43a9d07a0d91677eab82b2c2d06316337d23d73deef2d315dac4e20a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Printer: 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":"lib/graphql/language/printer.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316d0339490a2b9ff2ed50327b3b324b47ab92e75344bf72989fbadd40ec99f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"lib/graphql/language/parser.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba08d9d2b1ff6689f0c194fbf0d856c71ca3b135427ec7c397f40c3296dab7fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rules/fields_will_merge.rb: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 85 over it, 1.17\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":"lib/graphql/static_validation/rules/fields_will_merge.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86860adaac86d3c6d5fc864ef3a88bbe3b561f190d9a6c888d882c30f81ae4ce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Resolver: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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":"lib/graphql/schema/resolver.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b9dea886fa97088559dd59bd36361534f613c41c8377f480f925a9c14113cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Profile: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\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":"lib/graphql/schema/visibility/profile.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec046e3ad371dd51129e416ba57714de4d78bd6495d0e73980930b1d695fc1e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FieldsWillMerge: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\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":"lib/graphql/static_validation/rules/fields_will_merge.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"921c63dbea870749476e80b164c12220fc046adb529c94b7cec5a6e6639fccea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FieldResolveStep: 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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a0091facba66720cba9887319e00bbb059731cd00509e0db2c8b51ff4f99c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): lib/graphql/schema/addition.rb:111-175 | lib/graphql/schema/visibility/visit.rb:139-188 \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":"lib/graphql/schema/addition.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9a22a426081a1cc4dbd3c34f55a04b44e079d28ac36534c13f629207bd56d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lib/graphql/dataloader.rb:208-242 | lib/graphql/dataloader/async_dataloader.rb:209-241 \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":"lib/graphql/dataloader.rb"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbd313bc08c85143daba0e5683d65831d0e9d9cfc1d5a4eb9bacac0faa7642e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/graphql/schema/field.rb:1446-1465 | lib/graphql/schema/field.rb:1471-1490 \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":"lib/graphql/schema/field.rb"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2362062aabf0eb82766626797498cd5ce3249ac82144ecfe5aaa22b61a118b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): lib/graphql/schema.rb:669-696 | lib/graphql/schema.rb:721-748 | lib/graphql/schema.rb:773-803 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 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":"lib/graphql/schema.rb"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"825b280690f311e74ab65c196c1884f03d3d0b60e66f8643638ccc002f5055c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/graphql/language/printer.rb:375-387 | lib/graphql/language/printer.rb:398-412 \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":"lib/graphql/language/printer.rb"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c91c352ae343fe423da1f8521a5cef1a646e61d40e5290cde1675985533613"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/graphql/schema/member/has_arguments.rb:190-200 | lib/graphql/schema/member/has_fields.rb:251-261 \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":"lib/graphql/schema/member/has_arguments.rb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bd2a6b7bd098345ae33fec36826ce76c4a7110ea1fcb26028147cb76ed9508"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/graphql/rubocop/graphql/base_cop.rb:15-33 | lib/graphql/rubocop/graphql/field_type_in_block.rb:104-120 \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":"lib/graphql/rubocop/graphql/base_cop.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd21d7ced4c6d8f4280bfb7194ccde9a5238aa5f32f204125536040c48f0d96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/graphql/language/printer.rb:130-145 | lib/graphql/language/printer.rb:194-211 \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":"lib/graphql/language/printer.rb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8a6eed0e5640544048ef54821c39085e5845c7c3dafeec45de42846b2c1490"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/graphql/static_validation/rules/input_object_names_are_unique.rb:19-32 | lib/graphql/static_validation/rules/variable_names_are_unique.rb:11-25 \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":"lib/graphql/static_validation/rules/input_object_names_are_unique.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e9170ad99b2fc9789721cfb6b4bf214897bfa93f5216f04b2a3286406e91c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/graphql/rubocop/graphql/field_type_in_block.rb:45-58 | lib/graphql/rubocop/graphql/field_type_in_block.rb:62-75 \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":"lib/graphql/rubocop/graphql/field_type_in_block.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd7203bb09a2b27acbc8e38ce6e6b93bb53f6c691d510c627ee168f58b346d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): lib/graphql/tracing/perfetto_trace.rb:367-387 | lib/graphql/tracing/perfetto_trace.rb:542-554 | lib/graphql/tracing/perfetto_trace.rb:572-584 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/tracing/perfetto_trace.rb"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"487a8fd7393c7f5e448267948055f21da49934a15b3320879f639dcc4d205578"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/graphql/language/document_from_schema_definition.rb:83-89 | lib/graphql/language/document_from_schema_definition.rb:93-100 \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":"lib/graphql/language/document_from_schema_definition.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0ec6a8f6608bdc5487c38a0ce62d7898c4b5beefc53154fe5e06acf7a0bcec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/graphql/schema/build_from_definition.rb:580-592 | lib/graphql/schema/build_from_definition.rb:612-619 \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":"lib/graphql/schema/build_from_definition.rb"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfc6a29c5765608afc504e3c61b1e685c1d17183b516e17df41780ceb9baf6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/graphql/tracing/appoptics_trace.rb:239-242 | lib/graphql/tracing/appoptics_tracing.rb:160-163 \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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9309b68f2d0e91bc1468de2f583871e46510134e99a2fa8b59fc6ba3c3873ee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/graphql/execution/prepare_object_step.rb:8-21 | lib/graphql/execution/selections_step.rb:8-19 \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":"lib/graphql/execution/prepare_object_step.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67690b21a4bc8048381b173afd82aa7e1e17659c253acc766116adbbecd41be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/graphql/static_validation/rules/variable_default_values_are_correctly_typed_error.rb:21-25 | lib/graphql/static_validation/rules/variables_are_used_and_defined_error.rb:19-22 \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":"lib/graphql/static_validation/rules/variable_default_values_are_correctly_typed_error.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c9517b18435beed0ddb8940c55208a2af5e8736fdd85b2308a30d1a80be7f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/graphql/execution/interpreter/execution_errors.rb:16-26 | lib/graphql/query/context.rb:17-26 \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":"lib/graphql/execution/interpreter/execution_errors.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"20272c10ad38570d3bb57a15911c0a7fb9a85f6240f8190fda7eb9f770a49829"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/graphql/tracing/appoptics_trace.rb:185-188 | lib/graphql/tracing/appoptics_tracing.rb:106-109 \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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c082af82e89815acfea49b59203d6c67f7db2be5c8d0cabaf5042a5956e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/graphql/tracing/appoptics_trace.rb:232-235 | lib/graphql/tracing/appoptics_tracing.rb:153-156 \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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8ac5dd6c6e7c8e8122413e2ea44ae3c8e06eb8bce5ab221bd46af6bebfb9ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): tool/docs/compatibility.rb:49-50 | tool/docs/legacy.rb:41-42 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"tool/docs/compatibility.rb"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"642d4c4d0e9ba55bc79f120ea6faadd61b36e7733459a27fae949187706dcd26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/graphql/language/parser.rb:259-276 | lib/graphql/language/parser.rb:300-317 \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":"lib/graphql/language/parser.rb"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"df54bf0bf207cad7ca7119ac6a19eeea7e14f205b0e5164f50742c512e30cd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/graphql/tracing/appoptics_trace.rb:193-208 | lib/graphql/tracing/appoptics_tracing.rb:114-129 \u2014 before extracting anything, compare \u0060lib/graphql/tracing/appoptics_trace.rb\u0060 and \u0060lib/graphql/tracing/appoptics_tracing.rb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2521fe8fcacc4c61689a8830001094c7d6b3c47dd0eb06b5f976eec28f831250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/graphql/rubocop/graphql/base_cop.rb:15-29 | lib/graphql/rubocop/graphql/field_type_in_block.rb:104-118 \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":"lib/graphql/rubocop/graphql/base_cop.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"879976312b3c382a0d17625d585f937b25a5c2c859bce6bb9093356efd166f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/graphql/schema/addition.rb:157-171 | lib/graphql/schema/visibility/visit.rb:171-185 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/graphql/schema/addition.rb:172\u0060 calls \u0060references_to\u0060 and \u0060lib/graphql/schema/visibility/visit.rb:186\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":"lib/graphql/schema/addition.rb"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3ed288bd1f1932d51594dab0ecad91cd69f4e5aa181a492f15cc50b6bcb7ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/graphql/schema/addition.rb:228-242 | lib/graphql/schema/addition.rb:246-260 \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":"lib/graphql/schema/addition.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20ac808bc07a165be24f4cc059ea75e64ea3a5bdebe792e1b496a13ce313fde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/graphql/schema/addition.rb:121-134 | lib/graphql/schema/visibility/visit.rb:146-159 \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":"lib/graphql/schema/addition.rb"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31d04fab18d8d8762c0ad0fe6c72d5817fe2da132518f5b293f72851e1f777e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/graphql/schema/build_from_definition.rb:748-758 | lib/graphql/schema/build_from_definition.rb:763-773 \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 \u0060lib/graphql/schema/build_from_definition.rb:748\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":"lib/graphql/schema/build_from_definition.rb"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"18df9191755863e29a8407c76280d8dfdda4a43569d3939155f23a9ad6106eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/graphql/tracing/perfetto_trace.rb:542-551 | lib/graphql/tracing/perfetto_trace.rb:572-581 \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":"lib/graphql/tracing/perfetto_trace.rb"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a2aac8a6d9c73f2c164bf066ecc5a6384cc4e06d14c474266389a9554c12c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/generators/graphql/mutation_generator.rb:26-33 | lib/generators/graphql/orm_mutations_base.rb:36-43 \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":"lib/generators/graphql/mutation_generator.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e173aa3a92bd86052292596e1f44ad74d60086340c83aab1448cadec0800e293"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/generators/graphql/input_generator.rb:21-48 | lib/generators/graphql/object_generator.rb:29-48 \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 \u0060lib/generators/graphql/input_generator.rb:21\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/generators/graphql/input_generator.rb:48\u0060 calls \u0060gsub\u0060 and \u0060lib/generators/graphql/object_generator.rb:49\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":"lib/generators/graphql/input_generator.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7151e2c31e33ced80d6b44b56d6fcad3bcc74a32f1aaad9f23b23c7101e682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/graphql/introspection/directive_type.rb:28-35 | lib/graphql/introspection/field_type.rb:21-38 \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":"lib/graphql/introspection/directive_type.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"49270660431ef1de40ee9522bf58224202c16d0b06eb6a95493b10d9b0fed33f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/graphql/static_validation/rules/argument_names_are_unique_error.rb:12-31 | lib/graphql/static_validation/rules/input_object_names_are_unique_error.rb:12-31 \u2014 before extracting anything, compare \u0060lib/graphql/static_validation/rules/argument_names_are_unique_error.rb\u0060 and \u0060lib/graphql/static_validation/rules/input_object_names_are_unique_error.rb\u0060 as WHOLE FILES: 93% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/static_validation/rules/argument_names_are_unique_error.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"350015a426d6d548a1d41ece55a081a27aa8fb14ac9b37a70d8326f705abbf92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/graphql/static_validation/rules/directives_are_defined_error.rb:12-31 | lib/graphql/static_validation/rules/unique_directives_per_location_error.rb:12-31 \u2014 before extracting anything, compare \u0060lib/graphql/static_validation/rules/directives_are_defined_error.rb\u0060 and \u0060lib/graphql/static_validation/rules/unique_directives_per_location_error.rb\u0060 as WHOLE FILES: 93% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/static_validation/rules/directives_are_defined_error.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d091a105a055165e6d38979df443106f526e767e2105b9c7e0b2c53b7b9f939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): lib/graphql/static_validation/rules/fragment_names_are_unique_error.rb:12-31 | lib/graphql/static_validation/rules/fragments_are_finite_error.rb:12-31 | lib/graphql/static_validation/rules/fragments_are_used_error.rb:12-31 \u2014 before extracting anything, compare \u0060lib/graphql/static_validation/rules/fragment_names_are_unique_error.rb\u0060 and \u0060lib/graphql/static_validation/rules/fragments_are_finite_error.rb\u0060 as WHOLE FILES: 93% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/static_validation/rules/fragment_names_are_unique_error.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3443373686d35d3f68919a3cdadb4eb8f1396e4f823a0e6d9131c13c4809bf62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/graphql/static_validation/rules/fragment_types_exist_error.rb:12-31 | lib/graphql/static_validation/rules/fragments_are_on_composite_types_error.rb:11-28 \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":"lib/graphql/static_validation/rules/fragment_types_exist_error.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0756296e5f456eed23953fc6c64e8ceca0c2b044eebb2a8d5dcaf0d4f610db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 6): lib/graphql/static_validation/rules/fragments_are_named_error.rb:10-27 | lib/graphql/static_validation/rules/mutation_root_exists_error.rb:10-27 | lib/graphql/static_validation/rules/no_definitions_are_present_error.rb:9-26 | lib/graphql/static_validation/rules/not_single_subscription_error.rb:9-26 | lib/graphql/static_validation/rules/query_root_exists_error.rb:10-27 | lib/graphql/static_validation/rules/subscription_root_exists_error.rb:10-27 \u2014 before extracting anything, compare \u0060lib/graphql/static_validation/rules/fragments_are_named_error.rb\u0060 and \u0060lib/graphql/static_validation/rules/mutation_root_exists_error.rb\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/static_validation/rules/fragments_are_named_error.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6aa0bd8e21299aba0c1271419f0e9a4209470c22f148b69a462ed239bb6ac61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/graphql/execution/interpreter/runtime.rb:1055-1060 | lib/graphql/execution/runner.rb:232-237 \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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b75e3a462b6e2149357d3c7a35bd729bc10c619657490a4fc0b2758da9b1344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/graphql/integer_encoding_error.rb:28-39 | lib/graphql/string_encoding_error.rb:8-19 \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":"lib/graphql/integer_encoding_error.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6715185d8fe55db55dc8fa3dc6ccac989b95e3e946647341c00f2bab29370ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/graphql/tracing/appoptics_trace.rb:164-171 | lib/graphql/tracing/appoptics_tracing.rb:85-92 \u2014 before extracting anything, compare \u0060lib/graphql/tracing/appoptics_trace.rb\u0060 and \u0060lib/graphql/tracing/appoptics_tracing.rb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0959de94673a21b57c10a3dd51d82ea673f1a81c1a6b6492060c607d5e8f1e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/graphql/tracing/appoptics_trace.rb:175-181 | lib/graphql/tracing/appoptics_tracing.rb:96-102 \u2014 before extracting anything, compare \u0060lib/graphql/tracing/appoptics_trace.rb\u0060 and \u0060lib/graphql/tracing/appoptics_tracing.rb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e64cd05faed702efa3d192a3e01ffa053fc29864f13a33020a60008c2cfa10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/graphql/tracing/appoptics_trace.rb:213-217 | lib/graphql/tracing/appoptics_tracing.rb:134-138 \u2014 before extracting anything, compare \u0060lib/graphql/tracing/appoptics_trace.rb\u0060 and \u0060lib/graphql/tracing/appoptics_tracing.rb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb4a3c779fd74acb38d791123123896125e94abfb61106b34a67e3e7d6f5656"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/graphql/tracing/appoptics_trace.rb:221-228 | lib/graphql/tracing/appoptics_tracing.rb:142-149 \u2014 before extracting anything, compare \u0060lib/graphql/tracing/appoptics_trace.rb\u0060 and \u0060lib/graphql/tracing/appoptics_tracing.rb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3081990f33af9206c75f7a8da3268265d160b590bf7cc8dc3c24b86176a78d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lib/graphql/tracing/monitor_trace.rb:35-43 | lib/graphql/tracing/platform_trace.rb:110-118 | lib/graphql/tracing/platform_tracing.rb:101-109 \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":"lib/graphql/tracing/monitor_trace.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c66b5d7bd32be3e2290755cd2af21c654afef46828d1a9babd3b084c11c603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/graphql/schema/member/has_arguments.rb:176-185 | lib/graphql/schema/member/has_fields.rb:235-244 \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":"lib/graphql/schema/member/has_arguments.rb"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1b32c6ee5950600d1d00fd9de9f64354cb6a78b32f945bde4155ec91898297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/graphql/static_validation/rules/directives_are_in_valid_locations_error.rb:22-29 | lib/graphql/static_validation/rules/fields_have_appropriate_selections_error.rb:22-29 | lib/graphql/static_validation/rules/variable_default_values_are_correctly_typed_error.rb:31-38 \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":"lib/graphql/static_validation/rules/directives_are_in_valid_locations_error.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"054bf646d87905020dc71fb0b6f264bd3a19ed561902aac838fd20ae07fa6d66"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Field (LCOM4 6): Field\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \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 6 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":"lib/graphql/schema/field.rb"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"042d505af233738146efce883408e0e0160c5cccba4edb3c5d74e96c51192e52"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TracesController (LCOM4 5): TracesController\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":"lib/graphql/dashboard/detailed_traces.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"502c3e3834113297b2f95e0ab2553c62397fe757afbf54bfce8cf2c74369563a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AbstractNode (LCOM4 5): AbstractNode\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":"lib/graphql/language/nodes.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da34b6f46790ad7f9e66790854f66d96131b6a0c5b8c535bd1b052df21c7403"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Visitor (LCOM4 5): Visitor\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":"lib/graphql/language/visitor.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"be529b3f347e4f4bc4b6618da262cfcb0f19eac1f15237b2e0e50ff07db939ad"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Argument (LCOM4 5): Argument\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":"lib/graphql/schema/argument.rb"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec274f4b865df44d137809dfea4037b25d37a9f6d5a9efff9c3727f0b1b74c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EnumValue (LCOM4 5): EnumValue\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":"lib/graphql/schema/enum_value.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2becc1f9db44f3d8068681fbca3acbf80a911e96e8a6766c9c7c87eab1c22483"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TypeGeneratorBase (LCOM4 4): TypeGeneratorBase\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":"lib/generators/graphql/type_generator.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b4186577ba36c3bdf6bb2e242b90dd6bd10930da4cade4d1a76fbde7bb00b8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Connection (LCOM4 4): Connection\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":"lib/graphql/pagination/connection.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabcdb477f3654654781b2e154aae9ccc00430027519967e9e39febedf489a1f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Query (LCOM4 4): Query\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":"lib/graphql/query.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d7879cf05d546a413851feead0f4ab372c02cc2070ed4c7ae869db4c2f947f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Subscription (LCOM4 4): Subscription\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":"lib/graphql/schema/subscription.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"652907f23934e87ab80113ddeb21376176c88a9954234999fc4d18664f35f4c4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: exits 0 on OK: 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":"javascript_client/src/__tests__/cliTest.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"393f26b7a05d4a92e5a18a0814770e9ff1dded24ed24ee352fdb106bb233fceb"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: allows passing custom callbacks: 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 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":"javascript_client/src/subscriptions/__tests__/ActionCableLinkTest.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"232592cbe2979e51b81da186bd6c7e37029d3df9677c68bf93c37a2a094d613d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/schema/build_from_definition.rb: lib/graphql/schema/build_from_definition.rb changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in Builder.build at line 36. 1 of those changes was a fix/bug commit, and the other 21 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/schema/build_from_definition.rb\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":"lib/graphql/schema/build_from_definition.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe000641b28cf81ecc0e53d437867db10c8814bb6b17585c7aa6c8ff09935bde"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/execution/input_values.rb: lib/graphql/execution/input_values.rb changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in InputValues.value_from_ast at line 183. 4 of those changes were fix/bug commits, and the other 9 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/execution/input_values.rb\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":"lib/graphql/execution/input_values.rb"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"297da36eb99026e0c26ac2df23c7af748425f63b2bdfa0437430f1d05ef62536"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/execution/field_resolve_step.rb: lib/graphql/execution/field_resolve_step.rb changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in FieldResolveStep.resolve_batch at line 795. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/execution/field_resolve_step.rb\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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a30372fe9c68677772aa2d6ed20edfddf9a0599f2e7a0bf8a966a62648b67c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/language/lexer.rb: lib/graphql/language/lexer.rb changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Lexer.advance at line 35. 3 of those changes were fix/bug commits, and the other 13 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/language/lexer.rb\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":"lib/graphql/language/lexer.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b9430e9d74b70f93ff1fdcddbabe043612f25e29f3cbfa7acf9430c9c26819"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/execution/runner.rb: lib/graphql/execution/runner.rb changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Runner.begin_execute at line 253. 1 of those changes was a fix/bug commit, and the other 14 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/execution/runner.rb\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":"lib/graphql/execution/runner.rb"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe09bb0de3bc29d01be6cc6359fd9e82e99482edc051f787e37f9eeee10318ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/language/parser.rb: lib/graphql/language/parser.rb changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Parser.definition at line 130. 2 of those changes were fix/bug commits, and the other 7 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/language/parser.rb\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":"lib/graphql/language/parser.rb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cf1874f685ef860c1844190f5ae4e2c8c4cca7befc66284b9f9c5781a18c07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/execution/interpreter/runtime.rb: lib/graphql/execution/interpreter/runtime.rb changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Runtime.continue_value at line 584. 2 of those changes were fix/bug commits, and the other 8 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/execution/interpreter/runtime.rb\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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fb58bb59f10785aaa1b86f69b0e6968df6f184c638b16ef37c21b5b69e30db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/schema/addition.rb: lib/graphql/schema/addition.rb changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in Addition.add_type at line 178. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/schema/addition.rb\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":"lib/graphql/schema/addition.rb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1ba5d3209df3a0fbd527823b64efaebe280ce6fee2e39564da1b84ddeeb73f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/static_validation/rules/fields_will_merge.rb: lib/graphql/static_validation/rules/fields_will_merge.rb changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in FieldsWillMerge.find_conflict at line 462. 1 of those changes was a fix/bug commit, and the other 10 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/static_validation/rules/fields_will_merge.rb\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":"lib/graphql/static_validation/rules/fields_will_merge.rb"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"d338c8246afc524412cba1e1af3b2093169177581b8c85f59c9efebd8a3bf919"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/schema/field.rb: lib/graphql/schema/field.rb changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Field.calculate_complexity at line 970. 2 of those changes were fix/bug commits, and the other 9 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/schema/field.rb\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":"lib/graphql/schema/field.rb"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"422561e98379879b2d820b63daeb8a0a186b86b44c594a4d4e4c1d06d06f1bd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/static_validation/rules/variable_usages_are_allowed.rb: lib/graphql/static_validation/rules/variable_usages_are_allowed.rb changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in VariableUsagesAreAllowed.on_argument at line 79. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/static_validation/rules/variable_usages_are_allowed.rb\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":"lib/graphql/static_validation/rules/variable_usages_are_allowed.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a640768b75d63221aac3e9c389885566c94b223d53445459020029d34b4bc8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/subscriptions/serialize.rb: lib/graphql/subscriptions/serialize.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Serialize.load_value at line 92. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/subscriptions/serialize.rb\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":"lib/graphql/subscriptions/serialize.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"09466cba65cd3a3641ad8c56b2a45b5ef263563dc650feb3713566b6f3e02be2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/static_validation/rules/fields_have_appropriate_selections.rb: lib/graphql/static_validation/rules/fields_have_appropriate_selections.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in FieldsHaveAppropriateSelections.validate_field_selections at line 29. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/static_validation/rules/fields_have_appropriate_selections.rb\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":"lib/graphql/static_validation/rules/fields_have_appropriate_selections.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fba62b1e31f1c2a43f496e362396a9f4674b47ab0a032af5e7918324724f3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/language.rb: lib/graphql/language.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Language.escape_single_quoted_newlines at line 54. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/language.rb\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":"lib/graphql/language.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4775977d4a7e23515fe7b63eb811bcfedafd0feb5660469271103570b81b7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/graphql/language/block_string.rb: lib/graphql/language/block_string.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in BlockString.trim_whitespace at line 10. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:24:11 -05:00\u0027 --until=\u00272026-11-11 11:24:11 -05:00\u0027 --full-history --no-merges -- lib/graphql/language/block_string.rb\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":"lib/graphql/language/block_string.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5146554c7352af12cff8e457e4f963c0ff23d200185be59bad46656054de0eb4"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 56 significant file(s) lose their only recent owner: lib/graphql/tracing/perfetto_trace.rb, lib/graphql/schema/warden.rb, lib/graphql/schema/member/has_fields.rb, lib/graphql/subscriptions.rb, lib/graphql/execution/input_values.rb, lib/graphql/schema/visibility.rb, lib/graphql/tracing/trace.rb, lib/graphql/schema/subscription.rb (\u002B48 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e061c9b55a9863ca8c345d3d7e71fdbf1797150dc7465a97967a15174178f68c"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 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 (57 single-owned of 183 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; 183 of the 420 production source files in this repository met that bar). They are anonymized user #2 (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: lib/graphql/schema/addition.rb."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Better would be opting in with some \u0060use ...\u0060 configuration \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":"spec/support/jazz.rb"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9635d686ef2b328592751a954ab1effa354ad65571c06ec640e5dbd00008c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO not threadsafe \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":"spec/support/lazy_helpers.rb"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0419b33d6ababd4b76fa015d0591a036d077f6884d81399b41a4905ede943c82"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO make this work with existing fixtures \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":"spec/support/mongoid_setup.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0793c5f6d1b04127ae5d9baa2ae83fa176fe040635034543100ad71a09da5f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Implement this method \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":"spec/integration/rails/generators/graphql/install_generator_spec.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3aa189e9ecd229b28e676de7d82c0d7bbdefa0a9cfa1238e16d6c18756bc1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Implement this method \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":"spec/integration/rails/generators/graphql/install_generator_spec.rb"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1f35e8ff4f98a3506eb5ba3e51946bb16f524c1231de835f4fb48996e749af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove me \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":"spec/integration/rails/generators/graphql/install_generator_spec.rb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d50ba9b3e97cbb8755c130bad06eee11578b70ae696806613e9e9d67fe65a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove me \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":"spec/integration/rails/generators/graphql/install_generator_spec.rb"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a040fc7a697e1423b9a2ae741ac9fdd187c20b0bde9542d5fcf5da8fc6cf919a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove me \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":"spec/integration/rails/generators/graphql/mutation_create_generator_spec.rb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ebab8b164be3a1a4f9908a29e54832194968946a599a8f376e3a8243459794"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove me \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":"spec/integration/rails/generators/graphql/mutation_delete_generator_spec.rb"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3095ce87d7118a46a91c47aaed14e43b9f795148a4192eed7c465476df59a18c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove me \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":"spec/integration/rails/generators/graphql/mutation_generator_spec.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba19585cd0ea4b080c3bcb98fca55dcf9f41dc62d4b986f85719faaf19c99c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove me \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":"spec/integration/rails/generators/graphql/mutation_generator_spec.rb"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81972888687964c8c9c1d58643b99bc1b3faa13c224703286266fae678eabb6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove me \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":"spec/integration/rails/generators/graphql/mutation_update_generator_spec.rb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4d7733824d28c7eb7f6fdb1ac4254cd241c49fd6e977e0c69c56e0d0bc6557"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: define return 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":"spec/integration/rails/generators/graphql/mutation_generator_spec.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d4578e12daad3125af57a40bd1ccbbf25d88dfd81f1024226177f503c6a8fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: define return 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":"spec/integration/rails/generators/graphql/mutation_generator_spec.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c1e3823d7be7e29e0891ebd129f2bbeebdfae9a7e914f3e50a69b0b8f4e7b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: define 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":"spec/integration/rails/generators/graphql/mutation_generator_spec.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49d7efe3c0d852a7ea832813ae06044384facba63d8591ff85e1ae420bc2b65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: define 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":"spec/integration/rails/generators/graphql/mutation_generator_spec.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaf3b1fad5d31c3719c546297c372c216c787235d308433c39b2275f77c80b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: define resolve method \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":"spec/integration/rails/generators/graphql/mutation_generator_spec.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22601d102c46a8da4284c15f6c0038cec442c94f1d61963e9e5de5c490dd6a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: define resolve method \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":"spec/integration/rails/generators/graphql/mutation_generator_spec.rb"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"697d51117c349de4d4c60b1f94a3cd41a12338fd596e7f370c4de29e1098332d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test fails. fixme \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":"spec/integration/mongoid/graphql/relay/mongo_relation_connection_spec.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5aee6af9fc8493cdfa77e5afd89f758992822fb11376d56097ec932c30363fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO why does this happen sometimes? \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":"spec/graphql/dataloader_spec.rb"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"888752ee63e139c8f86f394e7f5c80a22d66da585c243bcd221ea6c10f4d0c60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO don\u0027t hack this (no way to add metadata from IDL parser right now) \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":"spec/graphql/subscriptions_spec.rb"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"584f795bc18e5336ada15fd375c223028f52c514f5f8e809db2b48317406b10b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: more negative, abstract examples here, add stuff to the 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":"spec/graphql/static_validation/rules/fragment_spreads_are_possible_spec.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5991e8ee7db39e7e32e5182dbab293c84ab43790a73a6d86c388c001c636bb67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: GraphQL::CParser doesn\u0027t support definition_line yet. \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":"spec/graphql/schema/build_from_definition_spec.rb"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4046ddae427487097a3d7fc0236b87f1eb3f82579ea752e3f232ddd2866a3e38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO can I get rid of \u0060future_schema: ...\u0060 here in a way that \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":"spec/graphql/schema/dynamic_members_spec.rb"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff9fec026bb704d05242106592798beb8554832917e9e5dda9aed2c77600706"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can I get rid of the requirement for \u0060future_schema: true\u0060 here since \u0060Scream.future_schema\u0060 is true? \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":"spec/graphql/schema/dynamic_members_spec.rb"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf3f18d1186154302122ea5738d47bcb1b3228c029a6d35a8d3a3ae26c07255"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO use a real class in RedisBackend \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":"spec/dummy/test/controllers/dashboard/subscriptions/topics_controller_test.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47d26022f9eb429165eac950f8ce5bed5480b5f9a5c5164854b3627a410c018"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo context-specific introspection? \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":"lib/graphql/schema.rb"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa79de41799d78199198d8d5bd79ae90bffbdaee7817167ec5198ebeaa1a071"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO duck-typing \u0060.possible_types\u0060 would probably be nicer 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":"lib/graphql/schema.rb"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e39441c4b86940ff39835c0a692b4380fa9b85f9a0aaf42428315187d5a7e8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this clears the cache made in \u0060def types\u0060. But this is not a great solution. \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":"lib/graphql/schema.rb"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"03201d0fed41bd4859dc60bbe4d604dda9666162c8cf4d321dfa08a5a8dc5404"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this clears the cache made in \u0060def types\u0060. But this is not a great solution. \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":"lib/graphql/schema.rb"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a3893f6de85d482eaac17b42ade0a4144ea3f1953cb880c580cf31d27379b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this clears the cache made in \u0060def types\u0060. But this is not a great solution. \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":"lib/graphql/schema.rb"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e8ffd35e502c1e9fe90e0906ef312089da05593e929cd42599fdc725b5cdf2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: #   # TODO: use \u0060context[:current_user]\u0060 to determine if this object is authorized. \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":"lib/graphql/schema.rb"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cbf4ec64a5982ffe0206844527835e068c73f9280e882181dd089e9121b816"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: when there\u0027s a proper API for extending root types, migrat this to use it. \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":"lib/graphql/schema.rb"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"745e5b086389b0089fc57d1c07d0023e7411578a0a3137404bdaec77a3356b6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO stop using def_delegators because of Array allocations \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":"lib/graphql/static_validation/validation_context.rb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d9b999f457a1f7b3cae0b4fd529e6724105a631764caff59f828dae2fb53b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO smell: these methods are added to all visitors, since they\u0027re included in a module. \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":"lib/graphql/static_validation/rules/arguments_are_defined.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"25607e678e56131a1dbe3a6ff739dc3a772073a192033a31cacf3b811b14c35f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO code smell to access such a deeply-nested constant in a distant module \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":"lib/graphql/schema/argument.rb"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e35a9692059600a3b6dca79f3c88f6fb2e3f80106537c883f7be99cb5422e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO set this when type is set by method \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":"lib/graphql/schema/field.rb"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3cc6fc785355c19c04a60a0820afb18ceaef167b158f07c23fe0fc4a1aa3ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO this doesn\u0027t support procs yet -- unlikely to need it. \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":"lib/graphql/schema/field.rb"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4688374fb6f0de70835ddd10f656e4eaca0fbe7286d6b94fc2c0e80fc24838b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO after_lazy? \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":"lib/graphql/schema/field.rb"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfcbbd656868226e48103da5c738d3163ef27ab7bc5794f3160b45f1959e926"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO make this lazier? \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":"lib/graphql/schema/has_single_input_argument.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bb6a9254ca20e3e29296e6f0580939550ce925e1db7851be275eea8984a79d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support argument types too, make this a public API somehow \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":"lib/graphql/schema/late_bound_type.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"78273b8e714f20d9d0e6cf2624b6bc878ad2901fac823c0cfcef529b944011cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this freezes errors of parent classes which could cause trouble \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":"lib/graphql/schema/ractor_shareable.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2d40fbcca676ee114d27a755120ad36a3cdebd8017ae2eee6a6ea5d0c77c37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO unify with [null](rdoc-ref:GraphQL::Schema::Resolver::null) \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":"lib/graphql/schema/resolver.rb"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4707d5853a9a0bc95cf775a0b62f8148352c62d3dd00999fb5eaee3f8d5fff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: somehow don\u0027t iterate over all these, \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":"lib/graphql/schema/visibility.rb"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"189461fd7bc752318ff76a06890b92e580fdda90bf7836b93f9d77f170ad3dfd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove ctx 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":"lib/graphql/schema/warden.rb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"877b1ba001248900ff2c3cb06c12e351b0ae9da63e44e626300de169d2d57f21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO public API \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":"lib/graphql/schema/visibility/migration.rb"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6084992c0d5750782d6fd556bcc2cafb6028710a5e0574ef3ec2dc6951a419e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO cycles, or maybe not necessary since previously checked? \u0026\u0026 @cached_visible_fields[owner][field] \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":"lib/graphql/schema/visibility/profile.rb"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d9b6bda71736e18ddd0991a26129b482c0e4c2dd8a3dbcb66457596c1d46e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO apply static validations on schema 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":"lib/graphql/schema/member/has_arguments.rb"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb860acfae0ef0c1fb0cff599bb8e24ca4aaab200ae4bdac5d6647a952487d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO skip this entirely? \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":"lib/graphql/schema/field/scope_extension.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4e329519052c810f11cf7f2ee45600f4afd25ee464fe4e40b287d0983cc246"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO DRY with \u0060replace_child\u0060 \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":"lib/graphql/language/nodes.rb"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7adccfc8a9961161ceb17f725e654365db63b92807eaa602e1a393a9260928"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove this check ^^^^^^ when NullDataloader isn\u0027t recursive \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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb9b157426572770aca3c24210ed72797b7fe69bada29836718bdeab7e2da4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO extract 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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9c49466cdcff36ee2a7b9c44d13012cc2b1f05b3193753712d43480704e71e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO batch 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":"lib/graphql/execution/field_resolve_step.rb"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0b0bbc4be72091d1cec4c5cd3461f66920c1b883a778d6678d91d79a197b9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO rescue at a higher level so it will catch errors in analysis, too \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":"lib/graphql/execution/interpreter.rb"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"503e6544178bf4aac863ea2e256d8a1669db7bfd616443280504312b66b028a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO DRY with SelectionsStep with directive handling \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":"lib/graphql/execution/runner.rb"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e216becd154f3c0442f27d82a8572acb47ccb72b4ade33cdf2898a279a9faba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This should really include the path to the problematic node in the variable value \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":"lib/graphql/execution/variable_values.rb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cb7ef5b57be00735905ee1521b5296743b1be7ea875c163d9429edaf1b3e46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO test query partial with lazy root object \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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1119f4f7acc11d849c37ccc1cc1a00a299605f67626ef3e11d4bfd238df4a8c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO the code is trying to tell me something. \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":"lib/graphql/execution/interpreter/runtime.rb"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"0824a52d4997ae621aee9bf30adf2a80b9ad73522f075a7d592850694e427a7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO test full path in Partial \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":"lib/graphql/execution/interpreter/runtime/graphql_result.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"374ebc2ba47ca85cc27f348b8e09757841528b615255802354fda8452b6f1ac3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: #{indent}use GraphQL::Tracing::DetailedTrace#{options.redis? ? \u0022, redis: raise(\\\u0022TODO: pass a connection to a persistent redis database\\\u0022)\u0022 : \u0022\u0022}, limit: 50 \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":"lib/generators/graphql/detailed_trace_generator.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c27346d9abbf141633673712c8c694a87e88f80f667c6e4cd0f348181faf05b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add authorization to this route and expose it in production \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":"lib/generators/graphql/detailed_trace_generator.rb"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb664adeb83a860850a6fbae0443326fd2374bbbbe5f24d7624f06885dfd7f8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: also add base classes \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":"lib/generators/graphql/install_generator.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcd6ee938e76ec12b8cf9c504ac478fc89077b531c0df28b50dbfea6ce4c149"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: What other options should be supported? \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":"lib/generators/graphql/mutation_create_generator.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d29e579fa05963d5338c9753e4e58118fd269837585a8980ed062df908fd713"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: What other options should be supported? \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":"lib/generators/graphql/mutation_delete_generator.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8466bdea895d90ca33ca16b78788b32ce9493917a03181df24a0a4e37ba929"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: What other options should be supported? \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":"lib/generators/graphql/mutation_generator.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceac6b831028a216548f34a200c961c85356bc0ca6d5bc493f999681016512a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: What other options should be supported? \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":"lib/generators/graphql/mutation_update_generator.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8171ba453038b4ffa00497116a1520830fd340406f2c9e999ed812c991798dd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: What other options should be supported? \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":"lib/generators/graphql/orm_mutations_base.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f32c17f159d3dcfcaa599eda902a1cd213649f1a66c2262e68593994d0461d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: nullability / list with \u0060mode: :graphql\u0060 doesn\u0027t work \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":"lib/generators/graphql/type_generator.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39434178e6aa8542f145edceaf417bffee7a329de9a0dbc1127ce4bb42094ca"}},{"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":"javascript_client/src/subscriptions/createAblyHandler.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b63e7a5c216f42516c912ae9844aef9e20c9861e445b89393167a8c2aab84db"}},{"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":"javascript_client/src/subscriptions/createPusherHandler.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd3ade0dc32d24dbaddd1751e0679587949ccddd09eb99356e77ae17a924946"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Extract this code \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":"javascript_client/src/subscriptions/createAblyHandler.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1257507beb58239217e272b5ffa4b325e4dbe33da2e3fd36c3f8a2dbda35b423"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Extract this code \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":"javascript_client/src/subscriptions/createPusherHandler.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ba94db3cd6c01ae7a6b5e6d306b71dd77166d659e6da8e955533578c0034c6"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 3 project(s) overshoot their size bounds, lowering Project Cohesion to 3.3/10. The most over is \u0060(repository root)\u0060 (48051 LoC, 1404 module-visible types across 44 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":"D28","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":"2d4758b44db96a45f3ade40a915b3c5d6bffc8eb0245161abecc269abd351b2a"},"properties":{"commitSha":"4edee78461490d079c8342a95d038c9331a5cea7"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"1dce3e7f97289dc8efc0bbad1ac0f5e942b054e9aa085154da1b96e10055612a"},"properties":{"commitSha":"46ae6a7658396188898eb3ae93aebf13aa4eef68"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"c6316974c64425e7b3659f733c4a1c18f97287da9cf61780f26ec0b733a99c13"},"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":"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":"bde41bc56fadcce75e375d7f7529c04388c91b364c3390fcaa030f7b68112418"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","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-3","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":"0705761e02c8d7dae9547427cf0c201a3b4a6fd046aeb5b8141a95cb938936f2"},"taxa":[{"id":"CWE-1265","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":"e06e5a781ce287fcd8715b6966ffd4c00eb5436ed3f25f979c51c835c7f3018d"},"taxa":[{"id":"CWE-1265","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":"932b878b7ca6514eb60a3e84ec69115c2abde946fb67eda9147936c0ead20ef4"},"taxa":[{"id":"CWE-1265","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":"eb1b6a80c0a04a572ecb95c7a42735e7a94015500888b799c3d86543bd5e9043"},"taxa":[{"id":"CWE-1265","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":"5d58c0cf871ddd2f2e5a6d48e2866d912967e8aeb1ae8855ad728aa72a770bec"},"taxa":[{"id":"CWE-1265","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":"587d85f6e2c8ecce62089388713b1ca64ea807db41aba47c8d430ba3cd10292c"},"taxa":[{"id":"CWE-1265","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":"3e7603353d154729657c4fec6e7f933ee788d52fb4c045dbe666694fc6757c74"},"taxa":[{"id":"CWE-1265","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":"6dab22716318bbcad800be790c650aa793eef54dfb371d8e801fef88db7b27fd"},"taxa":[{"id":"CWE-1265","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":"1fd7aaa680a8f9f0a335f21344cf27280a72012bebd981781d423f1c7dda3f99"},"taxa":[{"id":"CWE-1265","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":"ea4e1496e84da62230cade5a69dd02490c5d62a2e7b5bb20f21b7d0ccf7293ec"},"taxa":[{"id":"CWE-1265","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":"d0769a9404aa67b96892792cf2cad121c2445550a35a0e438f3647b5cf09ea4a"},"taxa":[{"id":"CWE-1265","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":"0f1d6bcf9e1eaf8fa98cec30ae217f6b9af299e71988dafb3cd70147d7c3c44f"},"taxa":[{"id":"CWE-1265","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":"bf290b0f89de655b2b1eb3e2f2568843d6498b3cfe60998bc28ff80144d2cd25"},"taxa":[{"id":"CWE-1265","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":"6cd638226fec678e692d22e21439f14d0eea4d5ee1ec34b2953f11687550c346"},"taxa":[{"id":"CWE-1265","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":"1034d3304817dcc5685beb57aeb70fd731cf2615e73c1cdf996da1fe32997ad2"},"taxa":[{"id":"CWE-1265","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":"ecc67ad8a9522e38f08ff5a2aa8461048f8d93977c4a8330803dec1b014166fa"},"taxa":[{"id":"CWE-1265","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":"6ca88112767ad7c88adf6cec3ae14ec1b20996f32296d0e5152c5360392b0bf6"},"taxa":[{"id":"CWE-1265","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":"6be33cb4841ee5ff71f54f4f10dfb9cee316b1ab784844167b92bcfd2124f294"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a4bb4e0310e1561099839eda2484930bf59599224e281965bb5c395127a8b1ef"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 3 of 183 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (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; 183 of the 420 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: javascript_client/src/subscriptions/createAblyHandler.ts, lib/graphql/tracing/appoptics_tracing.rb, lib/graphql/schema/finder.rb. 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":"javascript_client/src/subscriptions/createAblyHandler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"871214ff507e0d110c6dbe451f946cc799a3cd1f27d8e7af3013aeba6bfbc8b1"}},{"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":"lib/graphql/tracing/appoptics_tracing.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7cded004bdb718ef35a7a6d7ca00169ee6ff74fa0ab5bf90ef427141fbeda7"}},{"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":"lib/graphql/schema/finder.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"216bbf805f399d61f570b2fb14e64e441077c137d8ff9bab347a639332fe4580"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: array_connection.rb \u2194 relation_connection.rb: \u0060lib/graphql/pagination/array_connection.rb\u0060 and \u0060lib/graphql/pagination/relation_connection.rb\u0060 change together 54% of the time (7 of the 13 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 7 shared commits counted here, the most recent 3 are \u0060fa21fefa\u0060 Use overridden cursor_for for edges and page info cursors; \u006055ee65a2\u0060 Paginate duplicate connection items by position; \u006004a765d6\u0060 Revert hasNextPage change when first isn\u0027t present \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/pagination/array_connection.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b456379e3eb5638df682981f24864ce7d6a7a9a0bd51748bf5374cf8ee6494"}},{"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":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","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":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","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":"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":"5cb28dde8e3ebb141d09ade9639ee0bf087445ca026dd7027368406093345c0a"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/dashboard/views/graphql/dashboard/operation_store/clients/_form.html.erb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d4665045ebbe6b97b03348c17845a61800e26202289a5baf26287c76af3b63"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/dashboard/views/graphql/dashboard/operation_store/clients/_form.html.erb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b7d541088a28d9d6ab2fe38eef8f0d412075827ba776d810559341211f648c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h4: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/dashboard/views/graphql/dashboard/operation_store/clients/edit.html.erb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ccc88d2ff55ff8ddcab9627282cca730d5491c242a650ac311b22d188b7bb2"}},{"ruleId":"C2","level":"warning","message":{"text":"No authorization: This repository serves requests \u2014 a Rails controller (\u003C ActionController::Base) (lib/graphql/dashboard/application_controller.rb:8) \u2014 and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/dashboard/application_controller.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1fe481f70157af8579aec3ec19631746b40bcd74b488baecdf75804a11f1f7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060javascript_client/src/sync/generateClient.ts\u0060 reports through \u0060console.*\u0060 at line 71 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"javascript_client/src/sync/generateClient.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"747e4fd552e7a022368e16ad0ec3bae7364046fb9a2f1b4a8cf268bf48811a07"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060javascript_client/src/sync/generateClient.ts\u0060 reports through \u0060console.*\u0060 at line 72 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"javascript_client/src/sync/generateClient.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"79846ac4d769ed8a35d0d48330ac78f0d4e5ce0e4756b05d224377d0dbff0c9e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060javascript_client/src/sync/generateClient.ts\u0060 reports through \u0060console.*\u0060 at line 73 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"javascript_client/src/sync/generateClient.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac19904d2ac72b096b75348f2365bde2f218331b134b8de5685eadafdc4a4858"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060javascript_client/src/sync/generateClient.ts\u0060 reports through \u0060console.*\u0060 at line 88 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"javascript_client/src/sync/generateClient.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e5799ab2342dc91ad3584b4fd496e4860354caf38d4a48ff7aa50d2b117f25"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060javascript_client/src/subscriptions/createAblyFetcher.ts\u0060 reports through \u0060console.*\u0060 at line 64 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"javascript_client/src/subscriptions/createAblyFetcher.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9279e2ffae66f8568879fec5713f726f0c340a226ae01af98e98b9c233ccdf72"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060javascript_client/src/subscriptions/createAblyFetcher.ts\u0060 reports through \u0060console.*\u0060 at line 68 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"javascript_client/src/subscriptions/createAblyFetcher.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"122f7a7d3f358daf0bb3595431097f544e27e334d4ea06c10f90bf639e2df86d"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add brakeman for Rails apps, otherwise \u0060semgrep --config=auto\u0060 or CodeQL\u0027s ruby pack as a CI step. What was searched, so you can tell an absence from a miss: the 6 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/actions-lint.yaml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm/bundler: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, \u0060bundler\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c24142cebf1cde6808c55ff67f61ee57931ea93f13268c095a2b47cbe421944"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Net::HTTP.start\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/rake_task/validate.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e273856ba441c00c6126e52388f92a6b93715c2446d1a9785a5592f65ae6955"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Net::HTTP.get_response\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/rake_task/validate.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8127447776acb6c6d8acc9be6d20455d7e3155bd46fa65f26a7a804497fd08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (58 matched lines \u00D7 2 locations): javascript_client/src/subscriptions/createAblyFetcher.ts:18 \u00B7 javascript_client/src/subscriptions/createPusherFetcher.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 300 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":"javascript_client/src/subscriptions/createAblyFetcher.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7448c58b458631adca3f6e8a076d114de9e698f49dfdb6c171e4d9c627dbd6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): javascript_client/src/sync/removeClientFields.ts:19 \u00B7 javascript_client/src/sync/removeClientFields.ts:81 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\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":"javascript_client/src/sync/removeClientFields.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c08c6bc078a3a1d63aa286c21e940c36c70c297cfc22b7c561242f6ca9071df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): javascript_client/src/subscriptions/createActionCableFetcher.ts:56 \u00B7 javascript_client/src/subscriptions/createPusherFetcher.ts:23 \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":"javascript_client/src/subscriptions/createActionCableFetcher.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"393aa40c8609aac8d130ec67703a3db8e8e66b31f82615ad2a07d4d79e2994d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): javascript_client/src/subscriptions/ActionCableSubscriber.ts:68 \u00B7 javascript_client/src/subscriptions/PusherSubscriber.ts:67 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"javascript_client/src/subscriptions/ActionCableSubscriber.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52fb04d67d5fdfa93133b06a480ee99e68b15c24aa98e50958df1b8a5f5ffff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): javascript_client/src/subscriptions/createActionCableHandler.ts:56 \u00B7 javascript_client/src/subscriptions/createPusherHandler.ts:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"javascript_client/src/subscriptions/createActionCableHandler.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b345e2057dabd110c98aa479600b95e9f540d684b98294b4d058fda943dfcf3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): javascript_client/src/sync/index.ts:77 \u00B7 javascript_client/src/sync/index.ts:90 \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":"javascript_client/src/sync/index.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d2f728f66cd76dd9d7b119d54395320eabcde04637a0a9ccd1d9c018dd1db7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sync (cyclomatic 20, cognitive 21): sync has cyclomatic complexity 20 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":"javascript_client/src/sync/index.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"567f2c243f8009baa88c484e0fe77977d933c67a54fd54856d511565a128b44e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gatherOperations (cyclomatic 11, cognitive 13): gatherOperations 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":"javascript_client/src/sync/generateClient.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae8a3ac477e90c03848bba1f13f81b4f6d234e2280e4b2eff490988ff54eda7"}},{"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":"lib/graphql/dashboard/statics/dashboard.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"983b86a7655d0f13ad33a3655ccce402ed3dc89d1c7d9ab3c55465f5fe93f3b8"}},{"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":"javascript_client/scripts/prepare-esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2b0963c23c472ab2548c33cd238746d72d7d0642da3b6723c67b833d7253e4"}},{"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":"javascript_client/scripts/clean-esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"804174035dddb202734366481e1a2032cb37b862a6f3a991e6f7b25201869339"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060currentChannel \u0026\u0026 currentChannel.unsubscribe()\u0060 appears character-identically in 2 files \u2014 javascript_client/src/subscriptions/createAblyFetcher.ts, javascript_client/src/subscriptions/createPusherFetcher.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":"javascript_client/src/subscriptions/createAblyFetcher.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9b6fef7442664475fbfe9ec47c25c6f915b0d9a3e8039f0204d17ac382b68a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.createChannelId || defaultChannelId\u0060 appears character-identically in 2 files \u2014 javascript_client/src/subscriptions/ActionCableLink.ts, javascript_client/src/subscriptions/createActionCableHandler.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":"javascript_client/src/subscriptions/ActionCableLink.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b84ae1d5db357b85059851c69c6e25cc6cb066800892d392fb57d907acd67f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!defined?(AppOpticsAPM) || gql_config[:enabled] == false\u0060 appears character-identically in 2 files \u2014 lib/graphql/tracing/appoptics_trace.rb, lib/graphql/tracing/appoptics_tracing.rb. 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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19900336df4632a5621dcfc247f09e84c913e7c0e853364526a23deb670e18f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!query.valid? || !query.context.errors.empty?\u0060 appears character-identically in 2 files \u2014 lib/graphql/execution/interpreter.rb, lib/graphql/execution/runner.rb. 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":"lib/graphql/execution/interpreter.rb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dd13ac18f9e615d710e8e6541bfa969caef28ae72d35d49420c072fd2b45fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(field.trace.nil? \u0026\u0026 @trace_scalars) || field.trace\u0060 appears character-identically in 2 files \u2014 lib/graphql/tracing/appoptics_trace.rb, lib/graphql/tracing/platform_tracing.rb. 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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77036cac50da7d2ca8fcd314d821b576333a1ddb9e0f5c86d777dd9c5f1694a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060@type_membership_class || find_inherited_value(:type_membership_class, GraphQL::Schema::TypeMembership)\u0060 appears character-identically in 2 files \u2014 lib/graphql/schema/interface.rb, lib/graphql/schema/union.rb. 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":"lib/graphql/schema/interface.rb"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c936c9124a41b7a0b6e8f8c28c0c3f9c5ecfa35242e08a4a0c1cd944e858977"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ast_selection.alias || ast_selection.name\u0060 appears character-identically in 3 files \u2014 lib/graphql/execution/finalize.rb, lib/graphql/execution/lookahead.rb, lib/graphql/execution/runner.rb. 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":"lib/graphql/execution/finalize.rb"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5a96f0c576a33bd9033f7646714584e49407f478e06ad1a090082d6aa1d7a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060context.respond_to?(:types) \u0026\u0026 context.types.is_a?(GraphQL::Schema::Visibility::Profile)\u0060 appears character-identically in 3 files \u2014 lib/graphql/schema.rb, lib/graphql/schema/member/has_arguments.rb, lib/graphql/schema/member/has_fields.rb. 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":"lib/graphql/schema.rb"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a761238de252f6e5cbc6be93e8e517579eed7d1ab713f1ab4ccf7f25a4acec9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060defined?(Rails) \u0026\u0026 Rails.application \u0026\u0026 (app_config = Rails.application.config.filter_parameters).present? \u0026\u0026 !app_config.empty?\u0060 appears character-identically in 2 files \u2014 lib/generators/graphql/field_extractor.rb, lib/graphql/tracing/perfetto_trace.rb. 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":"lib/generators/graphql/field_extractor.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f626c3c72b921daf71e8a798143dbad3d542a2a1dad0b002422bcaf0a249bf4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060errors \u0026\u0026 (errors.is_a?(Array) \u0026\u0026 errors != EMPTY_ARRAY) || (errors.is_a?(String))\u0060 appears character-identically in 2 files \u2014 lib/graphql/schema/validator.rb, lib/graphql/schema/validator/all_validator.rb. 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":"lib/graphql/schema/validator.rb"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2d3b23a332cf741c8c0ad20d123af02d1758b0679394fe4febc31c6c37daea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060gql_config[:transaction_name] == false || ::AppOpticsAPM::SDK.get_transaction_name\u0060 appears character-identically in 2 files \u2014 lib/graphql/tracing/appoptics_trace.rb, lib/graphql/tracing/appoptics_tracing.rb. 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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"457c8c97f6e184a73e4bf52081ef7a05541c0db770244482ae92eb7904aae2a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060int_t.is_a?(LateBoundType) \u0026\u0026 int_t.graphql_name == type.graphql_name\u0060 appears character-identically in 2 files \u2014 lib/graphql/schema/addition.rb, lib/graphql/schema/visibility/visit.rb. 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":"lib/graphql/schema/addition.rb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"692c7b05c4daa5be4d1f6eb8883e41b69ee5350a382f4dad2793143fd8833d8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060int_t.is_a?(String) \u0026\u0026 int_t == type.graphql_name\u0060 appears character-identically in 2 files \u2014 lib/graphql/schema/addition.rb, lib/graphql/schema/visibility/visit.rb. 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":"lib/graphql/schema/addition.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d07716d99edfe8c3e817852319a2c8d71dbb727e93544d050d0625235bf1a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parent_type \u0026\u0026 parent_type.kind.input_object?\u0060 appears character-identically in 2 files \u2014 lib/graphql/static_validation/rules/one_of_input_objects_are_valid.rb, lib/graphql/static_validation/rules/required_input_object_attributes_are_present.rb. 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":"lib/graphql/static_validation/rules/one_of_input_objects_are_valid.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2affb3a9f7770023da473b345b2ad307ba69c9c5d6ea1412bfd586dd8ef83fd7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolve_type_result.is_a?(Array) \u0026\u0026 resolve_type_result.size == 2\u0060 appears character-identically in 2 files \u2014 lib/graphql/schema.rb, lib/graphql/schema/member/has_arguments.rb. 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":"lib/graphql/schema.rb"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"b464f20a77022577edf5c42183719f6a22641e7cbe9339db58556f272cd093dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060return_type.kind.scalar? || return_type.kind.enum?\u0060 appears character-identically in 2 files \u2014 lib/graphql/tracing/appoptics_trace.rb, lib/graphql/tracing/platform_tracing.rb. 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":"lib/graphql/tracing/appoptics_trace.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac19036ba49943620519bcde5f4b0de48ae9b1540530b3c4145475cf7a81cf94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selected_op.name || fallback_transaction_name(query.context) || \u0022anonymous\u0022\u0060 appears character-identically in 3 files \u2014 lib/graphql/tracing/monitor_trace.rb, lib/graphql/tracing/platform_trace.rb, lib/graphql/tracing/platform_tracing.rb. 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":"lib/graphql/tracing/monitor_trace.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ba9f76d0731d0d2ecb8e6d8bb130f0fbecd85b3bb61737e3c3d2820af57b0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060set_this_txn_name == true || (set_this_txn_name.nil? \u0026\u0026 @set_transaction_name)\u0060 appears character-identically in 5 files \u2014 lib/graphql/tracing/appsignal_trace.rb, lib/graphql/tracing/new_relic_tracing.rb, lib/graphql/tracing/scout_trace.rb, lib/graphql/tracing/scout_tracing.rb. 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":"lib/graphql/tracing/appsignal_trace.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"71df94d3b826e9960306b75d958238296554059e89140a4a36fb7003eb80a153"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060serialize\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 30 (\u0060self.serialize\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060serialize\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060serialize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/language.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede42703bccd5d4d24c2b8b9be3f62a2b8f5057f2c7ce5549d0c3c7602e57c12"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060execute_multiplex\u0060 is public, takes a document from its caller (line 238) and hands it to \u0060payload_to_debug\u0060, which walks \u0060v\u0060 as a \u0060Hash\u0060 and calls itself at line 691 (\u0060self.payload_to_debug\u0060) with a piece of \u0060v\u0060 \u2014 and nowhere in \u0060payload_to_debug\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060payload_to_debug\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/tracing/perfetto_trace.rb"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74ffd5fb39c4ca5aebd651180c408bed7506e3b392c9253db0ec88ef995530a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060print\u0060 is public, takes a document from its caller (line 70) and hands it to \u0060print_node\u0060, which walks \u0060node\u0060 as a \u0060Hash\u0060 and calls itself at line 570 (\u0060self.print_node\u0060) with a piece of \u0060node\u0060 (and at line 579) \u2014 and nowhere in \u0060print_node\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060print_node\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/language/printer.rb"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee08cdb1dbf8ce6ec9477d5adbbdd2e495076b7991a933ef45895ecd5c55c35"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060value_from_ast\u0060 is public and takes \u0060value_node\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 200 (\u0060self.value_from_ast\u0060) with a piece of \u0060value_node\u0060 (and at line 220, line 242) \u2014 and nowhere in \u0060value_from_ast\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060value_from_ast\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/input_values.rb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6c3c0d01310f1c889eb515831b44a8f8b5c967a38d79d9b0c08a5ac36afaaf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060initialize\u0060 is public, takes a document from its caller (line 21) and hands it to \u0060deep_stringify\u0060, which walks \u0060val\u0060 as a \u0060Hash\u0060 and calls itself at line 236 (\u0060self.deep_stringify\u0060) with a piece of \u0060val\u0060 (and at line 240) \u2014 and nowhere in \u0060deep_stringify\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_stringify\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/variable_values.rb"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29a0def9610cd7bc92fb504ea16c38269c634237a1f7c7e89ce6c937df2d44c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060prepare_args_hash\u0060 is public and takes \u0060ast_arg_or_hash_or_value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 70 (\u0060self.prepare_args_hash\u0060) with a piece of \u0060ast_arg_or_hash_or_value\u0060 (and at line 74, line 81) \u2014 and nowhere in \u0060prepare_args_hash\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060prepare_args_hash\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/execution/interpreter/arguments_cache.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5a3c1e21f60ec79df12d5ba483aaedbde80cfaea2e88d415f11a73744ae273"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/1 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: openOnPerfetto: \u0060openOnPerfetto\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/graphql/dashboard/statics/dashboard.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff9d35cdbe774928ab55bcff1ed72f80f735d27899c006e2ba8f29bb78e4fa4"}},{"ruleId":"X5","level":"note","message":{"text":"Ruby\u0027s type checker does not check nil everywhere: 332/397 of this repository\u0027s Ruby product files are checked for nil \u2014 332 by Sorbet at \u0060# typed: true\u0060 or above, 0 under a Steepfile target\u0027s \u0060check\u0060 paths with diagnostics that make \u0060Ruby::NoMethod\u0060 an error. A file at \u0060# typed: false\u0060 (Sorbet\u0027s reading of a file with no sigil), \u0060ignore\u0060, outside Sorbet\u0027s input or under its \u0060--ignore\u0060, or Steep-checked only under \u0060lenient\u0060/\u0060silent\u0060, is one where \u0060user.name.upcase\u0060 on a nilable \u0060name\u0060 passes, and the first nil reaching it is a \u0060NoMethodError: undefined method \u0027upcase\u0027 for nil\u0060 in production."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"32b27113b1bc22f400935e8620d19eae7fd3ef145cc36018609c445ea8cd4af1"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"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-1265","guid":"9bfc5711-f2f2-6252-bd2e-ff21a1e98a6c","name":"CWE-1265","shortDescription":{"text":"CWE-1265"},"helpUri":"https://cwe.mitre.org/data/definitions/1265.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-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-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-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":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"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":"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/"}]},{"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-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-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":29,"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."]}]}