{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"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":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"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":"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":"FilterUtils.getReturnType (cyclomatic 279): FilterUtils.getReturnType has cyclomatic complexity 279 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"03117b733f80d15231e7fa2099e831bd7afe229cbe32441151ca9e2726f6b9cf"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicTypeComparator.isContainedBy (cyclomatic 244): AtomicTypeComparator.isContainedBy has cyclomatic complexity 244 (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":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"74207c5bdb207e6d83099db235ddcb0b8f53b24025230d99aa51a4966c7817dd"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeAnalyzer.analyze (cyclomatic 235): FunctionLikeAnalyzer.analyze has cyclomatic complexity 235 (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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d27c48680ced5b7b258d858d8246ff540fe71f6970bc4a5c63d0b493dc0daee"}},{"ruleId":"D1","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyzeOperands (cyclomatic 225): ArithmeticOpAnalyzer.analyzeOperands has cyclomatic complexity 225 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"4766cf34e10b5696cc752248207f570ef071b77cba65fb1e60269e7e3df8048a"}},{"ruleId":"D1","level":"warning","message":{"text":"ReturnTypeAnalyzer.verifyReturnType (cyclomatic 209): ReturnTypeAnalyzer.verifyReturnType has cyclomatic complexity 209 (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":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a036e1547bc8154a6a4c4f9f59b4c68d200b60476ac305f4120708961a384f"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarTypeComparator.isContainedBy (cyclomatic 202): ScalarTypeComparator.isContainedBy has cyclomatic complexity 202 (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":"src/Psalm/Internal/Type/Comparator/ScalarTypeComparator.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd135f8ebb72b91df7070c7080893769eeacb340f7bb6b9fae8c4e9446e6ecfe"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeNodeScanner.start (cyclomatic 169): ClassLikeNodeScanner.start has cyclomatic complexity 169 (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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d83b74aa3d9cd4a1c95638cc747a5f465114f2efae9173c9be3ea104b58ea96"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCombiner.scrapeTypeProperties (cyclomatic 168): TypeCombiner.scrapeTypeProperties has cyclomatic complexity 168 (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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"67055df7c2b7765611e5b0e7d8feec191df74342ad578b6cc9a6892706de5783"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeNodeScanner.start (cyclomatic 164): FunctionLikeNodeScanner.start has cyclomatic complexity 164 (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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c65eb862090fb4ca2764947796a499f286d710dcda9ec4a6a443365bf06f8d"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentAnalyzer.verifyType (cyclomatic 151): ArgumentAnalyzer.verifyType has cyclomatic complexity 151 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de8857567aacc148cb4408594d1da793b822e8d190099974c2ac2c8f2922ad1"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.fromXmlAndPaths (cyclomatic 143): Config.fromXmlAndPaths has cyclomatic complexity 143 (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":"src/Psalm/Config.php"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0f964356164df0d3baf6e1ab86db7a8787540b6b2da92d62b90daab1b9f289"}},{"ruleId":"D1","level":"warning","message":{"text":"Reconciler.reconcileKeyedTypes (cyclomatic 142): Reconciler.reconcileKeyedTypes has cyclomatic complexity 142 (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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f87f2c6401751d97f7784eb725bef86eca6aa9f0b3dd391a58662a372847834"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassConstAnalyzer.analyzeFetch (cyclomatic 141): ClassConstAnalyzer.analyzeFetch has cyclomatic complexity 141 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"062b5a758a0495e3167f4d507c82508916e0e222d6517319ff2b19f611056ce5"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeParser.getTypeFromGenericTree (cyclomatic 141): TypeParser.getTypeFromGenericTree has cyclomatic complexity 141 (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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"250ad94d36d32e54928eee2eccbca5fc2d34657b6ba32e5a087b89439e9aff58"}},{"ruleId":"D1","level":"warning","message":{"text":"UnionTypeComparator.isContainedBy (cyclomatic 140): UnionTypeComparator.isContainedBy has cyclomatic complexity 140 (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":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a793610f5af2b7c531f319038ee7fb666c0b24ac472a48b904fdda960f6fb3"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCombiner.scrapeStringProperties (cyclomatic 136): TypeCombiner.scrapeStringProperties has cyclomatic complexity 136 (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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ec63dfb3647b54a71df59bf98bababbdfc5055ba663cb6111fa4cb6be05c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentsAnalyzer.checkArgumentsMatch (cyclomatic 133): ArgumentsAnalyzer.checkArgumentsMatch has cyclomatic complexity 133 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"011f06f379325c54ecd5506a250295ded9881101b9be6e064d71ed340fa7c4f7"}},{"ruleId":"D1","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.analyzeAtomicAssignment (cyclomatic 130): InstancePropertyAssignmentAnalyzer.analyzeAtomicAssignment has cyclomatic complexity 130 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3083d7cafafd1a6ad01a1ad9003a608527a9939fc789719bcfe95663ba25b2"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleTypeInferer.infer (cyclomatic 128): SimpleTypeInferer.infer has cyclomatic complexity 128 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe04919d78e783efbdf75817dbb3731a2d12c871d5c3bf540f25623c43c6477"}},{"ruleId":"D1","level":"warning","message":{"text":"LoopAnalyzer.analyze (cyclomatic 112): LoopAnalyzer.analyze has cyclomatic complexity 112 (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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1ff9d5bc841825082e59f15dcadbedfad8935b2f6d5ab9452895e264796e3e"}},{"ruleId":"D1","level":"warning","message":{"text":"ReflectorVisitor.enterNode (cyclomatic 112): ReflectorVisitor.enterNode has cyclomatic complexity 112 (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":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2f57f324fb1155d7c6b4ef00960eb51140eb2ba21027d0d66fc8e43d29d203"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaGenerator.getFormula (cyclomatic 110): FormulaGenerator.getFormula has cyclomatic complexity 110 (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":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3838830965dbf80fd8ce0959d2660e493deffdb7f662f070c87582bb23992a"}},{"ruleId":"D1","level":"warning","message":{"text":"ReturnAnalyzer.analyzeReturn (cyclomatic 109): ReturnAnalyzer.analyzeReturn has cyclomatic complexity 109 (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":"src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3da98e457ec474c32aed90f12a3396be663585bb143db87f165c949ee7d3116"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicStaticCallAnalyzer.handleNamedCall (cyclomatic 108): AtomicStaticCallAnalyzer.handleNamedCall has cyclomatic complexity 108 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2429c969f762ae24ae1928d713f1d2a5f29df193cd764b842f69b4b4a0f28e"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeDocblockParser.parse (cyclomatic 107): ClassLikeDocblockParser.parse has cyclomatic complexity 107 (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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8150657b91a2d6a32d3bfa7dcd854cd29016ad2801e4f81e6793e780412f4e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"TryAnalyzer.analyze (cyclomatic 106): TryAnalyzer.analyze has cyclomatic complexity 106 (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":"src/Psalm/Internal/Analyzer/Statements/Block/TryAnalyzer.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c31dd4bb57b934a8e0fcb6542744296d799852ad7b717407f161455e24e024"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodCallAnalyzer.analyze (cyclomatic 106): MethodCallAnalyzer.analyze has cyclomatic complexity 106 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/MethodCallAnalyzer.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"269bc885d4c0b3f5d6bdd367566ba30c3e85bb8b1e7dd0c00dca2ccebf7561ac"}},{"ruleId":"D1","level":"warning","message":{"text":"ExistingAtomicStaticCallAnalyzer.analyze (cyclomatic 104): ExistingAtomicStaticCallAnalyzer.analyze has cyclomatic complexity 104 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdc34d5070027f3cad0b818750f1b5bb89aafd8d690a969bb18d9b645bf7a65"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAnalyzer.analyzeAfterTheKeys (cyclomatic 102): AssignmentAnalyzer.analyzeAfterTheKeys has cyclomatic complexity 102 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d39db63966418deb4bc1c71bfd1d3c0e3efd13c4d1b72430c7c82a959de1ff"}},{"ruleId":"D1","level":"warning","message":{"text":"ExistingAtomicMethodCallAnalyzer.analyze (cyclomatic 100): ExistingAtomicMethodCallAnalyzer.analyze has cyclomatic complexity 100 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efe1ceb3ec9353543a29923b6ea2a7c7b8a46785d2c5806e3ff432e3da9ddb1"}},{"ruleId":"D1","level":"warning","message":{"text":"Atomic.createInner (cyclomatic 99): Atomic.createInner has cyclomatic complexity 99 (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":"src/Psalm/Type/Atomic.php"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd8c964a2545dc7d29343ae7d076d681def449d542deabd9e5aa4cfe5f73a0b"}},{"ruleId":"D1","level":"warning","message":{"text":"IfElseAnalyzer.analyze (cyclomatic 96): IfElseAnalyzer.analyze has cyclomatic complexity 96 (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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b23d23fb60e28bca09d7f1a52911fcfd9fc2fda8e4959fe86800cf3b344968f"}},{"ruleId":"D1","level":"warning","message":{"text":"PhpStormMetaScanner.handleOverride (cyclomatic 95): PhpStormMetaScanner.handleOverride has cyclomatic complexity 95 (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":"src/Psalm/Internal/Scanner/PhpStormMetaScanner.php"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43f966ad341a98514b7383d6e7531ed904e82a395c457a5504adbe86cb4c450"}},{"ruleId":"D1","level":"warning","message":{"text":"Methods.getMethodReturnType (cyclomatic 91): Methods.getMethodReturnType has cyclomatic complexity 91 (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":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d19254dbfcbf29a2b5ab2ae621b0ee67118a9b3e72640cf678b298d4b337a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedFunctionCallHandler.handle (cyclomatic 90): NamedFunctionCallHandler.handle has cyclomatic complexity 90 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"436ddfe9b04c8aa44ca24fff8f9cb44cdac36228a147381f9fda3a6d709c3233"}},{"ruleId":"D1","level":"warning","message":{"text":"NegatedAssertionReconciler.reconcile (cyclomatic 90): NegatedAssertionReconciler.reconcile has cyclomatic complexity 90 (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":"src/Psalm/Internal/Type/NegatedAssertionReconciler.php"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b479d0c60a29d9a3ec1db50b48863400298446bcff04e8888751ec0af87383"}},{"ruleId":"D1","level":"warning","message":{"text":"ScopeAnalyzer.getControlActions (cyclomatic 88): ScopeAnalyzer.getControlActions has cyclomatic complexity 88 (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":"src/Psalm/Internal/Analyzer/ScopeAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e838caa18431d2f8364cdf71a91d24010cdfce6ae05c5793664ae4b20343237"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassAnalyzer.addContextProperties (cyclomatic 87): ClassAnalyzer.addContextProperties has cyclomatic complexity 87 (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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bac165cfc1ee03d86fd03f36078ad1802a7b6625388fc3cff17069cb46f8910"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicMethodCallAnalyzer.analyze (cyclomatic 86): AtomicMethodCallAnalyzer.analyze has cyclomatic complexity 86 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d798bea319678ea84c6ffd4930ec2310610f5c098f2b2c67249e833683bf466b"}},{"ruleId":"D1","level":"warning","message":{"text":"ForeachAnalyzer.analyze (cyclomatic 85): ForeachAnalyzer.analyze has cyclomatic complexity 85 (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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b563e2ceaf5c79bc7fbc801064a36cc9542e9e5ba659903514543a2af94a07"}},{"ruleId":"D1","level":"warning","message":{"text":"SwitchCaseAnalyzer.analyze (cyclomatic 85): SwitchCaseAnalyzer.analyze has cyclomatic complexity 85 (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":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchCaseAnalyzer.php"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b04f6bf0b1dea3d26644e80c9d518fdfd1b714047199a84f1582f9157097991"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeExpander.expandAtomic (cyclomatic 85): TypeExpander.expandAtomic has cyclomatic complexity 85 (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":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"324902eb7bb81da071f9a698f62bf55494fadcce02756db76d5b5f13bd1f807d"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicPropertyFetchAnalyzer.analyze (cyclomatic 84): AtomicPropertyFetchAnalyzer.analyze has cyclomatic complexity 84 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"66db0712b9f5cb07c8a7268da75d67c003f2902afb9d066e529926e6797d7b51"}},{"ruleId":"D1","level":"warning","message":{"text":"VariableFetchAnalyzer.analyze (cyclomatic 83): VariableFetchAnalyzer.analyze has cyclomatic complexity 83 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"009909db3ce8239b09ce0c8dc833e02890091e6818f8569a16b31c9272a7f40e"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementsAnalyzer.analyzeStatement (cyclomatic 83): StatementsAnalyzer.analyzeStatement has cyclomatic complexity 83 (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":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c30680582686152dd2ba1226e668184aa2a67f45dbb19ff06ae6f841ab3389"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeDocblockScanner.addDocblockInfo (cyclomatic 83): FunctionLikeDocblockScanner.addDocblockInfo has cyclomatic complexity 83 (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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca55905230d02fcbb939a339dc5a962468871a4578677d1f403f993efab82e15"}},{"ruleId":"D1","level":"warning","message":{"text":"Reconciler.getValueForKey (cyclomatic 83): Reconciler.getValueForKey has cyclomatic complexity 83 (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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d630c5326da103708d5c9a05b18aa7dc4f98aa5a796afebcd9629cceebe0e928"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFetchAnalyzer.getArrayAccessTypeGivenOffset (cyclomatic 82): ArrayFetchAnalyzer.getArrayAccessTypeGivenOffset has cyclomatic complexity 82 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce73b761178c85b94bc0aabf22f136ee67081ecafebf24f090840abb1f8d8a00"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryOpAnalyzer.analyze (cyclomatic 80): BinaryOpAnalyzer.analyze has cyclomatic complexity 80 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"de92350d604077c0979f089eb4f9a488256e12e6e63ae6cfa140351699dac152"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentsAnalyzer.analyzeArguments (cyclomatic 80): ArgumentsAnalyzer.analyzeArguments has cyclomatic complexity 80 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5612ab80b53e88f32b39b71bd05fd27f012cb2194cdb639f61b4e49d16c9ddef"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentAnalyzer.checkFunctionLikeTypeMatches (cyclomatic 79): ArgumentAnalyzer.checkFunctionLikeTypeMatches has cyclomatic complexity 79 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f9ed890a6e7e7f2c5453470a3e16c5b0be348d73fa65fabde90ea0dbcca46b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCombiner.combine (cyclomatic 78): TypeCombiner.combine has cyclomatic complexity 78 (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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9664987391d98a1813802c1b254b81c6ab7823c0b3ea089d17a946ec854f0426"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCallAnalyzer.analyze (cyclomatic 77): FunctionCallAnalyzer.analyze has cyclomatic complexity 77 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"704da12efd4f5a96bba55cb39147e9e521cad61987c26bdd09f194be7e820cd0"}},{"ruleId":"D1","level":"warning","message":{"text":"Functions.getCallMapFunctionCapabilities (cyclomatic 77): Functions.getCallMapFunctionCapabilities has cyclomatic complexity 77 (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":"src/Psalm/Internal/Codebase/Functions.php"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"603b359d480e3c4bf56d5392e1ec7ced44a9e67305ab4b84741090f533db937c"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassAnalyzer.checkPropertyInitialization (cyclomatic 76): ClassAnalyzer.checkPropertyInitialization has cyclomatic complexity 76 (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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"61030629af730f55c1d15be0ca35122ed9b0e460832583766a1042e065dc6ec4"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticCallAnalyzer.analyze (cyclomatic 76): StaticCallAnalyzer.analyze has cyclomatic complexity 76 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c2ec8db656c815c2a996dd05d3e6d36d28fd9c237e1dba873a05fb3198346e"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstantTypeResolver.resolve (cyclomatic 76): ConstantTypeResolver.resolve has cyclomatic complexity 76 (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":"src/Psalm/Internal/Codebase/ConstantTypeResolver.php"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c59b8a0908704d6b2a25f0d39cbaea91a7b0ad5a53f53b5e72ab6dc0d1fe94"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeNodeScanner.visitPropertyDeclaration (cyclomatic 76): ClassLikeNodeScanner.visitPropertyDeclaration has cyclomatic complexity 76 (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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"955e8273b9d5b5b4b0114585ce015dd0bd2c5794843143c171463402d921e9b1"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFetchAnalyzer.analyze (cyclomatic 75): ArrayFetchAnalyzer.analyze has cyclomatic complexity 75 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"83be9501be06746da287e5658252a345d97c365ddd4f0adfc46269f63603c310"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassAnalyzer.analyzeClass (cyclomatic 73): ClassAnalyzer.analyzeClass has cyclomatic complexity 73 (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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2554f1844759b04b2516baef2e17cbb01085fb62d049d79649b26c1f37e90dd"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentsAnalyzer.handlePossiblyMatchingByRefParam (cyclomatic 73): ArgumentsAnalyzer.handlePossiblyMatchingByRefParam has cyclomatic complexity 73 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"f590ad05bdcc6479a22189ea2389e184f8cf7695f3407a41a1db95769b5b47e6"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikes.checkMethodReferences (cyclomatic 73): ClassLikes.checkMethodReferences has cyclomatic complexity 73 (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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba5d20fb19651735b8020ce80cdfad828b0838e4c6d241717127b7c692e301f"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateStandinTypeReplacer.handleTemplateParamStandin (cyclomatic 73): TemplateStandinTypeReplacer.handleTemplateParamStandin has cyclomatic complexity 73 (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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc388f9305e4a27ce1cc9767406ff4709c57bc0d97b65d262adb368556ec57c3"}},{"ruleId":"D1","level":"warning","message":{"text":"InstancePropertyFetchAnalyzer.analyze (cyclomatic 72): InstancePropertyFetchAnalyzer.analyze has cyclomatic complexity 72 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cef8fd2173234582314f818f6d606f6f7368d2ab52f3e081b99b803721fdf1"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayMergeReturnTypeProvider.getFunctionReturnType (cyclomatic 72): ArrayMergeReturnTypeProvider.getFunctionReturnType has cyclomatic complexity 72 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMergeReturnTypeProvider.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b45767fdf9f37f9501f428042199d86c772bdecf9944106ecd49ffbe366b15b"}},{"ruleId":"D1","level":"warning","message":{"text":"FileFilter.loadFromArray (cyclomatic 71): FileFilter.loadFromArray has cyclomatic complexity 71 (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":"src/Psalm/Config/FileFilter.php"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"221e333c640bbaf417c0cfc1e1d4f4905021efc45c6fd388e51e6b412c496eca"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.updateArrayAssignmentChildType (cyclomatic 69): ArrayAssignmentAnalyzer.updateArrayAssignmentChildType has cyclomatic complexity 69 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f520379ab04a921f581bd9783e6642b3a351394ee4a66303f616ed0f7e8cdd"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeDocblockParser.parse (cyclomatic 68): FunctionLikeDocblockParser.parse has cyclomatic complexity 68 (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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab938b1f8874f1ec8a51906f085d4af497d22bcfc47e0af043873c82b87be49"}},{"ruleId":"D1","level":"warning","message":{"text":"IssueBuffer.finish (cyclomatic 68): IssueBuffer.finish has cyclomatic complexity 68 (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":"src/Psalm/IssueBuffer.php"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf806e8769aadd50e1c73069ca83c3282b138cf3ea1a333c1f094cc094f4867"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeAnalyzer.processParams (cyclomatic 67): FunctionLikeAnalyzer.processParams has cyclomatic complexity 67 (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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e413a7630b03140ac3fdc52c4947539d286722243095782bdde1b668881ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"ForeachAnalyzer.handleIterable (cyclomatic 67): ForeachAnalyzer.handleIterable has cyclomatic complexity 67 (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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"765f24f3a51d8bafb610bdb046e7cdc2d4941f8bcf8d50309b42edb1e3b629f6"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionResolver.getUnresolvedClassConstExpr (cyclomatic 67): ExpressionResolver.getUnresolvedClassConstExpr has cyclomatic complexity 67 (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":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd41955180be906a167597052db13682e0b70658bd7dc85ee7ab5f659acc26e2"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayColumnReturnTypeProvider.getFunctionReturnType (cyclomatic 67): ArrayColumnReturnTypeProvider.getFunctionReturnType has cyclomatic complexity 67 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3e515727fa0ce65090c8fc99a0bb74d9898038da9f0b95bb1288d11366425c"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassStatementsDiffer.diff (cyclomatic 66): ClassStatementsDiffer.diff has cyclomatic complexity 66 (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":"src/Psalm/Internal/Diff/ClassStatementsDiffer.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efbddc5050fcb09240aad96525acf4921be6b2ab7e98fab3958d8eced0c16ac"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeTokenizer.tokenize (cyclomatic 66): TypeTokenizer.tokenize has cyclomatic complexity 66 (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":"src/Psalm/Internal/Type/TypeTokenizer.php"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cc167c345c967be096e65591724d6524069b6d18a0aff56f612b9e76c9705c"}},{"ruleId":"D1","level":"warning","message":{"text":"Algebra.simplifyCNF (cyclomatic 64): Algebra.simplifyCNF has cyclomatic complexity 64 (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":"src/Psalm/Internal/Algebra.php"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbcc57040d44b3b84a3c43ee8e34507400836d6900fb1cc00b5f7e44477edf0"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAnalyzer.analyzeAssignmentRef (cyclomatic 64): AssignmentAnalyzer.analyzeAssignmentRef has cyclomatic complexity 64 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b65cf2822fe71fbb64eeb0131fbe23485269ccfeea5c2ddba49612bf9112c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.getReturnTypeFromCallMapWithArgs (cyclomatic 63): FunctionCallReturnTypeFetcher.getReturnTypeFromCallMapWithArgs has cyclomatic complexity 63 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9d55fa3ec4e461379a12e83c75c3aa1145d6ef66e5448270ed2a01e6d5d457"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyedArrayComparator.isContainedBy (cyclomatic 63): KeyedArrayComparator.isContainedBy has cyclomatic complexity 63 (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":"src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bcb605716ddaf816fb1e27a0056217745e7e0cbc642f82bd0621b00690b938"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcile (cyclomatic 63): SimpleNegatedAssertionReconciler.reconcile has cyclomatic complexity 63 (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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa447f2df790cdcbaf07b41c3756c6068499ea56fb59c4e7f21bdf7218f7221c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionScanner.registerClassMapFunctionCall (cyclomatic 62): ExpressionScanner.registerClassMapFunctionCall has cyclomatic complexity 62 (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":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5463b853c08ea5a18790689ddca3658e1a3375ac00a6285486e70dc5d0d0c3da"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.filterAtomicWithAnother (cyclomatic 62): AssertionReconciler.filterAtomicWithAnother has cyclomatic complexity 62 (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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7911c36df4788b97f006c15b6126bc704836f8932451ec98dc41000f5e76982"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodCallPurityAnalyzer.analyze (cyclomatic 61): MethodCallPurityAnalyzer.analyze has cyclomatic complexity 61 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3d02c6d5b967366b004da9e91bd81cf9e499dfd83123cab4acd137fb95fdfd"}},{"ruleId":"D1","level":"warning","message":{"text":"Type.intersectAtomicTypes (cyclomatic 61): Type.intersectAtomicTypes has cyclomatic complexity 61 (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":"src/Psalm/Type.php"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ccfffc407829f9b5a14336c315eb09b6ee8fe53e941ae2a696b4428957fe03"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.refine (cyclomatic 60): AssertionReconciler.refine has cyclomatic complexity 60 (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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea426ab342f250a84f85e27ab66a35065edd70353692c3990c26480ce2196158"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicTypeComparator.canBeIdentical (cyclomatic 60): AtomicTypeComparator.canBeIdentical has cyclomatic complexity 60 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf53f68bb43190cb0650b1360b777f04d52d2ff1fdf6db0b2ebae54374fbacd9"}},{"ruleId":"D1","level":"warning","message":{"text":"Reconciler.addNestedAssertions (cyclomatic 60): Reconciler.addNestedAssertions has cyclomatic complexity 60 (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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeffd381de4f6286d5765b54f718b7ff8db1bfea9af573e26fb3d267487385e"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCallAnalyzer.getAnalyzeNamedExpression (cyclomatic 59): FunctionCallAnalyzer.getAnalyzeNamedExpression 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3951895d7c37296e3b0c816ebcdc72c240ef5349de1ea2ebe27714dc0f75b32"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFilterReturnTypeProvider.getFunctionReturnType (cyclomatic 59): ArrayFilterReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFilterReturnTypeProvider.php"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"22577d57dbe708496f6cf686edf7f0eed803ce30c8b3642c7bc2d315a8e1b8ed"}},{"ruleId":"D1","level":"warning","message":{"text":"SprintfReturnTypeProvider.getFunctionReturnType (cyclomatic 59): SprintfReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/SprintfReturnTypeProvider.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"635a000a6f2361d76f2148ef1f4ca78af138184864701cb6cf9d8a1e9bad5d57"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeTokenizer.getFullyQualifiedTokens (cyclomatic 59): TypeTokenizer.getFullyQualifiedTokens 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":"src/Psalm/Internal/Type/TypeTokenizer.php"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d37502448b970b167055be19f49966906d0537ae5949f82f54796a25a4d072"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeAnalyzer.getFunctionInformation (cyclomatic 58): FunctionLikeAnalyzer.getFunctionInformation has cyclomatic complexity 58 (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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"9caa0c55ff724007015225b6f9a2427d153cb4f6da1b8007b421105e1632f6e9"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionAnalyzer.handleExpression (cyclomatic 58): ExpressionAnalyzer.handleExpression has cyclomatic complexity 58 (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":"src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c71a087d057f7d1ba698a26a9e44d69fb51f9fadfba27cac44c7104b852d97"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileAssertion (cyclomatic 58): SimpleAssertionReconciler.reconcileAssertion has cyclomatic complexity 58 (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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07c1690431388508baac3bce0cf7963a573818066b40a534269bf630c688f42"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAnalyzer.analyzeDestructuringAssignment (cyclomatic 57): AssignmentAnalyzer.analyzeDestructuringAssignment has cyclomatic complexity 57 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ec976f6497990fc84590f24800d395d5663dd5c895984f6d0d8243a13d0324"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.handleSplice (cyclomatic 57): ArrayFunctionArgumentsAnalyzer.handleSplice has cyclomatic complexity 57 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61b58d618b7ab73236e7bd38027ec26926f82fa7dde298c6d75403706aaf5a9"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticPropertyFetchAnalyzer.analyze (cyclomatic 57): StaticPropertyFetchAnalyzer.analyze has cyclomatic complexity 57 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2253d2364d8a76611238248d9bbe275eb99c1bc595616c9830ecac72eeb42808"}},{"ruleId":"D1","level":"warning","message":{"text":"LanguageServer.run (cyclomatic 57): LanguageServer.run has cyclomatic complexity 57 (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":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c31c85035c50fc23270670186745795442b5ecd5dabb8230e66a6b590a629b"}},{"ruleId":"D1","level":"warning","message":{"text":"Populator.populateClassLikeStorage (cyclomatic 57): Populator.populateClassLikeStorage has cyclomatic complexity 57 (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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0814ea0f85899bf20685bd5d297a64af2ce277f95d03d63a1f593b8ad40a7b"}},{"ruleId":"D1","level":"warning","message":{"text":"ClosureAnalyzer.analyzeExpression (cyclomatic 56): ClosureAnalyzer.analyzeExpression has cyclomatic complexity 56 (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":"src/Psalm/Internal/Analyzer/ClosureAnalyzer.php"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfcf2b4878a9319a6667d11a8def180e190711a8dcbcfd7280aeb0d17e23780"}},{"ruleId":"D1","level":"warning","message":{"text":"ConcatAnalyzer.analyze (cyclomatic 56): ConcatAnalyzer.analyze has cyclomatic complexity 56 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5501d7f14bf5853475e96398972b74dee573b0893da870de46aa32f18aaa085d"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleArrayAccessOnKeyedArray (cyclomatic 56): ArrayFetchAnalyzer.handleArrayAccessOnKeyedArray has cyclomatic complexity 56 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cceb0b6d297804ebab6fccfe06ff0065ac42a590f7c5da0e2232d6e28050c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"Psalter.run (cyclomatic 56): Psalter.run has cyclomatic complexity 56 (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":"src/Psalm/Internal/Cli/Psalter.php"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1262ddc56de3db38b0f5dbb5a84c5a4e47d53f645f4b630e2134e7b35d9f0752"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericTypeComparator.isContainedBy (cyclomatic 56): GenericTypeComparator.isContainedBy has cyclomatic complexity 56 (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":"src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c9f7f73f0f6979a688f02bc661625f59f234c7c78b1078b4ce13c5dba27827"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.scrapeAssertions (cyclomatic 55): AssertionFinder.scrapeAssertions has cyclomatic complexity 55 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf224c2e2e2687d9cf69b36de35bbd46ebd45a5b5a4be6ed58cda8aa25eca697"}},{"ruleId":"D1","level":"warning","message":{"text":"ObjectComparator.isIntersectionShallowlyContainedBy (cyclomatic 55): ObjectComparator.isIntersectionShallowlyContainedBy has cyclomatic complexity 55 (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":"src/Psalm/Internal/Type/Comparator/ObjectComparator.php"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59dd4c4a3f2c106026475e9b3ea05488aa7311b09721a5646a493cc2929b4ae"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileTruthyOrNonEmpty (cyclomatic 55): SimpleAssertionReconciler.reconcileTruthyOrNonEmpty has cyclomatic complexity 55 (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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":3051}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea1bf62022fa98f87e83e604240f038af637fee1b3126acbd8b4198759b018a"}},{"ruleId":"D1","level":"warning","message":{"text":"ElseIfAnalyzer.analyze (cyclomatic 54): ElseIfAnalyzer.analyze has cyclomatic complexity 54 (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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9047e33a4a75f2875c089e69a87a9ca5e5bb515604dd43c4413c604b9c16c958"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAnalyzer.analyzeArrayItem (cyclomatic 54): ArrayAnalyzer.analyzeArrayItem has cyclomatic complexity 54 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"57762a57007a0b91946dc41fc7fe36b7ad1e5f3c76b908ba3306cf4dd9f694bb"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getArrayKeyExistsAssertions (cyclomatic 54): AssertionFinder.getArrayKeyExistsAssertions has cyclomatic complexity 54 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4228}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb50e4baa70554ef62e82e4ded91c56fbf40627c6a1d035073f0c56ca156dc1f"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeNodeScanner.createStorageForFunctionLike (cyclomatic 54): FunctionLikeNodeScanner.createStorageForFunctionLike has cyclomatic complexity 54 (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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"488a144049b632e2193351fc80dd9d139df4f08b7ba56fe35fd6e2e1f51e48f9"}},{"ruleId":"D1","level":"warning","message":{"text":"CallAnalyzer.applyAssertionsToContext (cyclomatic 53): CallAnalyzer.applyAssertionsToContext has cyclomatic complexity 53 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0a1aefaa82239ade6951a06d8abbdf3a61c9d497d682fee621f7f777e1d509"}},{"ruleId":"D1","level":"warning","message":{"text":"InstancePropertyFetchAnalyzer.handleScopedProperty (cyclomatic 53): InstancePropertyFetchAnalyzer.handleScopedProperty has cyclomatic complexity 53 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"de05e8276dc625eaa57d25b613995deb661144cd9a866a7255bb416940f97565"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialParserVisitor.enterNode (cyclomatic 53): PartialParserVisitor.enterNode has cyclomatic complexity 53 (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":"src/Psalm/Internal/PhpVisitor/PartialParserVisitor.php"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3235d5cd175e8aa2343687aeeae5b270a6061cbb4ce159801341370c380d6709"}},{"ruleId":"D1","level":"warning","message":{"text":"NegatedAssertionReconciler.handleLiteralNegatedEquality (cyclomatic 53): NegatedAssertionReconciler.handleLiteralNegatedEquality has cyclomatic complexity 53 (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":"src/Psalm/Internal/Type/NegatedAssertionReconciler.php"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2828a866c10ae59ee681d30030f13fdf0f6f2bb17d071c23ae04592e7d9c5a2"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodComparator.compareMethodParams (cyclomatic 52): MethodComparator.compareMethodParams has cyclomatic complexity 52 (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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f2b88e740756702f73cf27d820a2c9a805f773f958a0b21dad06738ad78b08"}},{"ruleId":"D1","level":"warning","message":{"text":"BreakAnalyzer.analyze (cyclomatic 52): BreakAnalyzer.analyze has cyclomatic complexity 52 (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":"src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b5ce94fdb2a90820cf0bbb6ae3b4c4b13e55118151e7c133314937965d115b"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentsAnalyzer.handleClosureArg (cyclomatic 52): ArgumentsAnalyzer.handleClosureArg has cyclomatic complexity 52 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65fa09096bb418e7b5aa4da82f66894dda1dd3ee007355c4b148916fa36c33f"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicStaticCallAnalyzer.analyze (cyclomatic 52): AtomicStaticCallAnalyzer.analyze has cyclomatic complexity 52 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d21fa578a440d2385f81f461cb726915cd6c2c756a012a53c56d9cc48cebf3"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionIdentifier.getExtendedVarId (cyclomatic 52): ExpressionIdentifier.getExtendedVarId has cyclomatic complexity 52 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/ExpressionIdentifier.php"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fea92c2a7a3f3c74dc720c4def00ff2cdf56d7141c840d409df58024b4f0fd"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeExpander.expandNamedObject (cyclomatic 52): TypeExpander.expandNamedObject has cyclomatic complexity 52 (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":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf4ae0d155c2311d431cc781a0c6f4daaf7d98ab3fab757d2fa584566ea9611"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchAnalyzer.analyze (cyclomatic 51): MatchAnalyzer.analyze has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/MatchAnalyzer.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9ec839007a3f8bca4a35e2dc93ab707b956163ef56e090f48df512f5c4f0fc"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassTemplateParamCollector.collect (cyclomatic 50): ClassTemplateParamCollector.collect has cyclomatic complexity 50 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ClassTemplateParamCollector.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cea79671965d9c7a5f1ab0c7dbd607aa04e9e93ef9d6168f747b07b2a0060d"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayReduceReturnTypeProvider.getFunctionReturnType (cyclomatic 50): ArrayReduceReturnTypeProvider.getFunctionReturnType has cyclomatic complexity 50 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReduceReturnTypeProvider.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1640054caf672659b12d48134e1a2694044718f5ac8cc1114071b3e29108bf8c"}},{"ruleId":"D1","level":"warning","message":{"text":"CallableTypeComparator.isContainedBy (cyclomatic 50): CallableTypeComparator.isContainedBy has cyclomatic complexity 50 (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":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"18042494d8af995688261316323c78e3f84f4def0250c5adf4062fd3dd184269"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodComparator.compare (cyclomatic 49): MethodComparator.compare has cyclomatic complexity 49 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f627c5e788157c031c04e8d6b808d519b6cdf3b879861cc30dfd6b0b70f0b1a7"}},{"ruleId":"D1","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.analyze (cyclomatic 49): InstancePropertyAssignmentAnalyzer.analyze has cyclomatic complexity 49 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"70416341b8c6b0fc9483f4e6fe0e017b03663409c4b0fa2f8f1ea1c8c12e9cea"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer.shiftFileOffsets (cyclomatic 49): Analyzer.shiftFileOffsets has cyclomatic complexity 49 (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":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27bd17da9b7306449e273534dcadbd9ea0ff10a775358480d56882ab728e2a2"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeDocblockScanner.improveParamsFromDocblock (cyclomatic 49): FunctionLikeDocblockScanner.improveParamsFromDocblock has cyclomatic complexity 49 (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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e9152cfcb3c78419da9f0c33c7779505a14d869a1722406509cc2ec9cf380d"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayMapReturnTypeProvider.getFunctionReturnType (cyclomatic 49): ArrayMapReturnTypeProvider.getFunctionReturnType has cyclomatic complexity 49 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"098ef6eaafcbb822ed8b73d35d29ffc9adf28d5506f78a8bf7f480f7b231c557"}},{"ruleId":"D1","level":"warning","message":{"text":"IfAnalyzer.analyze (cyclomatic 48): IfAnalyzer.analyze has cyclomatic complexity 48 (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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1403d665e221198b57c990a75d4c68c91f15cfc8d45fb1bf6ff6d930a841a6"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionDocblockManipulator.__construct (cyclomatic 48): FunctionDocblockManipulator.__construct has cyclomatic complexity 48 (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":"src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"def191ff23f508996ed6f0f1cb7fedff79bd58eeaddf43848ea036813380c22d"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayTypeComparator.isContainedBy (cyclomatic 48): ArrayTypeComparator.isContainedBy has cyclomatic complexity 48 (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":"src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c85933417d5297c2be01508d75b6369e5c23ff92c9423c0ce017ad5716ca98d"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateStandinTypeReplacer.handleAtomicStandin (cyclomatic 48): TemplateStandinTypeReplacer.handleAtomicStandin has cyclomatic complexity 48 (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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1284302e6f3d359e14636405e5c9c6e2da42f6fee84e88ed1a7282e3218a5756"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassAnalyzer.checkImplementedInterfaces (cyclomatic 47): ClassAnalyzer.checkImplementedInterfaces has cyclomatic complexity 47 (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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2375}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b7c50c8421e4de89b41b5c585a91b0290b16ff79c10f2e6152288140040def"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.processCustomAssertion (cyclomatic 47): AssertionFinder.processCustomAssertion has cyclomatic complexity 47 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22652fa6fed2157fa339f873f557e907bd71f96723b705262d0cc2c5e025287"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentsAnalyzer.checkArgCount (cyclomatic 47): ArgumentsAnalyzer.checkArgCount has cyclomatic complexity 47 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":2532}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bf670b4c2d75a07bffafe081c20a65120627cc5cad8a77a70b272f5f4870f4"}},{"ruleId":"D1","level":"warning","message":{"text":"CastAnalyzer.analyze (cyclomatic 47): CastAnalyzer.analyze has cyclomatic complexity 47 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e025e2e6dcf2578764d7d8078bbccb55bb8fb576cdae4a5b240d920e90b2b3"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstFetchAnalyzer.getGlobalConstType (cyclomatic 47): ConstFetchAnalyzer.getGlobalConstType has cyclomatic complexity 47 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ConstFetchAnalyzer.php"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bb09637d4dc2667c708088edd63581c31bace253b9e67bc0e44f6cf06405ab"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateInferredTypeReplacer.replace (cyclomatic 47): TemplateInferredTypeReplacer.replace has cyclomatic complexity 47 (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":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fea39ed09586f2e91dedeb37b580d46bd865e4bc48d04c893f6156328c772ea"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeParser.getTypeFromKeyedArrayTree (cyclomatic 47): TypeParser.getTypeFromKeyedArrayTree has cyclomatic complexity 47 (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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"048bacc82c7c94161199aa0d53a09e64e29dd68006ffce06c0dee637be513bd0"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeAnalyzer.checkFullyQualifiedClassLikeName (cyclomatic 46): ClassLikeAnalyzer.checkFullyQualifiedClassLikeName has cyclomatic complexity 46 (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":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c5c20536a5852631e5ffe8aaea7262ad83a77ce2bddfb13cbf86765dc4887d"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentAnalyzer.splitDocLine (cyclomatic 46): CommentAnalyzer.splitDocLine has cyclomatic complexity 46 (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":"src/Psalm/Internal/Analyzer/CommentAnalyzer.php"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f7ec895ef4e26a6deecddbf84e5e3ec2197fe7b3db2f45efc420ee2a1c0519"}},{"ruleId":"D1","level":"warning","message":{"text":"SwitchAnalyzer.analyze (cyclomatic 46): SwitchAnalyzer.analyze has cyclomatic complexity 46 (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":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchAnalyzer.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2253521b509381bd837e123a9bf8a9cbece663c828541f7641ad6fa86e623bc9"}},{"ruleId":"D1","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyze (cyclomatic 46): ArithmeticOpAnalyzer.analyze has cyclomatic complexity 46 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb38b57ba20032365ec574a4f6ba8d402c4e1d09c86eb9d8467a13eed84949fc"}},{"ruleId":"D1","level":"warning","message":{"text":"TernaryAnalyzer.analyze (cyclomatic 46): TernaryAnalyzer.analyze has cyclomatic complexity 46 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e953ffe3ce3721703ed4aa82a80248b93219fb85e319c2751e8e8fc86ea44c2"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionDocblockManipulator.getDocblock (cyclomatic 46): FunctionDocblockManipulator.getDocblock has cyclomatic complexity 46 (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":"src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e95a9e5e020510f992d1602c09e345fcb82fc260ebb8f435a2f8a0cc1234a92"}},{"ruleId":"D1","level":"warning","message":{"text":"CallableTypeComparator.getCallableMethodIdFromTKeyedArray (cyclomatic 46): CallableTypeComparator.getCallableMethodIdFromTKeyedArray has cyclomatic complexity 46 (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":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f2c56c8b25410c32e35303ff8d3e90c81cae2328249c59e900ed1cdb1870b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ForeachAnalyzer.checkIteratorType (cyclomatic 45): ForeachAnalyzer.checkIteratorType has cyclomatic complexity 45 (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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2686700c71833121f48a74a13f1d93d5937c1fd196c0d468932d813b664d812d"}},{"ruleId":"D1","level":"warning","message":{"text":"ElseAnalyzer.analyze (cyclomatic 45): ElseAnalyzer.analyze has cyclomatic complexity 45 (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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"654f36c3c29d726c00ae0b79ef7df96e9fa6285470d2d71c8514655cf8267889"}},{"ruleId":"D1","level":"warning","message":{"text":"IncludeAnalyzer.analyze (cyclomatic 45): IncludeAnalyzer.analyze has cyclomatic complexity 45 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1030481ed170212eaac105a99739f777c32e8590e55c9213ab1d55126b424055"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikes.consolidateAnalyzedData (cyclomatic 45): ClassLikes.consolidateAnalyzedData has cyclomatic complexity 45 (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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd85f8208f23e442c6a8e927efc2b05333024df116a4ca9fefdc5f32fda5be7"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayMultisortParamsProvider.getFunctionParams (cyclomatic 45): ArrayMultisortParamsProvider.getFunctionParams has cyclomatic complexity 45 (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":"src/Psalm/Internal/Provider/ParamsProvider/ArrayMultisortParamsProvider.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9aabbd487281d848a172da97b8e3d8571ed82913f4507f0a97dcd40cdea403"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.hasGetClassCheck (cyclomatic 44): AssertionFinder.hasGetClassCheck has cyclomatic complexity 44 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6e492328bf6d6c52e0d45ae721c175ed14a4a6c4fc5bd89950476bdad8c062"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentAnalyzer.verifyExplicitParam (cyclomatic 44): ArgumentAnalyzer.verifyExplicitParam has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a098eb146c1fdd8bb1860e4304aca912dee23284d712e505738420f8a8d858"}},{"ruleId":"D1","level":"warning","message":{"text":"Refactor.run (cyclomatic 44): Refactor.run has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Refactor.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74279dd420f1fd4c42f3d4d74436a578b0397b0799968c48db38bf425eac287"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer.loadCachedResults (cyclomatic 44): Analyzer.loadCachedResults has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"37239bb8ccee1bbb83cc826083a3594d5f0fde28664a42b196a50b87577c8d00"}},{"ruleId":"D1","level":"warning","message":{"text":"Methods.getMethodParams (cyclomatic 44): Methods.getMethodParams has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfa7b663ae23f476f67754fa05f22a808045082688bca739c6060e283375adf"}},{"ruleId":"D1","level":"warning","message":{"text":"Type.combineUnionTypes (cyclomatic 44): Type.combineUnionTypes has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type.php"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe61a4edb6ed49c8eb296abac64395522b3a73889e8e1620574dc40daee352f6"}},{"ruleId":"D1","level":"warning","message":{"text":"Transpiler.docType (cyclomatic 43): Transpiler.docType has cyclomatic complexity 43 (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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e1c73f6d0b364f792800117b219a52871f3393854f3e6d2242c4794b52811f"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeAnalyzer.checkTemplateParams (cyclomatic 43): ClassLikeAnalyzer.checkTemplateParams has cyclomatic complexity 43 (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":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"9845fe876ed51da399cb2e7580154cc4ef5c9e2879cb2602c69fef84a424d444"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.fetch (cyclomatic 43): FunctionCallReturnTypeFetcher.fetch has cyclomatic complexity 43 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a4ee9b46c60bda99a64554fe1ec881306f8aad86fe455a2dff7fb5520baec1"}},{"ruleId":"D1","level":"warning","message":{"text":"YieldAnalyzer.analyze (cyclomatic 43): YieldAnalyzer.analyze has cyclomatic complexity 43 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3892befe92aae64c65cfdd7b47e88806f91f5f37edf17e835113d841b45ad7d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Populator.populateOverriddenMethods (cyclomatic 43): Populator.populateOverriddenMethods has cyclomatic complexity 43 (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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6aa19a95c80448b24376efc46e7941a5aa75a631b2a1c105009298ed953fa9"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.processFunctionCall (cyclomatic 42): AssertionFinder.processFunctionCall 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"090d25332bd331830049d5f5148aad3f9f4e7991b1f9b72ec3d058ff51d5fd66"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAnalyzer.assignByRefParam (cyclomatic 42): AssignmentAnalyzer.assignByRefParam 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b8421f6fc9151f78bb2d5add1904788a6aaa4ea8889d8c1dd878ed4a3903ca"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentAnalyzer.processTaintedness (cyclomatic 42): ArgumentAnalyzer.processTaintedness has cyclomatic complexity 42 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a3cee139ea5037955d76817a98793bd8637f7bd1e41c3deaa50a387daa0636"}},{"ruleId":"D1","level":"warning","message":{"text":"NewAnalyzer.getNewType (cyclomatic 42): NewAnalyzer.getNewType 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3414f3d15fff3aa82cd901ebb7314e3e7b9f8c4929c1295c2e0ba1ba43407f"}},{"ruleId":"D1","level":"warning","message":{"text":"EncapsulatedStringAnalyzer.analyze (cyclomatic 42): EncapsulatedStringAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/Expression/EncapsulatedStringAnalyzer.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e02217a22efcea3e063d21ae7b8082f717fede2b9707bc7d1fac440db62b20"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeDocblockScanner.handleReturn (cyclomatic 42): FunctionLikeDocblockScanner.handleReturn 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2235c2b469e40ff411d1270a6fdb4029c4945b9cdd03686067e2b30e546865d"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreeCreator.create (cyclomatic 42): ParseTreeCreator.create has cyclomatic complexity 42 (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":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fc42d94f86a0f6bc48207de112dba9be0235e49b3afbd2aa439d754b3391b7"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileFalsyOrEmpty (cyclomatic 42): SimpleNegatedAssertionReconciler.reconcileFalsyOrEmpty 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6891d32aa6434cc53f144b104ae2fc59610ec77f94b405432a82815a8f10cdf"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodComparator.compareMethodSignatureParams (cyclomatic 41): MethodComparator.compareMethodSignatureParams has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa448bd9f5c88c16595c4abcec93e85377f70b9fec59f9f819f31e2381e63ac"}},{"ruleId":"D1","level":"warning","message":{"text":"CallAnalyzer.collectSpecialInformation (cyclomatic 41): CallAnalyzer.collectSpecialInformation has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e415ed0d307645553b7601b8b81af0a3c867d77ca841da2c700a9332ef0176"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleArrayAccessOnTArray (cyclomatic 41): ArrayFetchAnalyzer.handleArrayAccessOnTArray has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fba9927c5795835af12b355e3ec594295e8415f2d0f480dee30e55088cd734"}},{"ruleId":"D1","level":"warning","message":{"text":"DocblockParser.resolveTags (cyclomatic 41): DocblockParser.resolveTags has cyclomatic complexity 41 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Scanner/DocblockParser.php"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bddfb842d4c5172008c8eebf2a9776af24e3a282df49e97f120bdefe014914"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.taintArrayAssignment (cyclomatic 40): ArrayAssignmentAnalyzer.taintArrayAssignment has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"5393716c021d3534a90ac13daedb6d7899ffa713a7d6425bd21b040b07c7ef3a"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.checkClosureTypeArgs (cyclomatic 40): ArrayFunctionArgumentsAnalyzer.checkClosureTypeArgs has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf502fed392cc05a9da127b5c38b4b9aa7ac446d01b90eeb86f624d1f4435ba"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodCallReturnTypeFetcher.fetch (cyclomatic 40): MethodCallReturnTypeFetcher.fetch has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bedf0309470d74a7a9d21b79ce3025ce3aca9a0e2a8b6857af4b12cc6bf993d"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedFunctionCallHandler.handleExtract (cyclomatic 40): NamedFunctionCallHandler.handleExtract has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bde90ae5a78a1ac3515573b634c1f1d9f8b2915bfadc15edc7402835cbe4708"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowResolution.getNextOpenAssignments (cyclomatic 40): TaintFlowResolution.getNextOpenAssignments has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c3f60708479a3508318307a16dccdcbcfb5a97407b556939efe773eac3e8fe"}},{"ruleId":"D1","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyzeMulBetweenIntRange (cyclomatic 39): ArithmeticOpAnalyzer.analyzeMulBetweenIntRange has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a81c28d4273ade3c29e0cacedbffddaece4d8263c0eec757755894f1a45b0e"}},{"ruleId":"D1","level":"warning","message":{"text":"OrAnalyzer.analyze (cyclomatic 39): OrAnalyzer.analyze has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/OrAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2cde627930d02f83e8060eae960a57da8965043d76faf4235b79f1cdc73532"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikes.checkPropertyReferences (cyclomatic 39): ClassLikes.checkPropertyReferences has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2847}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a61e47ca08a3e233f3baa2a48fc0f0c95bd535e0e0723dcfe0a79bc20d479e0"}},{"ruleId":"D1","level":"warning","message":{"text":"FileStatementsDiffer.diff (cyclomatic 39): FileStatementsDiffer.diff has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/FileStatementsDiffer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"63790a3959e2436d55ec12ad4af5d9b96fc815ae1bf18506942e35720200c5f7"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeDocblockParser.parseTaintTags (cyclomatic 39): FunctionLikeDocblockParser.parseTaintTags has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d453541ed74898640c4e8bfe0d0f05af7b475b4b7a2d83984e7a323a74d6262"}},{"ruleId":"D1","level":"warning","message":{"text":"Type.intersectUnionTypes (cyclomatic 39): Type.intersectUnionTypes has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type.php"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ec5670804b6df983deceec6c938e704d58592361a687655cbbc8d600ed0914"}},{"ruleId":"D1","level":"warning","message":{"text":"ReturnTypeCollector.getReturnTypes (cyclomatic 38): ReturnTypeCollector.getReturnTypes has cyclomatic complexity 38 (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":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeCollector.php"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"594a76ef78cd79a268db1005dd2d779bd384b9620efe8a25d9df49ff817e2907"}},{"ruleId":"D1","level":"warning","message":{"text":"IfAnalyzer.updateIfScope (cyclomatic 38): IfAnalyzer.updateIfScope has cyclomatic complexity 38 (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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"34026a3d97ffaf0ec765fee0e424fa87f6e109466fffa27547c54e2fc8188907"}},{"ruleId":"D1","level":"warning","message":{"text":"CastAnalyzer.castFloatAttempt (cyclomatic 38): CastAnalyzer.castFloatAttempt has cyclomatic complexity 38 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f23a0e195c58ad0e17c8d488d83ebb3fb3d6fac54094eeec368724f99f4d950"}},{"ruleId":"D1","level":"warning","message":{"text":"Psalm.run (cyclomatic 38): Psalm.run has cyclomatic complexity 38 (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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"907a15616d13fe778f9b30ee0352c800cbb8dbaf8918f89e9c4602ccf7b331c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFilterParamsProvider.getFunctionParams (cyclomatic 38): ArrayFilterParamsProvider.getFunctionParams has cyclomatic complexity 38 (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":"src/Psalm/Internal/Provider/ParamsProvider/ArrayFilterParamsProvider.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be0e1fc229349b4a64af0ce3892c0ea955a7ab64105e2ce35138c8abd2aa3de"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCallAnalyzer.checkFunctionCallPurity (cyclomatic 37): FunctionCallAnalyzer.checkFunctionCallPurity has cyclomatic complexity 37 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"f388c9cec776abe9d72527115da8561e9a2c74eef672da36970b4b372fb0d74b"}},{"ruleId":"D1","level":"warning","message":{"text":"CastAnalyzer.castIntAttempt (cyclomatic 37): CastAnalyzer.castIntAttempt has cyclomatic complexity 37 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3a2a737c47b0424a2aafd4c95811e3bcdba88d81ff4cb5a6951988ee81c665"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementsAnalyzer.checkUnreferencedVars (cyclomatic 37): StatementsAnalyzer.checkUnreferencedVars has cyclomatic complexity 37 (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":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"649393a671f67f7e234d9e8068acf9c32a082bf5b9adb5cba88a36f8e9bd24aa"}},{"ruleId":"D1","level":"warning","message":{"text":"CliUtils.getPathsToCheck (cyclomatic 37): CliUtils.getPathsToCheck has cyclomatic complexity 37 (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":"src/Psalm/Internal/CliUtils.php"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e01608a2e92bd226596ddcbafd70584cb0cfbf3b61505a8c4b81009eaf944fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Methods.methodExists (cyclomatic 37): Methods.methodExists has cyclomatic complexity 37 (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":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc195e6e66494373c3b93cabb42094ea162bac29643ae6cef278b69607ab740"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeNodeScanner.visitClassConstDeclaration (cyclomatic 37): ClassLikeNodeScanner.visitClassConstDeclaration has cyclomatic complexity 37 (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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcd6580131679ac4f99834dd7dbc319ce0bd847ad2a2d35b2c3d887374dc354"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeVariableTracker.reconcileLowerBoundsWithUpperBounds (cyclomatic 37): TypeVariableTracker.reconcileLowerBoundsWithUpperBounds has cyclomatic complexity 37 (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":"src/Psalm/Internal/Type/TypeVariableTracker.php"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6600f817d94749b8be713cb04bc86d82ea92681b4d66654cc169d3d0908c4a50"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.updateArrayType (cyclomatic 36): ArrayAssignmentAnalyzer.updateArrayType has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92dbd8d66d7ea82fab2bc73f6d70e87dffb19df101262a6fdedfd1e875fc412"}},{"ruleId":"D1","level":"warning","message":{"text":"NonComparisonOpAnalyzer.analyze (cyclomatic 36): NonComparisonOpAnalyzer.analyze has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/NonComparisonOpAnalyzer.php"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f9aa28725f61821c139ded7eed086a3d5fbcb0d37433ed0b725a18f3d65c24"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentsAnalyzer.evaluateArbitraryParam (cyclomatic 36): ArgumentsAnalyzer.evaluateArbitraryParam has cyclomatic complexity 36 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb37675073159b59ccd3a223a19a021ef575594abe008f0dd5bfeede53dbf36"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentsAnalyzer.handleByRefFunctionArg (cyclomatic 36): ArgumentsAnalyzer.handleByRefFunctionArg has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01600fb485de2782183c364219427f669e7d2e3cfa850c03ce740bd9241f362"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicMethodCallAnalyzer.handleInvalidClass (cyclomatic 36): AtomicMethodCallAnalyzer.handleInvalidClass has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f670e71d464325d0f8a3ad2e2492a9e1b144bb4e6c1827d79547114f8741cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodVisibilityAnalyzer.analyze (cyclomatic 36): MethodVisibilityAnalyzer.analyze has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodVisibilityAnalyzer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ada9fed3a8666e9f034d6a7b7d88754a3a3bd88001fc2774ecebaa5c699626"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFetchAnalyzer.taintArrayFetch (cyclomatic 36): ArrayFetchAnalyzer.taintArrayFetch has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"633f21d6f62aadbd69d6c00134e89b86406ed86ff4b4782b4054584ba8e06385"}},{"ruleId":"D1","level":"warning","message":{"text":"InternalCallMapHandler.getMatchingCallableFromCallMapOptions (cyclomatic 36): InternalCallMapHandler.getMatchingCallableFromCallMapOptions has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/InternalCallMapHandler.php"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ea7343d38b4a98c2b757c9c315e94486fab1b1cfae6e6f56440374e53074d7"}},{"ruleId":"D1","level":"warning","message":{"text":"ReflectorVisitor.recordExternalEffects (cyclomatic 36): ReflectorVisitor.recordExternalEffects has cyclomatic complexity 36 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37d47ca2b8211704a7af2e7493a202759c6226f3ec44b57f2cae6522800fdbf"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNameResolver.enterNode (cyclomatic 36): SimpleNameResolver.enterNode has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/SimpleNameResolver.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c65fcf2a281c70d73d22ee3d94f9108c8effb76ccef0191461738ab151ecf6"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.reconcile (cyclomatic 36): AssertionReconciler.reconcile has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0ed734283870f9fe21f4a6313f180fb5d7e2186c9065ab6384d5e129894a84"}},{"ruleId":"D1","level":"warning","message":{"text":"CallableTypeComparator.getCallableFromAtomic (cyclomatic 36): CallableTypeComparator.getCallableFromAtomic has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c28e51a6a757af15a66713da835596c9edaa3c527115ac18a8aa9772cb874d4"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateInferredTypeReplacer.replaceConditional (cyclomatic 36): TemplateInferredTypeReplacer.replaceConditional has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74652d55cf28a23883b5fbe5cf2ab5cdfa9967113fb57f6de768d9c7a36719a"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeParser.getTypeFromTree (cyclomatic 36): TypeParser.getTypeFromTree has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fb9420417835329539ee1e80e7ad2abdb2e1de58e7fe76c74cd2232a11fc92"}},{"ruleId":"D1","level":"warning","message":{"text":"Transpiler.emit (cyclomatic 35): Transpiler.emit 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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"3050dfa8135300c7684b2196d93ea5369c2eab233d919296820d0f8005455565"}},{"ruleId":"D1","level":"warning","message":{"text":"LoopAnalyzer.setLoopVars (cyclomatic 35): LoopAnalyzer.setLoopVars 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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ed6561da678f364732012808a39254add336f36f21521b55adc32e35f7c7e5"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAnalyzer.getReferencedPropertyType (cyclomatic 35): AssignmentAnalyzer.getReferencedPropertyType 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"97099274152bb1ac32f71db00f74fd644bae0dc62d14479c93cfe9fbb4d9f79b"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAnalyzer.analyzeAssignmentToVariable (cyclomatic 35): AssignmentAnalyzer.analyzeAssignmentToVariable 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":2926}}}],"partialFingerprints":{"codehealthFindingId/v1":"22845049899195d30aaa277192571bc2ee33c51bf61470c989385a8b2a27264e"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.handleAddition (cyclomatic 35): ArrayFunctionArgumentsAnalyzer.handleAddition 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94ff550e3367c321edf372835e13f383030376496b30df738801da1ef2684e4"}},{"ruleId":"D1","level":"warning","message":{"text":"NewAnalyzer.analyze (cyclomatic 35): NewAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c723fd95755ec4115dd2643951e98ad2e73458d0be786b2fdc2044d2d7fe64"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicPropertyFetchAnalyzer.handleNonExistentClass (cyclomatic 35): AtomicPropertyFetchAnalyzer.handleNonExistentClass 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6d496b68c16adc94d80fae0598d0c0554f2b43172b099a9665f8c8eb8c5e5b"}},{"ruleId":"D1","level":"warning","message":{"text":"FilterInputReturnTypeProvider.getFunctionReturnType (cyclomatic 35): FilterInputReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d80c05b74c30541a14de0c03e0a846fcec678fdfa41bec15713893b3633964"}},{"ruleId":"D1","level":"warning","message":{"text":"MinMaxReturnTypeProvider.getFunctionReturnType (cyclomatic 35): MinMaxReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/MinMaxReturnTypeProvider.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8559205e149614b26ecbc4d1554be3af4fa3c544b653d58f5c3517ffd4d0e90"}},{"ruleId":"D1","level":"warning","message":{"text":"Codebase.getCompletionItemsForClassishThing (cyclomatic 34): Codebase.getCompletionItemsForClassishThing has cyclomatic complexity 34 (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":"src/Psalm/Codebase.php"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"335094d655131c788118c0411fa0dfbd70cca984db6fadf95ff4cfc04d692cdc"}},{"ruleId":"D1","level":"warning","message":{"text":"Algebra.getTruthsFromFormula (cyclomatic 34): Algebra.getTruthsFromFormula has cyclomatic complexity 34 (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":"src/Psalm/Internal/Algebra.php"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7052c8dc8876e1342eb2afe562bedb1e057996e1d2473514ba09bbf8fa47e4e8"}},{"ruleId":"D1","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.analyzeRegularAssignment (cyclomatic 34): InstancePropertyAssignmentAnalyzer.analyzeRegularAssignment has cyclomatic complexity 34 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46c860b9cffb31f393cba176effe17b2b180ebc70330276e3f76f5331ee8548"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentAnalyzer.coerceValueAfterGatekeeperArgument (cyclomatic 34): ArgumentAnalyzer.coerceValueAfterGatekeeperArgument has cyclomatic complexity 34 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8ec3b8fe7853d46e61b02a26c7fdfb5aa245dd6431e90e5139276a1ca081c3"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodCallReturnTypeFetcher.taintMethodCallResult (cyclomatic 34): MethodCallReturnTypeFetcher.taintMethodCallResult has cyclomatic complexity 34 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c8e7d07dbdb7a0b708e35d5064678fca288dd8f5d86e550a166f2f1f9d38c0"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeDocblockScanner.handleAssertions (cyclomatic 34): FunctionLikeDocblockScanner.handleAssertions has cyclomatic complexity 34 (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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdcfe0406dfd22d10368845cabf33507aa8b774214e2a7dda9f54f886089a30"}},{"ruleId":"D1","level":"warning","message":{"text":"ReflectorVisitor.leaveNode (cyclomatic 34): ReflectorVisitor.leaveNode has cyclomatic complexity 34 (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":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f5dc541395685458490aa5f4ea0370f937c0555a7e297fcce938c3c0d3023b"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.handleIsA (cyclomatic 34): AssertionReconciler.handleIsA has cyclomatic complexity 34 (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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe70608a611bd41199d852e78346fdf131af60810939eb6658df64a0fedcf51c"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreeCreator.handleValue (cyclomatic 34): ParseTreeCreator.handleValue has cyclomatic complexity 34 (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":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf61007a99065195d28487bac0ca717dfcee065e09969894546c70bb7fd7f77"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileList (cyclomatic 34): SimpleAssertionReconciler.reconcileList has cyclomatic complexity 34 (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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"31019502f0f43ea11de79dd27b88cef99e9439d8eeb8e914464157d14a92d2f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Reconciler.reconcileAbsentArrayValue (cyclomatic 34): Reconciler.reconcileAbsentArrayValue has cyclomatic complexity 34 (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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c6cd10603dca7140fe21b1ed258ed0b36e5ed6fc9a694409f70651e05a57f9"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeAnalyzer.checkPropertyVisibility (cyclomatic 33): ClassLikeAnalyzer.checkPropertyVisibility 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":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b47577208c37acb8c15455cce5caa0e73535f8f50d7b00101bb418735e6468"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getTrueInequalityAssertions (cyclomatic 33): AssertionFinder.getTrueInequalityAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7218443daa09ba14df9b91b2a45e0d7e992cd3a3229161437c126f392153e49"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getIsaAssertions (cyclomatic 33): AssertionFinder.getIsaAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e4f5f18074f11658e01b7415d4ac8ccba5843fad0ae5dd9413c92202a2f87d"}},{"ruleId":"D1","level":"warning","message":{"text":"ConcatAnalyzer.analyzeOperand (cyclomatic 33): ConcatAnalyzer.analyzeOperand 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"629c593e7343079fbd91eb43e001d7c435f776a04f4977eca60f870399839812"}},{"ruleId":"D1","level":"warning","message":{"text":"IncludeAnalyzer.getPathTo (cyclomatic 33): IncludeAnalyzer.getPathTo 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":"src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0741c86ebf9d62f82c5bf4bce9544897a42d0b1d5df8bc603977c1e676b2872b"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.scanFile (cyclomatic 33): Scanner.scanFile 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":"src/Psalm/Internal/Codebase/Scanner.php"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb7664727021ab2acc59ba237319c8f6378db35bc4ae3b717fca9e24f46b82c"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentMapVisitor.enterNode (cyclomatic 33): AssignmentMapVisitor.enterNode 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":"src/Psalm/Internal/PhpVisitor/AssignmentMapVisitor.php"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"967754b8284a57254de1b7a1744f30199b4bd6dfa80087096cc07ac4a5ab5a47"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplodeReturnTypeProvider.getFunctionReturnType (cyclomatic 33): ImplodeReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ImplodeReturnTypeProvider.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4562b23edcf2a3cd5fd3e8d5685d499b6dca8c3036bbd312a4a4ffa2c45faaec"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCombiner.handleKeyedArrayEntries (cyclomatic 33): TypeCombiner.handleKeyedArrayEntries 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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c55bc014662c228fcaa5d5ebe959bc0efcbadc5e9afaf482dae8d4de93957f"}},{"ruleId":"D1","level":"warning","message":{"text":"MutableUnion.substitute (cyclomatic 33): MutableUnion.substitute 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":"src/Psalm/Type/MutableUnion.php"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa38a67da074dcdea6a2bb36ab30dc96fd2d61dfeac99d6f26328f032ac6dabe"}},{"ruleId":"D1","level":"warning","message":{"text":"Algebra.combineOredClauses (cyclomatic 32): Algebra.combineOredClauses has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra.php"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed457369ff24736103c788d9d0d25a9d2f235aa7840638e9902931c82a972e7"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectAnalyzer.interpretRefactors (cyclomatic 32): ProjectAnalyzer.interpretRefactors has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"0038da67501fc2ea88384b1c608eb5d88ac30e46b58556ed60d0791bd92e421e"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.scrapeEqualityAssertions (cyclomatic 32): AssertionFinder.scrapeEqualityAssertions has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6e146f3acabcc67efe4f64fdf004a01bb65dcbee67d412fa91577b12844968"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getFalseEqualityAssertions (cyclomatic 32): AssertionFinder.getFalseEqualityAssertions has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ad906a58aad6da96eec25bd395a7b48dbb2a92dbcf9fb583e0d546e82e7245"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticPropertyAssignmentAnalyzer.analyze (cyclomatic 32): StaticPropertyAssignmentAnalyzer.analyze has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/StaticPropertyAssignmentAnalyzer.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3086438f5ef71799477c319b6422be3cd7f33be48df61f162353cf47e05f30f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.handleByRefArrayAdjustment (cyclomatic 32): ArrayFunctionArgumentsAnalyzer.handleByRefArrayAdjustment has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e8f37e239ae0882c5eb7aac65074ccaaeecb5dabb60b9f5c5fe19eec23d43f"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.checkClosureType (cyclomatic 32): ArrayFunctionArgumentsAnalyzer.checkClosureType has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e365f1e75375d4a5225b1726d18595c763a353d78ad38882584bd8c208e902c"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCallAnalyzer.handleNamedFunction (cyclomatic 32): FunctionCallAnalyzer.handleNamedFunction has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efb0d61c5174aab4571bb17d14ded9a8a0ec7600e9e0ed593911d230a3dc8f3"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.simpleExclusion (cyclomatic 32): FunctionCallReturnTypeFetcher.simpleExclusion has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd570ec3675d33096abf9aa25e49a99b37a14c9d490bb8c89ecef1a9a88e7840"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialApplicationAnalyzer.bind (cyclomatic 32): PartialApplicationAnalyzer.bind has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bba7ccfe4c046e0ec9c580e18199bc016635d1f6f6d11cc0e08947f1520198e"}},{"ruleId":"D1","level":"warning","message":{"text":"CastAnalyzer.castStringAttempt (cyclomatic 32): CastAnalyzer.castStringAttempt has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"811644fbfcb6e8f20f40219a51f4fff272fbd825fe460648c0c5c3d9828ec7d3"}},{"ruleId":"D1","level":"warning","message":{"text":"NamespaceStatementsDiffer.diff (cyclomatic 32): NamespaceStatementsDiffer.diff has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"65275844915f2368b6b40bc9cc4e6bd361e24393eee1359cd6f0231f4bb04279"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionResolver.functionEvaluatesToTrue (cyclomatic 32): ExpressionResolver.functionEvaluatesToTrue has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a9f3bef85838350554a924c1cc2c38ee56caffec0a25024ea1af72b3099d7e"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateStandinTypeReplacer.getMappedGenericTypeParams (cyclomatic 32): TemplateStandinTypeReplacer.getMappedGenericTypeParams has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"44620dd3a2e79a6431ba400e9874fd9fb531f9d243d135e52f52f63ac30237f9"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeParser.intersectAtomicTypes (cyclomatic 32): TypeParser.intersectAtomicTypes has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fd0c077fd40f3177797e5724654acd942a812556362323d478c59dac2e448b"}},{"ruleId":"D1","level":"warning","message":{"text":"FileAnalyzer.analyze (cyclomatic 31): FileAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/FileAnalyzer.php"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d446930277cd803b8ac2b01181858b2d258df382fae0e5a0eec37cc1dd561b6f"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAnalyzer.analyze (cyclomatic 31): ArrayAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"970ee6d679878d5a927ceacc455179a638476be6cb784085cfd323aa4f8bab2c"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getGetclassEqualityAssertions (cyclomatic 31): AssertionFinder.getGetclassEqualityAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3688}}}],"partialFingerprints":{"codehealthFindingId/v1":"611fa58f13d0eb61b97c2efcb85992241965cadebcc91125629ccaec14db9b21"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentAnalyzer.checkArgumentMatches (cyclomatic 31): ArgumentAnalyzer.checkArgumentMatches 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c6ce4fb771ba6a9f628512050e8d7aa4c2204cf838b80b727e3437ad954b37"}},{"ruleId":"D1","level":"warning","message":{"text":"DestructorAnalyzer.getHeldType (cyclomatic 31): DestructorAnalyzer.getHeldType 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":"src/Psalm/Internal/Analyzer/Statements/Expression/DestructorAnalyzer.php"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9025d1c2061343f1f6f6196223bf5872bc0bcb31787c859cfc937599bd93d6"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleTypeInferer.handleArrayItem (cyclomatic 31): SimpleTypeInferer.handleArrayItem 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":"src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"251161b48df2265e6886c90b0fddbe8fb9b141d9534d640ad2a90653f6b6e405"}},{"ruleId":"D1","level":"warning","message":{"text":"UnusedAssignmentRemover.findAssignStmt (cyclomatic 31): UnusedAssignmentRemover.findAssignStmt 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":"src/Psalm/Internal/Analyzer/Statements/UnusedAssignmentRemover.php"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"894d8ec846294873129c71789160eb4c9da2413599b460fd9889f0164cb7ea34"}},{"ruleId":"D1","level":"warning","message":{"text":"Populator.inheritPropertyTypes (cyclomatic 31): Populator.inheritPropertyTypes 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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"a079f39fca08754a4649cec7775a56a544f65e8053bcd2fbc02b6a73e3a4f157"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowGraph.reportTaintedFlow (cyclomatic 31): TaintFlowGraph.reportTaintedFlow has cyclomatic complexity 31 (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":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b4df37c39d1e7e952af584a0a5e59c83a3fa5f3d1ce72d85e3215ada2389c2"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateStandinTypeReplacer.handleTemplateParamClassStandin (cyclomatic 31): TemplateStandinTypeReplacer.handleTemplateParamClassStandin 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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6ec5025cb5adc78295646e8e1bb55e57e7acc9f1d3fe3e5cba06518670e512"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCombiner.getArrayTypeFromGenericParams (cyclomatic 31): TypeCombiner.getArrayTypeFromGenericParams 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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf91d9ac77c16ecade3d5a16c7d5f1ef5a124c453522c675be0d1825712c7f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Reconciler.adjustTKeyedArrayType (cyclomatic 31): Reconciler.adjustTKeyedArrayType 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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"acde8a7457d628595b7291fcaba57fd9264d0156d2e768ef5b8b83d840ee2463"}},{"ruleId":"D1","level":"warning","message":{"text":"Codebase.getCompletionItemsForPartialSymbol (cyclomatic 30): Codebase.getCompletionItemsForPartialSymbol has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75424950a3e5351f664f8a7c743c832db609d0310458d67927f91c59276119a"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.getParentIssueType (cyclomatic 30): Config.getParentIssueType has cyclomatic complexity 30 (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":"src/Psalm/Config.php"},"region":{"startLine":2425}}}],"partialFingerprints":{"codehealthFindingId/v1":"853feec1e34bc0228b61b136bb0ef6e7eadf9a22c877b1f0cd3555e6e6f4fb63"}},{"ruleId":"D1","level":"warning","message":{"text":"DoAnalyzer.getUnsureBounds (cyclomatic 30): DoAnalyzer.getUnsureBounds has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"43185030109fa0c5c9d522d44424ad0cc67d8a6e9f458b2a4b4ef67d50de4275"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getGetclassInequalityAssertions (cyclomatic 30): AssertionFinder.getGetclassInequalityAssertions has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2932}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b94058694612895e684010587fcb500e5c3407715402b6544312f6c7a88e61"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.analyzeNestedArrayAssignment (cyclomatic 30): ArrayAssignmentAnalyzer.analyzeNestedArrayAssignment has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4a0d8461c42dea768996de17018c11060d235d1416916205cecf210ca8a745"}},{"ruleId":"D1","level":"warning","message":{"text":"AndAnalyzer.analyze (cyclomatic 30): AndAnalyzer.analyze has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/AndAnalyzer.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed10dc61f590c4859185547034619ee2bd7db2ea1df3d840fb48ab0fd0ce180"}},{"ruleId":"D1","level":"warning","message":{"text":"HighOrderFunctionArgHandler.getCallableArgInfo (cyclomatic 30): HighOrderFunctionArgHandler.getCallableArgInfo has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/HighOrderFunctionArgHandler.php"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8a64d37d3277918941e87790ec2b7186287905fe45af937dc31819e1acc2c4"}},{"ruleId":"D1","level":"warning","message":{"text":"NewAnalyzer.analyzeNamedConstructor (cyclomatic 30): NewAnalyzer.analyzeNamedConstructor has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d80ab0b1a7049b4a21dac78112b73b75fecf9d42d30312dd61ba02da353e61"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleArrayAccessOnNamedObject (cyclomatic 30): ArrayFetchAnalyzer.handleArrayAccessOnNamedObject has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f3e54612565835568db4f8bb751bbd4287402fbbe0d42c4df498d930a9f706"}},{"ruleId":"D1","level":"warning","message":{"text":"FreshObjectFinder.use (cyclomatic 30): FreshObjectFinder.use has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/FreshObjectFinder.php"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4347308f3b700fe3a208f23ba6294f655197208820416868f0e485c739da6b"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionResolver.enterConditional (cyclomatic 30): ExpressionResolver.enterConditional has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c0fa0169b372b2c75b253ffdde6891d0cb3e15b572df88c1807b6b9b75a5db"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionScanner.scanGlobalWrites (cyclomatic 30): ExpressionScanner.scanGlobalWrites has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"743c6bf394946e49ca922575b960dc6e4e62c7467fdf8a79816547f70b249d8a"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementsProvider.getStatementsForFile (cyclomatic 30): StatementsProvider.getStatementsForFile has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/StatementsProvider.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3363c2134aa3412c3e385a5395afa936d5cfd9763bf98ced88c684a41b8a2754"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileCallable (cyclomatic 30): SimpleAssertionReconciler.reconcileCallable has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2877}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e45104f7acb1382104b80d9c9d1fa6382dddb9f1125eeabed90b0816980fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateStandinTypeReplacer.findMatchingAtomicTypesForTemplate (cyclomatic 30): TemplateStandinTypeReplacer.findMatchingAtomicTypesForTemplate has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a41a5fa358a450afd3928a6a0964cdc0da41b096c4c62d2871adfe97bdf94d"}},{"ruleId":"D1","level":"warning","message":{"text":"Transpiler.nativeType (cyclomatic 29): Transpiler.nativeType 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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae2ee6da18b434b0034aefda90af9b6460d906cf86d0d129c1b1c0f6e23349a"}},{"ruleId":"D1","level":"warning","message":{"text":"Transpiler.emitClass (cyclomatic 29): Transpiler.emitClass 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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd380b546861a06d1be2cddca028df5226f80c61e3bfdb4fd8b3b762ffeeffc3"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeLocation.calculateRealLocation (cyclomatic 29): CodeLocation.calculateRealLocation 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":"src/Psalm/CodeLocation.php"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf42a683be4f24fdaa9f95df25fad80df1a181745d2d2758bef0f4648699e707"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentAnalyzer.arrayToDocblocks (cyclomatic 29): CommentAnalyzer.arrayToDocblocks 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":"src/Psalm/Internal/Analyzer/CommentAnalyzer.php"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8c2a8fe6a91e59549fc1ae7c99880ad39a2c2a78f06c2711eff479080f2836"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getNativeSymbolGuardAssertion (cyclomatic 29): AssertionFinder.getNativeSymbolGuardAssertion 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d26c9d09e5198911dcae006a93c316a02939f49ed7d3e75e5b8f7966db9b5f"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getTypedValueEqualityAssertions (cyclomatic 29): AssertionFinder.getTypedValueEqualityAssertions has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3793}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc720757bc2690870975b76cdc1896250609f426997a6d3fdca1383d848b008e"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.getElementCopySource (cyclomatic 29): ArrayAssignmentAnalyzer.getElementCopySource has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea72198323f5b364f01a6bc70a87bc5935b2830c8efb97b7a77d664bd2c8ab0"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.taintReturnType (cyclomatic 29): FunctionCallReturnTypeFetcher.taintReturnType 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"4951861028dbd21daadea678aa5c633be9a62b695f1e63cb26ddeabd683fa45c"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikes.getPotentialDynamicMethodCalls (cyclomatic 29): ClassLikes.getPotentialDynamicMethodCalls 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"790a21644bae3ded3f76b2838d377c2bca1e3869f676daf9fe12eb6fadf6e536"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintStore.getKnownStart (cyclomatic 29): TaintStore.getKnownStart 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":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f1f5ade9eb9129820859441fc5caf619560ab0e7926478adc9ba28f11d2e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayUniqueReturnTypeProvider.getFunctionReturnType (cyclomatic 29): ArrayUniqueReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayUniqueReturnTypeProvider.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c93f0992e5b388c5a0431af5420548f312ec0c6daa424e09558b68936d0f786"}},{"ruleId":"D1","level":"warning","message":{"text":"ObjectComparator.isShallowlyContainedBy (cyclomatic 29): ObjectComparator.isShallowlyContainedBy 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":"src/Psalm/Internal/Type/Comparator/ObjectComparator.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3e150b2f7520d672cb8408a147af3c90a9f887100606f0221e67abba3c5894"}},{"ruleId":"D1","level":"warning","message":{"text":"Atomic.isTruthy (cyclomatic 29): Atomic.isTruthy has cyclomatic complexity 29 (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":"src/Psalm/Type/Atomic.php"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e5c4d8dd943a2d728c6952b8b29782a8289d3afc7b375f5594248f484a0308"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.visitStubFiles (cyclomatic 28): Config.visitStubFiles 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":"src/Psalm/Config.php"},"region":{"startLine":2855}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e4d4bef57c729748874e79c9b6915427007d960cbe21c12124dc016a81f43c"}},{"ruleId":"D1","level":"warning","message":{"text":"AlgebraAnalyzer.checkForParadox (cyclomatic 28): AlgebraAnalyzer.checkForParadox has cyclomatic complexity 28 (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":"src/Psalm/Internal/Analyzer/AlgebraAnalyzer.php"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"25252961d863a7026ee98c1dbbb0937534025e7223e7a6efdaf829f726dc0eec"}},{"ruleId":"D1","level":"warning","message":{"text":"InterfaceAnalyzer.analyze (cyclomatic 28): InterfaceAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/InterfaceAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5fb5a2969aa0122257b9e1fc08b55df7e7b56c345d4072ddaaab4eaa2de5c6"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentAnalyzer.verifyCallableInContext (cyclomatic 28): ArgumentAnalyzer.verifyCallableInContext 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8d713c1eebcdf82f1cd9a1a175b796e299d1b73efc7e4bffe2d55ddd163eb7"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedFunctionCallHandler.handleDependentTypeFunction (cyclomatic 28): NamedFunctionCallHandler.handleDependentTypeFunction 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed35168508deb83fc95a9137837b980bc82fb1a67a741f23d838cd39c5e1c0d5"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowResolution.buildTrace (cyclomatic 28): TaintFlowResolution.buildTrace 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":4017}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf1ef7d7521e9457ad1914c3a8dac083b84681f3c2050b50e9d0db7548cf338"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.handleLiteralEqualityWithInt (cyclomatic 28): AssertionReconciler.handleLiteralEqualityWithInt 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ba511845679e967ff140c500cc18d4d3b5c2a28830ffbd3e1d623ddc6ddd2a"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.handleLiteralEqualityWithString (cyclomatic 28): AssertionReconciler.handleLiteralEqualityWithString 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c5bdf9755192d0cb7b6215414548ba9852b5142bf856328246be8853a55da1"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateInferredTypeReplacer.replaceTemplateParam (cyclomatic 28): TemplateInferredTypeReplacer.replaceTemplateParam 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":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"24885747aba6691f1d0cae5d3e73b81d8e8f004de2aff3fa6119415dd538a582"}},{"ruleId":"D1","level":"warning","message":{"text":"ReturnTypeAnalyzer.checkReturnType (cyclomatic 27): ReturnTypeAnalyzer.checkReturnType 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":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af32d838fe88d206f4d805e565e9a6e142b9e2b0b7f04be85f1a6f26ef374aa"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeAnalyzer.alterParams (cyclomatic 27): FunctionLikeAnalyzer.alterParams 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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"070296da47081bf4ee647b243d8375530d154f645cc1102ff7ab0dc5a320672c"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodComparator.compareMethodDocblockReturnTypes (cyclomatic 27): MethodComparator.compareMethodDocblockReturnTypes 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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc49c8f5f1098783bf6d07eb3928e89e951ca485df016b84ad6b10b12ee4e8e"}},{"ruleId":"D1","level":"warning","message":{"text":"IfConditionalAnalyzer.analyze (cyclomatic 27): IfConditionalAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52464910a9f7b578261487e9f6b2c42fb5e521d024d70e838c2c6d848d24502"}},{"ruleId":"D1","level":"warning","message":{"text":"LoopAnalyzer.addAlwaysWrittenVarIds (cyclomatic 27): LoopAnalyzer.addAlwaysWrittenVarIds has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecb283d9b5ddb2e1597c6fa71e572ec4b33f4e67bb29da8b3d90981eaae476f"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAnalyzer.analyzeAssignmentOperation (cyclomatic 27): AssignmentAnalyzer.analyzeAssignmentOperation has cyclomatic complexity 27 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"953b1158e5e4ae9633187a4c6c530db4100d724c95d9673d51b6c7cbc8fd8faf"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentAnalyzer.getDispatchNode (cyclomatic 27): ArgumentAnalyzer.getDispatchNode 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":2422}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c41b865f11d74d389762cda69957b2ffe76366b8fea8e603d7829863370c04"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticCallAnalyzer.taintReturnType (cyclomatic 27): StaticCallAnalyzer.taintReturnType has cyclomatic complexity 27 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dafd183e3524d13469aa08eb4616a2f50b1af9efe9aea4e6e9e5d6e9b07d258"}},{"ruleId":"D1","level":"warning","message":{"text":"CallAnalyzer.checkTemplateResult (cyclomatic 27): CallAnalyzer.checkTemplateResult 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b183dca7cce53cfeeff0b456e87d1876f9c4f75f89eec948af2a841979971ea5"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionIdentifier.getVarId (cyclomatic 27): ExpressionIdentifier.getVarId 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ExpressionIdentifier.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fed79a15c8add123b20c36b3a333fe4e04e38a8731f80431b14ab91e191501f"}},{"ruleId":"D1","level":"warning","message":{"text":"NullsafeAnalyzer.analyze (cyclomatic 27): NullsafeAnalyzer.analyze has cyclomatic complexity 27 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/NullsafeAnalyzer.php"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb82c6d7a9c57db3c640780633f9609e82c7e112bf01330b143441fda076bee"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalAnalyzer.analyze (cyclomatic 27): GlobalAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/GlobalAnalyzer.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45d54c35660fae7c1156d4b940718ab7d6a5e70a4709e4403883f1fbd4618b3"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowResolution.takeEdge (cyclomatic 27): TaintFlowResolution.takeEdge 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3bdb52df2ea70a321729e2a73031c2cc20d9e9b61cb9967b931f58743c547b"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowResolution.addEntryCaller (cyclomatic 27): TaintFlowResolution.addEntryCaller has cyclomatic complexity 27 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":2667}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a3a2dcede189d248414bfb07563e85c189cb8917a37017884cd664eb7ab564"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeHintResolver.resolve (cyclomatic 27): TypeHintResolver.resolve 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":"src/Psalm/Internal/PhpVisitor/Reflector/TypeHintResolver.php"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafd00bd13dbec632420f13737f70ce5df227b011536a62b4ebd385be815e0dc"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFillReturnTypeProvider.getFunctionReturnType (cyclomatic 27): ArrayFillReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFillReturnTypeProvider.php"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"24435676ed3cbb3cdc15c9a33c8d203596b8e3b080c2bf9772c8b9d662bc8369"}},{"ruleId":"D1","level":"warning","message":{"text":"FilterUtils.getOptionsArgValueOrError (cyclomatic 27): FilterUtils.getOptionsArgValueOrError 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"140f75d9c8933de1cb31737ae7c2ff9e179be51e43e48c429fbe0eb47b05f6f8"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.handleLiteralEqualityWithFloat (cyclomatic 27): AssertionReconciler.handleLiteralEqualityWithFloat 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd91ec9bc72247aea5060731cb41af32cc16060a62272b4343ba9fc7003f847"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileNonEmptyCountable (cyclomatic 27): SimpleAssertionReconciler.reconcileNonEmptyCountable 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1760c6f49283f70066cc04726e9f6418a306fefbdf1d0ebebcf8988c8c6a19"}},{"ruleId":"D1","level":"warning","message":{"text":"UnionTrait.equals (cyclomatic 27): UnionTrait.equals has cyclomatic complexity 27 (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":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6acf7ea66f45c1f3219418232bb1827b2ccb17aeb8c96e1ce3091088b49d759"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.findReferenceRebinding (cyclomatic 26): Context.findReferenceRebinding has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Context.php"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab1d001a1dd4fb5569798250d6e5d3d65ee040e28fd8c2cd7c0577b697f6080"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.removeMutableObjectVars (cyclomatic 26): Context.removeMutableObjectVars has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Context.php"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e78fb63b743e90c3302878ea9c43faaa4ff9d88e8fa0434851e75458b547b3"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassAnalyzer.analyzeClassMethod (cyclomatic 26): ClassAnalyzer.analyzeClassMethod 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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceef2efc09d0794de76ce0935cb5438391a6a1e7fca3d6031a5fdb3a80274908"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAnalyzer.handleUnpackedArray (cyclomatic 26): ArrayAnalyzer.handleUnpackedArray 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"56114d8506b74660e0d8e244c3e7bd3f1b64203a8b724e43dff0fd9204e1c5fa"}},{"ruleId":"D1","level":"warning","message":{"text":"CoalesceAnalyzer.analyze (cyclomatic 26): CoalesceAnalyzer.analyze has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/CoalesceAnalyzer.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2560de91641a5ae8ff697089574ae32373f23595b464dfb9a485fc0399719b37"}},{"ruleId":"D1","level":"warning","message":{"text":"GuardedClasses.whenResult (cyclomatic 26): GuardedClasses.whenResult has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/GuardedClasses.php"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9f439bdb74ec9d5c310c662513f445f6747c2ea4dcfdef6eb1a0bd3fd45561"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialApplicationAnalyzer.analyze (cyclomatic 26): PartialApplicationAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd9fab005d6d21f1eb767306e92c799634a9180091f9b7319f8bd6266227624"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowResolution.applyPathType (cyclomatic 26): TaintFlowResolution.applyPathType 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"042379b96a0de2be209368dd0d010cef99fd3bed1551492dbcda664496b3838e"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowResolution.walk (cyclomatic 26): TaintFlowResolution.walk has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35757638e93d8b77c7443a3ba4a53d484ea2d65cd8a452fd8ad606699651161"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowResolution.passesFetch (cyclomatic 26): TaintFlowResolution.passesFetch has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":3092}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d66ee6b43bcb9a9e8793e038e4a603326a7157fe94421f485ee03dde2d4aa4c"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeNodeScanner.getTrivialConstructorCapabilities (cyclomatic 26): FunctionLikeNodeScanner.getTrivialConstructorCapabilities has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"00efba974b1701ab2fc2696e66c50d07951b6d9e0a4191f14c097fa04a54c643"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayCombineReturnTypeProvider.getFunctionReturnType (cyclomatic 26): ArrayCombineReturnTypeProvider.getFunctionReturnType has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayCombineReturnTypeProvider.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"78267ca8124cae0c8b709a347049233bbe010426fa40da97f7ea694f1a6c6ff2"}},{"ruleId":"D1","level":"warning","message":{"text":"FilterUtils.getOptions (cyclomatic 26): FilterUtils.getOptions 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"914972e6d5c463934a714c953568e8aa85d9cda8678979dd8f26a263dbb54226"}},{"ruleId":"D1","level":"warning","message":{"text":"DocblockParser.parse (cyclomatic 26): DocblockParser.parse 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":"src/Psalm/Internal/Scanner/DocblockParser.php"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc75d630d9f420d48d4555796b946ada2eb8fcf0bd276c23d76fc1f86fbec8b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarTypeComparator.isContainedByDecimalIntString (cyclomatic 26): ScalarTypeComparator.isContainedByDecimalIntString 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":"src/Psalm/Internal/Type/Comparator/ScalarTypeComparator.php"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4227538e5f030db784b8f4facc2d28dc96d1af8323cf67d9fb49837a05bef5c"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileIsGreaterThan (cyclomatic 26): SimpleAssertionReconciler.reconcileIsGreaterThan 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"0723b60a0f595e95d9b668af748e67d31ae5126bda568ca3d90bab746773a0e9"}},{"ruleId":"D1","level":"warning","message":{"text":"UnionTrait.getNonDefaultProperties (cyclomatic 26): UnionTrait.getNonDefaultProperties has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"822e1556e733d956f98da2a0d1c1c3d302cd4e7d657f2f01e6a74ca37fe32019"}},{"ruleId":"D1","level":"warning","message":{"text":"Algebra.groupImpossibilities (cyclomatic 25): Algebra.groupImpossibilities 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":"src/Psalm/Internal/Algebra.php"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"e379b7088a0eb795b9b1ed0080359faeb0ff9642f84822837b09516c1682a5d8"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceAnalyzer.signalMutationOnlyInferred (cyclomatic 25): SourceAnalyzer.signalMutationOnlyInferred 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":"src/Psalm/Internal/Analyzer/SourceAnalyzer.php"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b53559c1c47273f83cd68486ea4096476bb6aca1f46b17fd3e64ecfc77a9a1"}},{"ruleId":"D1","level":"warning","message":{"text":"ArithmeticOpAnalyzer.arithmeticOperation (cyclomatic 25): ArithmeticOpAnalyzer.arithmeticOperation 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01595e8d95866e30f71c111330023bee4cddfaf4c043ac0eb562f2cb6567831"}},{"ruleId":"D1","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyzePowBetweenIntRange (cyclomatic 25): ArithmeticOpAnalyzer.analyzePowBetweenIntRange 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b0948fc408362602213cd57b3614038b87644c3678faaf16d6e08063534516"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassConstAnalyzer.getOverriddenConstant (cyclomatic 25): ClassConstAnalyzer.getOverriddenConstant 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f3fd7aa9943a1024235b7586c581ae72c1aa432521e0d65c70f0b99689e632"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowResolution.reach (cyclomatic 25): TaintFlowResolution.reach 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36463cf135d7afdbfe6b95be7f652e3433ee0e13e772c242310519cbab8f774"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeDocblockScanner.getAssertionParts (cyclomatic 25): FunctionLikeDocblockScanner.getAssertionParts 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78db093ca271cd951c446be02282407b0dfb8cfdbae055838abdde6db59bb03"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicTypeComparator.getTraversableHalf (cyclomatic 25): AtomicTypeComparator.getTraversableHalf has cyclomatic complexity 25 (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":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9a79403ccac2be39c6bad7d5c733361dd405443c0292148aa7397b7200119a"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeStringComparator.isContainedBy (cyclomatic 25): ClassLikeStringComparator.isContainedBy has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/ClassLikeStringComparator.php"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd44bf0c9139ed57f3074e06c6fa428fb7b3f7cf0e83d595b0dc70ed3db243e0"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileIsLessThan (cyclomatic 25): SimpleAssertionReconciler.reconcileIsLessThan 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8211763dbec0b2f0216e0ccb85bb9470250f9b71c18ed65bd19a5a6694fed6b5"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodComparator.compareMethodSignatureReturnTypes (cyclomatic 24): MethodComparator.compareMethodSignatureReturnTypes 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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"accc39eff4fdbc855f23f0f5f691b5a6eb78078f23d00d3786e8f050709b7a41"}},{"ruleId":"D1","level":"warning","message":{"text":"LoopAnalyzer.widenIntRanges (cyclomatic 24): LoopAnalyzer.widenIntRanges 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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9fb76c1e92cf4b19c33eea36c9abb543215cd44bb59dd2b7a670a8e6717a51"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getInarrayAssertions (cyclomatic 24): AssertionFinder.getInarrayAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4120}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e20499ab85f578ecfd365141f2ceb892a313bd183b18293a1c338000472737"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticCallAnalyzer.analyzeParentPropertyHookCall (cyclomatic 24): StaticCallAnalyzer.analyzeParentPropertyHookCall has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d734320427d4afc43908430c8d96537d3be1820bedadb31d4f3982274d98483"}},{"ruleId":"D1","level":"warning","message":{"text":"CallAnalyzer.getFunctionIdsFromCallableArg (cyclomatic 24): CallAnalyzer.getFunctionIdsFromCallableArg has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1c2834fcdaa64f72e48870fc5302ab710597f3789cf463f877b919aa80b4b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikes.rebuildStructuralEdges (cyclomatic 24): ClassLikes.rebuildStructuralEdges 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcd6ae562fbcfac45ac5258b68fe173ae66c9e9285af08680855e2178947a35"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikes.handleClassLikeReferenceInMigration (cyclomatic 24): ClassLikes.handleClassLikeReferenceInMigration 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"289be0f116a603599c60f553a0f368d8ac3a134c744fbc320fb95b9f12939f3d"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikes.findPossibleMethodParamTypes (cyclomatic 24): ClassLikes.findPossibleMethodParamTypes 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2629}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db50dfe5091ef2fc061c637c104006988fc09d6808ff9021a774496d3c49e44"}},{"ruleId":"D1","level":"warning","message":{"text":"Reflection.registerClass (cyclomatic 24): Reflection.registerClass 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":"src/Psalm/Internal/Codebase/Reflection.php"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0331557e13dba6da35d0378d7cd76baabf062c2140888657810f567f57f3c5ab"}},{"ruleId":"D1","level":"warning","message":{"text":"PurityWildcardPaths.collectEdits (cyclomatic 24): PurityWildcardPaths.collectEdits 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":"src/Psalm/Internal/Type/PurityWildcardPaths.php"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98b26277ac12b6f9245935b701c6861ac1155c223b49ed36b0f92a93d1fbbeb"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileExactlyCountable (cyclomatic 24): SimpleAssertionReconciler.reconcileExactlyCountable 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcf640152763a51595e09225c843a771750f5acbafc0b40253acbfaedd1e88b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCombiner.scrapeIntProperties (cyclomatic 24): TypeCombiner.scrapeIntProperties 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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9b6ffadd049ddfd204dfad3f9111ed673dbaa41d3aa0fe89f1dfab9455cff7"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeExpander.expandPropertiesOf (cyclomatic 24): TypeExpander.expandPropertiesOf 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":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a698630c504552e3a92c8ad63459f4f86e4a809069413484f8deafc6438da1f1"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeParser.intersectScalarTypes (cyclomatic 24): TypeParser.intersectScalarTypes 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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"935e1cbd58583ff6840ba54226de476741486a56b84a2a2304e842adec520f4c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker.checkGenericParams (cyclomatic 24): TypeChecker.checkGenericParams 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":"src/Psalm/Internal/TypeVisitor/TypeChecker.php"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3b39c6b4a3a313298e68465b0162c7f3b9f5283107d7457b4a2a02fa358359"}},{"ruleId":"D1","level":"warning","message":{"text":"Transpiler.parseType (cyclomatic 23): Transpiler.parseType has cyclomatic complexity 23 (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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a746c9c123fe2409a09eaeb3dda3befc98c730b0a852a3d35e4d091c37f509f"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.visitPreloadedStubFiles (cyclomatic 23): Config.visitPreloadedStubFiles 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":"src/Psalm/Config.php"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"615bdae06356ce048a3e48772ee0fdebfe940c1fc1382f9a37471ea684b20454"}},{"ruleId":"D1","level":"warning","message":{"text":"IssetGuardedProperties.walk (cyclomatic 23): IssetGuardedProperties.walk 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":"src/Psalm/Internal/Analyzer/IssetGuardedProperties.php"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06f8e512478f71b62241ee92de9c68e34b77ead9690b707670abcd02bab8338"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getFalseInequalityAssertions (cyclomatic 23): AssertionFinder.getFalseInequalityAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2448}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d176356b03ee3afdde247856964e6d45e0aa99d04576362335298543256e2a"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getTrueEqualityAssertions (cyclomatic 23): AssertionFinder.getTrueEqualityAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"419aebc11e6fa0f156294bead64ab7a813a16abccd01f1ff0edecd6edc178a75"}},{"ruleId":"D1","level":"warning","message":{"text":"ArithmeticOpAnalyzer.isChangeableByLoop (cyclomatic 23): ArithmeticOpAnalyzer.isChangeableByLoop 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3eafd8e145d2610f4b8b6a133c1ca8eaa06f663b504b6194627c2e2effa9002"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodCallReturnTypeFetcher.getReturnDispatchNode (cyclomatic 23): MethodCallReturnTypeFetcher.getReturnDispatchNode 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b35e0f1c02923f5b9354c38d89e8601d63a91257798ea12fe93e29da27096b"}},{"ruleId":"D1","level":"warning","message":{"text":"CloneAnalyzer.analyzeClonedType (cyclomatic 23): CloneAnalyzer.analyzeClonedType 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CloneAnalyzer.php"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2753860c1f29a0b506071480171b094f04ad8d60f593fdb046030f6aa062cbdb"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleArrayAccessOnArray (cyclomatic 23): ArrayFetchAnalyzer.handleArrayAccessOnArray 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ecf44f47678b9210c94cd85b6e185453b0f86cd6879b10eeb4ef9afc2a9cff"}},{"ruleId":"D1","level":"warning","message":{"text":"Populator.inheritMethodsFromParent (cyclomatic 23): Populator.inheritMethodsFromParent 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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"214be36509509b6d5704c53506e032912fd3f91e92c8359c074a370af6e6d84a"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeNodeScanner.inferPropertyTypeFromConstructor (cyclomatic 23): FunctionLikeNodeScanner.inferPropertyTypeFromConstructor 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74d8485ef5fa0850c965bf0b1572dd5f1a68e5b30fbcae5f4642966193e5cb9"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayMapReturnTypeProvider.getElementMarker (cyclomatic 23): ArrayMapReturnTypeProvider.getElementMarker has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"057d15a3f32b068183f39b11d922cfa230fc05fc4b955d83124088496cc9d340"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.restoreTemplateKeyOrValueOf (cyclomatic 23): AssertionReconciler.restoreTemplateKeyOrValueOf 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0b9fe6846a7e99a9968589c01f600e97c3b854a95763ab0d276e28a90b662b"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileHasMethod (cyclomatic 23): SimpleAssertionReconciler.reconcileHasMethod 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1bb318516de095f1d22588c2889b949f13f08642268fd9c7b57bac93895be5"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileObject (cyclomatic 23): SimpleAssertionReconciler.reconcileObject 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"528ef0b1c68963703cc7eec90261cd7cd12ead0ee3eae8a36be2ddc1df434107"}},{"ruleId":"D1","level":"warning","message":{"text":"Reconciler.breakUpPathIntoParts (cyclomatic 23): Reconciler.breakUpPathIntoParts 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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b845410a213c07b54713a87f5ab42f51ede687ea7a0e4d7e6885d00e5ce084"}},{"ruleId":"D1","level":"warning","message":{"text":"Codebase.getMarkupContentForSymbolByReference (cyclomatic 22): Codebase.getMarkupContentForSymbolByReference has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a9be08f7c4c274dee0dc1ad8b39d6cbcd42c8714bbe2d94b3cc03a163cdc3e"}},{"ruleId":"D1","level":"warning","message":{"text":"Codebase.getCompletionDataAtPosition (cyclomatic 22): Codebase.getCompletionDataAtPosition has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"863058f4130dc3d0d078e757c055a55ccf66b176365dc2b2fdf7f04408575a7f"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.reportIssueInFile (cyclomatic 22): Config.reportIssueInFile has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ca52e328b1552cf9b479f2f1fe75bb918741f8c69594016f038e8782d800d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ClosureAnalyzer.analyzeClosureUses (cyclomatic 22): ClosureAnalyzer.analyzeClosureUses has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClosureAnalyzer.php"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd541bb21d58b917f03a91fbbffc7ce2b0b46401d9dda81937b90c536a4f465f"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeAnalyzer.findAssignments (cyclomatic 22): FunctionLikeAnalyzer.findAssignments has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06bd58c90b0dc6bb7d335c66127c6501692b752d84c9d73d376f8b5876b41e2"}},{"ruleId":"D1","level":"warning","message":{"text":"ForeachAnalyzer.mayWriteTheArrayOtherwise (cyclomatic 22): ForeachAnalyzer.mayWriteTheArrayOtherwise has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47393a5e57e98d44818684f849a80b3aa382ed38c98e95700726a21f6d8e42f"}},{"ruleId":"D1","level":"warning","message":{"text":"SwitchCaseAnalyzer.handleNonReturningCase (cyclomatic 22): SwitchCaseAnalyzer.handleNonReturningCase has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchCaseAnalyzer.php"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"f459f113a4be1175e90a8682212c8361f4117cd6cecf8fe18fabdf1ccfd14b8b"}},{"ruleId":"D1","level":"warning","message":{"text":"ContinueAnalyzer.analyze (cyclomatic 22): ContinueAnalyzer.analyze has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/ContinueAnalyzer.php"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2ae218a05d5b9e82048430b15e698def366531d17ee9cc0498a192497f1647"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAnalyzer.assignTypeFromVarDocblock (cyclomatic 22): AssignmentAnalyzer.assignTypeFromVarDocblock has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"614fae3ac4ca0de83968f79b6e3f692aa860bd8abed8abe44024fff396c3c0d5"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAnalyzer.analyzePropertyAssignment (cyclomatic 22): AssignmentAnalyzer.analyzePropertyAssignment has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"428d7705d4e789d5fc1b9aeb7f90efa898192d9c8b1fb0882373c5aad7460265"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingMethodCallHandler.overloadAcceptsArgs (cyclomatic 22): MissingMethodCallHandler.overloadAcceptsArgs has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b326d0e0977ae35a0e889e04209fca3a714c6d9b58f94bf131fccdf43f3e97"}},{"ruleId":"D1","level":"warning","message":{"text":"NewAnalyzer.taintNewObject (cyclomatic 22): NewAnalyzer.taintNewObject has cyclomatic complexity 22 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d06477e4cf485c56fadeaee136e2c1b6c51562644097177faf32535f8fbf5e"}},{"ruleId":"D1","level":"warning","message":{"text":"Cache.consolidate (cyclomatic 22): Cache.consolidate has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cache.php"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7905089d58b522f0d9b9f44b558c334655bd9bfd073244ee4f8beb63c2e9e6f"}},{"ruleId":"D1","level":"warning","message":{"text":"Populator.populateFileStorage (cyclomatic 22): Populator.populateFileStorage has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3e332d8a2a70a5a30ae922f4e593c8fec3c82c03394138024be9315e0b6eb8"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionDocblockManipulator.getManipulationsForFile (cyclomatic 22): FunctionDocblockManipulator.getManipulationsForFile has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87c403cc04380ff015260ae9925b7d15c24a1b60af2aa873da816079d7dc01f"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckTrivialExprVisitor.checkNonTrivialExpr (cyclomatic 22): CheckTrivialExprVisitor.checkNonTrivialExpr has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/CheckTrivialExprVisitor.php"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2800fa6adc7f6d60ce6c7511e7445d396e32265e020e440cf50d9464cbfd66"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeNodeScanner.handleTraitUse (cyclomatic 22): ClassLikeNodeScanner.handleTraitUse has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b155fd715daf74520a656613f4a5a927c69fc377910753c1949b47c24c4e814"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeNodeScanner.visitEnumDeclaration (cyclomatic 22): ClassLikeNodeScanner.visitEnumDeclaration has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8f056a8f9df5871b034886c1f5c81af922ee3b314958790d1e5289e58f40ee"}},{"ruleId":"D1","level":"warning","message":{"text":"StringStartScanner.scan (cyclomatic 22): StringStartScanner.scan has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c8d6f481afdbc29dbe0ba4c869ec4dacd392671791d422c4d4e4adb1ccc57d"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateTagParser.findDefaultSeparator (cyclomatic 22): TemplateTagParser.findDefaultSeparator has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/TemplateTagParser.php"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2137b20b146b6debb3ec32efc5f1e71ed66cbc7c89fd737bbe0162bbc18666bd"}},{"ruleId":"D1","level":"warning","message":{"text":"IteratorToArrayReturnTypeProvider.getFunctionReturnType (cyclomatic 22): IteratorToArrayReturnTypeProvider.getFunctionReturnType has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/IteratorToArrayReturnTypeProvider.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c4aac4450c7bc713a7f4228bc6dc07195d4d3444f516b177419ffa4afbeef9"}},{"ruleId":"D1","level":"warning","message":{"text":"PowReturnTypeProvider.getFunctionReturnType (cyclomatic 22): PowReturnTypeProvider.getFunctionReturnType has cyclomatic complexity 22 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/PowReturnTypeProvider.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c784d82a3f3a5a35c9299c65184292a46452cdb868627b71fc090a176ff6849"}},{"ruleId":"D1","level":"warning","message":{"text":"StubsGenerator.getAll (cyclomatic 22): StubsGenerator.getAll has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Stubs/Generator/StubsGenerator.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"660dae60204d73f8090eeb17da48d33e52c100b678412a799440d618547d9989"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreeCreator.handleQuestionMark (cyclomatic 22): ParseTreeCreator.handleQuestionMark has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d74671b8a36e17edd1c91acc1c19b09277082fad97f4a1a04b0374ba8a8c6a"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileString (cyclomatic 22): SimpleAssertionReconciler.reconcileString has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ed3e03a66c1ee31c7cefe613d84aafe7d326bebbe150ca2b8b85a56991e84"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileIsLessThanOrEqualTo (cyclomatic 22): SimpleNegatedAssertionReconciler.reconcileIsLessThanOrEqualTo has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (SimpleNegatedAssertionReconciler.reconcileIsGreaterThanOrEqualTo) 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0fd28919e561f423ed35fbf0943465cc460279aeadeb67e612308895dc78e7"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileIsGreaterThanOrEqualTo (cyclomatic 22): SimpleNegatedAssertionReconciler.reconcileIsGreaterThanOrEqualTo has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (SimpleNegatedAssertionReconciler.reconcileIsLessThanOrEqualTo) 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b53f9c26f38bd144ed04bd0465bc664e35a0b91d126208f5e3cb7381cf3433"}},{"ruleId":"D1","level":"warning","message":{"text":"Reconciler.triggerIssueForImpossible (cyclomatic 22): Reconciler.triggerIssueForImpossible has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b5fc28aa34ac6ac1edfd477a33b43698c782ac49e12361dab6684b1ca4b3bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.getReportingLevelForIssue (cyclomatic 21): Config.getReportingLevelForIssue 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":"src/Psalm/Config.php"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b20460825cfe4c589f59add9ab84c1ce26b6a00a36e9c4e10650c9d0ec6774"}},{"ruleId":"D1","level":"warning","message":{"text":"AttributesAnalyzer.analyze (cyclomatic 21): AttributesAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/AttributesAnalyzer.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f6c74fbe693c7de08d21571ca26cd4c3deb62a1222439ccd2dfe24ede0d1b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassAnalyzer.checkParentClass (cyclomatic 21): ClassAnalyzer.checkParentClass 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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"579d0d7462510907a7691220e9047aecb5bba9fa1149f48ef82369c5691d8445"}},{"ruleId":"D1","level":"warning","message":{"text":"InheritedMethodTaints.getBodySuffix (cyclomatic 21): InheritedMethodTaints.getBodySuffix has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/InheritedMethodTaints.php"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c50d73fb30117b3ebf73cec338ae7fe677cbcb83435e8aef67ec76d75a8383a"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodComparator.compareMethodDocblockParams (cyclomatic 21): MethodComparator.compareMethodDocblockParams 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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"99901ad020e285b3c3ed07ac8892bef26fa7d5bbb30b58b860ed06234a25d5bc"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAnalyzer.castArrayKeyType (cyclomatic 21): ArrayAnalyzer.castArrayKeyType 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb4ab0ad04f507c53fba96768d7b47b5e5d181b5c103f0a1945289847c6fd4d"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.scrapeInequalityAssertions (cyclomatic 21): AssertionFinder.scrapeInequalityAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc99ada13551c1c242774b01249da22c650fb404c98872de7e2b491e5c78b4ee"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.hasSuperiorNumberCheck (cyclomatic 21): AssertionFinder.hasSuperiorNumberCheck has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (AssertionFinder.hasInferiorNumberCheck) 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"1257066f72a3fd2e1c8817ecbaca3a815df25d63599eb25631a1b2eba9d576a2"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.hasInferiorNumberCheck (cyclomatic 21): AssertionFinder.hasInferiorNumberCheck has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (AssertionFinder.hasSuperiorNumberCheck) 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"7208e91302132dc59dfff39f91c0fd23aeb08d720b4abe792b9632b13dda273b"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getGreaterAssertions (cyclomatic 21): AssertionFinder.getGreaterAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7a223b8ca6e49769dacf3398611f0d4f53d4cb82c20e94d41e4cc58329d895"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getStringLengthComparison (cyclomatic 21): AssertionFinder.getStringLengthComparison has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4569}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbbc73086e6d0da06006def554e3ce93173000c2646fc45440d08464f578073"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getSmallerAssertions (cyclomatic 21): AssertionFinder.getSmallerAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4668}}}],"partialFingerprints":{"codehealthFindingId/v1":"8421ad4408afb7674ffd218289063c8e05db45fbfc386ca7a6a075022e105742"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.updateTypeWithKeyValues (cyclomatic 21): ArrayAssignmentAnalyzer.updateTypeWithKeyValues 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"472e3499ec510ecedbd0d8b7fdf96d9834528d3dd0228c503b9466d215f040fc"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.getArrayAssignmentOffsetType (cyclomatic 21): ArrayAssignmentAnalyzer.getArrayAssignmentOffsetType 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbcc1ca088e3a092e74c676d5304ab0e0e0db0709075ed6fcaff85f1c95780f"}},{"ruleId":"D1","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.checkReadonlyPropertyWrite (cyclomatic 21): InstancePropertyAssignmentAnalyzer.checkReadonlyPropertyWrite has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"527280a4b0abc6675aade7203247dc6aba70ea708acb9d978f24b6c927fe2a2a"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingMethodCallHandler.handleMissingOrMagicMethod (cyclomatic 21): MissingMethodCallHandler.handleMissingOrMagicMethod 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e647d35579ba61e4f92ebf81f5354bb3ca9a3f50ed300f03e748d3b01200bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialApplicationAnalyzer.captureReference (cyclomatic 21): PartialApplicationAnalyzer.captureReference 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"956af6099f8e7bf77b99e16eb48da374f978d09891ecbf430af4cca5f6089e02"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleArrayAccessOnString (cyclomatic 21): ArrayFetchAnalyzer.handleArrayAccessOnString 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"c826fa4c6b8ce6da179e486560d9c6c542c20d9c3e08ec2397df31983ae86b91"}},{"ruleId":"D1","level":"warning","message":{"text":"FreshObjectFinder.walk (cyclomatic 21): FreshObjectFinder.walk 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":"src/Psalm/Internal/Analyzer/Statements/FreshObjectFinder.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef683af606fe96b8a2fbb846c3469fa8155c08044730e677b47f5166dbfc6edd"}},{"ruleId":"D1","level":"warning","message":{"text":"UnsetAnalyzer.removeOffset (cyclomatic 21): UnsetAnalyzer.removeOffset 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":"src/Psalm/Internal/Analyzer/Statements/UnsetAnalyzer.php"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9332d8548a15188d176fd5f5664e83e94ce840cbf6c7319159357f7cf7a217"}},{"ruleId":"D1","level":"warning","message":{"text":"Review.run (cyclomatic 21): Review.run 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":"src/Psalm/Internal/Cli/Review.php"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"320894f507799e97d316c4b630fc8ed3d28d63985e959c80cb72df470033e764"}},{"ruleId":"D1","level":"warning","message":{"text":"CliUtils.parseOptions (cyclomatic 21): CliUtils.parseOptions 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":"src/Psalm/Internal/CliUtils.php"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"284580955b11178e95043a44f5c6a124c7ffc39f7b29fe47c847ba8eee7ea984"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikes.handleDocblockTypeInMigration (cyclomatic 21): ClassLikes.handleDocblockTypeInMigration 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ee87a911e4a84deecaaf6874f6438c4f587d3986a50de1bedeefba7f4957c0"}},{"ruleId":"D1","level":"warning","message":{"text":"Functions.getMatchingFunctionNames (cyclomatic 21): Functions.getMatchingFunctionNames 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":"src/Psalm/Internal/Codebase/Functions.php"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"2129bf7f6061e10db96fa3ce8413f3d4718621f8f624847ab34f7fc421482622"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.queueFilesOfInheritedMethods (cyclomatic 21): Scanner.queueFilesOfInheritedMethods 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":"src/Psalm/Internal/Codebase/Scanner.php"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac4081e9a8eadfc097e098443c592812e0554ab6ece1412c5b80c857f4ae573"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintStore.getKnownStartOfMember (cyclomatic 21): TaintStore.getKnownStartOfMember has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aed095fee8f9e2ecd7d35a86b91dcd0edc705c8ba38baf85c3f762c04b07d89"}},{"ruleId":"D1","level":"warning","message":{"text":"UnshippedCode.fromContents (cyclomatic 21): UnshippedCode.fromContents has cyclomatic complexity 21 (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":"src/Psalm/Internal/Codebase/UnshippedCode.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cbf95a45004bd48bc45a0dc555febd71833c96d3e8a80db240a142d5a54008"}},{"ruleId":"D1","level":"warning","message":{"text":"EventDispatcher.registerClass (cyclomatic 21): EventDispatcher.registerClass 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":"src/Psalm/Internal/EventDispatcher.php"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"be133e51d2b9671d966493c7f00a6582bbc3c80c2acfeab0527cf8bc89ef761f"}},{"ruleId":"D1","level":"warning","message":{"text":"StringStartScanner.getReturnStart (cyclomatic 21): StringStartScanner.getReturnStart 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":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"3843bd7940248954244397a8b563bda1bde4b45f3e9d752547c34e7b9bf489d0"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFirstLastReturnTypeProvider.getElementType (cyclomatic 21): ArrayFirstLastReturnTypeProvider.getElementType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFirstLastReturnTypeProvider.php"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9c9bab8364b27bb766d798784659b64645c0ab3595d008cbab5f904ac0345e"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayReverseReturnTypeProvider.getFunctionReturnType (cyclomatic 21): ArrayReverseReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReverseReturnTypeProvider.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa8b01ad392a4e0dace056268ced9656d8c93b713b5146c81ba9066952cb927"}},{"ruleId":"D1","level":"warning","message":{"text":"GetObjectVarsReturnTypeProvider.getGetObjectVarsReturnType (cyclomatic 21): GetObjectVarsReturnTypeProvider.getGetObjectVarsReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/GetObjectVarsReturnTypeProvider.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d368065e3b0a3d8de704737b5d1ad7bab4762f7d599e39ad1b254dce88b0411f"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileInt (cyclomatic 21): SimpleAssertionReconciler.reconcileInt 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d817394f5a8a34ae2827fbdbc4efc2d085e004885f1f49b254b0211270567c89"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileNumeric (cyclomatic 21): SimpleAssertionReconciler.reconcileNumeric 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e02ef4381a3ffb61aac3d61212961b542da9f306f61035256c6ba8d9db252a"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileArray (cyclomatic 21): SimpleAssertionReconciler.reconcileArray 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38b73deea14d52dee2630e1bdd7a07aeb9f99329ab53e59cfda1e0bed004360"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileNotNonEmptyCountable (cyclomatic 21): SimpleNegatedAssertionReconciler.reconcileNotNonEmptyCountable 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1836d74e9738f46f1887307f8953d0ac19b4a1513d8744e92e96ed55cca5200"}},{"ruleId":"D1","level":"warning","message":{"text":"Reconciler.getPathType (cyclomatic 21): Reconciler.getPathType 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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6348230b163d1405df8103fee307a24db641bf2f0b4f05ac7787d994a692c32"}},{"ruleId":"D1","level":"warning","message":{"text":"Transpiler.resolveContext (cyclomatic 20): Transpiler.resolveContext 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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"0289021fd0900e7a3865458bb5b275c6577e359e3f713d291000b749b8c9f979"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassAnalyzer.analyzeTraitUse (cyclomatic 20): ClassAnalyzer.analyzeTraitUse 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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"73011c1af7dce0dca15c32ba783ecedcf4cbc0f6a3c97435b2b06d61505006e0"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentAnalyzer.isHashNotation (cyclomatic 20): CommentAnalyzer.isHashNotation 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":"src/Psalm/Internal/Analyzer/CommentAnalyzer.php"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b1df854a4e75b297b3ad7a18d3b4a8b65a2d570ebdebc217da19400d31a940"}},{"ruleId":"D1","level":"warning","message":{"text":"LoopAnalyzer.setVarsAssignedInCondition (cyclomatic 20): LoopAnalyzer.setVarsAssignedInCondition 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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8b2e8826824aa5f81d85485635487006c97254e72f3615ee07bb5ffe8d5d60"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getInstanceOfAssertions (cyclomatic 20): AssertionFinder.getInstanceOfAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf0a950d7f49e4c8abb21e511c4cf2ad5b1bf80f82368aeae5dbcaaa6bc1d44"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryOpAnalyzer.addDataFlow (cyclomatic 20): BinaryOpAnalyzer.addDataFlow 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae19db90a70889face5f9592d00d3fa71d9ef4da234cdd218af8a579b9748491"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodCallPurityAnalyzer.getUnaffectedPropertyGetters (cyclomatic 20): MethodCallPurityAnalyzer.getUnaffectedPropertyGetters 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"380f020feb9cc3e17739117caed4ea0bc246164aca81379dd042546a9cf2aabd"}},{"ruleId":"D1","level":"warning","message":{"text":"NewAnalyzer.getUnconstrainableTemplates (cyclomatic 20): NewAnalyzer.getUnconstrainableTemplates 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff843999c8725c9cbadf2e820a97bf42654870bba22bb425652671707b304bc"}},{"ruleId":"D1","level":"warning","message":{"text":"CloneAnalyzer.analyzeFuncCall (cyclomatic 20): CloneAnalyzer.analyzeFuncCall 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CloneAnalyzer.php"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81cd68406a91d6e41056224913b4bfacf9698844c32c29cf1e9b38fcafd1e18"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFetchAnalyzer.taintSuperGlobalFetch (cyclomatic 20): ArrayFetchAnalyzer.taintSuperGlobalFetch has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"582b43eaf5cf3185a89118161fddbf0160cc86508ec5140082230be5d22973f3"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicPropertyFetchAnalyzer.propertyFetchCanBeAnalyzed (cyclomatic 20): AtomicPropertyFetchAnalyzer.propertyFetchCanBeAnalyzed 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc235beb417f43ee388f360581f841411decbd88433394e8d68858d19e7c350"}},{"ruleId":"D1","level":"warning","message":{"text":"MagicConstAnalyzer.analyze (cyclomatic 20): MagicConstAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/Expression/MagicConstAnalyzer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b044c893e7578e81b779d0f14ab42e85913adb9328a125f6a1844637201a276c"}},{"ruleId":"D1","level":"warning","message":{"text":"ReturnAnalyzer.collectGeneratorReturnTypes (cyclomatic 20): ReturnAnalyzer.collectGeneratorReturnTypes 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":"src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e30119ec98ec36535dcfcbde7f2b2a50ef201f14dff267b892fdc924b2acd6"}},{"ruleId":"D1","level":"warning","message":{"text":"UnsetAnalyzer.replaceElement (cyclomatic 20): UnsetAnalyzer.replaceElement 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":"src/Psalm/Internal/Analyzer/Statements/UnsetAnalyzer.php"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b8a2e78943a629e477be99680e83d18c610737934e5f84be3980dee35bf68e"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeUseGraph.reach (cyclomatic 20): CodeUseGraph.reach 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":"src/Psalm/Internal/Codebase/CodeUseGraph.php"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"3081044450e5f9c78323df18e1edfc016145c73cf2bd41c0966e7fabf839aede"}},{"ruleId":"D1","level":"warning","message":{"text":"ReceiverPropertyTaints.taintCall (cyclomatic 20): ReceiverPropertyTaints.taintCall has cyclomatic complexity 20 (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":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd229702a63d659bedfa413bce7b9ae895cd66157f3e9d33b676cf3ed51f13b"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowAnnotation.parse (cyclomatic 20): TaintFlowAnnotation.parse 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":"src/Psalm/Internal/Codebase/TaintFlowAnnotation.php"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d72306c40f57590803973803e4b98c631e129e3e79a51fb264d03326ee70d1"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowResolution.composeOpenAssignments (cyclomatic 20): TaintFlowResolution.composeOpenAssignments 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3917c44714b8d98508b36df166be134f3a72358f1b4ffd2b056808c5bc0995"}},{"ruleId":"D1","level":"warning","message":{"text":"CustomTraverser.traverseArray (cyclomatic 20): CustomTraverser.traverseArray 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":"src/Psalm/Internal/PhpTraverser/CustomTraverser.php"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed5af923175a858a818dee56c9b93632a785df1ee49beefb37cd7a4e00494c6"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionResolver.fileDeclaresKind (cyclomatic 20): ExpressionResolver.fileDeclaresKind 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":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1282b9016cabf3b22730770206703920daa646a7978c496769056745ff0f848"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionScanner.scan (cyclomatic 20): ExpressionScanner.scan 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":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"187a138d66a84458ff5815ae119a49f410b318f9d4ce4a3f4cbaad0908613b45"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeDocblockScanner.handleTaintFlow (cyclomatic 20): FunctionLikeDocblockScanner.handleTaintFlow 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"12364d31de1f60fddcab60c233df82b77062c957d68eb4376d5e54bb280c0d4a"}},{"ruleId":"D1","level":"warning","message":{"text":"StringStartScanner.getStart (cyclomatic 20): StringStartScanner.getStart 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":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae72ed0425124fa149ad526f3b7dd53f88b0485fda74a6851397641d26fdd197"}},{"ruleId":"D1","level":"warning","message":{"text":"ReflectorVisitor.recordThisPropertyMutation (cyclomatic 20): ReflectorVisitor.recordThisPropertyMutation has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf029e1a43ae3248b77908bd2fa7d9fc6f0ca8f8be5ab5bfc6bae2100e4c6c3"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeStubGenerator.getMethodNodes (cyclomatic 20): ClassLikeStubGenerator.getMethodNodes 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":"src/Psalm/Internal/Stubs/Generator/ClassLikeStubGenerator.php"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33181c4615a5ee84764ce40ae64481701253318fb9ca59c335698735f676978"}},{"ruleId":"D1","level":"warning","message":{"text":"UnionTypeComparator.mergeAlternativeBounds (cyclomatic 20): UnionTypeComparator.mergeAlternativeBounds has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4f382ec139cd624dd5740f98181e71cbf37782aaadcb65d18a27f8af0fb40f"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCombiner.combineDecimalIntString (cyclomatic 20): TypeCombiner.combineDecimalIntString 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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"09799d7b7e0b8abcb554818d735b05ce16b7bc2cbd013482c622dc29cf875ce7"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeExpander.expandConditional (cyclomatic 20): TypeExpander.expandConditional 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":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c720f391b04a6b715e2b15418ea50022012273a05f022678caf97a35c12528"}},{"ruleId":"D1","level":"warning","message":{"text":"Atomic.isFalsy (cyclomatic 20): Atomic.isFalsy 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":"src/Psalm/Type/Atomic.php"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef72f36151853ebd295dd57be4238863960f9f91ae1bdf69d38acb5baf25063"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericTrait.toNamespacedString (cyclomatic 20): GenericTrait.toNamespacedString 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":"src/Psalm/Type/Atomic/GenericTrait.php"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"213dccd842096664e8b7d90a1f82776f513d418a268874b7a6e18cd76839848e"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.removeCacheDirectory (cyclomatic 19): Config.removeCacheDirectory 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":"src/Psalm/Config.php"},"region":{"startLine":3332}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ebdc2bed7b30a4863c1daf622e8a51e315d460195abbfd7335a202a7c88bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.filterClauses (cyclomatic 19): Context.filterClauses 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":"src/Psalm/Context.php"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fc1bddb509b17e438448fb0aab5843b49952daf3d41b152a13b86aaeca38b8"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassAnalyzer.analyzeProperty (cyclomatic 19): ClassAnalyzer.analyzeProperty has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"befe6d4e1c03559682c1c395bebfc1eee675c85863710cdf34d1820ac3deb748"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeAnalyzer.detectUnusedParameters (cyclomatic 19): FunctionLikeAnalyzer.detectUnusedParameters 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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":3215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a50f9cb609f2372e5bc77ba0b07325b247d6ce6a2606af593697223bbd6cb4c"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodComparator.checkForObviousMethodMismatches (cyclomatic 19): MethodComparator.checkForObviousMethodMismatches has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0a6ae917e8d8775b1cff55557db1de38ea301bd4ab7145fef25715dbb9ae7e"}},{"ruleId":"D1","level":"warning","message":{"text":"DoAnalyzer.analyze (cyclomatic 19): DoAnalyzer.analyze has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c32954403b071bf9ff9eca6da2517d363d40ec493756921ef9c61668f0e097"}},{"ruleId":"D1","level":"warning","message":{"text":"DoAnalyzer.hasExitToTheLoop (cyclomatic 19): DoAnalyzer.hasExitToTheLoop 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":"src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"405874b75d40f4486c9644d11189d338df8fc8f43b29286b0868bea9a862b3ec"}},{"ruleId":"D1","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.trackPropertyImpurity (cyclomatic 19): InstancePropertyAssignmentAnalyzer.trackPropertyImpurity 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f664dab27295333b008217d0597e95e8e40218a85e9c85e033201c72bf3aea9"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingMethodCallHandler.handleMagicMethod (cyclomatic 19): MissingMethodCallHandler.handleMagicMethod 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b773bd1f2c6cfef900a7264abf987397ced49483637a655461f3f41d1d1efa8c"}},{"ruleId":"D1","level":"warning","message":{"text":"UnaryPlusMinusAnalyzer.analyze (cyclomatic 19): UnaryPlusMinusAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/Expression/UnaryPlusMinusAnalyzer.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6579c1363912865118f2012473b5fdf167097efd5bfbd5d7177ae44c56707a2c"}},{"ruleId":"D1","level":"warning","message":{"text":"Psalm.restart (cyclomatic 19): Psalm.restart 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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba51a4db6c981ab55a8fe65fc4b01007ab3a93b7537bea861e4434846d74426b"}},{"ruleId":"D1","level":"warning","message":{"text":"CliUtils.requireAutoloaders (cyclomatic 19): CliUtils.requireAutoloaders 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":"src/Psalm/Internal/CliUtils.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1600334b74a026ccc979809f1b11722531063dff242e25b486b87bb4f07480"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer.removeExistingDataForFile (cyclomatic 19): Analyzer.removeExistingDataForFile 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":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fcd501c54f12a42257dd0497129154197c2f9add441b836a9443b92b76cca5"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeDocblockScanner.getConditionalSanitizedTypeTokens (cyclomatic 19): FunctionLikeDocblockScanner.getConditionalSanitizedTypeTokens 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd85228c923639e728b789142be51b66eca40b3b0b6030c59a115b53b1a94c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFillKeysReturnTypeProvider.getFunctionReturnType (cyclomatic 19): ArrayFillKeysReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFillKeysReturnTypeProvider.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ce62be5b42e311d8ab5705b65c889adc2f434e94152f228aaf704f2de0ed51"}},{"ruleId":"D1","level":"warning","message":{"text":"MbInternalEncodingReturnTypeProvider.getFunctionReturnType (cyclomatic 19): MbInternalEncodingReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/MbInternalEncodingReturnTypeProvider.php"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d7679d6dde5053df004ddfdd9b58ac8ffd6c88ee1635b0a21009b58e2636b7"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.handleLiteralEquality (cyclomatic 19): AssertionReconciler.handleLiteralEquality 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"b056a9d1cf301c36e99431dac27c8d123b6f1b4e2a4e30a8030bd044d4a25ff0"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.getCompatibleStringType (cyclomatic 19): AssertionReconciler.getCompatibleStringType has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88ac48bb0910bc35178d23c79661d718d1229608be291d2bc84b656336a25f6"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.canBeIntersected (cyclomatic 19): AssertionReconciler.canBeIntersected 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":2463}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be1a29f1b8add7167d25f6c9472544b9ec58081073bcdac2159ad7e77d9f21a"}},{"ruleId":"D1","level":"warning","message":{"text":"IntegerRangeComparator.reduceRangeIncrementally (cyclomatic 19): IntegerRangeComparator.reduceRangeIncrementally 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":"src/Psalm/Internal/Type/Comparator/IntegerRangeComparator.php"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d7764f9ac15125e9c547740bdbe88c94e8c318d2121c0b8ed52e3af127b9a8"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreeCreator.parseCallableParam (cyclomatic 19): ParseTreeCreator.parseCallableParam 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":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fe30df81a1e819c0f130a4a96ae4f438e449af342645721876e23f88573b07"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreeCreator.handleComma (cyclomatic 19): ParseTreeCreator.handleComma has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"5724bcc38fdfcc42d11f0a0d41d0c9b288c08a639546e151dad19d5a252db0ed"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreeCreator.handleColon (cyclomatic 19): ParseTreeCreator.handleColon has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9e45e0522db61454c81a74ba76de6370aaa4edb70938dcd4716519075f8ce8"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileIsset (cyclomatic 19): SimpleAssertionReconciler.reconcileIsset 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc7cc24c2124f9f805d0eea20e1a5a3c12224b2f2c8c3ca43b14b090d27dc3c"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileInt (cyclomatic 19): SimpleNegatedAssertionReconciler.reconcileInt 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e83fa4bb3e0a0d55df70be51e793e47db4f81d515cdb43bf91c7b39ddf5d74"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileArray (cyclomatic 19): SimpleNegatedAssertionReconciler.reconcileArray 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f284a594dcb3e0ae3a2155619375799ecdf3b6f8c5022e009dc4be3297560f4"}},{"ruleId":"D1","level":"warning","message":{"text":"StringRefinement.get (cyclomatic 19): StringRefinement.get has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/StringRefinement.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19e0d5a37dbfac5a9c1535b3b3d38297454f880a654c93de5593697db510956"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateStandinTypeReplacer.replace (cyclomatic 19): TemplateStandinTypeReplacer.replace 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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db13aded12f7250974346ea02cb4d76dd14ab7f56d485092a4d06a6a28d73c0"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker.enterNode (cyclomatic 19): TypeChecker.enterNode has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/TypeVisitor/TypeChecker.php"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"56896a025d1317bb07aab9cd1ef4ac679c5baa1435b294b32aa9364b167b7149"}},{"ruleId":"D1","level":"warning","message":{"text":"IssueBuffer.add (cyclomatic 19): IssueBuffer.add 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. This is NOT this file\u0027s highest cyclomatic complexity: IssueBuffer.getOutput (cyclomatic 20) 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":"src/Psalm/IssueBuffer.php"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9b98b0568643dc3898f1ab881b4c68f36535b467e2ad104a7a0e6c98f2d913"}},{"ruleId":"D1","level":"warning","message":{"text":"LongProgress.taskDone (cyclomatic 19): LongProgress.taskDone 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":"src/Psalm/Progress/LongProgress.php"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75f5373de160896ec96f70d6dc5777973189771adbc588e59e2c2bfbdfb708f"}},{"ruleId":"D1","level":"warning","message":{"text":"MutableUnion.addType (cyclomatic 19): MutableUnion.addType 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":"src/Psalm/Type/MutableUnion.php"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"9321c21b261bec1303c50b1c876832775506330f90b4e1394e5068c4d7cd8c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"ClosureAnalyzer.widenLiteralsOfByRefCapture (cyclomatic 18): ClosureAnalyzer.widenLiteralsOfByRefCapture 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":"src/Psalm/Internal/Analyzer/ClosureAnalyzer.php"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c074608df53837e2ec40fff32ebc544826cce1e8dfa9412539b4a08249621a1"}},{"ruleId":"D1","level":"warning","message":{"text":"ForeachAnalyzer.getIterationCapabilities (cyclomatic 18): ForeachAnalyzer.getIterationCapabilities 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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3baadc63add933f146d911eda4b3744923c1d39b1f495a9738951d40bfcac7"}},{"ruleId":"D1","level":"warning","message":{"text":"LoopAnalyzer.analyzeForOrWhile (cyclomatic 18): LoopAnalyzer.analyzeForOrWhile 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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10cc9f78dbcca2353890e487fff6cc17012189368fbfb2026ae609830f9e2e4"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getNullInequalityAssertions (cyclomatic 18): AssertionFinder.getNullInequalityAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94678533a24f0503433a7b10fcad824206cce8c3a605d0996057095a9740f26"}},{"ruleId":"D1","level":"warning","message":{"text":"BitwiseNotAnalyzer.analyze (cyclomatic 18): BitwiseNotAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BitwiseNotAnalyzer.php"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"41601d55d1a0b2f69310fb801a61069a0321ebe0321767e21ecd5283a7d46c80"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentAnalyzer.getDispatchRoutes (cyclomatic 18): ArgumentAnalyzer.getDispatchRoutes 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91dd27096ccb7a4e9b8c6f09837decf0738fc0fa36ed2fb95dcf5847fb6534f"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentMapPopulator.recordArgumentPositions (cyclomatic 18): ArgumentMapPopulator.recordArgumentPositions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentMapPopulator.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5baa33099e8261338d7970162abc22b06395513392e58112557dd09004196d"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.taintCallableParamCall (cyclomatic 18): FunctionCallReturnTypeFetcher.taintCallableParamCall 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7843767c955fdf95e088d0d98e29dc46bd62ad83d42d944d2e38ced1c15707"}},{"ruleId":"D1","level":"warning","message":{"text":"ExistingAtomicMethodCallAnalyzer.getMagicGetterOrSetterProperty (cyclomatic 18): ExistingAtomicMethodCallAnalyzer.getMagicGetterOrSetterProperty 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"42596287263b5f355239434d7292b94375f157004870985dac8962d49436029a"}},{"ruleId":"D1","level":"warning","message":{"text":"CastAnalyzer.castScalarToString (cyclomatic 18): CastAnalyzer.castScalarToString 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a798e747af35d0db940700693d359fae418fb25bfff8b0db8df826d955c5179"}},{"ruleId":"D1","level":"warning","message":{"text":"ThrowAnalyzer.analyze (cyclomatic 18): ThrowAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ThrowAnalyzer.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"142df9bdd6f26426d4ac9057a99e867ac70ea813f463ba270706841d9a85154c"}},{"ruleId":"D1","level":"warning","message":{"text":"Psalm.generateConfig (cyclomatic 18): Psalm.generateConfig 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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acd8ae411ab938da3d1d72062072bbe8009379e948a7aca1705850f3793b04a"}},{"ruleId":"D1","level":"warning","message":{"text":"Populator.extendTemplateParams (cyclomatic 18): Populator.extendTemplateParams 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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95d3a46e5893fae0a76ecaea829057b3a064c4a34675007d4f2e58d1a249a78"}},{"ruleId":"D1","level":"warning","message":{"text":"ReceiverPropertyTaints.getElementCopySource (cyclomatic 18): ReceiverPropertyTaints.getElementCopySource has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d118dcf346c1c8375640e45865ebd06e2891b95a3a921f5cf320f1d3509bfc6c"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowGraph.linkGeneratorSends (cyclomatic 18): TaintFlowGraph.linkGeneratorSends 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":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b5e3beadf101786c1252fba79a14c14fd0d5f19832980ebfe7f1c8cc2ed5d2"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeDocblockParser.keepTemplatesInParamTypes (cyclomatic 18): ClassLikeDocblockParser.keepTemplatesInParamTypes has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e14e97e5ede372d7219ccccb960c1427859db4cdf8c30bd12ec7657b618f52e"}},{"ruleId":"D1","level":"warning","message":{"text":"StringStartScanner.getCallArguments (cyclomatic 18): StringStartScanner.getCallArguments 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":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb53456bd5cafc4c91f3baec257153671db9d2d3c89c61047230ddcb2a64558"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayReplaceRecursiveReturnTypeProvider.replaceArray (cyclomatic 18): ArrayReplaceRecursiveReturnTypeProvider.replaceArray 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReplaceRecursiveReturnTypeProvider.php"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f5c7da8e3378b35569a826aef10be3c75c63d0dcf29a48c7dbe8abe155d20c"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreeCreator.handleIsOrAs (cyclomatic 18): ParseTreeCreator.handleIsOrAs 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":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee6ac242ec6923151a8c3c3dbfa57c9e489192494192859f436be8756793ea4"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileFalse (cyclomatic 18): SimpleAssertionReconciler.reconcileFalse 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. This shape REPEATS in the file: one other method here (SimpleAssertionReconciler.reconcileTrue) 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4292d7f86018cc8a72d945d0cd0a7afd77cce76039036499ae8f81791bc8c315"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileTrue (cyclomatic 18): SimpleAssertionReconciler.reconcileTrue 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. This shape REPEATS in the file: one other method here (SimpleAssertionReconciler.reconcileFalse) 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"965a46d5ba4f730ecd514141df05877477e1786f91df7322713cf43ddbfeb132"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileStringArrayAccess (cyclomatic 18): SimpleAssertionReconciler.reconcileStringArrayAccess 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbf87034fe604462e4e834db9aff7ee3ac5d743acef2b2ade13c960cfe7f70a"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileNumeric (cyclomatic 18): SimpleNegatedAssertionReconciler.reconcileNumeric 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8601abda0fdb4f13c9bed3ac9cffc100f39503e92615a42a143a324567931c1"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileString (cyclomatic 18): SimpleNegatedAssertionReconciler.reconcileString 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c06994ba8d247ce658f1efcb54e0af395d7555d7960b26e438c98ea1c7b242"}},{"ruleId":"D1","level":"warning","message":{"text":"TKeyedArray.replaceTemplateTypesWithStandins (cyclomatic 18): TKeyedArray.replaceTemplateTypesWithStandins has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0029812553078a6548eb708fd7ab028cca25001ee0a47a0b66f7e7081b7378"}},{"ruleId":"D1","level":"warning","message":{"text":"FileFilter.loadFromXMLElement (cyclomatic 17): FileFilter.loadFromXMLElement has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config/FileFilter.php"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90a7c9cdd749af896c18a19f54d4cff8d41e6ffed9a95df916382c402a18912"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.resetMutatedStaticProperties (cyclomatic 17): Context.resetMutatedStaticProperties 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":"src/Psalm/Context.php"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec7bdf73bcd5487aaa2578920bb6f2ec304ee04d6869bafa704eb90a3c8a037"}},{"ruleId":"D1","level":"warning","message":{"text":"AlgebraAnalyzer.findImplication (cyclomatic 17): AlgebraAnalyzer.findImplication 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":"src/Psalm/Internal/Analyzer/AlgebraAnalyzer.php"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7cc2265f1a18c68bc92b55e0808777ac583e31c088226b10d56425f072d027"}},{"ruleId":"D1","level":"warning","message":{"text":"AttributesAnalyzer.analyzeGetAttributes (cyclomatic 17): AttributesAnalyzer.analyzeGetAttributes has cyclomatic complexity 17 (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":"src/Psalm/Internal/Analyzer/AttributesAnalyzer.php"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3b9a1113d6c39d50a81f178ecada6699502a03c51f1a1c3c955906baa7fd2f"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodAnalyzer.isMethodVisible (cyclomatic 17): MethodAnalyzer.isMethodVisible 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":"src/Psalm/Internal/Analyzer/MethodAnalyzer.php"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d591441beab881d80e21cae8d30a402884f3ce2a1001ec68a34a19980d83253"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectAnalyzer.migrateCode (cyclomatic 17): ProjectAnalyzer.migrateCode 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":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7d3c833263cd163f9293ad52185f783fa9a6eaf8a51ebb3ef5b74e2b9317d4"}},{"ruleId":"D1","level":"warning","message":{"text":"IfConditionalAnalyzer.getAssignmentStates (cyclomatic 17): IfConditionalAnalyzer.getAssignmentStates 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"291322c03482d31ed1bd757a2be6df2f875d103e457888750c235ec849e82ff8"}},{"ruleId":"D1","level":"warning","message":{"text":"LoopAnalyzer.applyPreConditionToLoopContext (cyclomatic 17): LoopAnalyzer.applyPreConditionToLoopContext 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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f5dfe6ac53cdd9fd422f8a9edfbf2d853175b30a105223fe7e91ef8b8b8de4"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.hasTypedValueComparison (cyclomatic 17): AssertionFinder.hasTypedValueComparison has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9429477b93d9c228b9ae79badbc02a427d151063d4787480dab7f4f02a9690"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getNullEqualityAssertions (cyclomatic 17): AssertionFinder.getNullEqualityAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3114}}}],"partialFingerprints":{"codehealthFindingId/v1":"849d1391225db5e5a87e3c5479bb2b0ef39052d12277bcbe42a0edbd9477272b"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getGetdebugtypeEqualityAssertions (cyclomatic 17): AssertionFinder.getGetdebugtypeEqualityAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3622}}}],"partialFingerprints":{"codehealthFindingId/v1":"0100d795e53faa04cace36927292f292489cc675b81f8cc616499b33d404fc7b"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getComparedVarId (cyclomatic 17): AssertionFinder.getComparedVarId 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4027}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1517405da8d1e7cc72238c908758dc1f26025622621f69dcc103c21f73de0ef"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.updateParentTypes (cyclomatic 17): ArrayAssignmentAnalyzer.updateParentTypes 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e784f9d5bc5d13c7c413a696806b9229a8bc6c9ab93ac99012107d606abc67b8"}},{"ruleId":"D1","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.taintUnspecializedProperty (cyclomatic 17): InstancePropertyAssignmentAnalyzer.taintUnspecializedProperty has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5559ffa0935d6b3afbfd2f1b0f14a162a2d221e47a440c4a5cc4276bae26310"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAnalyzer.makeReferencedArrayNonNull (cyclomatic 17): AssignmentAnalyzer.makeReferencedArrayNonNull 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"087265a96c410ff6f4e201e0ce0752aecb7886e1cfb1db009891a058ba338d42"}},{"ruleId":"D1","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyzeOperandsBetweenIntRange (cyclomatic 17): ArithmeticOpAnalyzer.analyzeOperandsBetweenIntRange 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dc194d09a4ebc3c0bb1b33c4091d4fb14da69571ad41d5f9cb844a29497963"}},{"ruleId":"D1","level":"warning","message":{"text":"PipeAnalyzer.getDirectCall (cyclomatic 17): PipeAnalyzer.getDirectCall 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/PipeAnalyzer.php"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"671296bee031961f525af5ddd28ad8499a441fe3a77f4c94354a0d9ac4a1168f"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentsAnalyzer.getProvisionalTemplateResultForFunctionLike (cyclomatic 17): ArgumentsAnalyzer.getProvisionalTemplateResultForFunctionLike 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ddd5ef3dbb369524fdba1615956297171c41dff2bd8e6648955453ece3e494"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.checkArgumentsMatch (cyclomatic 17): ArrayFunctionArgumentsAnalyzer.checkArgumentsMatch 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6886c1b8fc38e851a58a04dc08fbbcf2b660426fd057f532023c01703ed63c7"}},{"ruleId":"D1","level":"warning","message":{"text":"CallAnalyzer.checkFunctionExists (cyclomatic 17): CallAnalyzer.checkFunctionExists has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f7dd315ec12f94135ef4ee7ac2751db91bb21fad2d088266bff726c2a17f86"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstFetchAnalyzer.getConstType (cyclomatic 17): ConstFetchAnalyzer.getConstType 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ConstFetchAnalyzer.php"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8541ffa8d11d9daf97575a8985b61884ad9ff927de21eda9e6c319e1f78fa60"}},{"ruleId":"D1","level":"warning","message":{"text":"IncDecExpressionAnalyzer.analyze (cyclomatic 17): IncDecExpressionAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/Expression/IncDecExpressionAnalyzer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"030f16c2ddff2823f89dd4d5a676277c43f972f39848692f5dd741bf16a4ae2e"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionAnalyzer.analyze (cyclomatic 17): ExpressionAnalyzer.analyze has cyclomatic complexity 17 (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":"src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"93555c5616a9773022f1693750bf0e926cc2743e48bdc865965427c1daf8bf59"}},{"ruleId":"D1","level":"warning","message":{"text":"UnsetAnalyzer.analyze (cyclomatic 17): UnsetAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/UnsetAnalyzer.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e5fc506014f5f68de41e64b10f9fa79953511abd7587ff3e6b8fa75e7900a6"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementsAnalyzer.analyze (cyclomatic 17): StatementsAnalyzer.analyze has cyclomatic complexity 17 (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":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"673849a66278b8c6fd279b59e1df9cf1a420cac4469491ad5f08000846eff295"}},{"ruleId":"D1","level":"warning","message":{"text":"Clause.calculateNegation (cyclomatic 17): Clause.calculateNegation has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Clause.php"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7400c3e640c2562db2785b1ec32e31f7890c79293d7b4e252bef8f4fb999f2ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer.doAnalysis (cyclomatic 17): Analyzer.doAnalysis has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5765836837ba744b40479224b71d520c117cf81e8670445dbe848172d613f9"}},{"ruleId":"D1","level":"warning","message":{"text":"InternalCallMapHandler.getCallablesFromCallMap (cyclomatic 17): InternalCallMapHandler.getCallablesFromCallMap 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":"src/Psalm/Internal/Codebase/InternalCallMapHandler.php"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4e89189f92c5aa68eff2cb74da2d6d753a427e7c1926574d4d02b4c6d230b0"}},{"ruleId":"D1","level":"warning","message":{"text":"PropertyBagTaints.taintAssignment (cyclomatic 17): PropertyBagTaints.taintAssignment 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":"src/Psalm/Internal/Codebase/PropertyBagTaints.php"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5014d3c0002cb4442054c4a6cdd2885d03d604d50e2cfb42aa2ef969ec09b5ab"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowResolution.prepareGraph (cyclomatic 17): TaintFlowResolution.prepareGraph has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8d991582f4a1f9b12591488be157e4c9a172c1449a370e4b540833c28e24aa"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintFlowResolution.reportFlow (cyclomatic 17): TaintFlowResolution.reportFlow 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":3921}}}],"partialFingerprints":{"codehealthFindingId/v1":"088d23c28a20d3faf9779212f833112dcb22c0a2cdad188dd53418b65dd367cf"}},{"ruleId":"D1","level":"warning","message":{"text":"VariableUseGraph.getChildNodes (cyclomatic 17): VariableUseGraph.getChildNodes 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":"src/Psalm/Internal/Codebase/VariableUseGraph.php"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c31b215527481122a55b91338f3aaada927449b2c763b3cab3380c6455366e"}},{"ruleId":"D1","level":"warning","message":{"text":"CustomTraverser.traverseNode (cyclomatic 17): CustomTraverser.traverseNode 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":"src/Psalm/Internal/PhpTraverser/CustomTraverser.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0033712f79fa21199f4836e60f896cb567d927c98d6731283cbbf48a86bfa29"}},{"ruleId":"D1","level":"warning","message":{"text":"ParamReplacementVisitor.enterNode (cyclomatic 17): ParamReplacementVisitor.enterNode 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":"src/Psalm/Internal/PhpVisitor/ParamReplacementVisitor.php"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c2fcede28a2a1327cfd6a2b454c29e9ac2eba2ae77f91cb4b4a1982a1ddfe7"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeNodeScanner.nodesUseProperty (cyclomatic 17): ClassLikeNodeScanner.nodesUseProperty 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f298c312637b6ef328b56bf73b3b152be92dd2c70e15707bbf0ac0ed9069e64b"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonEncodeTainter.removeTaints (cyclomatic 17): JsonEncodeTainter.removeTaints 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":"src/Psalm/Internal/Provider/AddRemoveTaints/JsonEncodeTainter.php"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c3c895c50f51fec377233ca65d0c23b928d185f117f749916c50473d090c4d"}},{"ruleId":"D1","level":"warning","message":{"text":"PregReplaceCallbackParamsProvider.getFunctionParams (cyclomatic 17): PregReplaceCallbackParamsProvider.getFunctionParams 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":"src/Psalm/Internal/Provider/ParamsProvider/PregReplaceCallbackParamsProvider.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"112cd0fcdc7cbf0d859a3b8a144a32fee3aec66e9a577a9ad4589948c781d780"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayColumnReturnTypeProvider.castToArrayKey (cyclomatic 17): ArrayColumnReturnTypeProvider.castToArrayKey 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b0507c9c2af3e0a08cdb3c575ade97694927bf91c31c5f178c4bb0158e0144"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayIntersectKeyReturnTypeProvider.getFunctionReturnType (cyclomatic 17): ArrayIntersectKeyReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayIntersectKeyReturnTypeProvider.php"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"96df54223541da6cfd6bf527b6e4d0e8b7201cdb2dbd2a7256a21ac9c41676f2"}},{"ruleId":"D1","level":"warning","message":{"text":"DirnameReturnTypeProvider.getFunctionReturnType (cyclomatic 17): DirnameReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/DirnameReturnTypeProvider.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0e093f6aa7d4f21c4d1be8a40ed192197ca1acdd3b651c03dd6d0365706249"}},{"ruleId":"D1","level":"warning","message":{"text":"FilterUtils.checkRedundantFlags (cyclomatic 17): FilterUtils.checkRedundantFlags 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d789d45e8e9c268fe535b18b594c548c4904bed6cc656d6f3255b1ea7de6c988"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionReconciler.inferTemplateParamsFromParent (cyclomatic 17): AssertionReconciler.inferTemplateParamsFromParent 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07e6d544cef70574126f45984219fcf6e7e113fc8f96d305ccafe6fab85a6c8"}},{"ruleId":"D1","level":"warning","message":{"text":"CallableTypeComparator.getCallableFromMethodId (cyclomatic 17): CallableTypeComparator.getCallableFromMethodId 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":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25782fb41d3709b309b2bd2ac8bc89a29d563e69e731817564794f0125986ca"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreeCreator.handleEllipsisOrEquals (cyclomatic 17): ParseTreeCreator.handleEllipsisOrEquals 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":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"0053f3651b3703e8e86bab0994143ea6cf63996e44edc893e58ce9ada55c2950"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleAssertionReconciler.getListOfSealedShape (cyclomatic 17): SimpleAssertionReconciler.getListOfSealedShape 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2527}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd68825a05a2c7d3e2c7f324de5abcf797f7b4a1e9d132d806eef0da5f26c694"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileBool (cyclomatic 17): SimpleNegatedAssertionReconciler.reconcileBool 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"462f01af439e2ee1a0fad971fc38475078b05098801345c432fb1fa19c8658cd"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileFloat (cyclomatic 17): SimpleNegatedAssertionReconciler.reconcileFloat 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa091c78292776037ff4c38e996961ac8c2a565de1d284c997dc41ab6b26ef40"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCombination.fallbackKeyAlwaysContains (cyclomatic 17): TypeCombination.fallbackKeyAlwaysContains 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":"src/Psalm/Internal/Type/TypeCombination.php"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db9c61997b66824442e54e36b47406f8993b820b60b1359f1681b2f9624c386"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeExpander.expandKeyOfValueOf (cyclomatic 17): TypeExpander.expandKeyOfValueOf 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":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"42592f7e501de6549b9ec652e92ecbeef0d30c107b45be42eca421ba6c2ed519"}},{"ruleId":"D1","level":"warning","message":{"text":"UnionTrait.toPhpString (cyclomatic 17): UnionTrait.toPhpString 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":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"8731a418a75e7c577c7b8b9cc6cd9219b543d0a24fc59b3ce4fd74ca7867fb1b"}},{"ruleId":"D1","level":"warning","message":{"text":"Transpiler.emitLambda (cyclomatic 16): Transpiler.emitLambda 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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dbef206367fa22a42ca7a48f97cd9bfabd681ac6830670b38ae6176fc31f1b"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.resolveCompressor (cyclomatic 16): Config.resolveCompressor has cyclomatic complexity 16 (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":"src/Psalm/Config.php"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c18fab05dc6fa0f6cf2b3b4f93548d24c5a6b6874556ffec2e6119c0f58d3d"}},{"ruleId":"D1","level":"warning","message":{"text":"FileFilter.allows (cyclomatic 16): FileFilter.allows 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":"src/Psalm/Config/FileFilter.php"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"805db9b4e05d1d1e33d872d3d8b78d3c13b0abe8990e1d9034c356ec67b3a39e"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.update (cyclomatic 16): Context.update 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":"src/Psalm/Context.php"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5f25dd0a98e0994e3666bac17acb897ec04fca33631f6369b8b00e2ad618ef"}},{"ruleId":"D1","level":"warning","message":{"text":"NamespaceAnalyzer.collectAnalyzableInformation (cyclomatic 16): NamespaceAnalyzer.collectAnalyzableInformation 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":"src/Psalm/Internal/Analyzer/NamespaceAnalyzer.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc7bcdfd87f28ee887f705b2dcf5d37d0d9e10ae566b4a53aa7a9fb4dedb6c3"}},{"ruleId":"D1","level":"warning","message":{"text":"PurityWildcardInference.markReceiverTemplates (cyclomatic 16): PurityWildcardInference.markReceiverTemplates 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":"src/Psalm/Internal/Analyzer/PurityWildcardInference.php"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bce7e4b50c2ee0963fa87752d447e5b1cd8548ac54e33cb496cc289996f4613"}},{"ruleId":"D1","level":"warning","message":{"text":"PurityWildcardInference.findParamPath (cyclomatic 16): PurityWildcardInference.findParamPath 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":"src/Psalm/Internal/Analyzer/PurityWildcardInference.php"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83ba09ae88768244cf7e5a2a73d7d3edc92028022d282ac09d01522d9a01673"}},{"ruleId":"D1","level":"warning","message":{"text":"ForeachAnalyzer.addItemsWrittenByRef (cyclomatic 16): ForeachAnalyzer.addItemsWrittenByRef 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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"5511a86a8aedb15c60080a3994371398ff07d3a150e917c24c2290bb2dc0c115"}},{"ruleId":"D1","level":"warning","message":{"text":"ForeachAnalyzer.mayPassByReference (cyclomatic 16): ForeachAnalyzer.mayPassByReference 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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c2a78433599f56e27f02dbb452cf5ce54c793a06d5f3bfd2493067be2a1621"}},{"ruleId":"D1","level":"warning","message":{"text":"ForeachAnalyzer.taintItemsWrittenByRef (cyclomatic 16): ForeachAnalyzer.taintItemsWrittenByRef 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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dc46939647e8488eed0c54d9e2956db1b17b0f4ac62682ca92d0028f335f64"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionFinder.getTypedValueInequalityAssertions (cyclomatic 16): AssertionFinder.getTypedValueInequalityAssertions 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5b701bb2588f68ff760b1c05416e99808ccd0a55ddc2ec862a378e620ea7d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyzeModBetweenIntRange (cyclomatic 16): ArithmeticOpAnalyzer.analyzeModBetweenIntRange 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8321866e0c632f9cd01380ea7cd6cff9fd719e5a995a10e999cbb8a0100f3a2"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.taintArrayColumn (cyclomatic 16): FunctionCallReturnTypeFetcher.taintArrayColumn 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4d6296ed1d32bc933f17d953cee69c436376a1d03d05c6a3bbb99090e1f95c"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodCallPurityAnalyzer.resetWrittenProperties (cyclomatic 16): MethodCallPurityAnalyzer.resetWrittenProperties 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0227992cd6d8539852691422f30bdf8000d9f9031747a77ad8446dfa7d556e"}},{"ruleId":"D1","level":"warning","message":{"text":"ExistingAtomicStaticCallAnalyzer.getStaticClassType (cyclomatic 16): ExistingAtomicStaticCallAnalyzer.getStaticClassType 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba3088fd69cd103117f36481bd5997304eb2a05a318f2fc861d779897d6311c"}},{"ruleId":"D1","level":"warning","message":{"text":"CallAnalyzer.resolveStaticPropertyAssertionClasses (cyclomatic 16): CallAnalyzer.resolveStaticPropertyAssertionClasses 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4759cf1dcd9131864373c0fe7722fbd2f14a4e73c53dc4f4cd3276c4f49716f"}},{"ruleId":"D1","level":"warning","message":{"text":"VariableFetchAnalyzer.addDataFlowToVariable (cyclomatic 16): VariableFetchAnalyzer.addDataFlowToVariable 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc9b9e4d1e3943e3ef2d84b1265a85136ac00e991ba91231bff061413d895cd"}},{"ruleId":"D1","level":"warning","message":{"text":"InstanceofAnalyzer.analyze (cyclomatic 16): InstanceofAnalyzer.analyze 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":"src/Psalm/Internal/Analyzer/Statements/Expression/InstanceofAnalyzer.php"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"939e5ce39b6b996e6bff787f3ebe1361cda219b452247cd2e038f7a43152c5a3"}},{"ruleId":"D1","level":"warning","message":{"text":"IntMaskComparisonAnalyzer.analyzeBinaryOp (cyclomatic 16): IntMaskComparisonAnalyzer.analyzeBinaryOp has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/IntMaskComparisonAnalyzer.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac1aab48c0d28f76adffa7c1c550eb60966d9003428b5be796448858191e06a"}},{"ruleId":"D1","level":"warning","message":{"text":"ReturnAnalyzer.getTemplateParamEqualToLiteral (cyclomatic 16): ReturnAnalyzer.getTemplateParamEqualToLiteral 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":"src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc0810ead5da42c3d906b4e68c14707b7789d025262a558baa5b2b1766ca4d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikes.getFinalInsertionPosition (cyclomatic 16): ClassLikes.getFinalInsertionPosition 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbf938a982694d7d514ae021f43bda3e68e6cbd02ae3c44676e42ee0e79a2e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Functions.getStorage (cyclomatic 16): Functions.getStorage 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":"src/Psalm/Internal/Codebase/Functions.php"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b78770a70173f1003e9dd00287b57b06c155a482860d9cb166bfb92ac39298"}},{"ruleId":"D1","level":"warning","message":{"text":"NosqlEqualityOperand.markArgument (cyclomatic 16): NosqlEqualityOperand.markArgument has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/NosqlEqualityOperand.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e5b31355028e9318e1f215bd00127f00f44da62bd297847e4492fed36f5c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"ReceiverPropertyTaints.taintWrites (cyclomatic 16): ReceiverPropertyTaints.taintWrites 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":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa0ede305b2d4ecd411bf5bb511430e49253d44ad553e3abe631e4449d39419"}},{"ruleId":"D1","level":"warning","message":{"text":"TaintStore.addFlow (cyclomatic 16): TaintStore.addFlow 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":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e7437e7e27d85de26d77e409448b6c941bc71532317f82cdd5aad4d8dfc6fc"}},{"ruleId":"D1","level":"warning","message":{"text":"PsalmRestarter.requiresRestart (cyclomatic 16): PsalmRestarter.requiresRestart 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":"src/Psalm/Internal/Fork/PsalmRestarter.php"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d1a2ac375d1c6793464c51aac7d024cf14ff7336ee0afc675f66ea7faf444a"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeNodeScanner.getTypeAliasesFromCommentLines (cyclomatic 16): ClassLikeNodeScanner.getTypeAliasesFromCommentLines 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f41b094dc3b1984ebc8bf4980056bc3ad830e44b78a9f92a325aaf6a31a2cde"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionLikeNodeScanner.addParams (cyclomatic 16): FunctionLikeNodeScanner.addParams 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf80e3f594898dd100a2f0e7d0726cb9a0116fd44f9d0a607e72afd722d0e58"}},{"ruleId":"D1","level":"warning","message":{"text":"FileReferenceProvider.loadReferenceCache (cyclomatic 16): FileReferenceProvider.loadReferenceCache 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":"src/Psalm/Internal/Provider/FileReferenceProvider.php"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5606ce04bfb1cc3d4e383f0b0dfccf699af31fedf1953790887c6cba0b83d9d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ClosureReturnTypeProvider.getMethodReturnType (cyclomatic 16): ClosureReturnTypeProvider.getMethodReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ClosureReturnTypeProvider.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd667878c9a6935149e1c8332dbb827049cfe87ac8611872334f51ecd769610d"}},{"ruleId":"D1","level":"warning","message":{"text":"FilterVarReturnTypeProvider.getFunctionReturnType (cyclomatic 16): FilterVarReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterVarReturnTypeProvider.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13b63f15fe9608b6b6d83fe04e126357e730b552a011bbef8aae9836b88910b"}},{"ruleId":"D1","level":"warning","message":{"text":"PdoStatementReturnTypeProvider.handleFetch (cyclomatic 16): PdoStatementReturnTypeProvider.handleFetch has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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. This is NOT this file\u0027s highest cyclomatic complexity: PdoStatementReturnTypeProvider.handleFetchAll (cyclomatic 17) 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/PdoStatementReturnTypeProvider.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28dcc22ac8a2b27aebb16c9c7f1c1b4e4ba05cf9737cf38fe23106b1c804070"}},{"ruleId":"D1","level":"warning","message":{"text":"RoundReturnTypeProvider.getFunctionReturnType (cyclomatic 16): RoundReturnTypeProvider.getFunctionReturnType 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/RoundReturnTypeProvider.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a1037ceceab45a05410a1b346a4fe1f83809951356038f92eacfdf382eea6f"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicParts.split (cyclomatic 16): AtomicParts.split 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":"src/Psalm/Internal/Type/AtomicParts.php"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfaeebe42a9b3afc8b35de05abc5103f1902a2258af945800feeed9c3257530"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyedArrayComparator.coerceToObjectWithProperties (cyclomatic 16): KeyedArrayComparator.coerceToObjectWithProperties has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"26012f7acc77ecb013ab6ec43f407143eebfe33a31c7f4a533abe5200e93c9a1"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreeCreator.handleAmpersand (cyclomatic 16): ParseTreeCreator.handleAmpersand 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":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c99ae3832ab6c76574738033d0d89c1cc388f6c38caa3276989b50e5a1a846"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileObject (cyclomatic 16): SimpleNegatedAssertionReconciler.reconcileObject 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2073064d11dd88ace5fcda6c38d153fcf2da33978598f3bbb7b682056f18fe0a"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeParser.intersectObjectTypes (cyclomatic 16): TypeParser.intersectObjectTypes 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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"069ed04eaf2ecb4f9b26c65b2973e1694f0109d4f7d9d6e2f2c780d84c1f0d1c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeParser.intersectStringTypes (cyclomatic 16): TypeParser.intersectStringTypes 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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d411f16cb67a1a9797b2323d80ce3aedd069a180851601ffe11daf10d7e513f"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeParser.unescapeStringLiteral (cyclomatic 16): TypeParser.unescapeStringLiteral 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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":2834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75c49ba17f9b9ab1b89d40db520557db2a95a8e03a09cba241e7777b5fc7ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker.checkNamedObject (cyclomatic 16): TypeChecker.checkNamedObject 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":"src/Psalm/Internal/TypeVisitor/TypeChecker.php"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95f047c8f78bbd7baac0c0ecf3702eae7463df0611f0f3fb1bf4b14bf183a8d"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeLocalizer.enterNode (cyclomatic 16): TypeLocalizer.enterNode 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":"src/Psalm/Internal/TypeVisitor/TypeLocalizer.php"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b9f893468cce5ad6d192b751a6a9de5e810e89621ccd6ba20df85448d8bf3d"}},{"ruleId":"D1","level":"warning","message":{"text":"CallableTrait.replaceCallableTemplateTypesWithStandins (cyclomatic 16): CallableTrait.replaceCallableTemplateTypesWithStandins 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":"src/Psalm/Type/Atomic/CallableTrait.php"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedde133a50529c3337318052ccae1a042e17158215fef93ba0f0c6800f972ba"}},{"ruleId":"D1","level":"warning","message":{"text":"TKeyedArray.toNamespacedString (cyclomatic 16): TKeyedArray.toNamespacedString 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":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc0a93b7b9c5b63b3429c24d15754eed92bebf27aa3f417fd4d58083150c527"}},{"ruleId":"D1","level":"warning","message":{"text":"TValueOf.getValueType (cyclomatic 16): TValueOf.getValueType 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":"src/Psalm/Type/Atomic/TValueOf.php"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bb7ed83997f6f15948babfd2707550d27d52e2e800093f98aa8ba175600f64"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterUtils.getReturnType (cognitive 520): FilterUtils.getReturnType has cognitive complexity 520 (threshold 15). Drivers by points: if/else 114 (353 pts), boolean chains 119, loops 12 (26 pts), ternaries 6 (21 pts), match/switch 1 (nesting depth added 268). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0e5b8b64dd90ff9b5240d7b8f3c24bad824f59600d5613818291cf1cd9b365"}},{"ruleId":"D2","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyzeOperands (cognitive 398): ArithmeticOpAnalyzer.analyzeOperands has cognitive complexity 398 (threshold 15). Drivers by points: if/else 102 (233 pts), boolean chains 125, ternaries 5 (27 pts), loops 4 (13 pts) (nesting depth added 162). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bb09143b3fce58ba8148d19767deed37a35c09f2497596bfc09878ed10a533"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicTypeComparator.isContainedBy (cognitive 391): AtomicTypeComparator.isContainedBy has cognitive complexity 391 (threshold 15). Drivers by points: if/else 112 (246 pts), boolean chains 119, loops 11 (26 pts) (nesting depth added 149). 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":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc153081ec0a979774f5260663f66836f4f66ab19395083c9beec1a6c38311f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeNodeScanner.start (cognitive 381): ClassLikeNodeScanner.start has cognitive complexity 381 (threshold 15). Drivers by points: if/else 78 (194 pts), error handling 15 (57 pts), loops 22 (49 pts), boolean chains 47, ternaries 10 (34 pts) (nesting depth added 209). 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfe5236ae77a3aeb745509f59ac66161ffc48c058517707cba78252de5bce68"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeAnalyzer.analyze (cognitive 351): FunctionLikeAnalyzer.analyze has cognitive complexity 351 (threshold 15). Drivers by points: if/else 88 (163 pts), boolean chains 104, loops 23 (42 pts), ternaries 18 (42 pts) (nesting depth added 118). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2fbfbdd934c7d272a20bb52d3617ee7c1d9eb4328873351848511cf0919fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentsAnalyzer.checkArgumentsMatch (cognitive 336): ArgumentsAnalyzer.checkArgumentsMatch has cognitive complexity 336 (threshold 15). Drivers by points: if/else 58 (183 pts), ternaries 15 (77 pts), boolean chains 40, loops 15 (36 pts) (nesting depth added 208). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"5158f92c56174bcbcc76b0afcaf5320b69bef3e099c100b865202eb260502c85"}},{"ruleId":"D2","level":"warning","message":{"text":"ReturnAnalyzer.analyzeReturn (cognitive 329): ReturnAnalyzer.analyzeReturn has cognitive complexity 329 (threshold 15). Drivers by points: if/else 58 (224 pts), loops 8 (46 pts), boolean chains 43, ternaries 3 (14 pts), error handling 1 (2 pts) (nesting depth added 216). 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":"src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5af2ba4aab5821f1cd4d50804d09380abed8b63d72cb809816bd6022823124"}},{"ruleId":"D2","level":"warning","message":{"text":"ReturnTypeAnalyzer.verifyReturnType (cognitive 310): ReturnTypeAnalyzer.verifyReturnType has cognitive complexity 310 (threshold 15). Drivers by points: if/else 74 (171 pts), boolean chains 126, ternaries 6 (11 pts), loops 1 (2 pts) (nesting depth added 103). 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":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa292d67192cfd63d40604c03453dbb9b6a865284c68f377dae09bfeaac124b"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionTypeComparator.isContainedBy (cognitive 302): UnionTypeComparator.isContainedBy has cognitive complexity 302 (threshold 15). Drivers by points: if/else 72 (209 pts), boolean chains 61, loops 7 (21 pts), ternaries 3 (11 pts) (nesting depth added 159). 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":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06cb679b158e9c5fa6e89e621ac915c26e2211158ae34988fe41128da05e21e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCombiner.scrapeTypeProperties (cognitive 302): TypeCombiner.scrapeTypeProperties has cognitive complexity 302 (threshold 15). Drivers by points: if/else 112 (220 pts), boolean chains 51, loops 10 (23 pts), ternaries 4 (8 pts) (nesting depth added 125). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fb8d84921be50eec7d814a0e6cf43803e8221219e529cc64d8d791abe60c9f"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeNodeScanner.start (cognitive 296): FunctionLikeNodeScanner.start has cognitive complexity 296 (threshold 15). Drivers by points: if/else 62 (163 pts), boolean chains 82, loops 8 (24 pts), error handling 5 (17 pts), ternaries 3 (10 pts) (nesting depth added 136). 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"551a9c5e3edd96aad69b8d9a0efc4e2e36ccb2a9949f9427022760c88535b727"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.reconcileKeyedTypes (cognitive 290): Reconciler.reconcileKeyedTypes has cognitive complexity 290 (threshold 15). Drivers by points: if/else 45 (140 pts), boolean chains 73, loops 16 (57 pts), ternaries 5 (20 pts) (nesting depth added 151). 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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5606c7427fdf579d4d002729592d189b7fa9b432037a6844b84cb5749eb48f"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.fromXmlAndPaths (cognitive 260): Config.fromXmlAndPaths has cognitive complexity 260 (threshold 15). Drivers by points: if/else 87 (156 pts), loops 25 (59 pts), boolean chains 29, ternaries 4 (16 pts) (nesting depth added 115). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Config.php"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"418bd08058c5577147a0ba1fd70dad668f96b906f1e2abc828325792acc9d923"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarTypeComparator.isContainedBy (cognitive 260): ScalarTypeComparator.isContainedBy has cognitive complexity 260 (threshold 15). Drivers by points: if/else 99 (152 pts), boolean chains 100, ternaries 3 (8 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/ScalarTypeComparator.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c725e312656c04c00a02fee493bed2db6df618f2fa4c0e66d572f6f12435c2ea"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopAnalyzer.analyze (cognitive 256): LoopAnalyzer.analyze has cognitive complexity 256 (threshold 15). Drivers by points: if/else 54 (144 pts), loops 24 (63 pts), boolean chains 32, ternaries 6 (15 pts), error handling 1 (2 pts) (nesting depth added 139). 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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"11545a2e7e831a80a56409094b46810b2bb9004cc7ba0907c500b25e09df6b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentAnalyzer.verifyType (cognitive 246): ArgumentAnalyzer.verifyType has cognitive complexity 246 (threshold 15). Drivers by points: if/else 61 (135 pts), boolean chains 68, ternaries 10 (24 pts), loops 8 (19 pts) (nesting depth added 99). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f6d288d73b28292bc5b4d202c978840085ca01e309fca258d3010f0bc7b3eb"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassConstAnalyzer.analyzeFetch (cognitive 240): ClassConstAnalyzer.analyzeFetch has cognitive complexity 240 (threshold 15). Drivers by points: if/else 69 (162 pts), boolean chains 54, loops 4 (10 pts), error handling 4 (8 pts), ternaries 2 (6 pts) (nesting depth added 107). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c90e325d4b31b53d6226fa184216f6a16e4ad0923153445843d8a3deca50c1"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCombiner.scrapeStringProperties (cognitive 239): TypeCombiner.scrapeStringProperties has cognitive complexity 239 (threshold 15). Drivers by points: if/else 44 (127 pts), boolean chains 55, loops 8 (37 pts), ternaries 5 (20 pts) (nesting depth added 127). 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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b17db6ca202e5ec2203fb653205ac711b9042c580798dbbec8a811301aed235"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeDocblockParser.parse (cognitive 233): ClassLikeDocblockParser.parse has cognitive complexity 233 (threshold 15). Drivers by points: if/else 61 (145 pts), loops 16 (34 pts), ternaries 5 (20 pts), error handling 5 (19 pts), boolean chains 15 (nesting depth added 131). 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a60ff6b5cc97f6d24bdb1e1d2995f4441f1cabaa602ca03fbbe6a07b7fe75a0"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.getTypeFromGenericTree (cognitive 225): TypeParser.getTypeFromGenericTree has cognitive complexity 225 (threshold 15). Drivers by points: if/else 70 (141 pts), boolean chains 54, ternaries 6 (18 pts), loops 7 (12 pts) (nesting depth added 88). 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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ffd6d94ee82a1ba8e44b0e61762e27299ba8ac2580166344464daa740ee086"}},{"ruleId":"D2","level":"warning","message":{"text":"TryAnalyzer.analyze (cognitive 223): TryAnalyzer.analyze has cognitive complexity 223 (threshold 15). Drivers by points: if/else 49 (124 pts), loops 28 (60 pts), boolean chains 28, ternaries 3 (11 pts) (nesting depth added 115). 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":"src/Psalm/Internal/Analyzer/Statements/Block/TryAnalyzer.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"28607487b5734ea47215d3f3d42356bb57ef0139aa20af74994566a0376e4aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.analyzeAtomicAssignment (cognitive 211): InstancePropertyAssignmentAnalyzer.analyzeAtomicAssignment has cognitive complexity 211 (threshold 15). Drivers by points: if/else 60 (119 pts), boolean chains 62, ternaries 7 (17 pts), loops 4 (13 pts) (nesting depth added 78). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9513e42efb991f8b9ef2abc26507e75c5a70a7e26101be64e86a395e7d741c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.getValueForKey (cognitive 209): Reconciler.getValueForKey has cognitive complexity 209 (threshold 15). Drivers by points: if/else 43 (165 pts), boolean chains 28, loops 3 (9 pts), ternaries 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 132). 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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16806bb36bc32307d16ee0df4f9f865575be9dd16386c844d3b3259ce8b4f52"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleTypeInferer.infer (cognitive 206): SimpleTypeInferer.infer has cognitive complexity 206 (threshold 15). Drivers by points: if/else 67 (132 pts), boolean chains 53, ternaries 4 (11 pts), loops 2 (6 pts), error handling 1 (4 pts) (nesting depth added 79). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e284ddaf767a499a52a283ea2b93f88e47ca390a3997529ba3d6e65f64e30ddc"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeAnalyzer.getControlActions (cognitive 196): ScopeAnalyzer.getControlActions has cognitive complexity 196 (threshold 15). Drivers by points: if/else 37 (120 pts), boolean chains 38, ternaries 5 (20 pts), loops 5 (15 pts), match/switch 1 (3 pts) (nesting depth added 110). 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":"src/Psalm/Internal/Analyzer/ScopeAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd238dcf5cf9b8ca9531b5d4e8177888726d83769e28f738705d875a5fd1341"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.checkMethodReferences (cognitive 196): ClassLikes.checkMethodReferences has cognitive complexity 196 (threshold 15). Drivers by points: if/else 33 (112 pts), boolean chains 32, ternaries 6 (30 pts), loops 4 (14 pts), error handling 2 (8 pts) (nesting depth added 119). 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65fb3842da6f529f1fc845844e9e40b832e1ae9846299673d3aa8e730fced6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Algebra.simplifyCNF (cognitive 195): Algebra.simplifyCNF has cognitive complexity 195 (threshold 15). Drivers by points: if/else 35 (136 pts), loops 14 (42 pts), boolean chains 17 (nesting depth added 129). 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":"src/Psalm/Internal/Algebra.php"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"54381bf7977386e6a894a393d3e4081854da9fb16eb382b37df07328c0e69256"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassAnalyzer.addContextProperties (cognitive 194): ClassAnalyzer.addContextProperties has cognitive complexity 194 (threshold 15). Drivers by points: if/else 30 (100 pts), boolean chains 42, loops 8 (27 pts), ternaries 5 (20 pts), error handling 1 (5 pts) (nesting depth added 108). 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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"081605de40d70803c43b35dce6176033e8aa3e4c21181ee591c17ace5494480b"}},{"ruleId":"D2","level":"warning","message":{"text":"FileFilter.loadFromArray (cognitive 193): FileFilter.loadFromArray has cognitive complexity 193 (threshold 15). Drivers by points: if/else 43 (146 pts), loops 11 (28 pts), boolean chains 19 (nesting depth added 120). 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":"src/Psalm/Config/FileFilter.php"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df0306902c4e16a180a1acdc26d630991524d47350a9e591cbcc202f82c079d"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaGenerator.getFormula (cognitive 188): FormulaGenerator.getFormula has cognitive complexity 188 (threshold 15). Drivers by points: if/else 41 (83 pts), boolean chains 52, loops 11 (37 pts), ternaries 5 (16 pts) (nesting depth added 79). 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":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc96045950836485a162b0c8b4845e702803629bf378546d2c9b4ba526a8dab"}},{"ruleId":"D2","level":"warning","message":{"text":"Methods.getMethodReturnType (cognitive 188): Methods.getMethodReturnType has cognitive complexity 188 (threshold 15). Drivers by points: if/else 48 (130 pts), boolean chains 37, loops 5 (13 pts), error handling 1 (5 pts), ternaries 1 (3 pts) (nesting depth added 96). 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":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"794d043ebca02a9710dc7b5a3c8d4cae47bdae21de207bc54661f9cecdf747f9"}},{"ruleId":"D2","level":"warning","message":{"text":"PhpStormMetaScanner.handleOverride (cognitive 188): PhpStormMetaScanner.handleOverride has cognitive complexity 188 (threshold 15). Drivers by points: if/else 43 (137 pts), boolean chains 40, ternaries 3 (9 pts), loops 1 (2 pts) (nesting depth added 101). 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":"src/Psalm/Internal/Scanner/PhpStormMetaScanner.php"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"54afcee2d9f16eb9509eed2c7da13e40950c5f6426f860b431af6faf417b2d5d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayMergeReturnTypeProvider.getFunctionReturnType (cognitive 186): ArrayMergeReturnTypeProvider.getFunctionReturnType has cognitive complexity 186 (threshold 15). Drivers by points: if/else 39 (127 pts), loops 8 (27 pts), boolean chains 25, ternaries 3 (7 pts) (nesting depth added 111). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMergeReturnTypeProvider.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98b08bec22f0b9358a59a339b685f61e51310fdec4af7fb09f110dcba13c1a4"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialParserVisitor.enterNode (cognitive 185): PartialParserVisitor.enterNode has cognitive complexity 185 (threshold 15). Drivers by points: if/else 34 (128 pts), loops 7 (32 pts), boolean chains 13, ternaries 2 (12 pts) (nesting depth added 129). 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":"src/Psalm/Internal/PhpVisitor/PartialParserVisitor.php"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0ff3a606289a22600fd1861e7286169f2dbb6ec8fb66b4fd8554b7188c3143"}},{"ruleId":"D2","level":"warning","message":{"text":"VariableFetchAnalyzer.analyze (cognitive 182): VariableFetchAnalyzer.analyze has cognitive complexity 182 (threshold 15). Drivers by points: if/else 53 (132 pts), boolean chains 31, ternaries 5 (12 pts), loops 2 (7 pts) (nesting depth added 91). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc655fa97a6215b87b713110731a6d6c43664fbcc7d10e3177c98d72018dc908"}},{"ruleId":"D2","level":"warning","message":{"text":"ReflectorVisitor.enterNode (cognitive 182): ReflectorVisitor.enterNode has cognitive complexity 182 (threshold 15). Drivers by points: if/else 40 (99 pts), boolean chains 40, loops 12 (28 pts), error handling 3 (8 pts), ternaries 2 (7 pts) (nesting depth added 85). 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":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7642fa8901f8d095e29ff3b70da7c0c7a7f5cb2a19e9dd8dc6c294278d6e2cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStandinTypeReplacer.handleTemplateParamStandin (cognitive 180): TemplateStandinTypeReplacer.handleTemplateParamStandin has cognitive complexity 180 (threshold 15). Drivers by points: if/else 40 (115 pts), loops 12 (40 pts), boolean chains 25 (nesting depth added 103). 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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"272aaf2df84a37ec6517f843ee19d8309122cdcb7f37f8f0da87e19c4eda0575"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicStaticCallAnalyzer.handleNamedCall (cognitive 175): AtomicStaticCallAnalyzer.handleNamedCall has cognitive complexity 175 (threshold 15). Drivers by points: if/else 43 (100 pts), boolean chains 51, ternaries 9 (18 pts), loops 2 (6 pts) (nesting depth added 70). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"957365045edbcd6bbd768b292c16f82a432d53a8288de3a6d4cc748060b2c9e3"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedFunctionCallHandler.handle (cognitive 163): NamedFunctionCallHandler.handle has cognitive complexity 163 (threshold 15). Drivers by points: if/else 68 (123 pts), boolean chains 32, loops 3 (8 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cb8b4980ba6e28b6b8d3b0d01b24d1a36c4139fc8250592c383eb3963a2c55"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticCallAnalyzer.analyze (cognitive 162): StaticCallAnalyzer.analyze has cognitive complexity 162 (threshold 15). Drivers by points: if/else 34 (86 pts), boolean chains 31, loops 7 (25 pts), ternaries 6 (20 pts) (nesting depth added 84). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"997ae6ea499ee853029ec1b070e66838f7ef4920094aca755184ee6aa4d003eb"}},{"ruleId":"D2","level":"warning","message":{"text":"ExistingAtomicStaticCallAnalyzer.analyze (cognitive 160): ExistingAtomicStaticCallAnalyzer.analyze has cognitive complexity 160 (threshold 15). Drivers by points: if/else 38 (74 pts), boolean chains 51, loops 5 (20 pts), ternaries 9 (15 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3662fb9bebd05369a80a20698e45683effe02ed2d023082f883788098dde617"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeExpander.expandAtomic (cognitive 160): TypeExpander.expandAtomic has cognitive complexity 160 (threshold 15). Drivers by points: if/else 50 (101 pts), loops 11 (28 pts), boolean chains 16, ternaries 4 (12 pts), error handling 1 (3 pts) (nesting depth added 78). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc7b90699f1666c7bf1cb179d5f686406b3bc80d3cafb9c7a2b2b50eb94b80d"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeachAnalyzer.handleIterable (cognitive 159): ForeachAnalyzer.handleIterable has cognitive complexity 159 (threshold 15). Drivers by points: if/else 29 (117 pts), boolean chains 36, loops 2 (6 pts) (nesting depth added 92). 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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"6439184594e7c1404ec2ebec0e8b850d7edb3fe0b2dc47e9defb9813a2806cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.addNestedAssertions (cognitive 158): Reconciler.addNestedAssertions has cognitive complexity 158 (threshold 15). Drivers by points: if/else 31 (104 pts), boolean chains 24, ternaries 4 (16 pts), loops 6 (14 pts) (nesting depth added 93). 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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"660270f094593a53c3a72bce56a724a693dad2e9a5b480b7782904c87babd216"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAnalyzer.analyzeAfterTheKeys (cognitive 157): AssignmentAnalyzer.analyzeAfterTheKeys has cognitive complexity 157 (threshold 15). Drivers by points: if/else 49 (90 pts), boolean chains 44, ternaries 5 (14 pts), loops 4 (9 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f1bf3d668df7112a98f47b674bedf47ddf33904319426a73a3f961a8a7b2a5"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentAnalyzer.checkFunctionLikeTypeMatches (cognitive 156): ArgumentAnalyzer.checkFunctionLikeTypeMatches has cognitive complexity 156 (threshold 15). Drivers by points: if/else 43 (105 pts), boolean chains 26, ternaries 7 (16 pts), loops 3 (9 pts) (nesting depth added 77). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"708fa0160b2739069955a48e626a888c1d57b0363bab6d9ef42c7e091ceecfa2"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstantTypeResolver.resolve (cognitive 155): ConstantTypeResolver.resolve has cognitive complexity 155 (threshold 15). Drivers by points: if/else 48 (118 pts), boolean chains 24, ternaries 2 (7 pts), loops 2 (6 pts) (nesting depth added 79). 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":"src/Psalm/Internal/Codebase/ConstantTypeResolver.php"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6724d3952773098c22c565cec4120811356c327f7ad2c4ff18290140be7ead2"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassAnalyzer.analyzeClass (cognitive 151): ClassAnalyzer.analyzeClass has cognitive complexity 151 (threshold 15). Drivers by points: if/else 38 (96 pts), loops 13 (34 pts), boolean chains 11, ternaries 3 (6 pts), error handling 1 (4 pts) (nesting depth added 85). 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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa50bc9e13ce6a1df49040f524e5efe7a049213619ad85a1f27c636cea08df6"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentAnalyzer.verifyExplicitParam (cognitive 151): ArgumentAnalyzer.verifyExplicitParam has cognitive complexity 151 (threshold 15). Drivers by points: if/else 21 (113 pts), loops 5 (19 pts), boolean chains 12, match/switch 1 (7 pts) (nesting depth added 112). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7441babc8464c785100f0e5d9154788a1574d9509635a5b80cf9fe9a8cd222"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassAnalyzer.checkPropertyInitialization (cognitive 150): ClassAnalyzer.checkPropertyInitialization has cognitive complexity 150 (threshold 15). Drivers by points: if/else 38 (87 pts), boolean chains 27, ternaries 6 (20 pts), loops 6 (16 pts) (nesting depth added 73). 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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b9a5eb599bb942e5b264b9f7e238684bf50232bee47f5f2892810ff36f9020"}},{"ruleId":"D2","level":"warning","message":{"text":"IfElseAnalyzer.analyze (cognitive 146): IfElseAnalyzer.analyze has cognitive complexity 146 (threshold 15). Drivers by points: if/else 38 (74 pts), boolean chains 29, loops 16 (27 pts), ternaries 10 (14 pts), error handling 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c018ca0c322ae6e8805d964debd141d6782ef264a56dd9a333822c56cfd12ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"SwitchCaseAnalyzer.analyze (cognitive 145): SwitchCaseAnalyzer.analyze has cognitive complexity 145 (threshold 15). Drivers by points: if/else 49 (85 pts), boolean chains 28, ternaries 8 (19 pts), loops 4 (11 pts), error handling 1 (2 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchCaseAnalyzer.php"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af54b730f76fe0454bc5bc25dd6eba42581e73f57d0b49930364f8987d1da90"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleArrayAccessOnKeyedArray (cognitive 144): ArrayFetchAnalyzer.handleArrayAccessOnKeyedArray has cognitive complexity 144 (threshold 15). Drivers by points: if/else 29 (88 pts), ternaries 6 (22 pts), boolean chains 20, loops 3 (14 pts) (nesting depth added 86). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"b618645efe224c3ecb7515d6b3c0bfb6f5c8e3f0df77eb333f3d11d546e1432f"}},{"ruleId":"D2","level":"warning","message":{"text":"IssueBuffer.finish (cognitive 144): IssueBuffer.finish has cognitive complexity 144 (threshold 15). Drivers by points: if/else 32 (74 pts), loops 12 (30 pts), boolean chains 19, ternaries 5 (19 pts), error handling 1 (2 pts) (nesting depth added 75). 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":"src/Psalm/IssueBuffer.php"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"de41f8aa64504bab86484564479b5d690c5a5b35e26cef4c7d1c5f56808709bd"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAnalyzer.analyzeDestructuringAssignment (cognitive 143): AssignmentAnalyzer.analyzeDestructuringAssignment has cognitive complexity 143 (threshold 15). Drivers by points: if/else 33 (105 pts), boolean chains 20, ternaries 2 (8 pts), loops 3 (6 pts), error handling 1 (4 pts) (nesting depth added 84). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"8596db13f75476f4fd05b5f0b34bfb8b31ea0fad5958ed0e5f30a4ae7eed17cb"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeNodeScanner.visitPropertyDeclaration (cognitive 143): ClassLikeNodeScanner.visitPropertyDeclaration has cognitive complexity 143 (threshold 15). Drivers by points: if/else 34 (84 pts), boolean chains 32, ternaries 7 (14 pts), loops 4 (9 pts), error handling 2 (4 pts) (nesting depth added 64). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"472a3e1c4c1e1a1a7bf85b0aa96c346e47437f558410a86af359a5cf4d7ca0e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExistingAtomicMethodCallAnalyzer.analyze (cognitive 141): ExistingAtomicMethodCallAnalyzer.analyze has cognitive complexity 141 (threshold 15). Drivers by points: if/else 43 (73 pts), boolean chains 47, loops 4 (10 pts), ternaries 5 (10 pts), error handling 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2bdff1dbf59a9178265110360989e002f92f7b8554ff3a90f837cca22fe905"}},{"ruleId":"D2","level":"warning","message":{"text":"SprintfReturnTypeProvider.getFunctionReturnType (cognitive 139): SprintfReturnTypeProvider.getFunctionReturnType has cognitive complexity 139 (threshold 15). Drivers by points: if/else 33 (100 pts), boolean chains 18, error handling 2 (8 pts), loops 4 (7 pts), ternaries 2 (6 pts) (nesting depth added 80). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/SprintfReturnTypeProvider.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e0378b470be4d43a2d32fa4acf2d7a219894c2965fb40a565451d094930427"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.getArrayAccessTypeGivenOffset (cognitive 137): ArrayFetchAnalyzer.getArrayAccessTypeGivenOffset has cognitive complexity 137 (threshold 15). Drivers by points: if/else 50 (100 pts), boolean chains 30, loops 3 (7 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb05834864c8344d897d3405fb9a889f63151b2797633f7d8ef3dab3a98d0454"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentsAnalyzer.handlePossiblyMatchingByRefParam (cognitive 135): ArgumentsAnalyzer.handlePossiblyMatchingByRefParam has cognitive complexity 135 (threshold 15). Drivers by points: if/else 21 (59 pts), boolean chains 39, ternaries 10 (30 pts), loops 2 (7 pts) (nesting depth added 63). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"a158d15ee316c25091c7b200074e3e4d9fe07a0b8dc5d9d8f57ede0d998abc11"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicMethodCallAnalyzer.analyze (cognitive 135): AtomicMethodCallAnalyzer.analyze has cognitive complexity 135 (threshold 15). Drivers by points: if/else 39 (75 pts), boolean chains 35, ternaries 12 (19 pts), loops 2 (6 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ee12b237b2f91cac4d87b0aae718fa3654254752a25a918436a3f2bc2d1c85"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassStatementsDiffer.diff (cognitive 135): ClassStatementsDiffer.diff has cognitive complexity 135 (threshold 15). Drivers by points: if/else 35 (81 pts), loops 9 (34 pts), boolean chains 13, ternaries 2 (7 pts) (nesting depth added 76). 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":"src/Psalm/Internal/Diff/ClassStatementsDiffer.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a096422d5852d170d7687670a267a40f6ddfbb77f7c26ac93676585e2c7334"}},{"ruleId":"D2","level":"warning","message":{"text":"NegatedAssertionReconciler.reconcile (cognitive 135): NegatedAssertionReconciler.reconcile has cognitive complexity 135 (threshold 15). Drivers by points: if/else 28 (72 pts), boolean chains 50, ternaries 3 (7 pts), loops 2 (6 pts) (nesting depth added 52). 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":"src/Psalm/Internal/Type/NegatedAssertionReconciler.php"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce87d801fe6d187f5233c69fb97fb6a05d55b5ec619dd17d878a7637b37b81b0"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallAnalyzer.getAnalyzeNamedExpression (cognitive 134): FunctionCallAnalyzer.getAnalyzeNamedExpression has cognitive complexity 134 (threshold 15). Drivers by points: if/else 29 (88 pts), boolean chains 18, ternaries 4 (18 pts), loops 3 (10 pts) (nesting depth added 80). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30be11785535987e469161e52252232d938ce45c591e74cc1382215873f2127"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayColumnReturnTypeProvider.getFunctionReturnType (cognitive 133): ArrayColumnReturnTypeProvider.getFunctionReturnType has cognitive complexity 133 (threshold 15). Drivers by points: if/else 36 (96 pts), boolean chains 25, ternaries 4 (9 pts), loops 1 (3 pts) (nesting depth added 67). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1ec6fd9bb8fe4024e4190aa52de6fb227229da067523c19976770e37ae49df"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryOpAnalyzer.analyze (cognitive 132): BinaryOpAnalyzer.analyze has cognitive complexity 132 (threshold 15). Drivers by points: if/else 33 (77 pts), boolean chains 48, loops 1 (4 pts), ternaries 1 (3 pts) (nesting depth added 49). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7063bba895eb68586cabda88bb35c0339850292e0207519e42870f43766d917f"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentsAnalyzer.checkArgCount (cognitive 132): ArgumentsAnalyzer.checkArgCount has cognitive complexity 132 (threshold 15). Drivers by points: if/else 21 (79 pts), loops 6 (25 pts), boolean chains 17, ternaries 4 (11 pts) (nesting depth added 84). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":2532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fc00a101d6acd3bd1bc37f2fd0e82aef88b19cc2c70d9eaea0af462084b13a"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallAnalyzer.analyze (cognitive 132): MethodCallAnalyzer.analyze has cognitive complexity 132 (threshold 15). Drivers by points: if/else 47 (72 pts), boolean chains 51, ternaries 4 (5 pts), loops 3 (4 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/MethodCallAnalyzer.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b300ba06851043534e53f4103053f03d0f90c146ef40b239a776ffcec5c8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer.shiftFileOffsets (cognitive 132): Analyzer.shiftFileOffsets has cognitive complexity 132 (threshold 15). Drivers by points: if/else 20 (64 pts), loops 20 (60 pts), boolean chains 8 (nesting depth added 84). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed18c6db7dc2d6f42702554145a0acdc25f14f298366d419d3f0b7b626f7bca4"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.getReturnTypeFromCallMapWithArgs (cognitive 131): FunctionCallReturnTypeFetcher.getReturnTypeFromCallMapWithArgs has cognitive complexity 131 (threshold 15). Drivers by points: if/else 26 (103 pts), ternaries 4 (14 pts), boolean chains 9, match/switch 3 (5 pts) (nesting depth added 89). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a453cfc6db7dc0f77320b39150689dc73a85ce5f47150016ac24c4b330453da6"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayReduceReturnTypeProvider.getFunctionReturnType (cognitive 130): ArrayReduceReturnTypeProvider.getFunctionReturnType has cognitive complexity 130 (threshold 15). Drivers by points: if/else 27 (82 pts), ternaries 7 (29 pts), boolean chains 14, loops 2 (5 pts) (nesting depth added 80). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReduceReturnTypeProvider.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9e787c971e2dc70f15304ff89443ef6ff72dcf2601f3680e76b589c7ebe321"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeAnalyzer.processParams (cognitive 129): FunctionLikeAnalyzer.processParams has cognitive complexity 129 (threshold 15). Drivers by points: if/else 35 (91 pts), boolean chains 28, ternaries 2 (6 pts), error handling 1 (3 pts), loops 1 (nesting depth added 62). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"876431fa343e6dcdd974feb651324406e28a1f2acf3bc1cfdf9bb407788e1698"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcatAnalyzer.analyze (cognitive 129): ConcatAnalyzer.analyze has cognitive complexity 129 (threshold 15). Drivers by points: if/else 25 (76 pts), boolean chains 23, loops 4 (19 pts), ternaries 3 (11 pts) (nesting depth added 74). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c60b7bc9e7ba5313b943c565a597b87529ac98ed532bd087b3bba4c1ba58bf"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicPropertyFetchAnalyzer.analyze (cognitive 128): AtomicPropertyFetchAnalyzer.analyze has cognitive complexity 128 (threshold 15). Drivers by points: if/else 43 (73 pts), boolean chains 30, ternaries 7 (17 pts), loops 3 (8 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8bfa42c3c7f4b8555bcc7b62f72fff7c3aa72e5def7a90de6e2f06094eef90"}},{"ruleId":"D2","level":"warning","message":{"text":"InstancePropertyFetchAnalyzer.handleScopedProperty (cognitive 126): InstancePropertyFetchAnalyzer.handleScopedProperty has cognitive complexity 126 (threshold 15). Drivers by points: if/else 23 (77 pts), boolean chains 25, ternaries 3 (15 pts), loops 3 (9 pts) (nesting depth added 72). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed06981ed0e017192e43cc65e44d3f1946e9d6cae364892ac870ebf0dc2d1c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.updateArrayAssignmentChildType (cognitive 124): ArrayAssignmentAnalyzer.updateArrayAssignmentChildType has cognitive complexity 124 (threshold 15). Drivers by points: if/else 31 (76 pts), boolean chains 31, ternaries 4 (10 pts), loops 2 (7 pts) (nesting depth added 56). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd774fbd2845f89a93ed963919e468b3374d4ca774f8e2db2096a173bfd4593"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFilterReturnTypeProvider.getFunctionReturnType (cognitive 123): ArrayFilterReturnTypeProvider.getFunctionReturnType has cognitive complexity 123 (threshold 15). Drivers by points: if/else 30 (73 pts), boolean chains 24, ternaries 4 (17 pts), error handling 1 (5 pts), loops 1 (4 pts) (nesting depth added 63). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFilterReturnTypeProvider.php"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c19445ece8788b5e5966546d540b3e17d9d700b9ce0c86b5b3c2b2a42620f8"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeAnalyzer.getFunctionInformation (cognitive 122): FunctionLikeAnalyzer.getFunctionInformation has cognitive complexity 122 (threshold 15). Drivers by points: if/else 28 (74 pts), boolean chains 21, loops 5 (15 pts), ternaries 4 (12 pts) (nesting depth added 64). 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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db33449e003f8783087aac2328578fd02bdaeff7e73aeb6baa6c7bf5961a4ad"}},{"ruleId":"D2","level":"warning","message":{"text":"BreakAnalyzer.analyze (cognitive 121): BreakAnalyzer.analyze has cognitive complexity 121 (threshold 15). Drivers by points: if/else 23 (62 pts), loops 10 (29 pts), boolean chains 15, ternaries 5 (15 pts) (nesting depth added 68). 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":"src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd80605de8ce67d5bb881b87f33776dc63add486a64f276dbf48b709549483e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAnalyzer.analyzeArrayItem (cognitive 121): ArrayAnalyzer.analyzeArrayItem has cognitive complexity 121 (threshold 15). Drivers by points: if/else 39 (89 pts), boolean chains 12, ternaries 3 (12 pts), loops 2 (8 pts) (nesting depth added 65). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb99fbd0e4dde9a3aa966fd6df879a4bb6bad3265b6a506dcd9b8c53a344f96"}},{"ruleId":"D2","level":"warning","message":{"text":"CallAnalyzer.applyAssertionsToContext (cognitive 121): CallAnalyzer.applyAssertionsToContext has cognitive complexity 121 (threshold 15). Drivers by points: if/else 21 (74 pts), loops 7 (26 pts), boolean chains 12, ternaries 1 (5 pts), error handling 1 (4 pts) (nesting depth added 79). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b3696b5a4402b131e090f8701e34a152bc3d0574b2c594525d5852a592c44b"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementsAnalyzer.analyzeStatement (cognitive 121): StatementsAnalyzer.analyzeStatement has cognitive complexity 121 (threshold 15). Drivers by points: if/else 33 (68 pts), loops 9 (26 pts), boolean chains 18, error handling 2 (6 pts), ternaries 1 (3 pts) (nesting depth added 58). 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":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"006a97337334a9421ce936612cad641ec829fe5700fc81fa2b785abe9d47f033"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionScanner.registerClassMapFunctionCall (cognitive 119): ExpressionScanner.registerClassMapFunctionCall has cognitive complexity 119 (threshold 15). Drivers by points: if/else 29 (68 pts), boolean chains 24, loops 4 (12 pts), ternaries 4 (10 pts), error handling 1 (5 pts) (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"289ecdd6661bf10f95af4f3aba8d254e5086c9c90b6b5f4d31c75f874ba89daf"}},{"ruleId":"D2","level":"warning","message":{"text":"Codebase.getCompletionItemsForClassishThing (cognitive 118): Codebase.getCompletionItemsForClassishThing has cognitive complexity 118 (threshold 15). Drivers by points: if/else 16 (59 pts), loops 11 (40 pts), error handling 3 (11 pts), ternaries 1 (5 pts), boolean chains 3 (nesting depth added 84). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Codebase.php"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53266c9ccac99c3ac21a244ecfc806fc7e581543c34a768ecff80f98356a1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureAnalyzer.analyzeExpression (cognitive 118): ClosureAnalyzer.analyzeExpression has cognitive complexity 118 (threshold 15). Drivers by points: if/else 25 (62 pts), loops 11 (27 pts), ternaries 5 (16 pts), boolean chains 13 (nesting depth added 64). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/ClosureAnalyzer.php"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb48b3d46964b4619ce77da55f110b9bc8801e0282cc40b9d2f89d0be25590f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentsAnalyzer.handleClosureArg (cognitive 118): ArgumentsAnalyzer.handleClosureArg has cognitive complexity 118 (threshold 15). Drivers by points: if/else 20 (67 pts), loops 12 (26 pts), boolean chains 15, ternaries 5 (9 pts), error handling 1 (nesting depth added 65). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13d048c147f32ac8b8ddd2e77108fc3edeabff2bbc84b2875b6fd624a4fe68b"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.checkClosureType (cognitive 117): ArrayFunctionArgumentsAnalyzer.checkClosureType has cognitive complexity 117 (threshold 15). Drivers by points: if/else 20 (70 pts), loops 6 (24 pts), ternaries 2 (10 pts), error handling 1 (5 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 84). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd31a8588be1d6499c84417806a86dcb572e8021cea5b3819553109501b43286"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockParser.parse (cognitive 117): FunctionLikeDocblockParser.parse has cognitive complexity 117 (threshold 15). Drivers by points: if/else 33 (64 pts), loops 16 (33 pts), boolean chains 14, error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4846003fd1f0da1f97754c1e5b3f2bae54ceeaabbecfce233f9902d048090c29"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionResolver.getUnresolvedClassConstExpr (cognitive 115): ExpressionResolver.getUnresolvedClassConstExpr has cognitive complexity 115 (threshold 15). Drivers by points: if/else 49 (90 pts), boolean chains 23, loops 1 (2 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba83443255cc93a9130218d2990161e094b1b5dc363a841ef9e73838ccf17cb"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockScanner.addDocblockInfo (cognitive 115): FunctionLikeDocblockScanner.addDocblockInfo has cognitive complexity 115 (threshold 15). Drivers by points: if/else 37 (59 pts), boolean chains 24, loops 16 (23 pts), ternaries 5 (7 pts), error handling 1 (2 pts) (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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2723f47ff27319dd9ddbd042022d611ecf4797749d2a471a0f977df9b6ecf652"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallAnalyzer.analyze (cognitive 114): FunctionCallAnalyzer.analyze has cognitive complexity 114 (threshold 15). Drivers by points: if/else 47 (78 pts), boolean chains 26, loops 4 (6 pts), ternaries 2 (4 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d8d24b861d1f442eb75888db0bd4b84b59f7e9125fea616f116cf60913edbf"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeNodeScanner.createStorageForFunctionLike (cognitive 114): FunctionLikeNodeScanner.createStorageForFunctionLike has cognitive complexity 114 (threshold 15). Drivers by points: if/else 28 (77 pts), boolean chains 20, ternaries 3 (10 pts), error handling 1 (4 pts), loops 1 (3 pts) (nesting depth added 61). 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"887e61a337be696e0ad2f307bd3187c5826e7220af182e1a4c83e853276725d3"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getArrayKeyExistsAssertions (cognitive 113): AssertionFinder.getArrayKeyExistsAssertions has cognitive complexity 113 (threshold 15). Drivers by points: if/else 22 (58 pts), boolean chains 24, ternaries 5 (19 pts), loops 3 (12 pts) (nesting depth added 59). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4228}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd14914dc93c6a6b277746803c6b28f5d068a2602a3ce4b13e40507946125ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"NegatedAssertionReconciler.handleLiteralNegatedEquality (cognitive 113): NegatedAssertionReconciler.handleLiteralNegatedEquality has cognitive complexity 113 (threshold 15). Drivers by points: if/else 27 (83 pts), boolean chains 15, loops 4 (15 pts) (nesting depth added 67). 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":"src/Psalm/Internal/Type/NegatedAssertionReconciler.php"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa61f1eda4f02757c7b5ba1d35efef6652fd170c816e13b51501e6b390c3a08"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeachAnalyzer.analyze (cognitive 112): ForeachAnalyzer.analyze has cognitive complexity 112 (threshold 15). Drivers by points: if/else 37 (61 pts), boolean chains 41, loops 3 (4 pts), ternaries 3 (4 pts), error handling 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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1083255b4845cd5c49295dd7649e2ec05868b7e6a40f4307cd492b41169a1790"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayMultisortParamsProvider.getFunctionParams (cognitive 111): ArrayMultisortParamsProvider.getFunctionParams has cognitive complexity 111 (threshold 15). Drivers by points: if/else 31 (92 pts), boolean chains 9, ternaries 2 (6 pts), loops 2 (4 pts) (nesting depth added 67). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Provider/ParamsProvider/ArrayMultisortParamsProvider.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6775fe88f6c1f87f695c70b96aa32740f45ef2eac9968ba4135d09267459381"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.analyze (cognitive 110): ArrayFetchAnalyzer.analyze has cognitive complexity 110 (threshold 15). Drivers by points: if/else 33 (64 pts), boolean chains 40, loops 1 (4 pts), ternaries 1 (2 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e984ba7fd33cb88b78da22bad009baa873bd5800e97b8ce3d906e68a6e56e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyedArrayComparator.isContainedBy (cognitive 110): KeyedArrayComparator.isContainedBy has cognitive complexity 110 (threshold 15). Drivers by points: if/else 24 (67 pts), boolean chains 35, loops 3 (5 pts), ternaries 1 (3 pts) (nesting depth added 47). 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":"src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db3389af185c8bf41be489c0c9e3722136d9bca86182edd49f479a0e6276151"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassTemplateParamCollector.collect (cognitive 109): ClassTemplateParamCollector.collect has cognitive complexity 109 (threshold 15). Drivers by points: if/else 24 (67 pts), loops 8 (20 pts), boolean chains 15, ternaries 2 (7 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ClassTemplateParamCollector.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ddee1b5f583bce5169695e381a8b5ed8e0b7b18f23891cd0a411eda167d681"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentsAnalyzer.analyzeArguments (cognitive 107): ArgumentsAnalyzer.analyzeArguments has cognitive complexity 107 (threshold 15). Drivers by points: boolean chains 49, if/else 24 (48 pts), ternaries 4 (9 pts), loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7e5c59dd86f9b105283173b32fe30451fc27b339d479c3fa79883d22d0aaa4"}},{"ruleId":"D2","level":"warning","message":{"text":"CallAnalyzer.collectSpecialInformation (cognitive 107): CallAnalyzer.collectSpecialInformation has cognitive complexity 107 (threshold 15). Drivers by points: if/else 23 (76 pts), loops 5 (17 pts), boolean chains 11, ternaries 1 (3 pts) (nesting depth added 67). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda5ad35902a00c53a84ccf9aba2549757cd8dd767a56b2e33247deacca4bc9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Functions.getCallMapFunctionCapabilities (cognitive 107): Functions.getCallMapFunctionCapabilities has cognitive complexity 107 (threshold 15). Drivers by points: boolean chains 40, if/else 24 (37 pts), ternaries 7 (17 pts), loops 3 (8 pts), error handling 1 (5 pts) (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":"src/Psalm/Internal/Codebase/Functions.php"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2963517e88cea61a003f3047825152f994218244aedd258974302875774fd11"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCombiner.combine (cognitive 107): TypeCombiner.combine has cognitive complexity 107 (threshold 15). Drivers by points: if/else 37 (60 pts), boolean chains 33, loops 8 (14 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce30317c90fee82d7ef9538850d0888ca58cc560970ff082557d67f06949d953"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.handleByRefArrayAdjustment (cognitive 105): ArrayFunctionArgumentsAnalyzer.handleByRefArrayAdjustment has cognitive complexity 105 (threshold 15). Drivers by points: if/else 21 (72 pts), ternaries 2 (12 pts), boolean chains 11, loops 2 (10 pts) (nesting depth added 69). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f513f206feed6d34dc8cf428c94f420b85c5fc766b63bee8d935db5e5153127"}},{"ruleId":"D2","level":"warning","message":{"text":"NewAnalyzer.getNewType (cognitive 105): NewAnalyzer.getNewType has cognitive complexity 105 (threshold 15). Drivers by points: if/else 23 (79 pts), boolean chains 11, ternaries 2 (8 pts), loops 2 (7 pts) (nesting depth added 67). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0afef9e6c11f072dd5e3b745025084b0ca6a9b6a1fdbb414095771188fac87d"}},{"ruleId":"D2","level":"warning","message":{"text":"Populator.populateOverriddenMethods (cognitive 105): Populator.populateOverriddenMethods has cognitive complexity 105 (threshold 15). Drivers by points: if/else 21 (73 pts), boolean chains 14, loops 8 (14 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 60). 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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb89afb6966af820fd5acad9c9afc715c2c207f836223200986ad1ba5171bc3"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer.loadCachedResults (cognitive 104): Analyzer.loadCachedResults has cognitive complexity 104 (threshold 15). Drivers by points: if/else 15 (49 pts), loops 24 (44 pts), error handling 1 (7 pts), boolean chains 4 (nesting depth added 60). 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":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1650f075e720d7961498a0a2d301281dad56e3678618b4157f20f0932bd61c6"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionDocblockManipulator.getDocblock (cognitive 102): FunctionDocblockManipulator.getDocblock has cognitive complexity 102 (threshold 15). Drivers by points: if/else 29 (73 pts), loops 7 (14 pts), ternaries 4 (9 pts), boolean chains 6 (nesting depth added 56). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b6bd9a56ba47f71d323d593017ededa5d4da1490ea095356c0903263d8590d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeTokenizer.tokenize (cognitive 102): TypeTokenizer.tokenize has cognitive complexity 102 (threshold 15). Drivers by points: if/else 27 (61 pts), boolean chains 40, loops 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":"src/Psalm/Internal/Type/TypeTokenizer.php"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e055043a588c5040581785a3b2f72999f564575b8bf1048ab0d7ff12f5549309"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.refine (cognitive 101): AssertionReconciler.refine has cognitive complexity 101 (threshold 15). Drivers by points: if/else 28 (64 pts), boolean chains 25, loops 4 (8 pts), ternaries 2 (4 pts) (nesting depth added 42). 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8af796149325bc8ed0c00174a554b75ed7eb08fa8eadf6eb8c45a8570ea4be"}},{"ruleId":"D2","level":"warning","message":{"text":"Methods.getMethodParams (cognitive 100): Methods.getMethodParams has cognitive complexity 100 (threshold 15). Drivers by points: if/else 19 (54 pts), loops 7 (23 pts), boolean chains 13, ternaries 4 (10 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d3c33906217f9f271277436edf6f548316c6a6886534e2b3fc3a014997281a"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockParser.parseTaintTags (cognitive 100): FunctionLikeDocblockParser.parseTaintTags has cognitive complexity 100 (threshold 15). Drivers by points: if/else 31 (80 pts), loops 7 (14 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 59). 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab815e1dfc3591e30386a05e6d39aa4b919f08b15f86f22431088cc033728a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericTypeComparator.isContainedBy (cognitive 99): GenericTypeComparator.isContainedBy has cognitive complexity 99 (threshold 15). Drivers by points: if/else 26 (65 pts), boolean chains 28, loops 2 (6 pts) (nesting depth added 43). 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":"src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7647d2eaad1e0e0d298cb6098df587163e8ebd995996513e929a5906f6b00f16"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodComparator.compareMethodParams (cognitive 98): MethodComparator.compareMethodParams has cognitive complexity 98 (threshold 15). Drivers by points: if/else 18 (48 pts), boolean chains 29, ternaries 6 (21 pts) (nesting depth added 45). 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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e6b8e7f8153f33ec78870df93c41024cc4c12972de1e69c730ec8e08e89ef3"}},{"ruleId":"D2","level":"warning","message":{"text":"CallAnalyzer.checkTemplateResult (cognitive 98): CallAnalyzer.checkTemplateResult has cognitive complexity 98 (threshold 15). Drivers by points: if/else 17 (67 pts), loops 7 (26 pts), boolean chains 5 (nesting depth added 69). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a986a4328d9cc4ca9c5b6c2cd947ab81e8d9112c5e76c25080d91c390d4819"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableTypeComparator.getCallableMethodIdFromTKeyedArray (cognitive 97): CallableTypeComparator.getCallableMethodIdFromTKeyedArray has cognitive complexity 97 (threshold 15). Drivers by points: if/else 19 (58 pts), ternaries 3 (15 pts), boolean chains 14, loops 3 (10 pts) (nesting depth added 58). 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":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dcee0308152cfc5c49efd778802903068df66ce25bfcc8559423fe4a99358d"}},{"ruleId":"D2","level":"warning","message":{"text":"InstancePropertyFetchAnalyzer.analyze (cognitive 96): InstancePropertyFetchAnalyzer.analyze has cognitive complexity 96 (threshold 15). Drivers by points: if/else 32 (47 pts), boolean chains 35, ternaries 3 (10 pts), loops 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"462c28e85530a084fba8c5f59fd704d814cf62301cde6d51db9449c431bb21b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Populator.populateClassLikeStorage (cognitive 96): Populator.populateClassLikeStorage has cognitive complexity 96 (threshold 15). Drivers by points: if/else 24 (49 pts), loops 19 (34 pts), boolean chains 13 (nesting depth added 40). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d8d7131bec23bc1abc8153e2d78332e8e15a541775b82246249914e1a89a2d"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockScanner.improveParamsFromDocblock (cognitive 96): FunctionLikeDocblockScanner.improveParamsFromDocblock has cognitive complexity 96 (threshold 15). Drivers by points: if/else 23 (59 pts), boolean chains 19, loops 5 (12 pts), ternaries 3 (4 pts), error handling 1 (2 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"404c1befb7aceceae8fa49c786fabb82defe9901031183bb28d0b393fc70a4be"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateInferredTypeReplacer.replace (cognitive 96): TemplateInferredTypeReplacer.replace has cognitive complexity 96 (threshold 15). Drivers by points: if/else 19 (56 pts), loops 6 (19 pts), boolean chains 11, ternaries 3 (10 pts) (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b820ef8905eafabc9d70464538fea57e8f0a04065ebad07d5f0adfb29fcb6e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.consolidateAnalyzedData (cognitive 95): ClassLikes.consolidateAnalyzedData has cognitive complexity 95 (threshold 15). Drivers by points: if/else 15 (52 pts), loops 7 (21 pts), boolean chains 17, error handling 2 (3 pts), ternaries 2 (nesting depth added 52). 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f5e49940209d6414cb77e6f7dafbbc5bf61ec3f63542459e6441a3c2dee60b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassAnalyzer.checkImplementedInterfaces (cognitive 94): ClassAnalyzer.checkImplementedInterfaces has cognitive complexity 94 (threshold 15). Drivers by points: if/else 19 (62 pts), boolean chains 20, error handling 2 (4 pts), loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c672b4679630b229cb7e978c62935b67ecbdde05ffd3d87082daa755b2ce464"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.checkPropertyReferences (cognitive 94): ClassLikes.checkPropertyReferences has cognitive complexity 94 (threshold 15). Drivers by points: if/else 15 (50 pts), ternaries 4 (18 pts), boolean chains 17, loops 3 (9 pts) (nesting depth added 55). 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2847}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2d9b60901ae7447a17d4b3bef37763341dbeadb7f1686125bd3796fb6dd47b"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStandinTypeReplacer.handleAtomicStandin (cognitive 94): TemplateStandinTypeReplacer.handleAtomicStandin has cognitive complexity 94 (threshold 15). Drivers by points: if/else 29 (63 pts), boolean chains 16, loops 4 (15 pts) (nesting depth added 45). 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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd99f0d4542a2fa11fcdba35bda6233de0449412e7c0892e8e9e0e91c5ae85d"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.fetch (cognitive 93): FunctionCallReturnTypeFetcher.fetch has cognitive complexity 93 (threshold 15). Drivers by points: if/else 27 (65 pts), loops 4 (14 pts), boolean chains 11, error handling 1 (3 pts) (nesting depth added 50). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7129c23c55cf3d9e4033d0b6ab930944f630d7512edba77b26de4233e5302795"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAnalyzer.analyzeAssignmentRef (cognitive 92): AssignmentAnalyzer.analyzeAssignmentRef has cognitive complexity 92 (threshold 15). Drivers by points: if/else 27 (48 pts), boolean chains 27, ternaries 4 (7 pts), loops 3 (6 pts), error handling 2 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cd381bcb28971752d486cca96eb646b9a285f1656cb341365e5a7deafd5f9a"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.processCustomAssertion (cognitive 91): AssertionFinder.processCustomAssertion has cognitive complexity 91 (threshold 15). Drivers by points: if/else 25 (74 pts), boolean chains 12, loops 2 (4 pts), ternaries 1 (nesting depth added 51). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e32156011a2aeebfaead27570b723b512c3123b9126778eb32fef13927eaba5"}},{"ruleId":"D2","level":"warning","message":{"text":"YieldAnalyzer.analyze (cognitive 91): YieldAnalyzer.analyze has cognitive complexity 91 (threshold 15). Drivers by points: if/else 27 (62 pts), boolean chains 10, loops 4 (10 pts), ternaries 3 (7 pts), error handling 1 (2 pts) (nesting depth added 46). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"78138e27269f8321c2b967a627ca4e7e6266af45b541867a2a5bb6c0aa415b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"ElseIfAnalyzer.analyze (cognitive 90): ElseIfAnalyzer.analyze has cognitive complexity 90 (threshold 15). Drivers by points: if/else 26 (47 pts), loops 9 (18 pts), boolean chains 14, ternaries 4 (8 pts), error handling 3 (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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd4cd856982ce9b3c5d230bd0835a6c71d06939663b49b38dda5c73c18ad92f"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockScanner.handleAssertions (cognitive 90): FunctionLikeDocblockScanner.handleAssertions has cognitive complexity 90 (threshold 15). Drivers by points: if/else 18 (54 pts), ternaries 6 (18 pts), loops 6 (15 pts), boolean chains 3 (nesting depth added 57). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa9281b57efd519745774ad5333e74952235708aaed6401064b8039f75bda7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Algebra.getTruthsFromFormula (cognitive 89): Algebra.getTruthsFromFormula has cognitive complexity 89 (threshold 15). Drivers by points: if/else 22 (67 pts), loops 7 (14 pts), boolean chains 8 (nesting depth added 52). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Algebra.php"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecb2ffc91c83c4c69621d751dad75ae46e4f8867ca2124f9bb6d1abfa92f486"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeAnalyzer.checkTemplateParams (cognitive 89): ClassLikeAnalyzer.checkTemplateParams has cognitive complexity 89 (threshold 15). Drivers by points: if/else 15 (44 pts), loops 6 (20 pts), boolean chains 18, ternaries 3 (7 pts) (nesting depth added 47). 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":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ff7fefe06974d7905ca2feeeda4752fd53d442d1c1a3cc88171939d8057b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"CastAnalyzer.analyze (cognitive 89): CastAnalyzer.analyze has cognitive complexity 89 (threshold 15). Drivers by points: if/else 39 (75 pts), ternaries 2 (6 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"439c9234538dcfb86cec0945282ce50beab692e53ea092b925e63d6f6fdeda12"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticPropertyFetchAnalyzer.analyze (cognitive 89): StaticPropertyFetchAnalyzer.analyze has cognitive complexity 89 (threshold 15). Drivers by points: if/else 42 (64 pts), boolean chains 17, ternaries 4 (8 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"511cea39ff641fc05dd3573c19f2e99c6d0ad6667f7062cc479bc3135d8a2feb"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.handleSplice (cognitive 88): ArrayFunctionArgumentsAnalyzer.handleSplice has cognitive complexity 88 (threshold 15). Drivers by points: if/else 34 (60 pts), boolean chains 24, loops 1 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d205019b834ffe6b2228620f92766755a7fc677600dc92611c73ae09f48ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.analyze (cognitive 87): InstancePropertyAssignmentAnalyzer.analyze has cognitive complexity 87 (threshold 15). Drivers by points: if/else 30 (62 pts), boolean chains 17, loops 4 (6 pts), error handling 1 (2 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"44166b2e6dc0400618ed866902abe275c45a9a1633acd5e983086cf4f05143f9"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableTypeComparator.isContainedBy (cognitive 87): CallableTypeComparator.isContainedBy has cognitive complexity 87 (threshold 15). Drivers by points: if/else 25 (58 pts), boolean chains 19, ternaries 2 (6 pts), loops 2 (4 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db9b55491c425a64db0c05ed1ba65b7679286cd93736333627f08f9425fbf5c"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeachAnalyzer.checkIteratorType (cognitive 86): ForeachAnalyzer.checkIteratorType has cognitive complexity 86 (threshold 15). Drivers by points: if/else 28 (60 pts), boolean chains 12, ternaries 3 (10 pts), loops 2 (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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3aefabcfeee20c3bac2be538bbc9be6778f3dd7eec4b68ffb585491dd7e3e13"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.scrapeAssertions (cognitive 86): AssertionFinder.scrapeAssertions has cognitive complexity 86 (threshold 15). Drivers by points: if/else 30 (48 pts), boolean chains 18, ternaries 7 (14 pts), loops 2 (6 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5717bea1cff11e5c544f1b0828c9369205dcb61fb5fefbfbdaa9a57d54d8edf"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.taintArrayAssignment (cognitive 86): ArrayAssignmentAnalyzer.taintArrayAssignment has cognitive complexity 86 (threshold 15). Drivers by points: if/else 12 (31 pts), ternaries 9 (22 pts), loops 7 (21 pts), boolean chains 12 (nesting depth added 46). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d140df4ca68c6af5af927928f76714bb02e9a5505f6a7ece290b7ae4118919e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyze (cognitive 86): ArithmeticOpAnalyzer.analyze has cognitive complexity 86 (threshold 15). Drivers by points: if/else 29 (66 pts), boolean chains 14, loops 2 (5 pts), ternaries 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b10c0508f249b7bb905c43c78f01098f4efd687cf3e60373b245656f8f84a4"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicStaticCallAnalyzer.analyze (cognitive 86): AtomicStaticCallAnalyzer.analyze has cognitive complexity 86 (threshold 15). Drivers by points: if/else 22 (47 pts), boolean chains 21, ternaries 4 (13 pts), loops 2 (5 pts) (nesting depth added 37). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4d78c9fb744a52e1b6dac1f481d2a396338737abaf1978e62c713e492f2b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayMapReturnTypeProvider.getFunctionReturnType (cognitive 86): ArrayMapReturnTypeProvider.getFunctionReturnType has cognitive complexity 86 (threshold 15). Drivers by points: if/else 21 (46 pts), boolean chains 18, ternaries 6 (14 pts), loops 3 (8 pts) (nesting depth added 38). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4531d4ec969880ce0e79c07e0788fa856e046b65017c8bfddaad4640196c22c8"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableTypeComparator.getCallableFromAtomic (cognitive 86): CallableTypeComparator.getCallableFromAtomic has cognitive complexity 86 (threshold 15). Drivers by points: if/else 19 (55 pts), loops 4 (17 pts), boolean chains 7, ternaries 2 (5 pts), error handling 1 (2 pts) (nesting depth added 53). 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":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2377ad78169c5be4edeea64fd1434fef193dfb0c4fa21e3713467f1a89780e49"}},{"ruleId":"D2","level":"warning","message":{"text":"MinMaxReturnTypeProvider.getFunctionReturnType (cognitive 85): MinMaxReturnTypeProvider.getFunctionReturnType has cognitive complexity 85 (threshold 15). Drivers by points: if/else 24 (51 pts), ternaries 6 (18 pts), loops 4 (9 pts), boolean chains 7 (nesting depth added 44). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/MinMaxReturnTypeProvider.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccde1781cec60214fa9e58d0c8f62c4922949ca06a176e3eb64e24ee1ce4424"}},{"ruleId":"D2","level":"warning","message":{"text":"IfAnalyzer.analyze (cognitive 83): IfAnalyzer.analyze has cognitive complexity 83 (threshold 15). Drivers by points: if/else 22 (43 pts), boolean chains 16, loops 6 (16 pts), ternaries 4 (8 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"78300bdc33ad0efbb39bed1cbcab62cb1c96b7872a4845f2925b3a680ddb5977"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeTokenizer.getFullyQualifiedTokens (cognitive 83): TypeTokenizer.getFullyQualifiedTokens has cognitive complexity 83 (threshold 15). Drivers by points: if/else 24 (48 pts), boolean chains 32, ternaries 1 (2 pts), loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeTokenizer.php"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"f088dead81a2d41b54289e424646a7a0443d76fc8c242f9994490aa5f10d78e9"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.handleIsA (cognitive 82): AssertionReconciler.handleIsA has cognitive complexity 82 (threshold 15). Drivers by points: if/else 21 (59 pts), boolean chains 10, loops 3 (10 pts), ternaries 1 (3 pts) (nesting depth added 47). 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2d405fa69503e7e0ab18724692cbed91a0152c2f31fe43cbc8a0820705650c"}},{"ruleId":"D2","level":"warning","message":{"text":"Algebra.groupImpossibilities (cognitive 81): Algebra.groupImpossibilities has cognitive complexity 81 (threshold 15). Drivers by points: if/else 11 (43 pts), loops 12 (36 pts), boolean chains 2 (nesting depth added 56). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Algebra.php"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f490c2dc36c489d168b9cd83b49e1ce7c2004918605346bf593b2d73ff3b52"}},{"ruleId":"D2","level":"warning","message":{"text":"Psalter.run (cognitive 81): Psalter.run has cognitive complexity 81 (threshold 15). Drivers by points: if/else 34 (46 pts), boolean chains 15, loops 6 (14 pts), ternaries 2 (4 pts), error handling 1 (2 pts) (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":"src/Psalm/Internal/Cli/Psalter.php"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e3d98904abe3eebca40b79e63a502d7e25f6222b6eb526849a7b65f4489876"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeVariableTracker.reconcileLowerBoundsWithUpperBounds (cognitive 81): TypeVariableTracker.reconcileLowerBoundsWithUpperBounds has cognitive complexity 81 (threshold 15). Drivers by points: if/else 19 (53 pts), loops 8 (16 pts), boolean chains 7, ternaries 2 (5 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Type/TypeVariableTracker.php"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81b3ec16ad1d5802a3efaae3b0f30cba11bea4f19c3b6ae660699d53b37e563"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleArrayAccessOnTArray (cognitive 80): ArrayFetchAnalyzer.handleArrayAccessOnTArray has cognitive complexity 80 (threshold 15). Drivers by points: if/else 24 (53 pts), boolean chains 15, ternaries 3 (7 pts), loops 2 (5 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fdaec4ff1eb76c8a73c8855ca74ac96e2d0842fb17b544dda98bdc4e51ce7e"}},{"ruleId":"D2","level":"warning","message":{"text":"IncludeAnalyzer.analyze (cognitive 80): IncludeAnalyzer.analyze has cognitive complexity 80 (threshold 15). Drivers by points: if/else 23 (44 pts), boolean chains 17, loops 4 (11 pts), ternaries 2 (5 pts), error handling 1 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a63436707c76beefe5526a060ee2c69e21338b67b888fc961bc2b47def5842"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.findPossibleMethodParamTypes (cognitive 80): ClassLikes.findPossibleMethodParamTypes has cognitive complexity 80 (threshold 15). Drivers by points: if/else 17 (65 pts), boolean chains 6, loops 2 (6 pts), error handling 1 (3 pts) (nesting depth added 54). 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2629}}}],"partialFingerprints":{"codehealthFindingId/v1":"467cfef20675871aec20b98ab35abc6efc309a48a565b7fb17a414eef10dccf9"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalCallMapHandler.getMatchingCallableFromCallMapOptions (cognitive 80): InternalCallMapHandler.getMatchingCallableFromCallMapOptions has cognitive complexity 80 (threshold 15). Drivers by points: if/else 22 (60 pts), boolean chains 9, loops 4 (9 pts), ternaries 1 (2 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Codebase/InternalCallMapHandler.php"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cfd31dbe31d32e33928a1e9f2b7b0edc58316057a239840300930ec0338e63"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectComparator.isIntersectionShallowlyContainedBy (cognitive 80): ObjectComparator.isIntersectionShallowlyContainedBy has cognitive complexity 80 (threshold 15). Drivers by points: if/else 27 (51 pts), boolean chains 25, loops 1 (4 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":"src/Psalm/Internal/Type/Comparator/ObjectComparator.php"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b5da555cbddf42dd4eda6af5c48f7c91d7ef70d45d4e61497cdd68e6fb9c29"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateInferredTypeReplacer.replaceTemplateParam (cognitive 80): TemplateInferredTypeReplacer.replaceTemplateParam has cognitive complexity 80 (threshold 15). Drivers by points: if/else 15 (55 pts), loops 5 (16 pts), boolean chains 5, error handling 1 (4 pts) (nesting depth added 54). 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":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35eeeda9d37fec4bf252d966ac13002ebcd8d0c7c65fa29b40b64b17def7ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallPurityAnalyzer.analyze (cognitive 79): MethodCallPurityAnalyzer.analyze has cognitive complexity 79 (threshold 15). Drivers by points: boolean chains 33, if/else 18 (33 pts), ternaries 7 (11 pts), loops 1 (2 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4083430c1a0a2c99180257c827bacf756391297a861fa802cc71fdef20bcbc"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchAnalyzer.analyze (cognitive 79): MatchAnalyzer.analyze has cognitive complexity 79 (threshold 15). Drivers by points: if/else 26 (46 pts), boolean chains 17, loops 5 (9 pts), ternaries 3 (7 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/MatchAnalyzer.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5419f139153449efff290f989eef87de473490bc01dc220e01f5835c1bbed1"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.handleAddition (cognitive 78): ArrayFunctionArgumentsAnalyzer.handleAddition has cognitive complexity 78 (threshold 15). Drivers by points: if/else 21 (57 pts), loops 5 (11 pts), boolean chains 10 (nesting depth added 42). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc1c96848b556e3a19c25576ff3c7fe5a9a1778f108034f385c7053552de451"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileTruthyOrNonEmpty (cognitive 78): SimpleAssertionReconciler.reconcileTruthyOrNonEmpty has cognitive complexity 78 (threshold 15). Drivers by points: if/else 28 (55 pts), boolean chains 18, loops 3 (5 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":3051}}}],"partialFingerprints":{"codehealthFindingId/v1":"727cb3535bf6ac01e7fd35bec0e8e3b14710a45d3871c400464d2e024ec79f95"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectAnalyzer.interpretRefactors (cognitive 77): ProjectAnalyzer.interpretRefactors has cognitive complexity 77 (threshold 15). Drivers by points: if/else 26 (67 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed624d9dad7718c38b9c36c4112596ec4e6caff2657d6187083223dc2266e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.getPotentialDynamicMethodCalls (cognitive 77): ClassLikes.getPotentialDynamicMethodCalls has cognitive complexity 77 (threshold 15). Drivers by points: if/else 12 (41 pts), error handling 3 (12 pts), loops 5 (10 pts), boolean chains 7, ternaries 2 (7 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1b954511d3974e414dc9358ab72ac309c1748237b1c9e9d6a46639c1434e52"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.adjustTKeyedArrayType (cognitive 77): Reconciler.adjustTKeyedArrayType has cognitive complexity 77 (threshold 15). Drivers by points: if/else 15 (46 pts), loops 4 (14 pts), boolean chains 11, ternaries 1 (6 pts) (nesting depth added 46). 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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f597e1155ee64ec801204a113178f67de4cc7f92784077d117556fe290fb19"}},{"ruleId":"D2","level":"warning","message":{"text":"ElseAnalyzer.analyze (cognitive 76): ElseAnalyzer.analyze has cognitive complexity 76 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 16, loops 5 (12 pts), ternaries 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a8288fe81e179a1f5da8f8c9877b2bc535905cbf0beb50cc70c3ef627da317"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAnalyzer.assignByRefParam (cognitive 76): AssignmentAnalyzer.assignByRefParam has cognitive complexity 76 (threshold 15). Drivers by points: if/else 24 (55 pts), boolean chains 16, loops 2 (5 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd9ed40d978fe6c205ce5e3ff815cc4baf07dc90a1d05b2bbda542cebd2afaf"}},{"ruleId":"D2","level":"warning","message":{"text":"EncapsulatedStringAnalyzer.analyze (cognitive 76): EncapsulatedStringAnalyzer.analyze has cognitive complexity 76 (threshold 15). Drivers by points: if/else 19 (45 pts), boolean chains 13, ternaries 3 (10 pts), loops 3 (8 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/EncapsulatedStringAnalyzer.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d763776aea9b486c5ec6cdf8fc7072479d698d1e5ba5ee6579c8ccfd1917a1"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionDocblockManipulator.__construct (cognitive 76): FunctionDocblockManipulator.__construct has cognitive complexity 76 (threshold 15). Drivers by points: if/else 19 (50 pts), boolean chains 14, loops 4 (7 pts), ternaries 3, match/switch 1 (2 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd6dccdff0766abe537b9d9db8df5953c88910ac17ffe4ddb16be50ca7b005f"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStandinTypeReplacer.getMappedGenericTypeParams (cognitive 76): TemplateStandinTypeReplacer.getMappedGenericTypeParams has cognitive complexity 76 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 5 (19 pts), ternaries 6 (17 pts), boolean chains 8 (nesting depth added 45). 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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"204da7df3fd295b21e03e560bdb21c98539783b4041f28c276ff86eda0389407"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionIdentifier.getExtendedVarId (cognitive 75): ExpressionIdentifier.getExtendedVarId has cognitive complexity 75 (threshold 15). Drivers by points: if/else 18 (41 pts), boolean chains 22, ternaries 3 (12 pts) (nesting depth added 32). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ExpressionIdentifier.php"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7b68406888ce7e70191a4c6c7824c6a03513c42695bd83bc67de22feae774f"}},{"ruleId":"D2","level":"warning","message":{"text":"Refactor.run (cognitive 75): Refactor.run has cognitive complexity 75 (threshold 15). Drivers by points: if/else 34 (60 pts), boolean chains 9, loops 3 (6 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Refactor.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4484f2c5d1bbb2bb3ef6780d08d6778435926e98090d3d3057d3b7a6306c1dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.intersectUnionTypes (cognitive 75): Type.intersectUnionTypes has cognitive complexity 75 (threshold 15). Drivers by points: if/else 24 (51 pts), boolean chains 12, loops 3 (12 pts) (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":"src/Psalm/Type.php"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d28fabbcdb205a5b093beeb4de7ec7848e48c5318b44d442ebdbcabcb2a3e4"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcile (cognitive 74): SimpleNegatedAssertionReconciler.reconcile has cognitive complexity 74 (threshold 15). Drivers by points: if/else 31 (42 pts), boolean chains 29, ternaries 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"888ef08e570e1694a854f9419114a4cbd0b2d39b65a6969076b93093ec6ec0ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.intersectAtomicTypes (cognitive 74): Type.intersectAtomicTypes has cognitive complexity 74 (threshold 15). Drivers by points: boolean chains 34, if/else 15 (29 pts), error handling 2 (5 pts), ternaries 1 (4 pts), loops 1 (2 pts) (nesting depth added 21). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type.php"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"8568d1739ab54673d8ac4551e73449a9dbc46934022fb02a0d2bed7683304650"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAnalyzer.analyzeAssignmentToVariable (cognitive 73): AssignmentAnalyzer.analyzeAssignmentToVariable has cognitive complexity 73 (threshold 15). Drivers by points: if/else 15 (43 pts), boolean chains 15, loops 2 (8 pts), error handling 1 (4 pts), ternaries 1 (3 pts) (nesting depth added 39). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":2926}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da5abe894cd687aaab082045103958babfc3929d8e43664dfacdcf4586ce0b5"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.filterAtomicWithAnother (cognitive 73): AssertionReconciler.filterAtomicWithAnother has cognitive complexity 73 (threshold 15). Drivers by points: boolean chains 34, if/else 23 (33 pts), loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c411f4ec3b14663c45872adb392c5cc509f6dae39e68d539373c7fb2a6c8196e"}},{"ruleId":"D2","level":"warning","message":{"text":"CastAnalyzer.castFloatAttempt (cognitive 71): CastAnalyzer.castFloatAttempt has cognitive complexity 71 (threshold 15). Drivers by points: if/else 22 (48 pts), boolean chains 12, loops 4 (11 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7be52e05f701ec565dbe4d82fd95e65a0273ed49a28649b9133acffce03193"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterUtils.getOptionsArgValueOrError (cognitive 71): FilterUtils.getOptionsArgValueOrError has cognitive complexity 71 (threshold 15). Drivers by points: if/else 23 (62 pts), loops 2 (6 pts), ternaries 1 (3 pts) (nesting depth added 45). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b530a343a618a1a8116f57466d53871fbd7dec3d51cbd57d2d193917fccc8d55"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentAnalyzer.splitDocLine (cognitive 70): CommentAnalyzer.splitDocLine has cognitive complexity 70 (threshold 15). Drivers by points: if/else 14 (37 pts), boolean chains 24, ternaries 3 (8 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/CommentAnalyzer.php"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9e9080ed474c56194543894a03f2414ffb2288cfc323fa0089ce53d0a9a363"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAnalyzer.handleUnpackedArray (cognitive 70): ArrayAnalyzer.handleUnpackedArray has cognitive complexity 70 (threshold 15). Drivers by points: if/else 19 (57 pts), loops 3 (6 pts), ternaries 1 (6 pts), boolean chains 1 (nesting depth added 46). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"287a90592e439ec2164f76886f0e6b6c091fd5d3137982f13f6e31b31258f45a"}},{"ruleId":"D2","level":"warning","message":{"text":"CastAnalyzer.castIntAttempt (cognitive 70): CastAnalyzer.castIntAttempt has cognitive complexity 70 (threshold 15). Drivers by points: if/else 23 (50 pts), boolean chains 9, loops 3 (8 pts), ternaries 1 (3 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b3bbea41479bfcf63f93ba440e142701fdbd0d2f49de82f6915e31ae9f9fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.getTypeFromKeyedArrayTree (cognitive 70): TypeParser.getTypeFromKeyedArrayTree has cognitive complexity 70 (threshold 15). Drivers by points: if/else 26 (47 pts), boolean chains 15, ternaries 4 (5 pts), loops 2 (3 pts) (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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d315c10442aa18ea4ca31eb7937c5938cec43e24b513e40bd1ee3c321f896d"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodComparator.compareMethodSignatureParams (cognitive 69): MethodComparator.compareMethodSignatureParams has cognitive complexity 69 (threshold 15). Drivers by points: ternaries 11 (22 pts), if/else 10 (20 pts), boolean chains 18, loops 3 (9 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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"4630c37ce8193c3457f382c9cd6ced1ae5697e62da796986d35d7b64f0888321"}},{"ruleId":"D2","level":"warning","message":{"text":"CastAnalyzer.castStringAttempt (cognitive 69): CastAnalyzer.castStringAttempt has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (49 pts), boolean chains 8, ternaries 2 (8 pts), loops 2 (4 pts) (nesting depth added 37). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"85117ceb3bfb25a0194b1c80715bf745a348374d60c1d3120906455722eb739c"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayTypeComparator.isContainedBy (cognitive 69): ArrayTypeComparator.isContainedBy has cognitive complexity 69 (threshold 15). Drivers by points: if/else 22 (41 pts), boolean chains 25, loops 2 (3 pts) (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":"src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a13251f0be524fccb7bc19d1749e3d73fd682c305bcf2503497492266a1694"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getTrueInequalityAssertions (cognitive 68): AssertionFinder.getTrueInequalityAssertions has cognitive complexity 68 (threshold 15). Drivers by points: if/else 22 (48 pts), boolean chains 10, loops 2 (5 pts), ternaries 2 (5 pts) (nesting depth added 32). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8588d9e8ee5b4ab078d1e152062184460fb04b79ba31ee373ea7b1b5d1e233ee"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticPropertyAssignmentAnalyzer.analyze (cognitive 68): StaticPropertyAssignmentAnalyzer.analyze has cognitive complexity 68 (threshold 15). Drivers by points: if/else 26 (57 pts), boolean chains 5, ternaries 1 (4 pts), loops 2 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/StaticPropertyAssignmentAnalyzer.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2c00d435ca7aebe73b0bff2b08ee66b8de6f0d87be2c6418831b98d332a376"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getFalseEqualityAssertions (cognitive 67): AssertionFinder.getFalseEqualityAssertions has cognitive complexity 67 (threshold 15). Drivers by points: if/else 22 (48 pts), boolean chains 9, loops 2 (5 pts), ternaries 2 (5 pts) (nesting depth added 32). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d069669a03fc4e4b7aa003e3b97505587c511b1eb44ef636dcfccc36f6466522"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicTypeComparator.canBeIdentical (cognitive 67): AtomicTypeComparator.canBeIdentical has cognitive complexity 67 (threshold 15). Drivers by points: boolean chains 38, if/else 16 (23 pts), loops 3 (5 pts), ternaries 1 (nesting depth added 9). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5f74ff4fd6d46b01969d43f5d94638bc48414cdf278f38414be619448cee47"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeAnalyzer.checkFullyQualifiedClassLikeName (cognitive 66): ClassLikeAnalyzer.checkFullyQualifiedClassLikeName has cognitive complexity 66 (threshold 15). Drivers by points: if/else 23 (43 pts), boolean chains 16, ternaries 4 (5 pts), error handling 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b914c829b7e948e9379c742f9988ca08b658eae63097f4fc6bb043fbff9c509"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopAnalyzer.setLoopVars (cognitive 66): LoopAnalyzer.setLoopVars has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (47 pts), boolean chains 14, loops 3 (5 pts) (nesting depth added 33). 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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c44d1ca57623d99e4420ba71aca464c69afd297f00d8a007a5a6ced02a2cb"}},{"ruleId":"D2","level":"warning","message":{"text":"FileStatementsDiffer.diff (cognitive 66): FileStatementsDiffer.diff has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (38 pts), boolean chains 19, loops 3 (9 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/FileStatementsDiffer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2e899f7545c10564c0dc43167ffca8c7c38bda0a28f3f2e6c903dcb9105625"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentAnalyzer.coerceValueAfterGatekeeperArgument (cognitive 65): ArgumentAnalyzer.coerceValueAfterGatekeeperArgument has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (42 pts), loops 3 (12 pts), boolean chains 11 (nesting depth added 31). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cfd900c18cc0e845526fd3d65dfcdd4778b77edf33288b7ef7fa7ff8f899d8"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.taintArrayFetch (cognitive 65): ArrayFetchAnalyzer.taintArrayFetch has cognitive complexity 65 (threshold 15). Drivers by points: if/else 13 (31 pts), ternaries 7 (16 pts), boolean chains 13, loops 2 (5 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64535b5d380a65b7bbb2c20a6b0fdb08f22b7df8f6440102097448b077c2e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.scanFile (cognitive 65): Scanner.scanFile has cognitive complexity 65 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 9 (22 pts), boolean chains 9 (nesting depth added 31). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Codebase/Scanner.php"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cefcc320a32514bd381fcefc1b4034eff7134850a85a7456d2b03e03cd5c36d"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileAssertion (cognitive 65): SimpleAssertionReconciler.reconcileAssertion has cognitive complexity 65 (threshold 15). Drivers by points: if/else 37 (44 pts), boolean chains 19, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba0d8deebac7c1cbd21ee58deb4080d4c51d8deee126a31c9ee11d085a212a9"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStandinTypeReplacer.handleTemplateParamClassStandin (cognitive 65): TemplateStandinTypeReplacer.handleTemplateParamClassStandin has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 5 (15 pts), ternaries 2 (8 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe09e2701f5bc3a46790287634562a4093477ba18a177bb0dcfe6b86b461aae"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedFunctionCallHandler.handleExtract (cognitive 64): NamedFunctionCallHandler.handleExtract has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (39 pts), boolean chains 18, loops 3 (7 pts) (nesting depth added 29). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"0655b0139f42d56c35c9fd48f4f1c3f252fea1355ae4fa8b75365f84ae996bad"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleTypeInferer.handleArrayItem (cognitive 64): SimpleTypeInferer.handleArrayItem has cognitive complexity 64 (threshold 15). Drivers by points: if/else 23 (50 pts), boolean chains 10, ternaries 1 (4 pts) (nesting depth added 30). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe53e8ceed95c8c5d2f64124d6debf66f870ff6aa1bcfbfb6e6b19012709bff"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementsAnalyzer.checkUnreferencedVars (cognitive 64): StatementsAnalyzer.checkUnreferencedVars has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (38 pts), boolean chains 18, loops 2 (5 pts), ternaries 2 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"21539d64201b97a7acb4106a73d083791d8d9f8eb5ee97b436db13e7125c916e"}},{"ruleId":"D2","level":"warning","message":{"text":"Algebra.combineOredClauses (cognitive 63): Algebra.combineOredClauses has cognitive complexity 63 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 7 (15 pts), boolean chains 13, ternaries 1 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra.php"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff3b6b558b8fde2dd02412b18bf615951bf5689d4e87e86b67e953c6b7d0d64"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodComparator.compare (cognitive 63): MethodComparator.compare has cognitive complexity 63 (threshold 15). Drivers by points: boolean chains 31, if/else 14 (27 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 14). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bc7248638279a77b3d3f8c7358a517654bc9e84bb6f3d35628cfcc3542ae80"}},{"ruleId":"D2","level":"warning","message":{"text":"SwitchAnalyzer.analyze (cognitive 63): SwitchAnalyzer.analyze has cognitive complexity 63 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 13, loops 6 (11 pts), ternaries 1 (2 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchAnalyzer.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8901c5c41fb2580c70a9b4e85b076db4163167333e0a2bb3b169c2df4dfb06c"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getIsaAssertions (cognitive 63): AssertionFinder.getIsaAssertions has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (42 pts), boolean chains 13, loops 1 (4 pts), ternaries 2 (4 pts) (nesting depth added 32). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"28aa4b6989adef5be9616984d9a53ba7b73358fe27f9a21be2c7bc6d0da9e9cf"}},{"ruleId":"D2","level":"warning","message":{"text":"CliUtils.getPathsToCheck (cognitive 63): CliUtils.getPathsToCheck has cognitive complexity 63 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 12, loops 4 (8 pts), ternaries 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/CliUtils.php"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d92542b8ce72964ee877d8d8edd5510d268dba5ebcb1d8f72036737be34e0c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFilterParamsProvider.getFunctionParams (cognitive 63): ArrayFilterParamsProvider.getFunctionParams has cognitive complexity 63 (threshold 15). Drivers by points: if/else 25 (47 pts), boolean chains 9, ternaries 2 (4 pts), loops 1 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ParamsProvider/ArrayFilterParamsProvider.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcac1b655dd53ad415251c77ab9f794937256febe0575d46a556acfc8a0513fb"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCombiner.scrapeIntProperties (cognitive 63): TypeCombiner.scrapeIntProperties has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 2 (9 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 39). 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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b480803c04ed29d87aad8d73a2c95e5d5411e35390cae478395610943766ccb"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeExpander.expandNamedObject (cognitive 63): TypeExpander.expandNamedObject has cognitive complexity 63 (threshold 15). Drivers by points: boolean chains 33, if/else 13 (28 pts), loops 1 (2 pts) (nesting depth added 16). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b3092a6b08419bbd0993a2b3215068ca8247633d65e236f260f51bda958285"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallReturnTypeFetcher.fetch (cognitive 62): MethodCallReturnTypeFetcher.fetch has cognitive complexity 62 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 19, ternaries 3 (7 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd6bc12e74ab8f04f9469231cf47cbbf27d5ab42ff3f0306f235e5348fef4a5"}},{"ruleId":"D2","level":"warning","message":{"text":"LanguageServer.run (cognitive 62): LanguageServer.run has cognitive complexity 62 (threshold 15). Drivers by points: if/else 28 (31 pts), boolean chains 28, ternaries 2 (3 pts) (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":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddd3be1b847afb574eedeef1078d0b80545c84dfa77c267400e4e3dad761912"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeNodeScanner.visitClassConstDeclaration (cognitive 62): ClassLikeNodeScanner.visitClassConstDeclaration has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 16, loops 3 (6 pts), ternaries 3 (6 pts), error handling 2 (4 pts) (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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f594f3755f3728d9285c8cbb6e444b944917f6ba8ad80e39e3eac0e54d32044"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileNonEmptyCountable (cognitive 62): SimpleAssertionReconciler.reconcileNonEmptyCountable has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (34 pts), ternaries 2 (11 pts), loops 2 (10 pts), boolean chains 7 (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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3d80af63356c99fbbb3e4446230c3f3497b7b03842aac0526cd129e7c55c36"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallReturnTypeFetcher.taintMethodCallResult (cognitive 61): MethodCallReturnTypeFetcher.taintMethodCallResult has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (31 pts), ternaries 8 (14 pts), boolean chains 8, loops 3 (8 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3927cad218eb4d0ef2684828f13d8495b1c4075789eefd7940c0c8479a1d2fa"}},{"ruleId":"D2","level":"warning","message":{"text":"NewAnalyzer.analyze (cognitive 61): NewAnalyzer.analyze has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 9, ternaries 3 (9 pts), match/switch 1 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69c2cccfc7d425b38f71f35767b0abf90c0450cdf62f498406d9dbe46fd3349"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionAnalyzer.handleExpression (cognitive 61): ExpressionAnalyzer.handleExpression has cognitive complexity 61 (threshold 15). Drivers by points: if/else 49 (53 pts), boolean chains 8 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea67a08ed35cde08c5cea3063eca7166d4d43f3567c3dce814283df3f5a27af3"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAnalyzer.getReferencedPropertyType (cognitive 60): AssignmentAnalyzer.getReferencedPropertyType has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 11, ternaries 4 (11 pts), loops 2 (4 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4df0b95babac1f807543499e4c59bf4355493634add3479bdc9d6aacdda2c81"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.checkClosureTypeArgs (cognitive 60): ArrayFunctionArgumentsAnalyzer.checkClosureTypeArgs has cognitive complexity 60 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 13, ternaries 5 (10 pts), loops 4 (6 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ad8f4bddd34483a1a810743e65b713078e159f37909b5175efad037413ffc9"}},{"ruleId":"D2","level":"warning","message":{"text":"TernaryAnalyzer.analyze (cognitive 60): TernaryAnalyzer.analyze has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (26 pts), ternaries 9 (12 pts), boolean chains 10, loops 7 (10 pts), error handling 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f8445167f6c6e3fff6239cf7bbd0da1c56b0c4e1aa00b525ffd0588e99f603"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCombiner.handleKeyedArrayEntries (cognitive 60): TypeCombiner.handleKeyedArrayEntries has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 14, loops 3 (8 pts), ternaries 2 (8 pts) (nesting depth added 27). 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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c24223319ed0aa8c5082b21983daf3a7a94391f9d7e8ab1de484221fab4e00"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.combineUnionTypes (cognitive 60): Type.combineUnionTypes has cognitive complexity 60 (threshold 15). Drivers by points: if/else 27 (44 pts), boolean chains 16 (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":"src/Psalm/Type.php"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"88240e64ceec33920309ff6f89f6535d759ca37a9034c6c5367eee2fe83a7c7e"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcatAnalyzer.analyzeOperand (cognitive 59): ConcatAnalyzer.analyzeOperand has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 13, ternaries 3 (13 pts), error handling 1 (5 pts), loops 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bb8a1ba3785d398530cac60b2fbdf2aa7713fc0a89e8753f1380d209727c36"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicMethodCallAnalyzer.handleInvalidClass (cognitive 59): AtomicMethodCallAnalyzer.handleInvalidClass has cognitive complexity 59 (threshold 15). Drivers by points: if/else 12 (34 pts), boolean chains 11, ternaries 2 (8 pts), loops 1 (5 pts), match/switch 1 (nesting depth added 32). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"d692810d0276b6e9e08a6b785fe7367bd16228042f24e8ff461df7d9ca09c229"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialApplicationAnalyzer.bind (cognitive 59): PartialApplicationAnalyzer.bind has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (47 pts), boolean chains 6, loops 3 (4 pts), ternaries 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3e648a3166ec04aaefba28d0f789c139a44cc7ba1361ff7e0d97ca28f39aad"}},{"ruleId":"D2","level":"warning","message":{"text":"ReflectorVisitor.leaveNode (cognitive 59): ReflectorVisitor.leaveNode has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (38 pts), boolean chains 10, loops 2 (6 pts), ternaries 1 (5 pts) (nesting depth added 30). 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":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1248b0114ea561739e985d041a1bb73460b932f762c7577e020b0b65eeaf0c"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateInferredTypeReplacer.replaceConditional (cognitive 59): TemplateInferredTypeReplacer.replaceConditional has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 16, ternaries 4 (7 pts), loops 2 (4 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":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"8798920caecb18fcf9b9ba8d5f70c7c612d073595297f474b538e1e8eba45b46"}},{"ruleId":"D2","level":"warning","message":{"text":"IncludeAnalyzer.getPathTo (cognitive 58): IncludeAnalyzer.getPathTo has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (49 pts), boolean chains 8, ternaries 1 (nesting depth added 28). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de328dae745a264f78b9c606ac8b2bb9127e43418a745d84ef984b130e8d216"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockScanner.handleReturn (cognitive 58): FunctionLikeDocblockScanner.handleReturn has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 22, loops 2 (4 pts), ternaries 2 (4 pts), error handling 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61fba357aeee80ce73155ebbc03565617d48b055b6537f7377c773d887598dd"}},{"ruleId":"D2","level":"warning","message":{"text":"GetObjectVarsReturnTypeProvider.getGetObjectVarsReturnType (cognitive 58): GetObjectVarsReturnTypeProvider.getGetObjectVarsReturnType has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (45 pts), ternaries 2 (8 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 38). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/GetObjectVarsReturnTypeProvider.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fecaac83907035e920c951d2e0d26f2924e39200926b598d9a2cef47b292b34"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.removeCacheDirectory (cognitive 57): Config.removeCacheDirectory has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (42 pts), error handling 2 (7 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":3332}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6156781c08f3f5c1dd782f446e73778d42149cb3108d3a79d4c4f4f1503e42"}},{"ruleId":"D2","level":"warning","message":{"text":"IfAnalyzer.updateIfScope (cognitive 57): IfAnalyzer.updateIfScope has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 15, loops 6 (9 pts), ternaries 3 (6 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3643080bd0dfdae75cf54f61dd9142e0d07bb76bb03ae814848d352ffa9afa2"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallAnalyzer.checkFunctionCallPurity (cognitive 57): FunctionCallAnalyzer.checkFunctionCallPurity has cognitive complexity 57 (threshold 15). Drivers by points: boolean chains 23, if/else 8 (19 pts), ternaries 6 (15 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"008d18d34368aa2993e9bfcacf37f4d278b6645c62d1691693017157b09e2fd0"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleArrayAccessOnNamedObject (cognitive 57): ArrayFetchAnalyzer.handleArrayAccessOnNamedObject has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (46 pts), boolean chains 8, ternaries 1 (3 pts) (nesting depth added 27). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff96a56e8a66ff4979a915729d2bb4c1dbe6257b8666dfd7919a5828846d602"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeHintResolver.resolve (cognitive 57): TypeHintResolver.resolve has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (36 pts), loops 4 (10 pts), ternaries 2 (8 pts), boolean chains 3 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/TypeHintResolver.php"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0c1def2edb7e4c8995bbd4f279b131432a3eb24d79c26f5d60f260423a1942"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileFalsyOrEmpty (cognitive 57): SimpleNegatedAssertionReconciler.reconcileFalsyOrEmpty has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (43 pts), boolean chains 9, loops 3 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43ebe5e1102c2a6ce44ab0f6534a49e5e9a168c92c5ab3c50aa74bb1e7a2572"}},{"ruleId":"D2","level":"warning","message":{"text":"FileAnalyzer.analyze (cognitive 56): FileAnalyzer.analyze has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 9 (15 pts), boolean chains 2, error handling 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FileAnalyzer.php"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"577e9629cf42c014880552deb462d0d72fcf1e1632dd9196b7b993d0a6d97c63"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedAssignmentRemover.findAssignStmt (cognitive 56): UnusedAssignmentRemover.findAssignStmt has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (35 pts), boolean chains 10, loops 3 (7 pts), ternaries 1 (4 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Analyzer/Statements/UnusedAssignmentRemover.php"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a467c692a466ecc520368ccbd1384b8c02c7fb0728335356a980afe760b523"}},{"ruleId":"D2","level":"warning","message":{"text":"NamespaceStatementsDiffer.diff (cognitive 56): NamespaceStatementsDiffer.diff has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 15, loops 3 (9 pts), ternaries 1 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"025bf08f2cea8f29abad9806c2bd7474d82d641cc6a55993b81efca2a010c5c7"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentMapVisitor.enterNode (cognitive 56): AssignmentMapVisitor.enterNode has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 9 (21 pts), boolean chains 6 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/AssignmentMapVisitor.php"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d10a472b1dc99218c92973e7dd16feed17039a435a6caaebc9653182de5db9"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentAnalyzer.arrayToDocblocks (cognitive 55): CommentAnalyzer.arrayToDocblocks has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 14, error handling 2 (7 pts), ternaries 2 (6 pts), loops 1 (2 pts) (nesting depth added 26). 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":"src/Psalm/Internal/Analyzer/CommentAnalyzer.php"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecbaf68e9c0b7fc925447f93ab4d7f1120e70976086bd383be4c4a0911db801"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.hasGetClassCheck (cognitive 55): AssertionFinder.hasGetClassCheck has cognitive complexity 55 (threshold 15). Drivers by points: boolean chains 32, if/else 9 (17 pts), loops 2 (6 pts) (nesting depth added 12). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f5821d2e37f50d5a5dac705cc53f3d1577445af300b9e3363bbf3076de2d40"}},{"ruleId":"D2","level":"warning","message":{"text":"Populator.inheritPropertyTypes (cognitive 55): Populator.inheritPropertyTypes has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 11, loops 4 (11 pts), ternaries 3 (5 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"9678e68a10a02d58680232a4e8d21532a5193ef018d985b2530e7a4f43a1c80c"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStandinTypeReplacer.findMatchingAtomicTypesForTemplate (cognitive 55): TemplateStandinTypeReplacer.findMatchingAtomicTypesForTemplate has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (41 pts), boolean chains 10, error handling 1 (3 pts), loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbc962aecde483986c2ad22e5b5ec27297260dc1c1e3c284a340cfcba7ccbb8"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCombiner.getArrayTypeFromGenericParams (cognitive 54): TypeCombiner.getArrayTypeFromGenericParams has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 12, loops 3 (10 pts), ternaries 2 (7 pts) (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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"480fd75d6108235353fc5ba0bd32dc40691962b8b032e33d1b4c451f849f4fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"ReturnTypeCollector.getReturnTypes (cognitive 53): ReturnTypeCollector.getReturnTypes has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 4 (10 pts), boolean chains 7 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeCollector.php"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1273fda838a266eae4d1f86ffc9742ee3d1ab17484e6adfe8da9da08043029d8"}},{"ruleId":"D2","level":"warning","message":{"text":"InterfaceAnalyzer.analyze (cognitive 53): InterfaceAnalyzer.analyze has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 5 (11 pts), boolean chains 5, error handling 1 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/InterfaceAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8104a01f5d22f0339282cf8fba3759e027dd7d4d3596040ace450a23ebf19e0"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.scrapeEqualityAssertions (cognitive 53): AssertionFinder.scrapeEqualityAssertions has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 8, ternaries 2 (6 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc1cfd6f904a59b0543d5b1ae4fb39dabcc26c93dabbb2c22f82a6e76e4dcb3"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getGreaterAssertions (cognitive 53): AssertionFinder.getGreaterAssertions has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (42 pts), ternaries 5 (10 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a947b0180b79498071dcea8c0a24394a259e5aea57e4821b64aff479d3f93dcc"}},{"ruleId":"D2","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyzeMulBetweenIntRange (cognitive 53): ArithmeticOpAnalyzer.analyzeMulBetweenIntRange has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (22 pts), ternaries 8 (16 pts), boolean chains 15 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cad6f29816c81cb594d760a0567dc181f584fe288dabdba354f5b12e916f8ae"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodVisibilityAnalyzer.analyze (cognitive 53): MethodVisibilityAnalyzer.analyze has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 10, ternaries 2 (6 pts), loops 1, 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodVisibilityAnalyzer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f984a079009f7ef2e70467bc31b616c6f8453ab16ae8c741ce4937fcbd8c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicPropertyFetchAnalyzer.handleNonExistentClass (cognitive 53): AtomicPropertyFetchAnalyzer.handleNonExistentClass has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 17, loops 2 (5 pts), ternaries 2 (4 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed75cc4eb186d53492090bdc34f5a1bbf5a7bb9d43d9110d2e6bdc92672f81b0"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsetAnalyzer.removeOffset (cognitive 53): UnsetAnalyzer.removeOffset has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 2 (5 pts), ternaries 1 (5 pts), boolean chains 3 (nesting depth added 33). 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":"src/Psalm/Internal/Analyzer/Statements/UnsetAnalyzer.php"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"44318509bd3a8bb8d8560395d6a8e8dfa65643f88016288ef5c7268442282a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowGraph.linkGeneratorSends (cognitive 53): TaintFlowGraph.linkGeneratorSends has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (37 pts), loops 5 (12 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55ce2090174042c5eb6a9d0923de9cc75ba4ad7b6d9df55eca183e616ffc351"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockScanner.handleTaintFlow (cognitive 53): FunctionLikeDocblockScanner.handleTaintFlow has cognitive complexity 53 (threshold 15). Drivers by points: if/else 8 (31 pts), loops 6 (20 pts), boolean chains 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d5005d0bac2a23fdfac2943c16fdfae7f905d4bd14c25cbff88b34e25962eb"}},{"ruleId":"D2","level":"warning","message":{"text":"OrAnalyzer.analyze (cognitive 52): OrAnalyzer.analyze has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (30 pts), loops 5 (10 pts), boolean chains 7, error handling 2 (3 pts), ternaries 1 (2 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/OrAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb09bf51df2319287cba7a3ae40478c58f38b4cd4ccfdb3f3d8906ab71936dfa"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentsAnalyzer.evaluateArbitraryParam (cognitive 52): ArgumentsAnalyzer.evaluateArbitraryParam has cognitive complexity 52 (threshold 15). Drivers by points: boolean chains 24, if/else 11 (22 pts), loops 1 (4 pts), ternaries 1 (2 pts) (nesting depth added 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"686146d5081c24eaf5b92bd03d928813076a6205e0166cec78e9763cab7e8240"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockScanner.getConditionalSanitizedTypeTokens (cognitive 52): FunctionLikeDocblockScanner.getConditionalSanitizedTypeTokens has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (29 pts), ternaries 3 (14 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 33). 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"0530476baaf21b625c2eda11ecfb4976b9789c5f195626403f06d3479859ce5e"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeAnalyzer.checkPropertyVisibility (cognitive 51): ClassLikeAnalyzer.checkPropertyVisibility has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (26 pts), ternaries 8 (16 pts), boolean chains 6, loops 1 (2 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":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"1852f1ae91d23cc6fde4bcf8c702787df58090876fd1fa2d437f62ccdbd56586"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.analyzeNestedArrayAssignment (cognitive 51): ArrayAssignmentAnalyzer.analyzeNestedArrayAssignment has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 10, ternaries 1 (2 pts), loops 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7ab569d5cd3dc21756d87f962cc2d8279bc64e339436259788c7f2b64d5e56"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedFunctionCallHandler.handleDependentTypeFunction (cognitive 51): NamedFunctionCallHandler.handleDependentTypeFunction has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (37 pts), ternaries 1 (6 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 31). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"159e10305f41308be71d4b4720706f0f86da67026d622e075e8e4d4dc4a3b0fe"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalAnalyzer.analyze (cognitive 51): GlobalAnalyzer.analyze has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 8, ternaries 3 (7 pts), loops 2 (4 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":"src/Psalm/Internal/Analyzer/Statements/GlobalAnalyzer.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b302ba546b165527a85f50edf32a88172ef0d924d8687d1937cc1616158347"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.rebuildStructuralEdges (cognitive 51): ClassLikes.rebuildStructuralEdges has cognitive complexity 51 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 6 (12 pts), error handling 3 (9 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb25a1ac9ab5ac163603886e9b7ffd8e93859c0bb3b3162673f34af576a9033"}},{"ruleId":"D2","level":"warning","message":{"text":"Populator.inheritMethodsFromParent (cognitive 51): Populator.inheritMethodsFromParent has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (36 pts), boolean chains 6, loops 4 (6 pts), ternaries 1 (3 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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"65aab5a01f68d6c18168b9738a647ef44ca3b7e94067e1c11894bed8e4853977"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.buildTrace (cognitive 51): TaintFlowResolution.buildTrace has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 10, ternaries 3 (9 pts), loops 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":4017}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f26aa6d5a90e50d116e76a5a4a8ad996305405d020c2b719cf78567a9056a4"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileList (cognitive 51): SimpleAssertionReconciler.reconcileList has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 14, ternaries 2 (5 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fca8751b486b97ca6175a58758412df650f5718477459d3e21066133e6770e"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getSmallerAssertions (cognitive 50): AssertionFinder.getSmallerAssertions has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (37 pts), ternaries 6 (12 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4668}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6629cd7818d834734c24ef409e8653d7a0a24841b8df359a53ec6b01cf71d7"}},{"ruleId":"D2","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.analyzeRegularAssignment (cognitive 50): InstancePropertyAssignmentAnalyzer.analyzeRegularAssignment has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 11, ternaries 3 (7 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd240accdaa220ec2db15cedeb8ce334a4120724b5cbf31265cf3dc886776c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentAnalyzer.processTaintedness (cognitive 50): ArgumentAnalyzer.processTaintedness has cognitive complexity 50 (threshold 15). Drivers by points: boolean chains 16, if/else 10 (14 pts), ternaries 12 (14 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37bfb7dc60737f76e3e6b98b960aaeb66525865ebdbdaced4b47783fe327bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.addEntryCaller (cognitive 50): TaintFlowResolution.addEntryCaller has cognitive complexity 50 (threshold 15). Drivers by points: loops 14 (29 pts), if/else 12 (20 pts), boolean chains 1 (nesting depth added 23). 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":2667}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d05316f40924411723014eb3b3fabfceacc4f52e966dbaeb68f6495374b0efa"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileNotNonEmptyCountable (cognitive 50): SimpleNegatedAssertionReconciler.reconcileNotNonEmptyCountable has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (37 pts), boolean chains 7, loops 1 (6 pts) (nesting depth added 28). 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41fd066b3dc22d6cf5be6003cdd03507a680fa1289f297291c290fb84c794e7"}},{"ruleId":"D2","level":"warning","message":{"text":"Codebase.getCompletionItemsForPartialSymbol (cognitive 49): Codebase.getCompletionItemsForPartialSymbol has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 7, loops 5 (7 pts), error handling 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f0757a8391658cc5187488b437d2f7d507342b507ed90792abc59ce1888184"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentAnalyzer.getDispatchNode (cognitive 49): ArgumentAnalyzer.getDispatchNode has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 4 (13 pts), boolean chains 9, loops 4 (7 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":2422}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f56f1e3718deafd52bd573465f5c5efc792fd9b4486c1633ec73bd6e665e81"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.taintReturnType (cognitive 49): FunctionCallReturnTypeFetcher.taintReturnType has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 12, ternaries 3 (5 pts), loops 1 (3 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8eb7fa8ea7009e8cc317faa557b213a5d563d662d8f5b53cd73158e8b8d48b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Methods.methodExists (cognitive 49): Methods.methodExists has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 12, loops 4 (9 pts), ternaries 2, error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e81b7892204842cb98ff8e63900d00506f818ab5f082c019919fb338537f14a"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getInarrayAssertions (cognitive 48): AssertionFinder.getInarrayAssertions has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (29 pts), boolean chains 11, loops 2 (7 pts), ternaries 1 (nesting depth added 25). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1190b61af2c3997fc29cb64c8ca6d5fd2c516b307512b31af1dd9b6d2e03e1fa"}},{"ruleId":"D2","level":"warning","message":{"text":"NonComparisonOpAnalyzer.analyze (cognitive 48): NonComparisonOpAnalyzer.analyze has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 21, if/else 10 (15 pts), ternaries 4 (12 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/NonComparisonOpAnalyzer.php"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d696d4c63e7eb6f14e31cfeeea6ffaa09412560fd567fae9566a290e527f0a"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentsAnalyzer.handleByRefFunctionArg (cognitive 48): ArgumentsAnalyzer.handleByRefFunctionArg has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 18, loops 1 (3 pts), ternaries 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7923a660c8436a9b96015bed27d500a4fbd601050bacec2f49b3a7c7ff956df5"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.getNextOpenAssignments (cognitive 48): TaintFlowResolution.getNextOpenAssignments has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 11 (23 pts), boolean chains 16, if/else 7 (9 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de8ece654c27a41ac151dbabe5f856450a2292217129e9ae823bdb8118a468d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayMapReturnTypeProvider.getReturnTypeFromMappingIds (cognitive 48): ArrayMapReturnTypeProvider.getReturnTypeFromMappingIds has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 4 (12 pts), ternaries 1 (5 pts), boolean chains 2 (nesting depth added 32). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca00df803e7ffab123694c8aa5ca5341de71162f414e3e870b405d44fd1578a4"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.reconcile (cognitive 48): AssertionReconciler.reconcile has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 11, loops 4 (7 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2b2b2b772b662a5ea5872b39a3ea25ec4c2ad61523c49b5ffa66118f897911"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.updateArrayType (cognitive 47): ArrayAssignmentAnalyzer.updateArrayType has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 11, loops 3 (7 pts), ternaries 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ff4c8ae257d67a12e0622f84ed50ca0672f2d4c7fa16effe1193003a4b9316"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentAnalyzer.checkArgumentMatches (cognitive 47): ArgumentAnalyzer.checkArgumentMatches has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 15, loops 1 (3 pts) (nesting depth added 18). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cd102f4f58a14e67116d8ce2f3debc987d447259525e2e149ad38ae1db4653"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneAnalyzer.analyzeClonedType (cognitive 47): CloneAnalyzer.analyzeClonedType has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 6, ternaries 1 (5 pts), loops 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CloneAnalyzer.php"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73e30afa08e68490e56e9f5bca1f8f64b85894aa40348537e08e9d94d3d5eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"DestructorAnalyzer.getHeldType (cognitive 47): DestructorAnalyzer.getHeldType has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 9, ternaries 4 (8 pts), loops 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/DestructorAnalyzer.php"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba1c5239c59d9d544fdd258050eed5eacabcecd38f13162b8e5288abafb4216"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer.doAnalysis (cognitive 47): Analyzer.doAnalysis has cognitive complexity 47 (threshold 15). Drivers by points: loops 8 (24 pts), if/else 9 (21 pts), boolean chains 2 (nesting depth added 28). 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":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b213a60f3e9f350cc664e764a75aa55d8fed0ca13408cd1931d6c3c8307e03ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Populator.extendTemplateParams (cognitive 47): Populator.extendTemplateParams has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 6 (21 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 30). 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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cac82097837b5e625451327013f22b008205458049f35c9b5565258c1afbb93"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileExactlyCountable (cognitive 47): SimpleAssertionReconciler.reconcileExactlyCountable has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2 (10 pts), boolean chains 6, ternaries 1 (6 pts) (nesting depth added 27). 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef840986208b086b3f89dccb628f0b2f65bfaa85a882e541d1d72a2b20456cd0"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableUnion.substitute (cognitive 47): MutableUnion.substitute has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 14, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/MutableUnion.php"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bee14306c3c7619e74ce2786cbcdc53550bd06a94c65960544751a033f1dead"}},{"ruleId":"D2","level":"warning","message":{"text":"NewAnalyzer.analyzeNamedConstructor (cognitive 46): NewAnalyzer.analyzeNamedConstructor has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 7, ternaries 2 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb5c38281621de310acb440162102b9f519c9e1d77e8b21705e70efcbc617c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Functions.getMatchingFunctionNames (cognitive 46): Functions.getMatchingFunctionNames has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 5 (9 pts), error handling 1 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Functions.php"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0c81a0effc4439ed88e194519ebcb7a65705b56f4cea88447394204decd381"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterInputReturnTypeProvider.getFunctionReturnType (cognitive 46): FilterInputReturnTypeProvider.getFunctionReturnType has cognitive complexity 46 (threshold 15). Drivers by points: if/else 29 (39 pts), boolean chains 6, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c736a10895879e9959d952b305fbc43d51520abfc74b14d9ce77d000d2324d7"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.handleLiteralEqualityWithString (cognitive 46): AssertionReconciler.handleLiteralEqualityWithString has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 11, loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e41a93e03a7942e5cf44fbf44eaa8cac48b1a263104dd8bba532c2910c7e95"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.reconcileAbsentArrayValue (cognitive 46): Reconciler.reconcileAbsentArrayValue has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 15, loops 4 (7 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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"1815f88ff386747211af91016da2aaaafd1a0f58bfceab58db5f46c52b530940"}},{"ruleId":"D2","level":"warning","message":{"text":"SwitchCaseAnalyzer.handleNonReturningCase (cognitive 45): SwitchCaseAnalyzer.handleNonReturningCase has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (30 pts), loops 3 (9 pts), boolean chains 6 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchCaseAnalyzer.php"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7277dfe11716df9628620b9f5d25b7a98b5a3ffc4da7fccd10a101f39cf3a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAnalyzer.analyze (cognitive 45): ArrayAnalyzer.analyze has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (25 pts), ternaries 4 (9 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35fdc2a2cc6303adb44da2d4b4b8a2f0f19583b69e7913633f2f69b0bb2e099"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getNativeSymbolGuardAssertion (cognitive 45): AssertionFinder.getNativeSymbolGuardAssertion has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 10, loops 2 (5 pts), ternaries 3 (5 pts), error handling 1 (4 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"317b831d73a8efc6ff3a8b17fcb557986a1ecbdd57f921571fb7d46d2acd1de9"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementsAnalyzer.hoistFunctions (cognitive 45): StatementsAnalyzer.hoistFunctions has cognitive complexity 45 (threshold 15). Drivers by points: if/else 7 (28 pts), loops 3 (11 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 31). 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":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf3c46cbed6c06babc061aa6bf3e29b9a4d5f6f1b346446fd866f43dc79ef99"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNameResolver.enterNode (cognitive 45): SimpleNameResolver.enterNode has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 7 (16 pts), boolean chains 8 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/SimpleNameResolver.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb240146bf1e37d6a7cae0ba310fb4dbbc435b0a8275e702061a1f87a930bce"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementsProvider.getStatementsForFile (cognitive 45): StatementsProvider.getStatementsForFile has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 12, ternaries 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/StatementsProvider.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9107bcae2d14f27d43c3e607bd39fd317b70396cbaee247cbf0c8cc9398afc"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.handleLiteralEqualityWithInt (cognitive 45): AssertionReconciler.handleLiteralEqualityWithInt has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 11, loops 2 (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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"da75aa762fc0d67741c29522fb132118fb46d04d56bbf504313f210294c9a994"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.handleLiteralEqualityWithFloat (cognitive 45): AssertionReconciler.handleLiteralEqualityWithFloat has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 10, loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"36830ea63efeedd69aff3995832754dcf5d62ee366f1f1e61864564709fa0f12"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.getTypeFromTree (cognitive 45): TypeParser.getTypeFromTree has cognitive complexity 45 (threshold 15). Drivers by points: if/else 27 (35 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e527be289c97e2fd7170aaa06106bb71fe7aa9d7fedac7db3cdf259630121125"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureAnalyzer.analyzeClosureUses (cognitive 44): ClosureAnalyzer.analyzeClosureUses has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (35 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClosureAnalyzer.php"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a45d9184a097ab93de76afebc251ec15aafa9a64536568f5ad8a65df292398"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.queueFilesOfInheritedMethods (cognitive 44): Scanner.queueFilesOfInheritedMethods has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 4 (11 pts), boolean chains 9 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Scanner.php"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"295a3188609314795e22d95d7df2786d96d1054767a9a18bb09686735225daca"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectAnalyzer.migrateCode (cognitive 43): ProjectAnalyzer.migrateCode has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (23 pts), ternaries 3 (12 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 27). 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":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd5f966692cb198109f440d8c8f44abe545ab20621f18ede6f6302634f286e6"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getGetclassEqualityAssertions (cognitive 43): AssertionFinder.getGetclassEqualityAssertions has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 13, ternaries 2 (6 pts), loops 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3688}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b0954e1cb36b4b26c751ac92522362b7c803b7d93685992f9468cc2cb68213"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentAnalyzer.verifyCallableInContext (cognitive 43): ArgumentAnalyzer.verifyCallableInContext has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 16, if/else 7 (16 pts), ternaries 3 (9 pts), error handling 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06ab96228553131da03d174da2d8773ad116d85261ff77e8da0da120909518c"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassConstAnalyzer.getOverriddenConstant (cognitive 43): ClassConstAnalyzer.getOverriddenConstant has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 9, loops 4 (6 pts), ternaries 1 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d01ab466047feacebcaf4f3fa1a6e12616b07b18c1199ca54f28f7a21d1fe9c"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeUseGraph.reach (cognitive 43): CodeUseGraph.reach has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 5 (10 pts), boolean chains 7 (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":"src/Psalm/Internal/Codebase/CodeUseGraph.php"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1e15680a3e64a2d6c7dac62aac1aba83be4fd0605d571e06ed3ae69911571c"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintStore.getKnownStart (cognitive 43): TaintStore.getKnownStart has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 10, ternaries 2 (6 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8acbea288eb66a8e2a6b55a7ec9549391340a8719668c38e27151b8259e224"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeExpander.expandPropertiesOf (cognitive 43): TypeExpander.expandPropertiesOf has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 5 (9 pts), ternaries 3 (6 pts), boolean chains 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"42adbef0e72da44a36c6508cd34120f6141238d401d495d82e14d533484e8f6f"}},{"ruleId":"D2","level":"warning","message":{"text":"Transpiler.emitClass (cognitive 42): Transpiler.emitClass has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 4 (9 pts), loops 5 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cc8114333842a3e6c596e8ede0bf561874cfdaa439f943892a53360c2af211"}},{"ruleId":"D2","level":"warning","message":{"text":"Codebase.getMarkupContentForSymbolByReference (cognitive 42): Codebase.getMarkupContentForSymbolByReference has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (40 pts), error handling 1, ternaries 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":"src/Psalm/Codebase.php"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"7395546c90eab65890260f8d6ade10cac0fd12d16328e658620c1dc58462b8a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassAnalyzer.analyzeTraitUse (cognitive 42): ClassAnalyzer.analyzeTraitUse has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"04df1b83c6186728593b1a8abdc837e09b99cd7ec6df658261b2f4f49bd95094"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinueAnalyzer.analyze (cognitive 42): ContinueAnalyzer.analyze has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 4 (9 pts), boolean chains 5, ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/ContinueAnalyzer.php"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16825df383dc0ff29355e43a0bf80e003d0f76f0d3c8ede2296bb6101221ac2"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.updateTypeWithKeyValues (cognitive 42): ArrayAssignmentAnalyzer.updateTypeWithKeyValues has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 4 (9 pts), boolean chains 5, ternaries 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"068c8da0c420a74ac4f0745e4809504a2186c0bd78ba0e5271a2792d45a01b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallAnalyzer.handleNamedFunction (cognitive 42): FunctionCallAnalyzer.handleNamedFunction has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 13, ternaries 3 (4 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"df34b1d545f0447bba77d0395da9a6b9e53e9faaf637a1d7e38ac0a0b9548e7f"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.simpleExclusion (cognitive 42): FunctionCallReturnTypeFetcher.simpleExclusion has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 22, if/else 8 (19 pts), loops 1 (nesting depth added 11). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93314169a39ec3517b8ca6c0286feb0478139dee13ac9df53feb5024af414e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplodeReturnTypeProvider.getFunctionReturnType (cognitive 42): ImplodeReturnTypeProvider.getFunctionReturnType has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 16, if/else 9 (16 pts), loops 4 (5 pts), ternaries 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ImplodeReturnTypeProvider.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca81487c83aeb85d9b089a3c1520fea6e2afc1b6d8bb3ace7875da3dfb955e7"}},{"ruleId":"D2","level":"warning","message":{"text":"IteratorToArrayReturnTypeProvider.getFunctionReturnType (cognitive 42): IteratorToArrayReturnTypeProvider.getFunctionReturnType has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 8, ternaries 2 (6 pts), loops 1 (2 pts) (nesting depth added 21). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/IteratorToArrayReturnTypeProvider.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"95745d331e4df4a352cf02675dee9fdb7dac5f27b1d480bf43305a5525fedea7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocblockParser.resolveTags (cognitive 42): DocblockParser.resolveTags has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 26, if/else 14 (16 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Scanner/DocblockParser.php"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ec2238b67d66ad5b86e2f35aa468856a32e5545e6b195e8ee6a46f1e1100c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.visitStubFiles (cognitive 41): Config.visitStubFiles has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (10 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":2855}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfd025dced24bf4430e5cda6c628257152a36dd7aa774fdf5685d41243bb4bf"}},{"ruleId":"D2","level":"warning","message":{"text":"DoAnalyzer.hasExitToTheLoop (cognitive 41): DoAnalyzer.hasExitToTheLoop has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (7 pts), boolean chains 5, ternaries 2 (5 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23eece6c73140243fbb6b6c8b2925637addfaa6e80777280b2f4c6c8d74bb76"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingMethodCallHandler.overloadAcceptsArgs (cognitive 41): MissingMethodCallHandler.overloadAcceptsArgs has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc66148aa4b95d8e4311c23a335f76312465e57831a2857d107b2634c9f47c86"}},{"ruleId":"D2","level":"warning","message":{"text":"CallAnalyzer.getTemplateTypesForCall (cognitive 41): CallAnalyzer.getTemplateTypesForCall has cognitive complexity 41 (threshold 15). Drivers by points: loops 7 (23 pts), if/else 5 (16 pts), boolean chains 2 (nesting depth added 27). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"6588acfdafc86c714cf665ffe5aa8f8e1cf672c1bc0450a546f49b1233080b36"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicPropertyFetchAnalyzer.localizePropertyType (cognitive 41): AtomicPropertyFetchAnalyzer.localizePropertyType has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 4 (13 pts), boolean chains 1, ternaries 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86bca2db7aa99d4d5c71408f49045f6288d6a4ee98a587482d5ae6ba06e7a0a"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.restoreTemplateKeyOrValueOf (cognitive 41): AssertionReconciler.restoreTemplateKeyOrValueOf has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 6 (11 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d38a26d5954ac88dec49d5d8661022ad622bd598dacde05e0f04a7089931954"}},{"ruleId":"D2","level":"warning","message":{"text":"Codebase.getCompletionDataAtPosition (cognitive 40): Codebase.getCompletionDataAtPosition has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 4, loops 2, ternaries 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9a14eb190765156dc1d46a088f027b8301d5d1f0ad38bbadefea2a1e5823e2"}},{"ruleId":"D2","level":"warning","message":{"text":"FileFilter.allows (cognitive 40): FileFilter.allows has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config/FileFilter.php"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8f1d547ae8062ba9732f9dbdfa2fa673378ad73386b24cd8131c3c7f48b95e"}},{"ruleId":"D2","level":"warning","message":{"text":"AlgebraAnalyzer.checkForParadox (cognitive 40): AlgebraAnalyzer.checkForParadox has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 8 (12 pts), boolean chains 8, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/AlgebraAnalyzer.php"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2323378321e282f847935b3cc21a8603e0f53e07602bbb7327c75c485f7e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getGetclassInequalityAssertions (cognitive 40): AssertionFinder.getGetclassInequalityAssertions has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 12, ternaries 3 (8 pts), loops 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2932}}}],"partialFingerprints":{"codehealthFindingId/v1":"a049cb32007b57f196c3ad3a180430400689a5a6905845157b067651d038a68b"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getTrueEqualityAssertions (cognitive 40): AssertionFinder.getTrueEqualityAssertions has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 10 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dd28e84f34905d053a47fa6f0d7745b90c8e10a7b8de347f7c819a21a87699"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAnalyzer.analyzePropertyAssignment (cognitive 40): AssignmentAnalyzer.analyzePropertyAssignment has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 4 (9 pts), boolean chains 6, loops 1 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ed8c65aed034cdb245b890f3a200e6d9a3a93f46e4320c30ffd0cdbf9fce95"}},{"ruleId":"D2","level":"warning","message":{"text":"HighOrderFunctionArgHandler.getCallableArgInfo (cognitive 40): HighOrderFunctionArgHandler.getCallableArgInfo has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 11 (14 pts), boolean chains 9, error handling 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/HighOrderFunctionArgHandler.php"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ecd3e8d30adb0cc022960bbbe591a140a3035ef3188d72cde044d2b670b2ca"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleTypeInferer.handleUnpackedArray (cognitive 40): SimpleTypeInferer.handleUnpackedArray has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"7566ee7dbbd16e121b74a7c29e37e9ea026d321fa30d4020a4877faec7e31267"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayUniqueReturnTypeProvider.getFunctionReturnType (cognitive 40): ArrayUniqueReturnTypeProvider.getFunctionReturnType has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (21 pts), ternaries 5 (8 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayUniqueReturnTypeProvider.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"979bf1f87862abedad01ca72994bf9aa6ba0f28ae2c247ee8e7124c39c014095"}},{"ruleId":"D2","level":"warning","message":{"text":"DocblockParser.parse (cognitive 40): DocblockParser.parse has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 4 (5 pts), boolean chains 2, ternaries 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Scanner/DocblockParser.php"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e942ba3b09ac2c0c38d8e857da2a04a8c3c9c337bf90e4a6a850d8fabbea6e1"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodComparator.compareMethodDocblockParams (cognitive 39): MethodComparator.compareMethodDocblockParams has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 7 (19 pts), if/else 9 (15 pts), boolean chains 5 (nesting depth added 18). 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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e3a41b82c32da199262448e5cb6326ec205e698bc40bbb349efc5df849932b"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceAnalyzer.signalMutationOnlyInferred (cognitive 39): SourceAnalyzer.signalMutationOnlyInferred has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 12, ternaries 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/SourceAnalyzer.php"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce0ec4ffc17c244f028488cca6d36d7ac3c1956acbb1fe7af954dc5df68c887"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.processFunctionCall (cognitive 39): AssertionFinder.processFunctionCall has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 14, ternaries 3 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d5f758eeec1bb19ae915ce661a6280418f3ef1658c96491737d89ba24a85aa"}},{"ruleId":"D2","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.taintProperty (cognitive 39): InstancePropertyAssignmentAnalyzer.taintProperty has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (9 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"710cd26461cc841d8639ea907836c65e65cc09fd4aae3297bd3091b86719abdd"}},{"ruleId":"D2","level":"warning","message":{"text":"AndAnalyzer.analyze (cognitive 39): AndAnalyzer.analyze has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 9, loops 4 (6 pts), ternaries 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/AndAnalyzer.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb4b1ff9e5226a5045d8cb9654f68e9e51ed47347992c97a82e45686c9ec18f"}},{"ruleId":"D2","level":"warning","message":{"text":"ThrowAnalyzer.analyze (cognitive 39): ThrowAnalyzer.analyze has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ThrowAnalyzer.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"594112fd899b7213363553a98d14ca3d9fa16466d4ce584959c0cfdf51ea461d"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiverPropertyTaints.taintCall (cognitive 39): ReceiverPropertyTaints.taintCall has cognitive complexity 39 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 9 (12 pts), boolean chains 5, ternaries 1 (5 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":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c6a3bb1f2b2437b812bb293cfb4b5008381b4f9dfdac3c2dd8d0dc50bd46d7"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomTraverser.traverseNode (cognitive 39): CustomTraverser.traverseNode has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 3 (7 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpTraverser/CustomTraverser.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ca0e9970eac2fe7e51caee6d3e996738e48127f4f8aaaf63cd5723f4a02c28"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomTraverser.traverseArray (cognitive 39): CustomTraverser.traverseArray has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 4 (9 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpTraverser/CustomTraverser.php"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d985d0959c6b8f2230d59130c24e8e0c716faee4bee59578795c57190bf419"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionResolver.enterConditional (cognitive 39): ExpressionResolver.enterConditional has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 16, if/else 9 (14 pts), ternaries 3 (6 pts), error handling 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f20442d3bac53468b4f01c197ee4e92a71bed9b34bad8da07e6c813d7d9a56e"}},{"ruleId":"D2","level":"warning","message":{"text":"StringStartScanner.scan (cognitive 39): StringStartScanner.scan has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 8 (12 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8420c64364df07a257282a839dd9fe6bf4c1b01ca59c14b60cf6988d81a2f953"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicTypeComparator.getTraversableHalf (cognitive 39): AtomicTypeComparator.getTraversableHalf has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 15, loops 2 (7 pts), ternaries 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":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"db806c4588486357cee65be0b995481375b78d8ea5c7d5ced8085e04478bdc10"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreeCreator.create (cognitive 39): ParseTreeCreator.create has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (19 pts), boolean chains 10, loops 3 (8 pts), match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a966adc58778ef31b1eb346c5eb50e8d2288be2459d0296252381e687288fcd2"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileHasMethod (cognitive 39): SimpleAssertionReconciler.reconcileHasMethod has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (28 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 21). 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79b466bcf855d27ad434ae2257e5f3428c19d5d8b6c14f4d922aa2b2021e543"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeExpander.expandConditional (cognitive 39): TypeExpander.expandConditional has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 3 (7 pts), boolean chains 4 (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":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"004bade68178e22591e8250c4396ebe94bb538897632d00c74bb174a74d58998"}},{"ruleId":"D2","level":"warning","message":{"text":"IfConditionalAnalyzer.analyze (cognitive 38): IfConditionalAnalyzer.analyze has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 8, ternaries 2 (5 pts), loops 3 (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":"src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e406d49ecb3a198a924adba4199419f8b63c36c6e27d60945469abfd082eadca"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getAndCheckInstanceofAssertions (cognitive 38): AssertionFinder.getAndCheckInstanceofAssertions has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (28 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (3 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4771}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c228adf4ad6f01c9df55bdac0810aefac4a9924b6b89b0918a735eeb53d12e7"}},{"ruleId":"D2","level":"warning","message":{"text":"UnaryPlusMinusAnalyzer.analyze (cognitive 38): UnaryPlusMinusAnalyzer.analyze has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (29 pts), ternaries 2 (6 pts), loops 1 (2 pts), boolean chains 1 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/UnaryPlusMinusAnalyzer.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b1b82b77c56402c0927e45aa652081b844d5343f43ff6436704b6d3b43d426"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsetAnalyzer.replaceElement (cognitive 38): UnsetAnalyzer.replaceElement has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (17 pts), ternaries 4 (9 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/UnsetAnalyzer.php"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"deed0a1a7b9cd90a10f10a496828da413bc78f8d50c50b621eeaac122cbce2cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Psalm.run (cognitive 38): Psalm.run has cognitive complexity 38 (threshold 15). Drivers by points: if/else 24 (26 pts), boolean chains 8, loops 2, ternaries 2 (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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31a206e36272ba5498569aaa40f3257ef93ecdac8a3e28c098cf7ed83370dfa"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.handleClassLikeReferenceInMigration (cognitive 38): ClassLikes.handleClassLikeReferenceInMigration has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 8, ternaries 3 (7 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"0513b0f5864e3074e84621cb6b6195336a7281c850d556032add09aade475058"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeNodeScanner.handleTraitUse (cognitive 38): ClassLikeNodeScanner.handleTraitUse has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (8 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 21). 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c301919ffb7e268b75fec1d615d72b5abbb023130e5988c935cfe5a62352b9"}},{"ruleId":"D2","level":"warning","message":{"text":"StubsGenerator.getAll (cognitive 38): StubsGenerator.getAll has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 7 (9 pts), boolean chains 2, ternaries 1 (2 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":"src/Psalm/Internal/Stubs/Generator/StubsGenerator.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a42e086a929eb994892af4e8dc2d8fc06204c08ac27027b743156bfd036b388"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionTypeComparator.mergeAlternativeBounds (cognitive 38): UnionTypeComparator.mergeAlternativeBounds has cognitive complexity 38 (threshold 15). Drivers by points: loops 11 (26 pts), if/else 5 (9 pts), boolean chains 3 (nesting depth added 19). 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":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad24c586877b22aaa55c8ee9120b81310b3264a21211db53b82546811f45118"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreeCreator.handleValue (cognitive 38): ParseTreeCreator.handleValue has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 11, ternaries 4 (6 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa6f03a0413cfd9cbde37ae8c38833bf7706f9f4d6c89d82864b29b2380930a"}},{"ruleId":"D2","level":"warning","message":{"text":"Atomic.createInner (cognitive 38): Atomic.createInner has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 9, ternaries 3 (6 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic.php"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"78533292e2cd3d032577123159ebeab03e7167b3ab9e51c4242360a0645933bf"}},{"ruleId":"D2","level":"warning","message":{"text":"AlgebraAnalyzer.findImplication (cognitive 37): AlgebraAnalyzer.findImplication has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 4 (10 pts), boolean chains 5, ternaries 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/AlgebraAnalyzer.php"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94f353d185fbfe5f871aa7ba2c8cde7085e674008f0555e0b9887de86a6f786"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodComparator.compareMethodDocblockReturnTypes (cognitive 37): MethodComparator.compareMethodDocblockReturnTypes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 7 (14 pts), boolean chains 8 (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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c4d2aed5538e2bb1a6909066820ac3a853c398c3f65817d98e2dad96ff8865"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getInstanceOfAssertions (cognitive 37): AssertionFinder.getInstanceOfAssertions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (21 pts), ternaries 2 (10 pts), boolean chains 3, loops 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2949bc28e1bcc18964467b8399bb7f8f6155d556a2f51aa5ba3ff0e37d8db49d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.updateParentTypes (cognitive 37): ArrayAssignmentAnalyzer.updateParentTypes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 4, ternaries 1 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b214a35ae7498654c1b91351e1bc8cf1e44826250b70e2764f784ee7def0ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"Populator.populateFileStorage (cognitive 37): Populator.populateFileStorage has cognitive complexity 37 (threshold 15). Drivers by points: error handling 9 (20 pts), if/else 5 (9 pts), loops 7 (8 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4639dc4b247d5537083e74bba4aa44dc5c7140dd1b9eadf5bdbceeebfa3472"}},{"ruleId":"D2","level":"warning","message":{"text":"ReflectorVisitor.recordExternalEffects (cognitive 37): ReflectorVisitor.recordExternalEffects has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 29, if/else 6, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d489c0a64721d867d352db7af42c73e3944c88bc686819ce1bf107d979f32d07"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterUtils.getOptions (cognitive 37): FilterUtils.getOptions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 8, 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"135a8b7069b12213c29e6c53bd0616cd15efa32a2a024a0b6ebd5453e6591aea"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectComparator.isShallowlyContainedBy (cognitive 37): ObjectComparator.isShallowlyContainedBy has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 13, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/ObjectComparator.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3239be99feb6361a6355204fd8070576d6999929a09ac7755dfb134b45d11a8"}},{"ruleId":"D2","level":"warning","message":{"text":"PurityWildcardPaths.collectEdits (cognitive 37): PurityWildcardPaths.collectEdits has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, ternaries 3 (7 pts), loops 3 (6 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":"src/Psalm/Internal/Type/PurityWildcardPaths.php"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"354fe0d4c6a756fbf60dde450a33239723a17fe90d6a37dce24bf92df386c4f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.triggerIssueForImpossible (cognitive 37): Reconciler.triggerIssueForImpossible has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (19 pts), ternaries 4 (13 pts), boolean chains 5 (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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7f234f6b46d909548fa95b982e4a45d0ecbacc731817e78e64e1aa9ecaf933"}},{"ruleId":"D2","level":"warning","message":{"text":"ReturnTypeAnalyzer.checkReturnType (cognitive 36): ReturnTypeAnalyzer.checkReturnType has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 9, ternaries 2 (3 pts), loops 1 (2 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"f249eb75409563e80591d153976eb40492da28bd55fbf06ee46bcaf7c9fde7fc"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getTypedValueEqualityAssertions (cognitive 36): AssertionFinder.getTypedValueEqualityAssertions has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 18, if/else 9 (13 pts), loops 2 (4 pts), ternaries 1 (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3793}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ae979b146ff5239ee481c86f4a90b2b946069ae93ac62010f24a2486a615dd"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementsAnalyzer.getUncaughtThrows (cognitive 36): StatementsAnalyzer.getUncaughtThrows has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (7 pts), ternaries 2 (6 pts), error handling 1 (5 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c6a05c70f1bee1728caf82e007d09c1cdff40997440bef5c357a197a9b5b30"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.applyPathType (cognitive 36): TaintFlowResolution.applyPathType has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 13, ternaries 1 (2 pts) (nesting depth added 12). 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"35152f25251888643ab2bc8892a111268a86cac0daafc15f017d38563fb5ed45"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayReverseReturnTypeProvider.getFunctionReturnType (cognitive 36): ArrayReverseReturnTypeProvider.getFunctionReturnType has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (10 pts), boolean chains 8, ternaries 2 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReverseReturnTypeProvider.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfbd36341948aab61fd0536e8e8411006f2c78981470fa3cb08c1a214f18429"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeAnalyzer.detectUnusedParameters (cognitive 35): FunctionLikeAnalyzer.detectUnusedParameters has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 4, loops 2 (3 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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":3215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a808e023ed0e3debd19aeaeda53cb196c5298cb1dc393ce0fb5c60b8470057aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyzeModBetweenIntRange (cognitive 35): ArithmeticOpAnalyzer.analyzeModBetweenIntRange has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"83099e4237fa43500e9e91da15c0fd0e8b012c278721a122bb69005bb2786017"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallReturnTypeFetcher.getReturnDispatchNode (cognitive 35): MethodCallReturnTypeFetcher.getReturnDispatchNode has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (9 pts), boolean chains 8, ternaries 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"657af908ebb47ec875cd1c2035ee2755343886c7d882e22f3d1bb9900a80c619"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingMethodCallHandler.handleMissingOrMagicMethod (cognitive 35): MissingMethodCallHandler.handleMissingOrMagicMethod has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), ternaries 3 (9 pts), boolean chains 5 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eec85e6be7303213be09e880afefe571115b679b92137722bf1c41592e1ebfc"}},{"ruleId":"D2","level":"warning","message":{"text":"NewAnalyzer.getUnconstrainableTemplates (cognitive 35): NewAnalyzer.getUnconstrainableTemplates has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 8 (15 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ce00b446ec613fa5886607cbe7160b9d5d74f2a618ac0f9b21bddf4ede2931"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicPropertyFetchAnalyzer.propertyFetchCanBeAnalyzed (cognitive 35): AtomicPropertyFetchAnalyzer.propertyFetchCanBeAnalyzed has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 4 (8 pts), boolean chains 6 (nesting depth added 15). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc32f90c1578bc8f2a0072448000304af73903aa50c4a518b981dc2a094a3fd"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalCallMapHandler.getCallablesFromCallMap (cognitive 35): InternalCallMapHandler.getCallablesFromCallMap has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/InternalCallMapHandler.php"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7dca4d8a84ca191685b7323cedf089b720978c761e05658db56d10eb4a480a"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarTypeComparator.isContainedByDecimalIntString (cognitive 35): ScalarTypeComparator.isContainedByDecimalIntString has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 10 (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":"src/Psalm/Internal/Type/Comparator/ScalarTypeComparator.php"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa38442630c36e21ca699d44212c424992f6b683081b441c598da33ea581dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker.checkGenericParams (cognitive 35): TypeChecker.checkGenericParams has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 6 (10 pts), boolean chains 6, ternaries 2 (3 pts), error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/TypeVisitor/TypeChecker.php"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"11355e74f5fc05d0b977780bac23c8f3d33ffa8f80a6f9e0b7ab4e6ccf891804"}},{"ruleId":"D2","level":"warning","message":{"text":"Transpiler.resolveContext (cognitive 34): Transpiler.resolveContext has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (18 pts), ternaries 3 (9 pts), boolean chains 4, match/switch 1 (2 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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d3f78bc301c75ea2868e75f17bfaef0c378370bcfd14c384d67269ad36c673"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getFalseInequalityAssertions (cognitive 34): AssertionFinder.getFalseInequalityAssertions has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 11 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2448}}}],"partialFingerprints":{"codehealthFindingId/v1":"861469315272cc0bf7e0d4e69b1510fe0e0042d83d106e4911872ea03d132f79"}},{"ruleId":"D2","level":"warning","message":{"text":"BitwiseNotAnalyzer.analyze (cognitive 34): BitwiseNotAnalyzer.analyze has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 2 (8 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BitwiseNotAnalyzer.php"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"267207614e24bba0b2109d7b4a895d12ab537648d3a06edb1a74118df09ec973"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentAnalyzer.getDispatchRoutes (cognitive 34): ArgumentAnalyzer.getDispatchRoutes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (9 pts), boolean chains 4, ternaries 3 (4 pts) (nesting depth added 17). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"59122fe48e21bf7bf91aa3b0fc2a8262f502127036881e1c144e4a0476854a39"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionIdentifier.getVarId (cognitive 34): ExpressionIdentifier.getVarId has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 15, 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ExpressionIdentifier.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2657672af97277bd6f0fd77fd3c3899171262d7143ea4c50a2720cc7d20e884"}},{"ruleId":"D2","level":"warning","message":{"text":"FreshObjectFinder.walk (cognitive 34): FreshObjectFinder.walk has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (8 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/FreshObjectFinder.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c905e59e3757ee1ff624e31484b6d066d5787588c4b66496938b1d0c979d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeNodeScanner.visitEnumDeclaration (cognitive 34): ClassLikeNodeScanner.visitEnumDeclaration has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 8, error handling 1 (3 pts), loops 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"747f6c666175bca456cbca4d80131397cffc2b0aef8e18abbc445d69e847a437"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockScanner.getAssertionParts (cognitive 34): FunctionLikeDocblockScanner.getAssertionParts has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 5 (9 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"95805a81a3d0593cc5357560510e32d085e981fbf49c065f6541f0c55fbee40d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFillReturnTypeProvider.getFunctionReturnType (cognitive 34): ArrayFillReturnTypeProvider.getFunctionReturnType has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 11, ternaries 4, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFillReturnTypeProvider.php"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd3219a8f8126e71acd6ab311b55681ae4f85f5ae20798229e2c3b027055a3b"}},{"ruleId":"D2","level":"warning","message":{"text":"BasenameReturnTypeProvider.getFunctionReturnType (cognitive 34): BasenameReturnTypeProvider.getFunctionReturnType has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 1 (3 pts), boolean chains 1 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/BasenameReturnTypeProvider.php"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd89f1b5da2bc593aa5ccec37d497037bf5512024838027576e5a677a65c7dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.intersectAtomicTypes (cognitive 34): TypeParser.intersectAtomicTypes has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 16, if/else 14 (16 pts), error handling 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08669a946414297f465d174e3d3342348b3f0ff4c7c66c82a1d7fac0c11aecd"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.unescapeStringLiteral (cognitive 34): TypeParser.unescapeStringLiteral has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 4 (16 pts), if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":2834}}}],"partialFingerprints":{"codehealthFindingId/v1":"452f7d502355582d1dc00e7a8b6d1bb8299f705fb4f0dfc5a449b371ef3757ab"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeLocation.calculateRealLocation (cognitive 33): CodeLocation.calculateRealLocation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (22 pts), ternaries 3 (4 pts), boolean chains 3, loops 1 (2 pts), match/switch 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":"src/Psalm/CodeLocation.php"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdb8bfc235f98127a748a9599f819ce0ce548f6fd1e5baf949ed05f5fd5d358"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.getElementCopySource (cognitive 33): ArrayAssignmentAnalyzer.getElementCopySource has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 17, if/else 6 (8 pts), ternaries 4 (6 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ab8b12c04ed3c8aa07cab55e6064bc81e27d7286eb1759b290f6531734d828"}},{"ruleId":"D2","level":"warning","message":{"text":"ArithmeticOpAnalyzer.isChangeableByLoop (cognitive 33): ArithmeticOpAnalyzer.isChangeableByLoop has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 9, loops 3 (6 pts), ternaries 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"932ffd4d8b33953d0dbacdc0e9ae5c3aab65e41aa89c3007088cdcf7d6f9257d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyzePowBetweenIntRange (cognitive 33): ArithmeticOpAnalyzer.analyzePowBetweenIntRange has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 6 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0e4cb4597c45937aeef8f2a98081f7399b5732e80e50611cb2eff1df6e71a1"}},{"ruleId":"D2","level":"warning","message":{"text":"CoalesceAnalyzer.analyze (cognitive 33): CoalesceAnalyzer.analyze has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 17, if/else 8 (12 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/CoalesceAnalyzer.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"051ead5f1c154e031059c69f286741ed2bda0065574da55827ee9227d5f1e856"}},{"ruleId":"D2","level":"warning","message":{"text":"ExistingAtomicMethodCallAnalyzer.getMagicGetterOrSetterProperty (cognitive 33): ExistingAtomicMethodCallAnalyzer.getMagicGetterOrSetterProperty has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 4, ternaries 1 (2 pts), match/switch 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ea0f971c9ee3d6b6799333e9791f11df342fa0701ae4014d55f6206f12d767"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialApplicationAnalyzer.analyze (cognitive 33): PartialApplicationAnalyzer.analyze has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 12, ternaries 3 (6 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7b2e9a6af162daab3df193cca504f9e7634ec5616583a073a623fead78dbf0"}},{"ruleId":"D2","level":"warning","message":{"text":"ReturnAnalyzer.collectGeneratorReturnTypes (cognitive 33): ReturnAnalyzer.collectGeneratorReturnTypes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 9, loops 3 (7 pts), ternaries 1 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa24c21a6267457dcaa7ee9ba2dc779f220623a4da885ff0904792794cc17122"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer.removeExistingDataForFile (cognitive 33): Analyzer.removeExistingDataForFile has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (8 pts), boolean chains 5 (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":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8035e14181fcb4dfe054324983ba4351a6487d24e9787511cca9ba1cd3d8cece"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.handleDocblockTypeInMigration (cognitive 33): ClassLikes.handleDocblockTypeInMigration has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 9, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37381b4c969c2730d7caf57b37d1af86cb331dec35ba3f6814889dcfabdc2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionDocblockManipulator.getManipulationsForFile (cognitive 33): FunctionDocblockManipulator.getManipulationsForFile has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b06d4a32933b7efacd4172768d15b9ad3b76072f2458b095d318416e86dafd7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionResolver.functionEvaluatesToTrue (cognitive 33): ExpressionResolver.functionEvaluatesToTrue has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 17, if/else 11 (16 pts) (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe33c00e4024d67b7d91ff3d421e8a311488434c22812bcd9f4aef2c76f2d260"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionScanner.scanGlobalWrites (cognitive 33): ExpressionScanner.scanGlobalWrites has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 17, if/else 4 (8 pts), loops 2 (4 pts), match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0840823d74caf6be7c1d29888c5b0dd9b62081c59ead865d44d650dd41dbc3c8"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeStubGenerator.getMethodNodes (cognitive 33): ClassLikeStubGenerator.getMethodNodes has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 3 (7 pts), loops 4 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Stubs/Generator/ClassLikeStubGenerator.php"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef23f5d50ce5b9e5110b84a7bca13dc284fa1daa2ab6abd2b9272da6b446e14"}},{"ruleId":"D2","level":"warning","message":{"text":"IssetGuardedProperties.walk (cognitive 32): IssetGuardedProperties.walk has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 4 (8 pts), boolean chains 3 (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":"src/Psalm/Internal/Analyzer/IssetGuardedProperties.php"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7b18da2122faa9dcf50b4c41e265ac93d5418560b6f59573ced7e4c4a5ec64"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticCallAnalyzer.taintReturnType (cognitive 32): StaticCallAnalyzer.taintReturnType has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 12, ternaries 4 (6 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"19409a34397ff0ffff82b92ea45ae28bc2abc12035be52c6f8b7a8fd1975fd43"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleArrayAccessOnString (cognitive 32): ArrayFetchAnalyzer.handleArrayAccessOnString has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 9, loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff06ffae9ee7953a5c639cf7473341416e49eaed1bad0f866da4096a385a41f"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.reach (cognitive 32): TaintFlowResolution.reach has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 9 (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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"e592054f558ff05b4166211776dda9779c12d4e7b2f0f764a722faf543fe215f"}},{"ruleId":"D2","level":"warning","message":{"text":"IntegerRangeComparator.reduceRangeIncrementally (cognitive 32): IntegerRangeComparator.reduceRangeIncrementally has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 5, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/IntegerRangeComparator.php"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"673975e3c94914eaa2b85203c8ad5b26b0b4ece5c283b2e5a85f1d781b657681"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreeCreator.handleQuestionMark (cognitive 32): ParseTreeCreator.handleQuestionMark has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (13 pts), ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0778b0a83fce315faf8a13aee8806609bd61ffaf08186f2e88f501530b0bbf9"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.breakUpPathIntoParts (cognitive 32): Reconciler.breakUpPathIntoParts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 7, match/switch 1 (2 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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88a26e2f7c7b438b495e531f38f9c53cb35c48770af36d985dbe55737ce7a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"Transpiler.docType (cognitive 31): Transpiler.docType has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 9 (20 pts), if/else 3 (6 pts), loops 1 (2 pts), match/switch 2, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"400ab29510cecddaec7a02a26a810934f61a756386648cc98a8c1e11d73f5699"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.findReferenceRebinding (cognitive 31): Context.findReferenceRebinding has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 19, if/else 5 (11 pts), loops 1 (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Context.php"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8f027a90f49ded399aa0f0d5fa97b7552a4639e6dd3053c9e386c2f89368d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.filterClauses (cognitive 31): Context.filterClauses has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 8, loops 3 (6 pts), ternaries 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":"src/Psalm/Context.php"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1e01c06fdf02e702ec6976c52571bc62eac31ca0abf63c9c74cbed34218c89"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassAnalyzer.analyzeClassMethod (cognitive 31): ClassAnalyzer.analyzeClassMethod has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 11, error handling 1, loops 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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd4500a7f1fa8b6afd842499ba01fa5e4900d807a8b4ff65140de5567da3bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentAnalyzer.isHashNotation (cognitive 31): CommentAnalyzer.isHashNotation has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/CommentAnalyzer.php"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e66dc112009bc77d7eb9e14c1d03f2909ae8c08032f5853ffc9824b7c058b7"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeAnalyzer.alterParams (cognitive 31): FunctionLikeAnalyzer.alterParams has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 11, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"639799c71d09558e23639c053740cec276a6db4b9fcb2cf8744c9c98799fb57b"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeAnalyzer.getParamTypeStrings (cognitive 31): FunctionLikeAnalyzer.getParamTypeStrings has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (9 pts), boolean chains 6, error handling 1 (5 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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5b94c26273d0de56d92c262a7d1402599b3024e0c983591f9d35424d7f9ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"PurityWildcardInference.markReceiverTemplates (cognitive 31): PurityWildcardInference.markReceiverTemplates has cognitive complexity 31 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 4 (9 pts), ternaries 2 (5 pts), boolean chains 4 (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":"src/Psalm/Internal/Analyzer/PurityWildcardInference.php"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecc2da9d464c1e952284c9923ac91786b035485be3e05adee7d4edbe3f8233c"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAnalyzer.castArrayKeyType (cognitive 31): ArrayAnalyzer.castArrayKeyType has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 5, loops 4 (5 pts), ternaries 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfd7aebee7cca84080eeddceb738fbdaee69e0266a8569fe766ed52cb443e31"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardedClasses.whenResult (cognitive 31): GuardedClasses.whenResult has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 16, if/else 7 (11 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/GuardedClasses.php"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a359ce33c5accbf777eb0e887cd30a22cb8c39d997e18ad9a81b42b94345a6f9"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallPurityAnalyzer.getUnaffectedPropertyGetters (cognitive 31): MethodCallPurityAnalyzer.getUnaffectedPropertyGetters has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 7, loops 4 (6 pts), ternaries 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb13b922c954948f761cea5288abdcbeee50f29caba346a4d13892f9cf2f15b"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleArrayAccessOnArray (cognitive 31): ArrayFetchAnalyzer.handleArrayAccessOnArray has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 3 (12 pts), boolean chains 10, if/else 6 (9 pts) (nesting depth added 12). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8fc63d5a6e063afcc52f0b7d1b7b996822e5192c471a6fe6fa34fe46407d62"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicPropertyFetchAnalyzer.processTaints (cognitive 31): AtomicPropertyFetchAnalyzer.processTaints has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 2 (6 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 17). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dd2b33f1834011226e81c372cdfc76a20428cc6d1cea63a1897508aa4f6f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"FreshObjectFinder.use (cognitive 31): FreshObjectFinder.use has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 25, if/else 5 (6 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/FreshObjectFinder.php"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe12e96c32a338dd99ff73ac5a05b8d43a00980ce9437b98e3e9fe8b0aa128c"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementsAnalyzer.analyzeCheckedTypes (cognitive 31): StatementsAnalyzer.analyzeCheckedTypes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (8 pts), boolean chains 4, error handling 1 (4 pts), loops 1 (nesting depth added 17). 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":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d40c8339e56f8d3ba8e756254c28197e2d4f9536fb97e319893a70634024765"}},{"ruleId":"D2","level":"warning","message":{"text":"CliUtils.parseOptions (cognitive 31): CliUtils.parseOptions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 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":"src/Psalm/Internal/CliUtils.php"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a026af46fb77eaf398d713870f5508895c28a243038fb7831303738c70d91396"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.walk (cognitive 31): TaintFlowResolution.walk has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 12, loops 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3fa5e3b52dc5691759253e3403c3bd2f167d3b54317f3ef4437e5f4b58d441"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockScanner.handleTemplates (cognitive 31): FunctionLikeDocblockScanner.handleTemplates has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (10 pts), error handling 2 (8 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cc871d684ece5b9c5960f252356e3dbbc6dd2cfdab360525fc894e4dd3abfa"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayCombineReturnTypeProvider.getFunctionReturnType (cognitive 31): ArrayCombineReturnTypeProvider.getFunctionReturnType has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 6, loops 2, ternaries 1 (2 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayCombineReturnTypeProvider.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"985a1c7f262f67e023db22e85ecfe8bfd4923aa0aec93506ac809a525bff6744"}},{"ruleId":"D2","level":"warning","message":{"text":"Transpiler.emit (cognitive 30): Transpiler.emit has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 3 (6 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"9016068cf14b903f5ae84282db0a4cda99d81c7984baff334a7a515b31acecbe"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.getParentIssueType (cognitive 30): Config.getParentIssueType has cognitive complexity 30 (threshold 15). Drivers by points: if/else 26 (27 pts), boolean chains 3 (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":"src/Psalm/Config.php"},"region":{"startLine":2425}}}],"partialFingerprints":{"codehealthFindingId/v1":"284955f420de61687e4de4b5d212d5cbf199ec3b4e865bda5c11a6b03486a391"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.visitPreloadedStubFiles (cognitive 30): Config.visitPreloadedStubFiles has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 5, 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":"src/Psalm/Config.php"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4237c5a29064e67f966a8bea2a82f157419fc3ea41606e191f0f951874cd7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.update (cognitive 30): Context.update has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (19 pts), boolean chains 7, ternaries 1 (3 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":"src/Psalm/Context.php"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccaf7b63c4a46a707b9a4fc7f05101d65f3d63e29516320b80818642c72ffbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.removeMutableObjectVars (cognitive 30): Context.removeMutableObjectVars has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 16, if/else 5 (9 pts), loops 4 (5 pts) (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Context.php"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6a3350cc1625b8bf8e542a464efb80ac509741aa6686535b2783cbdd6d1424"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributesAnalyzer.analyze (cognitive 30): AttributesAnalyzer.analyze has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 10, ternaries 2 (5 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/AttributesAnalyzer.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9872d0cdd7b396fe998a3758224cbb7ac4b73ab8c26c001518de3be192a9cbdd"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodComparator.compareMethodSignatureReturnTypes (cognitive 30): MethodComparator.compareMethodSignatureReturnTypes has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 12, ternaries 7 (11 pts), if/else 5 (7 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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a066c98b25072785d362b4ed4cf091e3c474032ed71237c0d168ec7778c2da4f"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopAnalyzer.widenArrayValueIntRanges (cognitive 30): LoopAnalyzer.widenArrayValueIntRanges has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (19 pts), ternaries 2 (5 pts), loops 2 (4 pts), boolean chains 2 (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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e695d14c9b7bcccd897517d2243fabbdf6fe9fbc9b448348aa1b57e491b5d21"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.getArrayAssignmentOffsetType (cognitive 30): ArrayAssignmentAnalyzer.getArrayAssignmentOffsetType has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 10 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a15e8bcbadf0e2070046b76c40ce3af734f8a97af480b38dfa95c520f15d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentAnalyzer.resolveTypeVariablesInCallables (cognitive 30): ArgumentAnalyzer.resolveTypeVariablesInCallables has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 5, loops 2 (5 pts), ternaries 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":2566}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b91a654fc4b0b0cf56c3dbb2751a8369b6efef28ab059416a1b3504b1eff28a"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentMapPopulator.recordArgumentPositions (cognitive 30): ArgumentMapPopulator.recordArgumentPositions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 5 (10 pts), loops 5 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentMapPopulator.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9785eaaaf89b2129f801ee4c9bbb6810fa6e4d90e0c4351f787006070f48aa1b"}},{"ruleId":"D2","level":"warning","message":{"text":"InstanceofAnalyzer.analyze (cognitive 30): InstanceofAnalyzer.analyze has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 2 (8 pts), boolean chains 3 (nesting depth added 17). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/InstanceofAnalyzer.php"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e3c232f27ee9922a6e42799d5becc243f3ec3aa937a8dd4bac559b69d7d6f6"}},{"ruleId":"D2","level":"warning","message":{"text":"NullsafeAnalyzer.analyze (cognitive 30): NullsafeAnalyzer.analyze has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 14, if/else 10 (11 pts), ternaries 4 (5 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/NullsafeAnalyzer.php"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d5f4b4d923d912f51675059785ef3ccb0b2090dfe38dedcd447e15e3ea8846"}},{"ruleId":"D2","level":"warning","message":{"text":"Cache.consolidate (cognitive 30): Cache.consolidate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, ternaries 3 (5 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cache.php"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2058477e3827c97943038de3ec61e313fc4d78eb0a856dccff7a9505fc4c0f4"}},{"ruleId":"D2","level":"warning","message":{"text":"CliUtils.requireAutoloaders (cognitive 30): CliUtils.requireAutoloaders has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 5, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/CliUtils.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0496a9d5da571ac0d029388f3882faf9c89dc904f1d6dfbbd3645298153315d"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFlowGraph.shouldIgnoreFetch (cognitive 30): DataFlowGraph.shouldIgnoreFetch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (25 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/DataFlowGraph.php"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf5671d8b0406e0a8177b49ef51499b47364801f66f89faae6e01bd764c3652"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationLevelResolver.resolveLevels (cognitive 30): MutationLevelResolver.resolveLevels has cognitive complexity 30 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 4 (10 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 17). 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":"src/Psalm/Internal/Codebase/MutationLevelResolver.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"91332de7523b2cc1bb267f944da14746bd9af7cd6a6ff327fbf1aba493b4d513"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.takeEdge (cognitive 30): TaintFlowResolution.takeEdge has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 11 (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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c97d51773a79b928a4423a09f328a5f8c91913a16cf485943de258f447413c"}},{"ruleId":"D2","level":"warning","message":{"text":"UnshippedCode.fromContents (cognitive 30): UnshippedCode.fromContents has cognitive complexity 30 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 4 (9 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/UnshippedCode.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd6c5b8efce47ee225f2740924cbc9f62e2b9dae89eef0ac7d764c371f931dd"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtocolStreamReader.readMessages (cognitive 30): ProtocolStreamReader.readMessages has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (23 pts), error handling 1 (4 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/LanguageServer/ProtocolStreamReader.php"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6790a2c569102e093b15e3a128ace9c8bbb1eae8453fdf1a6ad2131983637e30"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeNodeScanner.getTrivialConstructorCapabilities (cognitive 30): FunctionLikeNodeScanner.getTrivialConstructorCapabilities has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 16, if/else 5 (9 pts), ternaries 2 (3 pts), loops 2 (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"040545dd9ad075cdaef3be2483a52023368a9ea68d23d701d1f8b30c3861aaa3"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeNodeScanner.inferPropertyTypeFromConstructor (cognitive 30): FunctionLikeNodeScanner.inferPropertyTypeFromConstructor has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (12 pts), ternaries 1 (3 pts), loops 2 (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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc6bc240e403b087c93272132db6e5aa68c33d5b091ad48c1ce7d649e57064c"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeNodeScanner.addParams (cognitive 30): FunctionLikeNodeScanner.addParams has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (12 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c2258fd4f77eea80308520cdab492496086ae8aaf0695a5d11b3e7b0abe476"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureReturnTypeProvider.getMethodReturnType (cognitive 30): ClosureReturnTypeProvider.getMethodReturnType has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 3 (6 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ClosureReturnTypeProvider.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"374506254c588c6480a869dd67d56413ea0b11cae0eaaa0973896f61025cec7c"}},{"ruleId":"D2","level":"warning","message":{"text":"DirnameReturnTypeProvider.getFunctionReturnType (cognitive 30): DirnameReturnTypeProvider.getFunctionReturnType has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/DirnameReturnTypeProvider.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf1f1ac4f08f9d1cc73e465a358ab30d44292ef8b8e61b273cc074277c44f07"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileIsGreaterThan (cognitive 30): SimpleAssertionReconciler.reconcileIsGreaterThan has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 9, loops 1, ternaries 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e56793a6f2c4be420c2e898a1401a7f808dc3a7a69b333358616b08d14a8e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileArray (cognitive 30): SimpleAssertionReconciler.reconcileArray has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e85d8887bafd8ebb6274090e9097aa4cf5f205eb3f6d8f3aba61b2df4ad5abf"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileArray (cognitive 30): SimpleNegatedAssertionReconciler.reconcileArray has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"454af7cbf21b6f1555217fcd48458630154a17a9106a583b501fca53574d1a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStandinTypeReplacer.replace (cognitive 30): TemplateStandinTypeReplacer.replace has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"72efbaefe5633737c25ae716f32767b0fdb549d664652e37a1de78e2254a051b"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeAnalyzer.findAssignments (cognitive 29): FunctionLikeAnalyzer.findAssignments has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 11, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b6bf46d2c01ede16a41530534b0d8e97a477dfdcea18a3a464e1eef1930123"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopAnalyzer.addAlwaysWrittenVarIds (cognitive 29): LoopAnalyzer.addAlwaysWrittenVarIds has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 16, if/else 5 (11 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70b9ab5eadf8dced7d038c4813f6533cef29091ff48161071f193045b7be451"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.scrapeInequalityAssertions (cognitive 29): AssertionFinder.scrapeInequalityAssertions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb29f7d28b8b3c026151202abb29361de170b97c5dd25795bb0b1bc0fc900de"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryOpAnalyzer.checkForImpureEqualityComparison (cognitive 29): BinaryOpAnalyzer.checkForImpureEqualityComparison has cognitive complexity 29 (threshold 15). Drivers by points: error handling 2 (8 pts), ternaries 2 (8 pts), if/else 3 (7 pts), loops 2 (4 pts), boolean chains 2 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b796c92fb16bef1fd897f301d066fd73e3254bbb3c85ed666c70a31ee71d101"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingMethodCallHandler.handleMagicMethod (cognitive 29): MissingMethodCallHandler.handleMagicMethod has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 3 (7 pts), boolean chains 5 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5a08692ad97ef892f19d2f61eb3b4081a1453a08e7cb0659cd718c3fe55994"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsetAnalyzer.analyze (cognitive 29): UnsetAnalyzer.analyze has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 7, ternaries 2 (6 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/UnsetAnalyzer.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ceff986e61fa735a8396078209146a043061b4f6bfd884ae59fde5e8a55d19"}},{"ruleId":"D2","level":"warning","message":{"text":"Reflection.registerClass (cognitive 29): Reflection.registerClass has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 5, boolean chains 2, error handling 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Reflection.php"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5e3d335083629ffefe1180b8df8ae2f797db2d46627e49355ba9fa22c51ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.composeOpenAssignments (cognitive 29): TaintFlowResolution.composeOpenAssignments has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 6 (9 pts), boolean chains 7, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1984d647bad62377398792cbccaa1c81edf53bcb91c1c5f98701fcd98cc2f99"}},{"ruleId":"D2","level":"warning","message":{"text":"ParamReplacementVisitor.enterNode (cognitive 29): ParamReplacementVisitor.enterNode has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/ParamReplacementVisitor.php"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2252a6167ab220a486f680fe456c01d3098754562a9225f5c3bdd82dfe876f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeNodeScanner.getTypeAliasesFromCommentLines (cognitive 29): ClassLikeNodeScanner.getTypeAliasesFromCommentLines has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (8 pts), boolean chains 5, error handling 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7d1e17c4a091eb324bde8ff358f8ec543ea3102bd46f49c10776588b613b71"}},{"ruleId":"D2","level":"warning","message":{"text":"MbInternalEncodingReturnTypeProvider.getFunctionReturnType (cognitive 29): MbInternalEncodingReturnTypeProvider.getFunctionReturnType has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 4, 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/MbInternalEncodingReturnTypeProvider.php"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48b703367759334f156b978d20d2caddb1b0c40cafb86d19c54aa35469c36d0"}},{"ruleId":"D2","level":"warning","message":{"text":"StubsGenerator.getExpressionFromType (cognitive 29): StubsGenerator.getExpressionFromType has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Stubs/Generator/StubsGenerator.php"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d867b18aa6a0dd8f5ecabe4fd2f1bd0dde9f98df5d8ea201e64bbaa37f8ac96"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileIsLessThan (cognitive 29): SimpleAssertionReconciler.reconcileIsLessThan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 8, loops 1, ternaries 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"990c81c3ead0b54738be58734e4442b91aedd3a0420ce8ffa0b8f69254b407e9"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileCallable (cognitive 29): SimpleAssertionReconciler.reconcileCallable has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 11, 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2877}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5310146854d728bcd27fdf0248d21d162f0a496fa85f9a9abcd4e4fd34f0c12"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableTrait.toNamespacedString (cognitive 29): CallableTrait.toNamespacedString has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 7 (19 pts), if/else 5 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/CallableTrait.php"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"146eb27917a601092ecbbf25924fe25fa4dfcf2204f3b08694cc33ea0ed5a772"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionTrait.equals (cognitive 29): UnionTrait.equals has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 10, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb54f70e8634c837dc8458483383fa867888f25079c379c8fa95e80c0b70d1c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.getLibraryStubs (cognitive 28): Config.getLibraryStubs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (9 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":3036}}}],"partialFingerprints":{"codehealthFindingId/v1":"80127f6c9e68cc7dde9f8a6b3bda4fa37fc7a4d207ff67210977735e2cabb62f"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeachAnalyzer.getKeysWrittenToTheItem (cognitive 28): ForeachAnalyzer.getKeysWrittenToTheItem has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad75b44cd4c607c8cbaddbbf5f5b9a208ba0c936026d1316c6505d6b8d53f17a"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopAnalyzer.widenIntRanges (cognitive 28): LoopAnalyzer.widenIntRanges has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (10 pts), ternaries 5 (7 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"408ef19e753410864c96da3ce25cc0577103825df56f9dfba87172728de7b9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.checkMethodParamReferences (cognitive 28): ClassLikes.checkMethodParamReferences has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afcffa211cf98c2290f179161939e2eb4b6bde6a8c7c0f2f1196381432097b6"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiverPropertyTaints.taintWrites (cognitive 28): ReceiverPropertyTaints.taintWrites has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (8 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf954936ca2a40bf7168d92861f60b432f4f3dfddd0298921260de8c896fa251"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.passesFetch (cognitive 28): TaintFlowResolution.passesFetch has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 13, if/else 10 (13 pts), ternaries 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":3092}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01e309c51bdbdb96da81cba91564de276126252f961d9a9115337135b3854f3"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.reportFlow (cognitive 28): TaintFlowResolution.reportFlow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 3 (9 pts), loops 2 (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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":3921}}}],"partialFingerprints":{"codehealthFindingId/v1":"499ef11bf587af43a1ac1e754ac80bc33ec11a4c6c536e3e342e045d73d430b6"}},{"ruleId":"D2","level":"warning","message":{"text":"StringStartScanner.getCallArguments (cognitive 28): StringStartScanner.getCallArguments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (6 pts), ternaries 2 (6 pts), boolean chains 2 (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":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27daf2510e8084a07f0305360d9fc60ef12d1819662e4fde52615d1fc4ae636"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileBool (cognitive 28): SimpleNegatedAssertionReconciler.reconcileBool has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"376eb28d370285ec9eb8d276134a3acd88af0d3a6560faf577fac76e0f7e42ef"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.intersectScalarTypes (cognitive 28): TypeParser.intersectScalarTypes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 10, ternaries 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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"47384115c47382554510df9ceeb83d7dd7e7d3b767ecc3d0e5ade6bdb093923c"}},{"ruleId":"D2","level":"warning","message":{"text":"Atomic.isTruthy (cognitive 28): Atomic.isTruthy has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18, boolean chains 10. 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":"src/Psalm/Type/Atomic.php"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"e866d0b8baed5893810fd4cdce2fcf1fcdac6aacbf970fd1e5f9dd4589e13732"}},{"ruleId":"D2","level":"warning","message":{"text":"FileAnalyzer.populateCheckers (cognitive 27): FileAnalyzer.populateCheckers has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FileAnalyzer.php"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89c35b719f12b43609089f294b7b50e0e1a9979a90036615ab9cb974ad5738d"}},{"ruleId":"D2","level":"warning","message":{"text":"DoAnalyzer.getUnsureBounds (cognitive 27): DoAnalyzer.getUnsureBounds has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 2 (6 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"63eb33b66240ed170cad4fe1cf1029de6819782cb22a7f804c8aef354e787e19"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeachAnalyzer.getIterationCapabilities (cognitive 27): ForeachAnalyzer.getIterationCapabilities has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"88abb3f2ebffba764fe4fcfaecb91cacda2d35402c37d8f83b4dd5a1bc1e773d"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getNullInequalityAssertions (cognitive 27): AssertionFinder.getNullInequalityAssertions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 3 (4 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa109786f16b4bad1eddc62b42bf894d683cfa0e3ec439070e816dd907816d1"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialApplicationAnalyzer.captureReference (cognitive 27): PartialApplicationAnalyzer.captureReference has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, loops 3 (5 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b73bc92f4f4c828d871f23b2959a3cd9754a64ca9e5c8516df591ba47ed2ed"}},{"ruleId":"D2","level":"warning","message":{"text":"ExistingAtomicStaticCallAnalyzer.collectClassTemplateParams (cognitive 27): ExistingAtomicStaticCallAnalyzer.collectClassTemplateParams has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (9 pts), boolean chains 7 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81d5589189057750e030dbce79f7b9980f56fa3a97bf2351f0b2430f33f6574"}},{"ruleId":"D2","level":"warning","message":{"text":"MixinLookup.find (cognitive 27): MixinLookup.find has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (5 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/MixinLookup.php"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7314e8b0b9aa5d18d7f34e10ebb1be00bb40f76a8e0c6688afdcb9c7ae9a625d"}},{"ruleId":"D2","level":"warning","message":{"text":"Populator.registerMixinDependencies (cognitive 27): Populator.registerMixinDependencies has cognitive complexity 27 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 4 (10 pts), error handling 1 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c205bb5f31161ae32954266f419730b921c5980dce8e28ce8475e9467fbd0077"}},{"ruleId":"D2","level":"warning","message":{"text":"Properties.getPropertyType (cognitive 27): Properties.getPropertyType has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Properties.php"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad666e8a01ce693838679b1fdcf04bc206dcd1d46d286f381b05a26ded3f548f"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.prepareGraph (cognitive 27): TaintFlowResolution.prepareGraph has cognitive complexity 27 (threshold 15). Drivers by points: loops 11 (15 pts), if/else 4 (11 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"293cd5ea052f725e96d23a4ff65f3e0520d5e953c58374dd9fb593f961ed8369"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFillKeysReturnTypeProvider.getFunctionReturnType (cognitive 27): ArrayFillKeysReturnTypeProvider.getFunctionReturnType has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, loops 1 (2 pts), ternaries 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFillKeysReturnTypeProvider.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6382dac7a1deb571e9b5313c64ff611eb7f149f6b6a29f8f06a7fcdd9fb0b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.handleLiteralEquality (cognitive 27): AssertionReconciler.handleLiteralEquality has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (6 pts), boolean chains 5 (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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fbb66449431451a7375693d6827629b0d99ff4248cde7c99b65c80842128f6"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileIsLessThanOrEqualTo (cognitive 27): SimpleNegatedAssertionReconciler.reconcileIsLessThanOrEqualTo has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 7, 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. This shape REPEATS in the file: one other method here (SimpleNegatedAssertionReconciler.reconcileIsGreaterThanOrEqualTo) 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"87db7a4cd1377c99ea55c67172bb6076569803c31c6f17fd6efd7c35df3b8c82"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileIsGreaterThanOrEqualTo (cognitive 27): SimpleNegatedAssertionReconciler.reconcileIsGreaterThanOrEqualTo has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 7, 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. This shape REPEATS in the file: one other method here (SimpleNegatedAssertionReconciler.reconcileIsLessThanOrEqualTo) 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c52180be820c544bdd8a7d4e8d937bfb319e12ff3bcd9c36e6869e89c805a34"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeLocalizer.enterNode (cognitive 27): TypeLocalizer.enterNode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (5 pts), boolean chains 3 (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":"src/Psalm/Internal/TypeVisitor/TypeLocalizer.php"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecf00e5c19518bade5756179749cb9567026366da1b68087f63f31953b1784e"}},{"ruleId":"D2","level":"warning","message":{"text":"TKeyedArray.getId (cognitive 27): TKeyedArray.getId has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 6 (11 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"de71cafc7a5cfb5ea6e4b9c484b23307d57a53771b0f6f0d0c0057e1f7f70070"}},{"ruleId":"D2","level":"warning","message":{"text":"Transpiler.nativeType (cognitive 26): Transpiler.nativeType has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts), ternaries 4 (5 pts), boolean chains 2, match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84417bf2101da58a1004b2e4ea7e15b7224b6ae7a3bd938552491ea4d1c39d9"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_callmap_utils.normalizeParameters (cognitive 26): gen_callmap_utils.normalizeParameters has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/stubs/gen_callmap_utils.php"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"914571933bf350bb650fc4313b2215555029d733b443b008dce0693968803d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeachAnalyzer.mayPassByReference (cognitive 26): ForeachAnalyzer.mayPassByReference has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"8769244a998f48aad991c7a004b3c61ae4e2601cc993261476e945ffcdcbeb42"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.getTaintsRemovedBySprintfFormats (cognitive 26): FunctionCallReturnTypeFetcher.getTaintsRemovedBySprintfFormats has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 2 (5 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"176cd204a8dd8fc34e06076405eb49c9ef2f82f6c1a7fb31a129ea4d3aef735c"}},{"ruleId":"D2","level":"warning","message":{"text":"CallAnalyzer.resolveStaticPropertyAssertionClasses (cognitive 26): CallAnalyzer.resolveStaticPropertyAssertionClasses has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), ternaries 2 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aba5e7e94a19c337339465c5a3e61c8c24547bb4fa7d4fe0dfe592bef618765"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.castInvalidOffsetTypes (cognitive 26): ArrayFetchAnalyzer.castInvalidOffsetTypes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (8 pts), loops 2 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15f8568e5121aeca96df60269f4c3414b8139f481e8f5776a247d49635e44c3"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintStore.taintCall (cognitive 26): TaintStore.taintCall has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 4 (7 pts), boolean chains 2 (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":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d78712fa6532b551f4f3509b89e17c70043caed555fd10db3c0dd9e1f9e643a"}},{"ruleId":"D2","level":"warning","message":{"text":"FileDiffer.getDiff (cognitive 26): FileDiffer.getDiff has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/FileDiffer.php"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b02a5d83be31dc362b1fbb91835b741ab973f31b8838ecd0193f14a0c954f9"}},{"ruleId":"D2","level":"warning","message":{"text":"StringStartScanner.getReturnStart (cognitive 26): StringStartScanner.getReturnStart has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, loops 3 (5 pts), ternaries 2 (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":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"163c72a8f624b650653eaecd06690fc0bd9aa937c6734d956bf8831f5d2bd520"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeStringComparator.isContainedBy (cognitive 26): ClassLikeStringComparator.isContainedBy has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (9 pts), ternaries 4 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/ClassLikeStringComparator.php"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9dae095dd8f5dcc173ed7de6abe6a7cd9d6e17d9d9700e8240756077d21d35"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreeCreator.handleIsOrAs (cognitive 26): ParseTreeCreator.handleIsOrAs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 8, ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af82932fecda71c61923f1c74bd654ba2d4f2cba4d170c5f4781e40371e0b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileInt (cognitive 26): SimpleAssertionReconciler.reconcileInt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 6, 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ca1e15522bf132e0b67c9b6bb551055404e50d81956cc1cc4ecb1f10e4ef9a"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.getListOfSealedShape (cognitive 26): SimpleAssertionReconciler.getListOfSealedShape has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3, boolean chains 1, ternaries 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2527}}}],"partialFingerprints":{"codehealthFindingId/v1":"8398ba478c2a14bfcbb320313e7b950403ff1d8399fcb96a8dc4a591bf15bea0"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileNumeric (cognitive 26): SimpleNegatedAssertionReconciler.reconcileNumeric has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b5e8cd0b4a9159a9bd5b6777b42fea3244f4c1c0c2d8793cf0a309b83a15bf"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCombiner.combineDecimalIntString (cognitive 26): TypeCombiner.combineDecimalIntString has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7, ternaries 2 (5 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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5117f20e6f72ad3adeb8ba2eacb424b4e040c98fa5c85f6432d82473157d8f"}},{"ruleId":"D2","level":"warning","message":{"text":"Atomic.visitMutable (cognitive 26): Atomic.visitMutable has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic.php"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"270108574dbcf16ef5b101224269f39ae5660f6c5dfb141912de39b0ddf3dd8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.resetMutatedStaticProperties (cognitive 25): Context.resetMutatedStaticProperties has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (6 pts), loops 4 (5 pts), boolean chains 3 (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":"src/Psalm/Context.php"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b9c2ece72da74ba15b3a51151b89f13bfaccd997f3b12c032aeb81ebd5045f"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionAnalyzer.analyzeStatement (cognitive 25): FunctionAnalyzer.analyzeStatement has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (4 pts), boolean chains 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":"src/Psalm/Internal/Analyzer/FunctionAnalyzer.php"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c003e443d439e0c6b197c5008dd6084121dc3732efbf0912ec04136ed3a3ec"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodComparator.comparePseudoMethod (cognitive 25): MethodComparator.comparePseudoMethod has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 4 (7 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f330bbb6ec849292d7d166c9513bf11e0e928e408c9bfc79be88804b75888c10"}},{"ruleId":"D2","level":"warning","message":{"text":"NamespaceAnalyzer.collectAnalyzableInformation (cognitive 25): NamespaceAnalyzer.collectAnalyzableInformation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/NamespaceAnalyzer.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e291f84f8fad71ba25ec2e798667bf1d5a7423dd6b9611e4c7efe0cffa6688c"}},{"ruleId":"D2","level":"warning","message":{"text":"PurityWildcardInference.findParamPath (cognitive 25): PurityWildcardInference.findParamPath has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 6 (9 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/PurityWildcardInference.php"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b77ddb9c811d40976d855ae3de1f6bb77ab83d284a7a34d886fef83d489d550"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeachAnalyzer.mayWriteTheArrayOtherwise (cognitive 25): ForeachAnalyzer.mayWriteTheArrayOtherwise has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 14, if/else 6 (9 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07eb14c8177625bb2c473e73a38103ba8523726b878cec14001863849956b8f"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopAnalyzer.applyPreConditionToLoopContext (cognitive 25): LoopAnalyzer.applyPreConditionToLoopContext has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (7 pts), boolean chains 4 (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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc6eec38c56dff275b742fc04ba1d201f015b7b3d10a81bc931ff48fcd89dca"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.taintCallableParamCall (cognitive 25): FunctionCallReturnTypeFetcher.taintCallableParamCall has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"e475ca77a2035178cb7f2f6eb588580231b18e3334d39301053a3fdfb6d474a8"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.taintCallablePassedToParam (cognitive 25): FunctionCallReturnTypeFetcher.taintCallablePassedToParam has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"633e4bddb923dd13b6852c3ed993811a2f371306a641eb14e2856e0bdacc848a"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticCallAnalyzer.analyzeParentPropertyHookCall (cognitive 25): StaticCallAnalyzer.analyzeParentPropertyHookCall has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (9 pts), ternaries 4, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f12f0dfcb1c8456af9691d485659a77cc05361bb626368991349d231424d255"}},{"ruleId":"D2","level":"warning","message":{"text":"CallAnalyzer.getFunctionIdsFromCallableArg (cognitive 25): CallAnalyzer.getFunctionIdsFromCallableArg has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 12 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7aeb87306f5311e28c1890d4bfc1798ca9c8488561ec840bc31b90c65ddd70b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassConstAnalyzer.analyze (cognitive 25): ClassConstAnalyzer.analyze has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 4, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc82721b9a9df3fb85e2e63181b8f58ede9929a1891cb77fc2497dbe238c88d6"}},{"ruleId":"D2","level":"warning","message":{"text":"MagicConstAnalyzer.analyze (cognitive 25): MagicConstAnalyzer.analyze has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/MagicConstAnalyzer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e642396643b25a6e91903ecc7c7038273a5a35a0e07c3766b4fabea5f0a10e"}},{"ruleId":"D2","level":"warning","message":{"text":"Psalm.restart (cognitive 25): Psalm.restart has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, loops 1 (3 pts), ternaries 2 (3 pts), error handling 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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cdc3c5b213c13e0e9012b5e90ec07da965231117bd8f6107d055041c64599c"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeNodeScanner.nodesUseProperty (cognitive 25): ClassLikeNodeScanner.nodesUseProperty has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f2158713240cecb790a01a709b00c4f580cb2d2acd4c5b6e308d61e63a3565"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionResolver.fileDeclaresKind (cognitive 25): ExpressionResolver.fileDeclaresKind has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 8, ternaries 3 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e4f113bb1050261bc03193f67079201034a42c82f49e9d789962377d21fd29"}},{"ruleId":"D2","level":"warning","message":{"text":"StringStartScanner.getStart (cognitive 25): StringStartScanner.getStart has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, ternaries 2 (5 pts), loops 1 (2 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":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"8565df345ce51c08e41c590337b856099fb817a6eadac956aa0b8a90f3915a73"}},{"ruleId":"D2","level":"warning","message":{"text":"FileReferenceProvider.loadReferenceCache (cognitive 25): FileReferenceProvider.loadReferenceCache has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/FileReferenceProvider.php"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d61a8bf20105db0646633b5c4fe5770e8391ab8467acc43a2febdce535df0aa"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.canBeIntersected (cognitive 25): AssertionReconciler.canBeIntersected has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 8, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":2463}}}],"partialFingerprints":{"codehealthFindingId/v1":"a019030c6e18e921d70030d784d5884af813a64c93afe1be2aded78018576e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileInt (cognitive 25): SimpleNegatedAssertionReconciler.reconcileInt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f13d4844eaddb3d264c9e7f9c8ca61097018df406b9fd6754a4991a0d0cdd8"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileFloat (cognitive 25): SimpleNegatedAssertionReconciler.reconcileFloat has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d179fe7df6e3f9cec9c0e77b464576dd6b6220717eca7a5e4c0b570db7a8fe"}},{"ruleId":"D2","level":"warning","message":{"text":"LongProgress.taskDone (cognitive 25): LongProgress.taskDone has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Progress/LongProgress.php"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c77292b1bfdfc7d54ee9d51892701ee11118e2cbac737d7d21c3b2e99f53abf"}},{"ruleId":"D2","level":"warning","message":{"text":"TKeyedArray.toNamespacedString (cognitive 25): TKeyedArray.toNamespacedString has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 4 (7 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e4d1dac079edfbbc4772a00fd829e3154ebebc19496d235cd64f34167694d1"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionTrait.getNonDefaultProperties (cognitive 25): UnionTrait.getNonDefaultProperties has cognitive complexity 25 (threshold 15). Drivers by points: if/else 25. 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":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c177d4d2e8c43b8de7031765778572efec2ebddf30b2d5d3e0c1dac2dd7e30"}},{"ruleId":"D2","level":"warning","message":{"text":"FileFilter.loadFromXMLElement (cognitive 24): FileFilter.loadFromXMLElement has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 8 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config/FileFilter.php"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f934f5ed6c6061bcbe1e98563394895088b81d5d3e4d39d2b94e419c6c1f7d92"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.taintCallableParams (cognitive 24): FunctionCallReturnTypeFetcher.taintCallableParams has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b534543f1170dc0e4f5d774c70cc23bf7cae771eb317d2a812b490375ef0ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallPurityAnalyzer.resetWrittenProperties (cognitive 24): MethodCallPurityAnalyzer.resetWrittenProperties has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aecf140fa2f971dc7dd1288f477f0903171ebfeb82e8e38afdf1579dde598c7"}},{"ruleId":"D2","level":"warning","message":{"text":"NewAnalyzer.taintNewObject (cognitive 24): NewAnalyzer.taintNewObject has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, if/else 8, ternaries 5 (7 pts) (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"35579de194b567264ae8ca4c663c5411f860dc06522a75f2ada31e686a5d4d46"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstFetchAnalyzer.getConstType (cognitive 24): ConstFetchAnalyzer.getConstType has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ConstFetchAnalyzer.php"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde04588680739681592f68b60bb5c6b892a265b53a5f2de3cd2bfcbf1d947f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Clause.__toString (cognitive 24): Clause.__toString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Clause.php"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"976e2500d12122b7849c592ef30892a98c19de7d462470fce0d8c5dfe036f5f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Review.run (cognitive 24): Review.run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4 (5 pts), boolean chains 3, loops 2, match/switch 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":"src/Psalm/Internal/Cli/Review.php"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac20b1b80f2bba1ebcef3922c3c60117a30a4fa93bd1dfe78f08d2c267964f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.getFinalInsertionPosition (cognitive 24): ClassLikes.getFinalInsertionPosition has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 7, ternaries 2, 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"579b4cd8a9eefa65e54ba5970ee2346f255c42593bb59fa06bf3aaaa75c05ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeUseGraph.loadCacheData (cognitive 24): CodeUseGraph.loadCacheData has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 5 (9 pts) (nesting depth added 14). 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":"src/Psalm/Internal/Codebase/CodeUseGraph.php"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"101e50c4a51b842c99faa4263894fc5684318c7818009933e6037f752e38b4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.convertClassesToFilePaths (cognitive 24): Scanner.convertClassesToFilePaths has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (22 pts), boolean chains 1, loops 1 (nesting depth added 15). 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":"src/Psalm/Internal/Codebase/Scanner.php"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccdf8c05d25cd5cd9726b799b99f5ca57968d262e5bb7ebdf8b5c71f3410f75"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowAnnotation.parse (cognitive 24): TaintFlowAnnotation.parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 8 (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":"src/Psalm/Internal/Codebase/TaintFlowAnnotation.php"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"46708d1203e6e3da830076d84c4212685c3b44b697cb0698a5a81ff83138bf93"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockParser.extractParams (cognitive 24): FunctionLikeDocblockParser.extractParams has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 7, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c84fd64fc0c6f054042e0784ef9d4723ab2ff023005a5acdf017851abb186a"}},{"ruleId":"D2","level":"warning","message":{"text":"ReflectorVisitor.recordThisPropertyMutation (cognitive 24): ReflectorVisitor.recordThisPropertyMutation has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (10 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"906d7474b5f4658d7d3783b88cd37cf07b311dd2786feac79a8b294296b936fb"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayReplaceRecursiveReturnTypeProvider.replaceArray (cognitive 24): ArrayReplaceRecursiveReturnTypeProvider.replaceArray has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (5 pts), loops 3 (4 pts), boolean chains 3 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReplaceRecursiveReturnTypeProvider.php"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1977cf2f02f0a23ecca49ed5b0ae9628b0413bc4ef61a20beef42214505fb15a"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileString (cognitive 24): SimpleAssertionReconciler.reconcileString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 7, 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cd05cff81c78737724dfa9d2d412f60003dd4bc4bfcf32b4336fb0765f93a9"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileObject (cognitive 24): SimpleAssertionReconciler.reconcileObject has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6fb2bd2375d8cd09ee6ea5592cfc4c013af3459d625b6ba0251bfa8e44893e"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileScalar (cognitive 24): SimpleNegatedAssertionReconciler.reconcileScalar has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab513a76ad6e2a2ea623143be91db48ab99c50e0e2c6f19e0042442bce39b680"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileObject (cognitive 24): SimpleNegatedAssertionReconciler.reconcileObject has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"debdbb69d92267b78775aa26dcfddd287c5d0d3e0c815d5dc0a0cc149418157c"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileString (cognitive 24): SimpleNegatedAssertionReconciler.reconcileString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84523f47390615c01fa68b3b571bd49dc872fe2df2b7cc89415d020a247a3c7"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeExpander.expandKeyOfValueOf (cognitive 24): TypeExpander.expandKeyOfValueOf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71435bd0b3efe710ca74cda958633fe5af4ad8eaab6e8f599e49be78c8e948e"}},{"ruleId":"D2","level":"warning","message":{"text":"IssueBuffer.add (cognitive 24): IssueBuffer.add has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, ternaries 3 (5 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":"src/Psalm/IssueBuffer.php"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b6327007581491ed4cc632dd61a1a7bc49058a64472a6be21bc6a54372cd0b"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_callmap_utils.assertEntryParameters (cognitive 23): gen_callmap_utils.assertEntryParameters has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/stubs/gen_callmap_utils.php"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15712cddf992c4fa88867757e8914d6bf72e659748a67f6d6fa13221f5a3d10"}},{"ruleId":"D2","level":"warning","message":{"text":"Codebase.getSignatureInformation (cognitive 23): Codebase.getSignatureInformation has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b821019e2da6eccc613a58d8ce4f50d0862fb8b6932ff78a213d3e1d47231a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.reportIssueInFile (cognitive 23): Config.reportIssueInFile has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 7 (8 pts), error handling 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e3ad87967c1c39f2a94a2c9186e2066ff3eee899421fa73e3bf3b3785e345d"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentAnalyzer.decorateVarDocblockComment (cognitive 23): CommentAnalyzer.decorateVarDocblockComment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (7 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/CommentAnalyzer.php"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8f2b435598b4fb3a39a2b62ae631de2018e1fc76529eb8b720c22231081212"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopAnalyzer.setVarsAssignedInCondition (cognitive 23): LoopAnalyzer.setVarsAssignedInCondition has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 11 (nesting depth added 7). 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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7844b4bfb995d745d76aaa4acce00d3e5c9b32c6e35bd5d3884785e0836c72"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getTypedValueInequalityAssertions (cognitive 23): AssertionFinder.getTypedValueInequalityAssertions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, loops 1 (3 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"69aeeca69d7a18cdf5d163db7bba5d6ca5b2e504202330bb434087bded39260b"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getComparedVarId (cognitive 23): AssertionFinder.getComparedVarId has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 5 (7 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4027}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedb2f9607be2f5ccd3024425554d755a077c79f395620aa5c8c5d1aa19729dc"}},{"ruleId":"D2","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.trackPropertyImpurity (cognitive 23): InstancePropertyAssignmentAnalyzer.trackPropertyImpurity has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, ternaries 4 (8 pts), if/else 3 (4 pts), match/switch 1 (2 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fa78de0b2dde9aab419e6799e166d3aff53f1af52ca853af6afaf804fa02de"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAnalyzer.assignTypeFromVarDocblock (cognitive 23): AssignmentAnalyzer.assignTypeFromVarDocblock has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, if/else 8 (9 pts), error handling 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a86f4fb91ac1a77ca9d26c0d840b512c867b4e44fc092bf4088e0247441f51"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryOpAnalyzer.addDataFlow (cognitive 23): BinaryOpAnalyzer.addDataFlow has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, loops 3 (6 pts), ternaries 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c62cf85e85b5a3d585c37da170ebd0eaf433ab534504f3082b983557b3abd1"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentsAnalyzer.getProvisionalTemplateResultForFunctionLike (cognitive 23): ArgumentsAnalyzer.getProvisionalTemplateResultForFunctionLike has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc1b573fad9f8af0f98a48da42051d50e1d99f0bf106d22c91df3b4c789cb7e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFunctionArgumentsAnalyzer.checkArgumentsMatch (cognitive 23): ArrayFunctionArgumentsAnalyzer.checkArgumentsMatch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (6 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1465297ac3ca73b32a89a3f152ce6670e4ca124178489c95059d44087d77ed31"}},{"ruleId":"D2","level":"warning","message":{"text":"CallPurityResolver.resolveMethodTemplateType (cognitive 23): CallPurityResolver.resolveMethodTemplateType has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (10 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/CallPurityResolver.php"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90c3a4e47c89ecb61d8474b46b9c8da423cb3f4a370db82e566c5922b44f591"}},{"ruleId":"D2","level":"warning","message":{"text":"NewAnalyzer.childConstructorsAcceptArgs (cognitive 23): NewAnalyzer.childConstructorsAcceptArgs has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 3 (8 pts), boolean chains 6, if/else 3 (6 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fab34d77202df3c91c400a63310672ec4442a37b279efc8e98156ac8e353eb"}},{"ruleId":"D2","level":"warning","message":{"text":"NewAnalyzer.taintUsingConstructorFlows (cognitive 23): NewAnalyzer.taintUsingConstructorFlows has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd344acb323f2338ec0debfed634c8a1a9ac205594053dbf66650f575a19326"}},{"ruleId":"D2","level":"warning","message":{"text":"CastAnalyzer.castScalarToString (cognitive 23): CastAnalyzer.castScalarToString has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, loops 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5c6a95112b1efa33ea99171ebadbb8f91780be5636856855416892e94f3149"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneAnalyzer.analyzeFuncCall (cognitive 23): CloneAnalyzer.analyzeFuncCall has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 2, ternaries 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CloneAnalyzer.php"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa4437d107e4bf6f008306c69bb46fa1d6231d454f7bd68761c386d7446b022"}},{"ruleId":"D2","level":"warning","message":{"text":"IncDecExpressionAnalyzer.analyze (cognitive 23): IncDecExpressionAnalyzer.analyze has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 8, ternaries 1 (2 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":"src/Psalm/Internal/Analyzer/Statements/Expression/IncDecExpressionAnalyzer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"15290db6f96e334c06c68e235904aae3e041a0dd626bd4d622e3e2a309509abb"}},{"ruleId":"D2","level":"warning","message":{"text":"Psalm.generateConfig (cognitive 23): Psalm.generateConfig has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 9, error handling 1 (2 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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"289014b5d959a310992301186c7fbc4083381a2985767d2e29dbb1da52659dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifiedDiffRenderer.colorize (cognitive 23): UnifiedDiffRenderer.colorize has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 2 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). 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":"src/Psalm/Internal/FileManipulation/UnifiedDiffRenderer.php"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40e536a0d8d542a7fa1a8d404663964478fde7e2196bc708b71fe486f74d3e8"}},{"ruleId":"D2","level":"warning","message":{"text":"LanguageServer.emitVersionedIssues (cognitive 23): LanguageServer.emitVersionedIssues has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/LanguageServer/LanguageServer.php"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"a531aec049da194586c387538723dbb2e3b292a365fae9ade5048ccb02661577"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckTrivialExprVisitor.checkNonTrivialExpr (cognitive 23): CheckTrivialExprVisitor.checkNonTrivialExpr has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 18, if/else 3 (5 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/CheckTrivialExprVisitor.php"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec93594a7121d237a75f7887eddb46abb81b3d002170accd2d0eaa1b80383ff"}},{"ruleId":"D2","level":"warning","message":{"text":"PregReplaceCallbackParamsProvider.getFunctionParams (cognitive 23): PregReplaceCallbackParamsProvider.getFunctionParams has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 4 (5 pts), loops 3 (4 pts), boolean chains 3 (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":"src/Psalm/Internal/Provider/ParamsProvider/PregReplaceCallbackParamsProvider.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54bc60eb3ce5bb98616cf6dbab3b5741b4e8acf0083b296150fe9041af25986"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFirstLastReturnTypeProvider.getElementType (cognitive 23): ArrayFirstLastReturnTypeProvider.getElementType has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 9, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFirstLastReturnTypeProvider.php"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"416be0106bb7cd69db7baa014ea03232b5444cdd9308e937b341bcb47702ee77"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayMapReturnTypeProvider.getElementMarker (cognitive 23): ArrayMapReturnTypeProvider.getElementMarker has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 15, if/else 5 (6 pts), loops 1, ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2d4ecfe8cde9363d9717d7b66f8f8413716072fe6ef2d1019f846eb37f4ada"}},{"ruleId":"D2","level":"warning","message":{"text":"PowReturnTypeProvider.getFunctionReturnType (cognitive 23): PowReturnTypeProvider.getFunctionReturnType has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 7 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/PowReturnTypeProvider.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f29d8c04c8e65db04ec979457f72cd81bec65d2652871713a1e9ffa04ad8b95"}},{"ruleId":"D2","level":"warning","message":{"text":"ParsedDocblock.render (cognitive 23): ParsedDocblock.render has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (7 pts), ternaries 2 (7 pts), boolean chains 2 (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":"src/Psalm/Internal/Scanner/ParsedDocblock.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e492ea873cffe700e854db6123e7b363014c8fd25dad7e5563026e6aa86e9543"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreeCreator.handleColon (cognitive 23): ParseTreeCreator.handleColon has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb25b50452cc7d3d5da9a15b191d2b79ddc81797b8aeba79e54188ca833f07b"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileIsset (cognitive 23): SimpleAssertionReconciler.reconcileIsset has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 10, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fe572426ce6930b643af972731fa916b8cfea4ae7bce62043c0d2adbb565b4"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.intersectStringTypes (cognitive 23): TypeParser.intersectStringTypes has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 3 (9 pts), boolean chains 8, if/else 4 (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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1939e628b683bd9e37f946ff72544172b87ebe6fd895d4d95a6d495be72cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"JunitReport.create (cognitive 23): JunitReport.create has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Report/JunitReport.php"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4eb08c0b112d757541c756409350c257d4bb95ba625bb292a3de785f86c11d"}},{"ruleId":"D2","level":"warning","message":{"text":"TValueOf.getValueType (cognitive 23): TValueOf.getValueType has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, 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":"src/Psalm/Type/Atomic/TValueOf.php"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee7510c0d24a7d5998c9c15163b94c60c729a0fec53381a1fa944fa2df13616"}},{"ruleId":"D2","level":"warning","message":{"text":"Transpiler.emitParameters (cognitive 22): Transpiler.emitParameters has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 3 (8 pts), loops 2 (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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"83db1e22fb817066271c847ebf44ae0c4ce177ba7dbe9c829f41cffc3bf569ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeAnalyzer.checkMixins (cognitive 22): ClassLikeAnalyzer.checkMixins has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"00da23b237d650617caa04e30fd8ef735cf183d6f8ea548f7d390f19293bee45"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeAnalyzer.examineParamTypes (cognitive 22): FunctionLikeAnalyzer.examineParamTypes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (8 pts), boolean chains 4, loops 1 (nesting depth added 12). 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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"2434d6e52b88a16680847ab8c735654834da94418a4f3ea0e7a1b573234f879d"}},{"ruleId":"D2","level":"warning","message":{"text":"DoAnalyzer.analyze (cognitive 22): DoAnalyzer.analyze has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, loops 3 (4 pts), error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7407b8c6f1186638d54d39ba8a7242cdcb597d814043dbe45d5a9390e77629"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getNullEqualityAssertions (cognitive 22): AssertionFinder.getNullEqualityAssertions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, ternaries 2 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2541cb132b8d07eeb55af3cbbd3596efa3c179757e15829940314d9f831d906e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArithmeticOpAnalyzer.arithmeticOperation (cognitive 22): ArithmeticOpAnalyzer.arithmeticOperation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, match/switch 1 (2 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c6a762bdfdc9d922c40d8909a737293b55d844b3ab6163ff151623ac7201d1"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallAnalyzer.processAssertFunctionEffects (cognitive 22): FunctionCallAnalyzer.processAssertFunctionEffects has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 6, loops 1 (2 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"4364ad99804b0ebb905367dbba07671e89351b0636410787bb2a8ae5c1ecb09b"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.taintArrayColumn (cognitive 22): FunctionCallReturnTypeFetcher.taintArrayColumn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3, boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"831f17ff36edabc596506262d6ee1c3f0152109131f88f6631844816ce4607de"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.checkLiteralStringArrayOffset (cognitive 22): ArrayFetchAnalyzer.checkLiteralStringArrayOffset has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09a8a0f5e2e518df698ed02063b680300bef7a261c1bc0b8e4a6ea697f0c706"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleArrayAccessOnClassStringMap (cognitive 22): ArrayFetchAnalyzer.handleArrayAccessOnClassStringMap has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 3 (12 pts), if/else 4 (9 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb956e5a39ab8f0dcdac7486a7a7c5d61fa0758e23a89d4e1cee69a88666405e"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticAnalyzer.analyze (cognitive 22): StaticAnalyzer.analyze has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 1 (3 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":"src/Psalm/Internal/Analyzer/Statements/StaticAnalyzer.php"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e27f07d72f61d4b59b92fd95e37dc7c7a3d80c99d06a5e5e099703526b8b70f"}},{"ruleId":"D2","level":"warning","message":{"text":"ConditionalTaintSinks.getParamBounds (cognitive 22): ConditionalTaintSinks.getParamBounds has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), ternaries 1 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ConditionalTaintSinks.php"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a031754929b0a5c083c640ccb2454b8a4077d33ae7b1a0365222a4969f420d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Functions.getStorage (cognitive 22): Functions.getStorage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Functions.php"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5a82df560ea8a39aabe05155989e1d4decb2a3a82c44daf2a9de7b182fd2a9"}},{"ruleId":"D2","level":"warning","message":{"text":"NosqlEqualityOperand.markArgument (cognitive 22): NosqlEqualityOperand.markArgument has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 2 (5 pts), ternaries 1 (4 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/NosqlEqualityOperand.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c231dde204ccde12462fad7d56a1ce2d83aa7612bc437c98ec8483168f7c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintStore.getKeyNames (cognitive 22): TaintStore.getKeyNames has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (6 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8246749fd4af4b13acf1ef7c24f4bfa4a7c63926cda2db33f9698a72ef5c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyDocblockManipulator.getManipulationsForFile (cognitive 22): PropertyDocblockManipulator.getManipulationsForFile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, ternaries 2 (6 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":"src/Psalm/Internal/FileManipulation/PropertyDocblockManipulator.php"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e546e685d174ba72ebc29122db3d3eaf319598ea0720f180d49e4d3aa89bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeDocblockParser.addMagicPropertyToInfo (cognitive 22): ClassLikeDocblockParser.addMagicPropertyToInfo has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"580efc91a2d71c8f81420f29415f7e613ad45875f6583aa1314005206122b062"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateTagParser.parseTags (cognitive 22): TemplateTagParser.parseTags has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 6 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/TemplateTagParser.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8052f239b660c1944bce4be873084aa838424d2a72be540e15bee1827f28d98d"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateTagParser.findDefaultSeparator (cognitive 22): TemplateTagParser.findDefaultSeparator has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 2 (5 pts), error handling 1 (3 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/TemplateTagParser.php"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"875bea2daeb88f9b7f90342f5d915f4d13f5fa45b50dc9ef2c9f6302649d0428"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeHintResolver.getDuplicateKeysOfAUnionMember (cognitive 22): TypeHintResolver.getDuplicateKeysOfAUnionMember has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (11 pts), boolean chains 5, if/else 3 (5 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":"src/Psalm/Internal/PhpVisitor/Reflector/TypeHintResolver.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bf07ff91e567f9837a83d4e2833ca698584e909b110073315f511d9a2d8a47"}},{"ruleId":"D2","level":"warning","message":{"text":"FileReferenceProvider.calculateFilesReferencingFile (cognitive 22): FileReferenceProvider.calculateFilesReferencingFile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), error handling 1 (4 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/FileReferenceProvider.php"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c504273966dcd74ff28078842ecf1158fe53327b9793ad274778ba689376882"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayIntersectKeyReturnTypeProvider.getFunctionReturnType (cognitive 22): ArrayIntersectKeyReturnTypeProvider.getFunctionReturnType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, loops 2 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayIntersectKeyReturnTypeProvider.php"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9a94aa1c63dafdc8db6bfb117f1de25b71b1829c015aafd1f3c7050b3c6cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayMapReturnTypeProvider.isPlainValue (cognitive 22): ArrayMapReturnTypeProvider.isPlainValue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), boolean chains 2 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b2530ae557e274ea66526c00b3add3845d55424dd0889c0afb1914d9ef9efc"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseUrlReturnTypeProvider.getFunctionReturnType (cognitive 22): ParseUrlReturnTypeProvider.getFunctionReturnType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (22 pts) (nesting depth added 13). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ParseUrlReturnTypeProvider.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"224d3e6d85a9c6b339850fb43972fb1e846385ad09e1e5e429a354a826ef0643"}},{"ruleId":"D2","level":"warning","message":{"text":"RoundReturnTypeProvider.getFunctionReturnType (cognitive 22): RoundReturnTypeProvider.getFunctionReturnType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/RoundReturnTypeProvider.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0826893d85ed4491a7dcd66dc36de8a6e0497f2666403a300d2a24ba66fca2a3"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.inferTemplateParamsFromParent (cognitive 22): AssertionReconciler.inferTemplateParamsFromParent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 9, loops 2 (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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"66235df3f40c51fc130977f41330f48d37290b4f362e8d075ca7d462ed654765"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableTypeComparator.isNotExplicitlyCallableTypeCallable (cognitive 22): CallableTypeComparator.isNotExplicitlyCallableTypeCallable has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff134a388b2438c5614cfabfdcf31df5052d379b0eab2f402e7e276c3894804"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableTypeComparator.getCallableFromMethodId (cognitive 22): CallableTypeComparator.getCallableFromMethodId has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ce378e40750ecb055abd393f82b0213a445cc28724b56e754ca1a65a0665fb"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyedArrayComparator.coerceToObjectWithProperties (cognitive 22): KeyedArrayComparator.coerceToObjectWithProperties has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (6 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"15459a451232bf7db4f7bdc312b8b6af1a664ba5fff8de16bff10fe89c1bb4f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreeCreator.parseCallableParam (cognitive 22): ParseTreeCreator.parseCallableParam has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 6 (7 pts), boolean chains 6 (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":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43ca43d2f2bdc27b593315801f6d5f486bf201726785715857fbe8aacba436e"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileNumeric (cognitive 22): SimpleAssertionReconciler.reconcileNumeric has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e971c48c748bb27a504520c365172d27698b7ea2d4439f0d5962d0237ad6b4"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileStringArrayAccess (cognitive 22): SimpleAssertionReconciler.reconcileStringArrayAccess has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (5 pts), boolean chains 4 (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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2eb945dc240291beff358f13546274904c1129a26f234779a149e13ebebc4f"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStandinTypeReplacer.replaceMatchingAtomicTypes (cognitive 22): TemplateStandinTypeReplacer.replaceMatchingAtomicTypes has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (9 pts), ternaries 1 (3 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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b868aed3683d38f9809bbf41aa5ba47a24773fcb53de8562b6157a31a7372525"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.extractKeyedIntersectionTypes (cognitive 22): TypeParser.extractKeyedIntersectionTypes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, 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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75430871767b134781a1bfffd25bec748dd3a8a895b81519aacbff5f60e614b"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericTrait.toNamespacedString (cognitive 22): GenericTrait.toNamespacedString has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/GenericTrait.php"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6ac984cd9614edf473f8711a2b23e58d737c674cdf4ee0f02d6b96e3616e76"}},{"ruleId":"D2","level":"warning","message":{"text":"lib.hc_parse_trees (cognitive 21): lib.hc_parse_trees has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/hack-conformance/lib.php"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8154f59a864450a06b968097e800853e18072df9a9d002dbc4aa44f014675c"}},{"ruleId":"D2","level":"warning","message":{"text":"Codebase.getSymbolLocationByReference (cognitive 21): Codebase.getSymbolLocationByReference has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), error handling 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"425b2d590a3384130cdeb05fc591529049d120249f169ad0c1c6656012f48dae"}},{"ruleId":"D2","level":"warning","message":{"text":"Creator.getPsr4Or0Paths (cognitive 21): Creator.getPsr4Or0Paths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config/Creator.php"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"45571ed2895c4bf57460fb1df1694432d0bb56438d2d34ac79f44fb417ccacd3"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassAnalyzer.analyzeClassMethodReturnType (cognitive 21): ClassAnalyzer.analyzeClassMethodReturnType has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 4 (8 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"54caeaf367e9cd9264672582c6a7a12407439d65b9993337e1a7b7eb31ad5f24"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassAnalyzer.checkParentClass (cognitive 21): ClassAnalyzer.checkParentClass has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, ternaries 3 (5 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23e424e57d0e8f68da7e2cde7d267659e1a02bf4733a011db32b68a5e450b83"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodComparator.checkForObviousMethodMismatches (cognitive 21): MethodComparator.checkForObviousMethodMismatches has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 6 (7 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"061f9bc2643fc157b752ad93d485b37867b1b0514ac2e9ce2f00e081842738b4"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodComparator.getBoundCapabilities (cognitive 21): MethodComparator.getBoundCapabilities has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), boolean chains 3 (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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"374b7eb3321651722114259678168e261a7bfa337a27ae6029e3589f90669663"}},{"ruleId":"D2","level":"warning","message":{"text":"IfElseAnalyzer.removeMixedAssignmentsOfNarrowedVars (cognitive 21): IfElseAnalyzer.removeMixedAssignmentsOfNarrowedVars has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 7, ternaries 1 (4 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c56b52482361027e3225efa0f3e442fa93656b0390980f5f4384afe52da47f"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getEmptyInequalityAssertions (cognitive 21): AssertionFinder.getEmptyInequalityAssertions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaf9b3cf838879f51d1c2dda69f6915a6b94fa54e0f3a23f1f839ee2f234dc0"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.removeAliasedOffsets (cognitive 21): ArrayAssignmentAnalyzer.removeAliasedOffsets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e7307120b1eb34c1317bc7f89ed2dff1f81bf90d048107ae2ee4ba0f73c4e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExitAnalyzer.analyze (cognitive 21): ExitAnalyzer.analyze has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (5 pts), boolean chains 3 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/ExitAnalyzer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"104467e60d5d1a09a64b11771647d2c0a1df65105afd853ba32b2e65e6f3b586"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.taintSuperGlobalFetch (cognitive 21): ArrayFetchAnalyzer.taintSuperGlobalFetch has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (5 pts), ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0620d9e59f7717e69765c8035b443c50edd0afa3c7e313c2205a53628c98dff"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstFetchAnalyzer.findGlobalConstTypesByWildcard (cognitive 21): ConstFetchAnalyzer.findGlobalConstTypesByWildcard has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (7 pts), loops 4 (5 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ConstFetchAnalyzer.php"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c787afe224a2e1bc680075512f95836243143306b7043176651ffd10f425ecf"}},{"ruleId":"D2","level":"warning","message":{"text":"ReturnAnalyzer.getTemplateParamEqualToLiteral (cognitive 21): ReturnAnalyzer.getTemplateParamEqualToLiteral has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c4b39b6b9bd31f9fa016b62e673642eaee070acbcece929766143aa8138760"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedAssignmentRemover.findUnusedAssignment (cognitive 21): UnusedAssignmentRemover.findUnusedAssignment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3 (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":"src/Psalm/Internal/Analyzer/Statements/UnusedAssignmentRemover.php"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e026b4d6a559c5a6720406ed1130bb340b8cd3c4bca9583d2dd076dccef036"}},{"ruleId":"D2","level":"warning","message":{"text":"Clause.calculateNegation (cognitive 21): Clause.calculateNegation has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (7 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Clause.php"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e59abb255cb59d688205ba2044401884a5ddfe5d53ed3260ca67003af71e05b"}},{"ruleId":"D2","level":"warning","message":{"text":"Psalm.initBaseline (cognitive 21): Psalm.initBaseline has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdda180665bd8fa088e3e0a1742c527324ec62cd6e873149b4a4db8d3bb8ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"Populator.inheritPropertiesFromParent (cognitive 21): Populator.inheritPropertiesFromParent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 3, ternaries 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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1854}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3bd2ebbb3cd6dce0d43e11326f3051486c50cc6aedbc5f3e1aae71a0220b02"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceMapGenerator.getReferenceMap (cognitive 21): ReferenceMapGenerator.getReferenceMap has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (5 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":"src/Psalm/Internal/Codebase/ReferenceMapGenerator.php"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d1250004e45bbd11525251bbaaf777c27eda73e2a5c67c868b84ed60648246"}},{"ruleId":"D2","level":"warning","message":{"text":"Reflection.extractReflectionMethodInfo (cognitive 21): Reflection.extractReflectionMethodInfo has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (5 pts), boolean chains 3, ternaries 2 (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":"src/Psalm/Internal/Codebase/Reflection.php"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"17773d7db668a31531a12bcdd4af1e1c3fb08ba1a9f208abb866274ca70ca154"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintStore.getKnownStartOfMember (cognitive 21): TaintStore.getKnownStartOfMember has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, ternaries 3 (5 pts), if/else 4 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"d418a141f2aca4d23f7b129c2bd0f2957027223529425b791da35c1bc22650ca"}},{"ruleId":"D2","level":"warning","message":{"text":"VariableUseGraph.getChildNodes (cognitive 21): VariableUseGraph.getChildNodes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 9, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/VariableUseGraph.php"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a225c64f2214be69f86ded679d3db37d3334b024d7e4986e7c741149fc9385"}},{"ruleId":"D2","level":"warning","message":{"text":"PurityTemplateParser.parse (cognitive 21): PurityTemplateParser.parse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/PurityTemplateParser.php"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9efc76d744c6f2ec97481997af702af33847e86f8c10874867ae85e14ab7120"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFindReturnTypeProvider.getFunctionReturnType (cognitive 21): ArrayFindReturnTypeProvider.getFunctionReturnType has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (7 pts), boolean chains 2, loops 2 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFindReturnTypeProvider.php"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3b5ee3fb7db170f6ed8e25e7635ec8f8114e69854a46c6a448477c17cdce2e"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterVarReturnTypeProvider.getFunctionReturnType (cognitive 21): FilterVarReturnTypeProvider.getFunctionReturnType has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 1, loops 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterVarReturnTypeProvider.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84df3cd6fca50ee0a173a0f7d4e90ae59c9a37ccd3b5b1fd3665262feb94fd8"}},{"ruleId":"D2","level":"warning","message":{"text":"StubsGenerator.getParserTypeFromPsalmType (cognitive 21): StubsGenerator.getParserTypeFromPsalmType has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Stubs/Generator/StubsGenerator.php"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba9186390d8d4ecafc45b41b80d7db95f5b38e28b76a843b2a23b47a08d2000"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionReconciler.getCompatibleStringType (cognitive 21): AssertionReconciler.getCompatibleStringType has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 15, if/else 2 (5 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44de62783f6006afb2a001f59848226014b7f83308c74b6dadfd8141af8fc08"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionTypeComparator.canBeContainedBy (cognitive 21): UnionTypeComparator.canBeContainedBy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f74275d4ab6fa4d80847d59c6bbdb3baeac692a9df54161ee60aea49177678"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreeCreator.handleOpenRoundBracket (cognitive 21): ParseTreeCreator.handleOpenRoundBracket has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 1 (3 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fc5ca567439aceb5a65ccefaff7e1271d08d5c671b73d398014d46520fcd30"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreeCreator.handleEllipsisOrEquals (cognitive 21): ParseTreeCreator.handleEllipsisOrEquals has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"112d599f6cf06af8298f0931326e9d759a54a4f6ddfd707adf8ae0515d566a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.parseTokens (cognitive 21): TypeParser.parseTokens has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ba6f7076733e374ee06b47f4a4c6be2affb1c134f12ab8cf73bdb21f263653"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeVariableTracker.doResolveTypeVariables (cognitive 21): TypeVariableTracker.doResolveTypeVariables has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeVariableTracker.php"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ee1819ac3567faccb7c255c3f090e46025febe23f173b5180715ffd99d6d5d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker.checkNamedObject (cognitive 21): TypeChecker.checkNamedObject has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7 (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":"src/Psalm/Internal/TypeVisitor/TypeChecker.php"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bb605c5cccb31f452dd50255901095432127ef3549d522be1f562b170e7302"}},{"ruleId":"D2","level":"warning","message":{"text":"SarifReport.create (cognitive 21): SarifReport.create has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 4 (7 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Report/SarifReport.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0c74b81460198e1464ce2b2623b8f58921607676c20e49d9d8eeeda26478ec"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableTrait.replaceCallableTemplateTypesWithStandins (cognitive 21): CallableTrait.replaceCallableTemplateTypesWithStandins has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, ternaries 2 (3 pts), loops 1 (2 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":"src/Psalm/Type/Atomic/CallableTrait.php"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"500d0af27717a3f2ff20183d2b819d2bc3da7e6729f18eb67fb29335ca5c7c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.getPathType (cognitive 21): Reconciler.getPathType has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, ternaries 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d329039ef069ab92130b73e4ea2188761689a9b4650e523a1d5059e925e7b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Transpiler.parseType (cognitive 20): Transpiler.parseType has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), boolean chains 1, 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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97a6ee15ddbecaa023f7168c4f1d49e5df691af92fdffc96907fd422c20fbee"}},{"ruleId":"D2","level":"warning","message":{"text":"Transpiler.contextTags (cognitive 20): Transpiler.contextTags has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3145594c6adcadf505ad749b8266e0c940335f5073ad9042d78866af88b3f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.detachReferencesReboundIn (cognitive 20): Context.detachReferencesReboundIn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), boolean chains 4 (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":"src/Psalm/Context.php"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50740d970e6aeffd308544dfde98e35a7aaa6a91a62d101aac7af5c5423fba1"}},{"ruleId":"D2","level":"warning","message":{"text":"CanAlias.visitUse (cognitive 20): CanAlias.visitUse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), ternaries 2 (7 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). 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":"src/Psalm/Internal/Analyzer/CanAlias.php"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04f5e0570ccee5dea4466467cc07537557885b576bd960248b3f6cb5756f956"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassAnalyzer.checkEnum (cognitive 20): ClassAnalyzer.checkEnum has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2858}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac92512ccc6f53853c6ebf47bc94160678da7ab97c1a6676074ae1cc321a8d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureAnalyzer.widenLiteralsOfByRefCapture (cognitive 20): ClosureAnalyzer.widenLiteralsOfByRefCapture has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClosureAnalyzer.php"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"591edcf15e17616da754f78ce742ac880f395f54b0861bab7d13a279f4026889"}},{"ruleId":"D2","level":"warning","message":{"text":"InheritedMethodTaints.getBodySuffix (cognitive 20): InheritedMethodTaints.getBodySuffix has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, if/else 4, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/InheritedMethodTaints.php"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"403c143ce0230d4fe8dfab8a265d055f0637482dc9623ccb0bfabc715c45f448"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodAnalyzer.checkStatic (cognitive 20): MethodAnalyzer.checkStatic has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (19 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":"src/Psalm/Internal/Analyzer/MethodAnalyzer.php"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bf42c9cb9844088b1c41fa3081639ec56c5722d50d544f6be40ad8e359d29a"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeachAnalyzer.addItemsWrittenByRef (cognitive 20): ForeachAnalyzer.addItemsWrittenByRef has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 5, loops 3 (5 pts), ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe3322d79637f2475906cd24fd32fd4c39bc7be7f6fc01752a8bef8464cd835"}},{"ruleId":"D2","level":"warning","message":{"text":"IfConditionalAnalyzer.getAssignmentStates (cognitive 20): IfConditionalAnalyzer.getAssignmentStates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (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":"src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc746b064bf35378756857580153c13db6d3c0f888f26ec1acf57d07f37b876"}},{"ruleId":"D2","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.checkReadonlyPropertyWrite (cognitive 20): InstancePropertyAssignmentAnalyzer.checkReadonlyPropertyWrite has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 17, if/else 2 (3 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cfb01e4317796061d00be8cf146c12166f35911df514f324f6d1aec8d21237"}},{"ruleId":"D2","level":"warning","message":{"text":"NewAnalyzer.analyzeConstructorExpression (cognitive 20): NewAnalyzer.analyzeConstructorExpression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"049bd2d9836e49acc63ea3bfb42e06e206a99a8aa1c950ab38ffdaaaf4350a3f"}},{"ruleId":"D2","level":"warning","message":{"text":"VariableFetchAnalyzer.addDataFlowToVariable (cognitive 20): VariableFetchAnalyzer.addDataFlowToVariable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 8, loops 1 (2 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e6556bc9569f05d6048c698d5591dce036898355ba486e043841eb28c87721"}},{"ruleId":"D2","level":"warning","message":{"text":"Psalter.loadCodeowners (cognitive 20): Psalter.loadCodeowners has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (6 pts), boolean chains 2 (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":"src/Psalm/Internal/Cli/Psalter.php"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed223ebde15390cd3113c87dffe8af15dcf4f056cf24f0469486a88490ba8d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.moveProperties (cognitive 20): ClassLikes.moveProperties has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"036715af204a96a590b3996183549e302572d5468fac9fa360895da16de7e54c"}},{"ruleId":"D2","level":"warning","message":{"text":"Populator.bindIterationPurity (cognitive 20): Populator.bindIterationPurity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (6 pts), boolean chains 5 (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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e16204d5713169994253ef1cc88927b51c5ccb31489ba64e95aa6b5935a0242"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyBagTaints.taintAssignment (cognitive 20): PropertyBagTaints.taintAssignment has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, loops 4 (5 pts), if/else 3 (4 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":"src/Psalm/Internal/Codebase/PropertyBagTaints.php"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a674de2f7c37c7a81f0a08091d7ca08a898867efe5c37722123c2eff8c6340"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintStore.addFlow (cognitive 20): TaintStore.addFlow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (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":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f2b434fd24a367dcbb1332dfbe4ad0ba28d32be72eb23f0b2add61e3aecffc"}},{"ruleId":"D2","level":"warning","message":{"text":"UnshippedCode.globToRegex (cognitive 20): UnshippedCode.globToRegex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/UnshippedCode.php"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"514457473d9662dc907fbd23538a571487d0edd2cf1bd84543f507412ab56940"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDispatcher.registerClass (cognitive 20): EventDispatcher.registerClass has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20. 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":"src/Psalm/Internal/EventDispatcher.php"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ef879faf776755835a6391b7772bdfe21705d6e51ece822dcc75f992fb502d"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeNodeScanner.finish (cognitive 20): ClassLikeNodeScanner.finish has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 2 (4 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c44f43086eb40d5f40c18238d625f9ee0cc2633b1c64032f4aeb5f31e04b4ae"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.getTypeFromCallableTree (cognitive 20): TypeParser.getTypeFromCallableTree has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4730c1d43a87182e7342786fc1664dddd76e9b4d0eaebb5618912b13284fec"}},{"ruleId":"D2","level":"warning","message":{"text":"TKeyedArray.replaceTemplateTypesWithStandins (cognitive 20): TKeyedArray.replaceTemplateTypesWithStandins has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (9 pts), loops 2 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed8a917afa7846148406280a0aeb2678a6573a5cc49b7c89fe3f56f16038fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"TKeyedArray.escapeAndQuote (cognitive 20): TKeyedArray.escapeAndQuote has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9752eef04f7c41869b283547601ab92caa23560a64ba040f0eabee2941f27de"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableUnion.addType (cognitive 20): MutableUnion.addType has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (6 pts), boolean chains 5 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/MutableUnion.php"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"718ae97b150ff9c09bf652c0e7a1f74e9af1c3fad175a4818f23de4c57769825"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableUnion.removeType (cognitive 20): MutableUnion.removeType has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5 (8 pts), boolean chains 2 (nesting depth added 9). 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":"src/Psalm/Type/MutableUnion.php"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9463940b27f6271d9643aa4548b560b12edb4274a2611d0fb67807519c423f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Transpiler.emitLambda (cognitive 19): Transpiler.emitLambda has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (5 pts), boolean chains 3, loops 1 (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":"bin/hack-conformance/Transpiler.php"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"15051da34a76727a494b2c2a6a4cc2a924030c32cbef8ba16fa0cd563dd65781"}},{"ruleId":"D2","level":"warning","message":{"text":"lib.hc_fixtures (cognitive 19): lib.hc_fixtures has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/hack-conformance/lib.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbaa20d0153699b6863c8756810a133208ce8130bbf15f103c2818f1f1d5b86"}},{"ruleId":"D2","level":"warning","message":{"text":"build_docker.pieInstalls (cognitive 19): build_docker.pieInstalls has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/stubs/build_docker.php"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec79c779364f718d4c51744cae07f90f55d3bb47fc22086a84a6257dae803505"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassAnalyzer.analyzeProperty (cognitive 19): ClassAnalyzer.analyzeProperty has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ccbe6a15f7bfe6b5f490b53d22b544380c20aae8c8d7fc9e05ce449aa74742"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeAnalyzer.checkParamReferences (cognitive 19): FunctionLikeAnalyzer.checkParamReferences has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, loops 1 (2 pts), ternaries 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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecda027c7ead844ebe09189d819a447726aff408dd0c19832ea7408599514fc"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodAnalyzer.isMethodVisible (cognitive 19): MethodAnalyzer.isMethodVisible has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, 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":"src/Psalm/Internal/Analyzer/MethodAnalyzer.php"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f089a99a90663527a641446ea0a320a0274c68139658ed7229271ec6b3bc506"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectAnalyzer.check (cognitive 19): ProjectAnalyzer.check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 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":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9397694e149964cb3865feba65729d6c23c7fdf343276cfe361a9fba92cbe009"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeachAnalyzer.getExtendedType (cognitive 19): ForeachAnalyzer.getExtendedType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a34ef79d6b4d34b38cad4dc33d3ea1574760c56200f1f9dbc76f484dfd065fc"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopAnalyzer.analyzeForOrWhile (cognitive 19): LoopAnalyzer.analyzeForOrWhile has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (2 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe8f3fd22918756c1bbe9d6c52ba4b1f5ac9a897676c96d68ebf956cc4a7163"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopAnalyzer.updateLoopScopeContexts (cognitive 19): LoopAnalyzer.updateLoopScopeContexts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3983876a2dac2c05a047f2eda10f1220671b029921d979e1637333801a568667"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getNullsafePropertyType (cognitive 19): AssertionFinder.getNullsafePropertyType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (5 pts), boolean chains 4, loops 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7da84c6255e0926f878d9014fba591f9e38670eb37a7dba1f3aec24bf6d3e38"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAnalyzer.analyzeAssignmentOperation (cognitive 19): AssignmentAnalyzer.analyzeAssignmentOperation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, loops 2 (4 pts), ternaries 2 (nesting depth added 4). 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f784728d94319cf7ff6f1318649a2a1e009a387f02ddc0c122eb74761d7b7e"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAnalyzer.makeReferencedArrayNonNull (cognitive 19): AssignmentAnalyzer.makeReferencedArrayNonNull has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, loops 2 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"2598bbb8b2ab0b1375f30f41098c6aedfaaf167c02b0294148fc794b455f3b38"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassTemplateParamCollector.resolveTemplateParam (cognitive 19): ClassTemplateParamCollector.resolveTemplateParam has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 1, 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ClassTemplateParamCollector.php"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71f42e04cca6b9ee20fd5d738f5616c92cee60060e50b5940fec381bdad313b"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallReturnTypeFetcher.getFirstClassCallableType (cognitive 19): MethodCallReturnTypeFetcher.getFirstClassCallableType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcae389055917ac984cca87d743a7b7d210a2b3d0004732c1a2c894c212def58"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeClassTaintAnalyzer.getPropertyIds (cognitive 19): NativeClassTaintAnalyzer.getPropertyIds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 2 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/NativeClassTaintAnalyzer.php"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6280587ba6b4b0c2a771995a13d166d079e33410badcef959d9331067f6261d2"}},{"ruleId":"D2","level":"warning","message":{"text":"CallAnalyzer.checkMethodArgs (cognitive 19): CallAnalyzer.checkMethodArgs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, ternaries 1 (2 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6438dace5649aa446428c5fc7366da2a94df5f396635260995f183a9ec7cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"YieldFromAnalyzer.analyze (cognitive 19): YieldFromAnalyzer.analyze has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/YieldFromAnalyzer.php"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76e633ccdfd746684e8ce7fd92cfb99c1f0e4db1ce90e4951bc60cbc70b3be2"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionAnalyzer.analyze (cognitive 19): ExpressionAnalyzer.analyze has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), loops 1 (3 pts) (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":"src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51d84524b6916769177522a5a6fbed1b26910b05ae65d35a051c2f76896ef26"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementsAnalyzer.analyze (cognitive 19): StatementsAnalyzer.analyze has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts), loops 2 (3 pts) (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":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d73f9264842e948fe391261a01b1608fa14a3b5a0be60f2a0f5f59fa85c0ab"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeUseGraph.addGraph (cognitive 19): CodeUseGraph.addGraph has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 3 (9 pts) (nesting depth added 10). 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":"src/Psalm/Internal/Codebase/CodeUseGraph.php"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde87ecddf07551ed754198e0c0e80de975d82526257bb427066f77c0986af2d"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationLevelResolver.resolve (cognitive 19): MutationLevelResolver.resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/MutationLevelResolver.php"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9f55585e73e1294261157bdf795499847e4447a0b330e2ffa5e24286196160"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintStore.getKnownStartOfImplode (cognitive 19): TaintStore.getKnownStartOfImplode has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 5, if/else 3 (5 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4f446962cb2022d5587324243843a9f94f39f189925f90557ede3b241af11a"}},{"ruleId":"D2","level":"warning","message":{"text":"FileDiffer.calculateTrace (cognitive 19): FileDiffer.calculateTrace has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 6, loops 3 (6 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":"src/Psalm/Internal/Diff/FileDiffer.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b70c6af7446f373c3b5fb0f84560dc201e4641695664457e40d60ddcb04bf0"}},{"ruleId":"D2","level":"warning","message":{"text":"PsalmRestarter.requiresRestart (cognitive 19): PsalmRestarter.requiresRestart has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (6 pts), boolean chains 3, loops 2 (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":"src/Psalm/Internal/Fork/PsalmRestarter.php"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"435427e62fbc005333d825f78edb3d7ff110002c79d9f64bd9dec27f0cc64106"}},{"ruleId":"D2","level":"warning","message":{"text":"EmitterTrait.emit (cognitive 19): EmitterTrait.emit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/LanguageServer/EmitterTrait.php"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41dbcfde627fbfd1357efa986defd4638ad67b8e8ae84801abc418021e72485"}},{"ruleId":"D2","level":"warning","message":{"text":"StringStartScanner.resolve (cognitive 19): StringStartScanner.resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, 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":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a47979ee16ff85dc0724c909990b45819dfad5b5066cf634348970d05dbc3c"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonEncodeTainter.removeTaints (cognitive 19): JsonEncodeTainter.removeTaints has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), ternaries 2 (3 pts), loops 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":"src/Psalm/Internal/Provider/AddRemoveTaints/JsonEncodeTainter.php"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53bfae0ab92aee70abb37aef889612bd483035c10e7f78e35136164d906470b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeStorageProvider.addMore (cognitive 19): ClassLikeStorageProvider.addMore has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 5, ternaries 1 (4 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":"src/Psalm/Internal/Provider/ClassLikeStorageProvider.php"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ac9063935f13bc02b1fa0226bef2373ed3435f6ae3440a108ad95151e052f1"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementsProvider.parseStatements (cognitive 19): StatementsProvider.parseStatements has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 3 (6 pts), error handling 2 (5 pts), boolean chains 2 (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":"src/Psalm/Internal/Provider/StatementsProvider.php"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac9edb118432ada0e633bb406163ad84f85134188b0a543d1b5f08d2c891c99"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeStubGenerator.getClassLikeNode (cognitive 19): ClassLikeStubGenerator.getClassLikeNode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (7 pts), ternaries 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Stubs/Generator/ClassLikeStubGenerator.php"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e7adfb2d213c480d1b19e49eb85c3f6dc32c0157880f874dfa2cf606e04a12"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreeCreator.createMethodParam (cognitive 19): ParseTreeCreator.createMethodParam has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2c9ec572291b428a8388cd1f4f3e45b93df29bdeaec41e45a9ffe2bc53eb9f"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileFalse (cognitive 19): SimpleAssertionReconciler.reconcileFalse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 1 (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. This shape REPEATS in the file: one other method here (SimpleAssertionReconciler.reconcileTrue) 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fd146a6613bb3124f22ab1e153400670c1a9eeff9d0565046e1f49876caf5c"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileTrue (cognitive 19): SimpleAssertionReconciler.reconcileTrue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 1 (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. This shape REPEATS in the file: one other method here (SimpleAssertionReconciler.reconcileFalse) 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"99575bfcfa33cdcdb4facc5a6f887344f5596b315e214d32081c0c5aa7455519"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.getTypeFromUnionTree (cognitive 19): TypeParser.getTypeFromUnionTree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), boolean chains 1, ternaries 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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"029941627145863a4812248690d29be70f15d4665b6d29e0f421028a058b0b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Atomic.isFalsy (cognitive 19): Atomic.isFalsy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 8. 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":"src/Psalm/Type/Atomic.php"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3224bb7d2c1e0c640e0cb35381fc797b7fd2a0bc9cf970010c1f2403bde111d"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionTrait.toPhpString (cognitive 19): UnionTrait.toPhpString has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (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":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c53c8b75c92fe8b485772982094a6b6eea7c7e7b90eb75562a3b2f9cb90b8de"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.reportStubDocblockIssues (cognitive 18): Config.reportStubDocblockIssues has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (8 pts) (nesting depth added 10). 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":"src/Psalm/Config.php"},"region":{"startLine":3092}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4319aeb4bdc30dac2690541fb07fbe6e70518560b6b098f506b18cf9c789d7"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributesAnalyzer.getAttributeClassFlags (cognitive 18): AttributesAnalyzer.getAttributeClassFlags has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/AttributesAnalyzer.php"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06a6808d5185f88b4670e4d09a8fc4ae6d3a2aaff59c4c1666da12784bc549a"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAnalyzer.getArrayType (cognitive 18): ArrayAnalyzer.getArrayType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 2 (6 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c341aa6d076504473ce895567687e0e38631c842b004f6b8cd9f38b3aaac03"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.isPropertyImmutableOnArgument (cognitive 18): AssertionFinder.isPropertyImmutableOnArgument has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":5025}}}],"partialFingerprints":{"codehealthFindingId/v1":"677fc7da1762c1d2cb6465f05e6d4522f5613acd2d1941e94dfc8676050d74b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.getKeyAt (cognitive 18): ArrayAssignmentAnalyzer.getKeyAt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01d66f8929b9da441d5086c64cf31f37cfc20abcff3d31eb9aaacab658cb6b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAssignmentAnalyzer.getDimKeyValues (cognitive 18): ArrayAssignmentAnalyzer.getDimKeyValues has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a13033bc9dac0852ead7528f98f2056b70c16b85e4457d0c37ff0cb4665948"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentsAnalyzer.applyParamClosureThisHint (cognitive 18): ArgumentsAnalyzer.applyParamClosureThisHint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"242ee1b6ab8b24324917cd63edf24bf2ffb8dfb558bc0d24fef1c48baf4cc86e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentsAnalyzer.addCurlOptionArraySinks (cognitive 18): ArgumentsAnalyzer.addCurlOptionArraySinks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47f9e5c100c57310a9d95f7c08ed6477d1639461f9f5ae1b32926ce93a73981"}},{"ruleId":"D2","level":"warning","message":{"text":"TernaryAnalyzer.mergeRedefinedVars (cognitive 18): TernaryAnalyzer.mergeRedefinedVars has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 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":"src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1410d5432252076abf7372c585d54e11f20cf7ac7e24513c8d0f0512aedfdbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Cache.__construct (cognitive 18): Cache.__construct has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cache.php"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e2925cb5107ae81f1e363755f393a0b2da1bea9a4a059ee128512dd9752438"}},{"ruleId":"D2","level":"warning","message":{"text":"Populator.extendType (cognitive 18): Populator.extendType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9d2851e8d7efa82bccd911c09e2f079e56e98fe92f5482d562dcd66473db8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiverPropertyTaints.getElementCopySource (cognitive 18): ReceiverPropertyTaints.getElementCopySource has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (5 pts), loops 1, ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1504e9a235669889a06d605854332e19f1f1aea519e9199eb792300f44d94c4"}},{"ruleId":"D2","level":"warning","message":{"text":"AstDiffer.calculateTrace (cognitive 18): AstDiffer.calculateTrace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), boolean chains 5 (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":"src/Psalm/Internal/Diff/AstDiffer.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89e1b5abfe321c23133005322c841c6377f74cb7c5d2c8a63d11b739e96ac73"}},{"ruleId":"D2","level":"warning","message":{"text":"AstDiffer.extractDiff (cognitive 18): AstDiffer.extractDiff has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 3 (5 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/AstDiffer.php"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a8372b71fc0c94c175089ad4708e8775330c0ab8f41f704e752e226d9e77cb"}},{"ruleId":"D2","level":"warning","message":{"text":"FileDiffer.coalesceReplacements (cognitive 18): FileDiffer.coalesceReplacements has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/FileDiffer.php"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"70586de15bd874a518ff6cb575e7e7eb02995c37ba8a8245c876e39b171b7257"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionScanner.scan (cognitive 18): ExpressionScanner.scan has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (8 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2379ba452b01a4ca27d976b253aa0f9e2d6dd72462f6492d77381a40df00026e"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeDocblockParser.extractReturnType (cognitive 18): FunctionLikeDocblockParser.extractReturnType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"5325ee6e13321253c0421dc0c68a29b4575bcd1b7d421b8dadf5331182b6f736"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlFunctionTainter.addTaints (cognitive 18): HtmlFunctionTainter.addTaints has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7 (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. This shape REPEATS in the file: one other method here (HtmlFunctionTainter.removeTaints) 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":"src/Psalm/Internal/Provider/AddRemoveTaints/HtmlFunctionTainter.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78a45fe634c4ee5d4ddab92f46c6438229df228d813e45a101dea91191a98a3"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlFunctionTainter.removeTaints (cognitive 18): HtmlFunctionTainter.removeTaints has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7 (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. This shape REPEATS in the file: one other method here (HtmlFunctionTainter.addTaints) 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":"src/Psalm/Internal/Provider/AddRemoveTaints/HtmlFunctionTainter.php"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9f6ee677ec65737d67ccfe074ef406c857d5598719346749f7761ab96fc477"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayReplaceRecursiveReturnTypeProvider.replaceValue (cognitive 18): ArrayReplaceRecursiveReturnTypeProvider.replaceValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 3 (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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReplaceRecursiveReturnTypeProvider.php"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae5eeeb0816571f7bf5b3f2efa60e267404c1e3fac0efb1ceda26606fdc7531"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterUtils.checkRedundantFlags (cognitive 18): FilterUtils.checkRedundantFlags has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"84013db5dc2e72d5f3c141247aeae75604ac92d4a507e5fab3f8ac2d9cf70d30"}},{"ruleId":"D2","level":"warning","message":{"text":"SerializedProperties.findSpecialKeys (cognitive 18): SerializedProperties.findSpecialKeys has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/SerializedProperties.php"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c47e17a07e752acb2072ebc4fe5b32a661bf255a7a79492947df3467c3b3e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreeCreator.handleComma (cognitive 18): ParseTreeCreator.handleComma has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 6, loops 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07671d4781340f429c458966584c88af95baf30c9d001618bf2596702fa6cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreeCreator.handleAmpersand (cognitive 18): ParseTreeCreator.handleAmpersand has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, loops 1 (2 pts), ternaries 2 (nesting depth added 2). 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":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c893da2127d146633dc57d887f1d7aa94de07fd272ad5a9a364f4512d7ce9f"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileValueOf (cognitive 18): SimpleAssertionReconciler.reconcileValueOf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":3292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc26bc435da5063c04334195942a8b86de8ee89c226c4f79311c071137a9252"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileFalse (cognitive 18): SimpleNegatedAssertionReconciler.reconcileFalse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SimpleNegatedAssertionReconciler.reconcileTrue) 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31676c0af1088f94dca30db0f72dc052fe62ab54d0c529d28020b90d2d8d807"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleNegatedAssertionReconciler.reconcileTrue (cognitive 18): SimpleNegatedAssertionReconciler.reconcileTrue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SimpleNegatedAssertionReconciler.reconcileFalse) 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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3106d61339303a28bf41ac0a7d3d9f0f31c26e3c65364aea32795ca9b8b309"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker.checkTemplateParam (cognitive 18): TypeChecker.checkTemplateParam has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, ternaries 2 (5 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":"src/Psalm/Internal/TypeVisitor/TypeChecker.php"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f4efe9b853dbbe0904fbb51ce85a06679674aa159179ad29844adecc473cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"TClassStringMap.replaceTemplateTypesWithStandins (cognitive 18): TClassStringMap.replaceTemplateTypesWithStandins has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 5, 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":"src/Psalm/Type/Atomic/TClassStringMap.php"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a9febda1e7e5aba5aa22c1c859d87660b1fbeaf19a0a12710735f10851601f"}},{"ruleId":"D2","level":"warning","message":{"text":"TKeyedArray.make (cognitive 18): TKeyedArray.make has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, loops 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":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a264580f390073c6049afc6318b10c6e25b8b9810fd1ac57584f0456567ac7db"}},{"ruleId":"D2","level":"warning","message":{"text":"Codebase.getReferenceAtPositionAsReference (cognitive 17): Codebase.getReferenceAtPositionAsReference has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (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":"src/Psalm/Codebase.php"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"b880a036a61588f7215589234a332044bb99c403c133f0bcdbe451496f5f84a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.loadCustomTaints (cognitive 17): Config.loadCustomTaints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6a2008f42d78ac786c4bffdf75830a88f891b53a77dfbe0a3955adb301b5aa"}},{"ruleId":"D2","level":"warning","message":{"text":"CiCreator.detectPsalmVersion (cognitive 17): CiCreator.detectPsalmVersion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, ternaries 2, error handling 1, loops 1 (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":"src/Psalm/Config/CiCreator.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccd11310b7a7be78f4636543b984fcaede64e637abd0031c6e7c24c502ca69f"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodComparator.transformTemplates (cognitive 17): MethodComparator.transformTemplates has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (8 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2ddbdbd4c33be44e8636444cc3c42007578c6cd25c55d2852d6946ebb9f8a6"}},{"ruleId":"D2","level":"warning","message":{"text":"DoAnalyzer.reportIssues (cognitive 17): DoAnalyzer.reportIssues has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (5 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":"src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"caec81921bed2119e9bbf17bcb44609e4612dc2ff6e3d24cc71bc0ab6a323c77"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeachAnalyzer.taintItemsWrittenByRef (cognitive 17): ForeachAnalyzer.taintItemsWrittenByRef has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 3 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eda6734ad8272c0253c5bbb47bdcfb08791afdbd5a393e84066b8d76a6c4dc"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getGettypeInequalityAssertions (cognitive 17): AssertionFinder.getGettypeInequalityAssertions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2803}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fe97fc2f6faeed73efda7cc5d973879afa2e9fe594445d5fb22ea6afa60444"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.getEmptyArrayEqualityAssertions (cognitive 17): AssertionFinder.getEmptyArrayEqualityAssertions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3488}}}],"partialFingerprints":{"codehealthFindingId/v1":"7244c9d66cc6260e32cc3067a68f069b3ce7dfa57e983e2b63241851fc0bad83"}},{"ruleId":"D2","level":"warning","message":{"text":"InstancePropertyAssignmentAnalyzer.taintUnspecializedProperty (cognitive 17): InstancePropertyAssignmentAnalyzer.taintUnspecializedProperty has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 5, loops 1 (2 pts), ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a58ff4a8378339bb075143dcb23ad7f763086683a6bf79e76a99b83350931a"}},{"ruleId":"D2","level":"warning","message":{"text":"ArithmeticOpAnalyzer.getBitwiseResultOfNonNegativeRanges (cognitive 17): ArithmeticOpAnalyzer.getBitwiseResultOfNonNegativeRanges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, ternaries 3 (5 pts), loops 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a16eadcbc48aadb11b4e715d8d40829e18b23b5992189f2c2f575678a6991fc"}},{"ruleId":"D2","level":"warning","message":{"text":"ArithmeticOpAnalyzer.analyzeOperandsBetweenIntRange (cognitive 17): ArithmeticOpAnalyzer.analyzeOperandsBetweenIntRange has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 2. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"db125f53b90bcdebe148e53cccda04b055c732eef0ca399543464f4e4b0578df"}},{"ruleId":"D2","level":"warning","message":{"text":"PipeAnalyzer.getDirectCall (cognitive 17): PipeAnalyzer.getDirectCall has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 1, 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/PipeAnalyzer.php"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e36a502c200f7fec414096d87808dc2140ec27599cac97b31aa93d8a25d7a8"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallAnalyzer.callUsesByReferenceArguments (cognitive 17): FunctionCallAnalyzer.callUsesByReferenceArguments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 2 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab9ac884915596836eeae91f6edc15e238afd147ba1469eb6a52bb3c47ec7c3"}},{"ruleId":"D2","level":"warning","message":{"text":"HighOrderFunctionArgHandler.remapLowerBounds (cognitive 17): HighOrderFunctionArgHandler.remapLowerBounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/HighOrderFunctionArgHandler.php"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b977bd91dbfab26454011d7ad764f01d708038d472839365bcad7fd13c64ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"ExistingAtomicStaticCallAnalyzer.getMethodReturnType (cognitive 17): ExistingAtomicStaticCallAnalyzer.getMethodReturnType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f0eecf27c65a9b7b58dd3dc521059e9e042d972e14740b81798ae63e416e74"}},{"ruleId":"D2","level":"warning","message":{"text":"CallAnalyzer.checkFunctionExists (cognitive 17): CallAnalyzer.checkFunctionExists has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (6 pts), error handling 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d0622c377308269a75fb7edacc3c1775c34f27f72d2d27874f561994d71c56"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.handleMixedArrayAccess (cognitive 17): ArrayFetchAnalyzer.handleMixedArrayAccess has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 1 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"421056c9564396111332be1a666c344f3bc2ed8e1397c91843df15d89aa5803e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.splitInvalidOffsetTypes (cognitive 17): ArrayFetchAnalyzer.splitInvalidOffsetTypes has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (6 pts), ternaries 1 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":2774}}}],"partialFingerprints":{"codehealthFindingId/v1":"07148682ba24e1fbd37a06da9f8665a9d4ecc7e40a661e55d969c297660053fe"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicPropertyFetchAnalyzer.processUnspecialTaints (cognitive 17): AtomicPropertyFetchAnalyzer.processUnspecialTaints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 2 (5 pts), boolean chains 3, loops 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f984c271217aa71c71d4805a316d784f3ddbac2df96ddeedab35aac6c80860"}},{"ruleId":"D2","level":"warning","message":{"text":"InstancePropertyFetchAnalyzer.isUndeclaredInterfacePropertyOf (cognitive 17): InstancePropertyFetchAnalyzer.isUndeclaredInterfacePropertyOf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, loops 1, ternaries 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"b478c5e47b6d3ae8623baca8bf2af9957af1ae90b05026394adefd9b6b3e52a5"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticPropertyFetchAnalyzer.analyzeVariableStaticPropertyFetch (cognitive 17): StaticPropertyFetchAnalyzer.analyzeVariableStaticPropertyFetch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), boolean chains 3, ternaries 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc67171d6b1a606d624e082e54392f56cb95ac1db42a62b332c358bcf8d2fb7"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalStateAnalyzer.propagate (cognitive 17): GlobalStateAnalyzer.propagate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 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":"src/Psalm/Internal/Analyzer/Statements/Expression/GlobalStateAnalyzer.php"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a075f3ed21fee7808f465a759336b84b66d7f9d58a53baf8aeb15fd1825495b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer.updateFile (cognitive 17): Analyzer.updateFile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 3 (6 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6365c3e0f6d9e71c2d8356ace37ad157b211033cd2494cce440da21c406fa5"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikes.moveMethods (cognitive 17): ClassLikes.moveMethods has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6317d31a29618b0a2d8b835d97724d05c5e9d96135f45ce4391ae39d1b938969"}},{"ruleId":"D2","level":"warning","message":{"text":"CliOutput.markPrintedArgs (cognitive 17): CliOutput.markPrintedArgs has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/CliOutput.php"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f108d5ee18ab467fd76d936477307496d09a0e71ba03fe348e6738cf232c03b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.queueClassLikeForScanning (cognitive 17): Scanner.queueClassLikeForScanning has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 1 (3 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":"src/Psalm/Internal/Codebase/Scanner.php"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"29415466284c89818e55e5db42c2aed4e35ea9e569ff980834df0c8370f804b3"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.computeTaintAddingReachable (cognitive 17): TaintFlowResolution.computeTaintAddingReachable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 5 (8 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"da51515310aaebe3a66d23a63647d9df43116dd02f40355059030242e693ee41"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintStore.getStores (cognitive 17): TaintStore.getStores has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (6 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":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ec89fa98764c41d8357a81bc65e645f72f223b3d640483c0f4e458fc984adc"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintStore.getArgsByParam (cognitive 17): TaintStore.getArgsByParam has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec056cf589cb99424dddb4d9af4cde6f258cc6938c520ce94bfd60febac2b14"}},{"ruleId":"D2","level":"warning","message":{"text":"IncludeCollector.getFilteredIncludedFiles (cognitive 17): IncludeCollector.getFilteredIncludedFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 3 (4 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":"src/Psalm/Internal/IncludeCollector.php"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f28eb2362bf26fb53a138b360d0182879bfb9a29516b82a4411a5ab5ca5c435"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeDocblockParser.keepTemplatesInParamTypes (cognitive 17): ClassLikeDocblockParser.keepTemplatesInParamTypes has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 2 (5 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8275c35f24b4d8b6631dac08e086194926b4e0483aedd63c620a369409bc0a"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionLikeNodeScanner.isConstantValue (cognitive 17): FunctionLikeNodeScanner.isConstantValue has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (6 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9020c360b23bba1e67a0c7037def8c9273ebd4ed01a5151a6ce31e805223cf"}},{"ruleId":"D2","level":"warning","message":{"text":"FfiMemcmpParamsProvider.getMethodParams (cognitive 17): FfiMemcmpParamsProvider.getMethodParams has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 3 (6 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ParamsProvider/FfiMemcmpParamsProvider.php"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b71823ec01793d3f74c27d3f8beed8a579632c84863fa8c6df1eed887fc83dd"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayReplaceRecursiveReturnTypeProvider.replaceWithUnpackedArray (cognitive 17): ArrayReplaceRecursiveReturnTypeProvider.replaceWithUnpackedArray has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReplaceRecursiveReturnTypeProvider.php"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d9d835d2c802de02685b4de29ded83f3a9e6a1531196026d60348535b3196c"}},{"ruleId":"D2","level":"warning","message":{"text":"StrReplaceReturnTypeProvider.getFunctionReturnType (cognitive 17): StrReplaceReturnTypeProvider.getFunctionReturnType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, loops 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/StrReplaceReturnTypeProvider.php"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"98480d5080b5784007ed3d298bf84b0c1605f364ca3d5f528645acc6d2a5f4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicParts.split (cognitive 17): AtomicParts.split has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 4 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AtomicParts.php"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2638adb6ebbb4406000bd79a768fc03777676d7b04b936094130b4297e6ff2aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosedInheritanceToUnion.map (cognitive 17): ClosedInheritanceToUnion.map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ClosedInheritanceToUnion.php"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8dd650c44477117f4fbae518636faa5cf337a43726721a1adc261b8def00eb"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionTypeComparator.getTypeParts (cognitive 17): UnionTypeComparator.getTypeParts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, ternaries 1 (3 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":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9e4ab4245df88143b0a039422c330d5f8f244748c66fa21b619d910f19d425"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCombiner.getSharedTypes (cognitive 17): TypeCombiner.getSharedTypes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), ternaries 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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a1ef658887943a79d5ca5e061419082ef7a2af5cd65f07d0dc2f2ee809cb87"}},{"ruleId":"D2","level":"warning","message":{"text":"Atomic.visit (cognitive 17): Atomic.visit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic.php"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"7397627fa005b313e4e86ea119f4f61023c4cc1daec3ea10d00018c11a3c348f"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericTrait.replaceTypeParamsTemplateTypesWithStandins (cognitive 17): GenericTrait.replaceTypeParamsTemplateTypesWithStandins has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, ternaries 2 (3 pts), loops 1 (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":"src/Psalm/Type/Atomic/GenericTrait.php"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfab23e1cd79cdf6297584900522acae49e0e448b484759bdeddfaad007a9dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"TKeyedArray.setProperties (cognitive 17): TKeyedArray.setProperties has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 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":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd47af2599ab6b491c70cbb872805cda1c7b2e2880cfd14504fb071280c5bdf1"}},{"ruleId":"D2","level":"warning","message":{"text":"Codebase.getGuardedPhpVersionId (cognitive 16): Codebase.getGuardedPhpVersionId has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (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":"src/Psalm/Codebase.php"},"region":{"startLine":3425}}}],"partialFingerprints":{"codehealthFindingId/v1":"40186905b6d8796ccbf4df2580e3f6fbf9e4abe1a7dea91bfe29915a2a47a8fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.getReportingLevelForIssue (cognitive 16): Config.getReportingLevelForIssue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15b921bfeb6698cd32ddded0a71789e699854413a950412fba7b1e96ff207b0"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeAnalyzer.getTraitUseMethodMutations (cognitive 16): ClassLikeAnalyzer.getTraitUseMethodMutations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8820f7f74bf123b044142c15a833d980494f0191983a15089154a61a6fc714"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectAnalyzer.checkPaths (cognitive 16): ProjectAnalyzer.checkPaths has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (7 pts), boolean chains 2 (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":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ea31018e5b414bced6e47aa9aa73194f0332f83000a938add9cf687b26818d"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeachAnalyzer.withoutKeysOfNarrowing (cognitive 16): ForeachAnalyzer.withoutKeysOfNarrowing has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2, 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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c013ee3d66402726c4188602edfc2cd4a7992bf3fe14b041d91993d0a9372b"}},{"ruleId":"D2","level":"warning","message":{"text":"IfConditionalAnalyzer.getDefinitelyEvaluatedExpressionAfterIf (cognitive 16): IfConditionalAnalyzer.getDefinitelyEvaluatedExpressionAfterIf 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. This shape REPEATS in the file: one other method here (IfConditionalAnalyzer.getDefinitelyEvaluatedExpressionInsideIf) 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c11717ce232215acb8ab9fd23c899c355d4f542dce7d99190e1618f8c3ca1d"}},{"ruleId":"D2","level":"warning","message":{"text":"IfConditionalAnalyzer.getDefinitelyEvaluatedExpressionInsideIf (cognitive 16): IfConditionalAnalyzer.getDefinitelyEvaluatedExpressionInsideIf 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. This shape REPEATS in the file: one other method here (IfConditionalAnalyzer.getDefinitelyEvaluatedExpressionAfterIf) 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"709a9ad29275793d620761dd34f5e0c54971491c8d05c36c5154660642d8338a"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertionFinder.hasTypedValueComparison (cognitive 16): AssertionFinder.hasTypedValueComparison has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 13, if/else 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"04195304e6db77625977c5b28feb3e68e7029226f5aa6e0a1a3cedcd95d85dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentAnalyzer.saysNothingAbout (cognitive 16): ArgumentAnalyzer.saysNothingAbout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"559f275cf8d86c967fd70767ef020743ea105df90aef6ba7587287d3a307a2a7"}},{"ruleId":"D2","level":"warning","message":{"text":"CallPurityResolver.getOuterPurityTemplates (cognitive 16): CallPurityResolver.getOuterPurityTemplates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/CallPurityResolver.php"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f33a73581cf17aa29f72c12d8bc19bc709118cff38fe933e160f089a92e8426"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallAnalyzer.getMethodCallableSignatures (cognitive 16): FunctionCallAnalyzer.getMethodCallableSignatures has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"6430ea27bf0c44a89e2e9541a342df464bad9d26dedb451a97d19ac9411ab863"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCallReturnTypeFetcher.taintCallableReturnType (cognitive 16): FunctionCallReturnTypeFetcher.taintCallableReturnType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (6 pts), 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed6bb0a838816d3d5ca5b25689b32e68c0f667744dc6393638814ea56a3bab8"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallPurityAnalyzer.getDeclaredPlainPropertyType (cognitive 16): MethodCallPurityAnalyzer.getDeclaredPlainPropertyType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5184a221aa3474b7bcb1bc7364bbba3f9dc907bc71f40bad5036de547e1389"}},{"ruleId":"D2","level":"warning","message":{"text":"CastAnalyzer.getStringConversionParentNodes (cognitive 16): CastAnalyzer.getStringConversionParentNodes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33d965711ebe37a322abf1600a6c11e5af2fd0bc927f1cd3f61c0138d87b60b"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFetchAnalyzer.checkArrayOffsetType (cognitive 16): ArrayFetchAnalyzer.checkArrayOffsetType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae24576f0b01502335f8cfe802e852e536ee9a2cdf2988210cd6b54c3e82662"}},{"ruleId":"D2","level":"warning","message":{"text":"InstancePropertyFetchAnalyzer.isLeftUninitialized (cognitive 16): InstancePropertyFetchAnalyzer.isLeftUninitialized has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1993951a81528ed49fc174591f28362cca9aaba9641175f253383ef9003ea7"}},{"ruleId":"D2","level":"warning","message":{"text":"IntMaskComparisonAnalyzer.analyzeBinaryOp (cognitive 16): IntMaskComparisonAnalyzer.analyzeBinaryOp has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, if/else 3 (4 pts), loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/IntMaskComparisonAnalyzer.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"692ba409fc8e3b7cef30e9d696fadb83a62a87a1da8d284eb9b76788477d49af"}},{"ruleId":"D2","level":"warning","message":{"text":"IntMaskComparisonAnalyzer.analyzeSearch (cognitive 16): IntMaskComparisonAnalyzer.analyzeSearch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (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":"src/Psalm/Internal/Analyzer/Statements/Expression/IntMaskComparisonAnalyzer.php"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"162583828b6f872cd4b7d35c6d0864f2bd9b25d3581f2bf589aa7424231e884d"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionAnalyzer.checkRiskyTruthyFalsyComparison (cognitive 16): ExpressionAnalyzer.checkRiskyTruthyFalsyComparison has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (2 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":"src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42b3bfc35ba9986ea454fee87c8413a35cf8ec4e2eb641843f7f95345d2afdb"}},{"ruleId":"D2","level":"warning","message":{"text":"CliOutput.isInCliOnlyCode (cognitive 16): CliOutput.isInCliOnlyCode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/CliOutput.php"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c01a7572d96cb2dbc508cba0d6e1276f7bcd185eb680fabc0a233bb5b71174"}},{"ruleId":"D2","level":"warning","message":{"text":"Reflection.createFunctionStorage (cognitive 16): Reflection.createFunctionStorage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Reflection.php"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b0e667bdcf5a38856fc3279164f317615c39b6dd9e341bcbfc5dd8f66efc4d"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowGraph.addGraph (cognitive 16): TaintFlowGraph.addGraph has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 5 (6 pts), boolean chains 3 (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":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e45e9117425546537690aab6f2cfe139d3ed4131fce6a9ed1a3a309fbfd34e"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.getObservedDepths (cognitive 16): TaintFlowResolution.getObservedDepths has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7e56f86e3f3c7d4397e4e8928ef08ef7ec0f3457a9b5bfbbdd383975639f55"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.getPathTypeEffects (cognitive 16): TaintFlowResolution.getPathTypeEffects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3, boolean chains 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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8894ba37cb13641bf81e32e8f72c7c892332fe422d306184bdad1ff8cf9368"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.getAssignmentClass (cognitive 16): TaintFlowResolution.getAssignmentClass has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 3 (5 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":3187}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d5715c9e55a365f8f173a8c3a154f1ee1d4cd059e3bb50eaf7b5ff5337b84b"}},{"ruleId":"D2","level":"warning","message":{"text":"TaintFlowResolution.addEntrySink (cognitive 16): TaintFlowResolution.addEntrySink has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (5 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":3627}}}],"partialFingerprints":{"codehealthFindingId/v1":"5996afc948d785cbc02ad966cfb31cfe616e6f3e9cf52ac5d36092b6c1ea18f7"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeTable.encode (cognitive 16): NodeTable.encode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6 (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":"src/Psalm/Internal/DataFlow/NodeTable.php"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7fdaba2ad408da2310b10bdffba42465bc026f352bd3c769ecc4f3e1049dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionScanner.visitInclude (cognitive 16): ExpressionScanner.visitInclude has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 1 (2 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":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f0b04490b7da77b58241fd60a8f91dee214986368fd65d8ce5277ec145898c"}},{"ruleId":"D2","level":"warning","message":{"text":"ReflectorVisitor.recordStaticPropertyMutation (cognitive 16): ReflectorVisitor.recordStaticPropertyMutation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"197608249b1e791eca272660a09bf33313fdab37f5a2c9009b9d0ed142cb6b11"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayReplaceRecursiveReturnTypeProvider.getMergedValueType (cognitive 16): ArrayReplaceRecursiveReturnTypeProvider.getMergedValueType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 1, 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReplaceRecursiveReturnTypeProvider.php"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdf34196e18697c839fc2c12c3195edab9dd6b47b306023b1126cdd8f802ed6"}},{"ruleId":"D2","level":"warning","message":{"text":"TrimReturnTypeProvider.getFunctionReturnType (cognitive 16): TrimReturnTypeProvider.getFunctionReturnType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 1, match/switch 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/TrimReturnTypeProvider.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"219b79154525968ff653338cce517a50b6dc0d110c2c1e280080f91f8d3e8494"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyedArrayComparator.isContainedByObjectWithProperties (cognitive 16): KeyedArrayComparator.isContainedByObjectWithProperties has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d89a5b5f2d24f65636676409d4fd3633df300d47005eaeb98489e6d1941a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileBool (cognitive 16): SimpleAssertionReconciler.reconcileBool has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd468a0be40132cc0f0c7b75eabf1c2307f8547df1397c80bc963f1593c25cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileScalar (cognitive 16): SimpleAssertionReconciler.reconcileScalar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c6cd1daac94e88acfdd576c6909c82c9b3b5538e4977a6bfd81fbc03e816be"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleAssertionReconciler.reconcileIterable (cognitive 16): SimpleAssertionReconciler.reconcileIterable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ee4441d35031c1fe32cbcdbf9290c5f8e3ba8149d92af2850ccb86151d26f4"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCombination.fallbackKeyAlwaysContains (cognitive 16): TypeCombination.fallbackKeyAlwaysContains has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeCombination.php"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56edcd4563f81f5e61304074bbde2bd9b6efb1c07fa5c08490d66199d36c867"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeExpander.expandUnion (cognitive 16): TypeExpander.expandUnion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"51aad53bc9dda1de06832d8f715fd0497fc5b3654f7b7fcbeb35bad50329e8ff"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.getGenericParamClass (cognitive 16): TypeParser.getGenericParamClass has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"36361dda939a48740fd7f0a4b4d66938662e52b6d0bf059a17dfd78f14e9679c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParser.intersectObjectTypes (cognitive 16): TypeParser.intersectObjectTypes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, loops 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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f25419e1f26a713e0ba27c699965da4067f573ccca8776af5d2954d666e13c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker.enterNode (cognitive 16): TypeChecker.enterNode has cognitive complexity 16 (threshold 15). Drivers by points: loops 2 (6 pts), boolean chains 5, if/else 4 (5 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":"src/Psalm/Internal/TypeVisitor/TypeChecker.php"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff82e225429849d4d47cd90de74944714e1cd17eb906ecb018c60ecd098f9de"}},{"ruleId":"D2","level":"warning","message":{"text":"Possibilities.getUntemplatedCopy (cognitive 16): Possibilities.getUntemplatedCopy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 4, loops 2 (4 pts), 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":"src/Psalm/Storage/Possibilities.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c75023fcc0dddeb0ff0c5b330da007bc939cd11af0b479966f411acb2d96be"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.getStringFromFQCLN (cognitive 16): Type.getStringFromFQCLN has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 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":"src/Psalm/Type.php"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"50aff44535d2f432c4dbd0be517c97caf1c8808ae31ee43105fa38df8725f506"}},{"ruleId":"D2","level":"warning","message":{"text":"TKeyedArray.getGenericArrayType (cognitive 16): TKeyedArray.getGenericArrayType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d9a11102ecbb0804baab63a78c5a4eae878a4d1aec40501358afaddad3a813"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AssertionFinder: ClassTooLong \u2014 3078 significant lines (blank, comment-only and punctuation-only lines excluded), 81 methods. The bar is 400 significant lines; this is 2678 over it, 7.70\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b8265e37cea7857504689f779481f998ce7bb3d544db3a972ea5ba223da9a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionLikeAnalyzer.analyze: MethodTooLong \u2014 analyze runs 668 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 568 over it, 6.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42a236c996afb009d0347f773823370d7817ecbb489e8081e94ae2fa3e95ac5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassLikeNodeScanner.start: MethodTooLong \u2014 start runs 652 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 552 over it, 6.52\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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e289a3fca32a35cb23027915b04924dcd738294dfa84da2d5b2315fda99416"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Expression/AssertionFinder.php: FileTooLong \u2014 3208 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: AssertionFinder (144-5077). The bar is 500 significant lines; this is 2708 over it, 6.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d4db5658339d9b5bf4ff1a7996fafe555951a3163679fed04726a7ca530e40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilterUtils.getReturnType: MethodTooLong \u2014 getReturnType runs 562 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 462 over it, 5.62\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"2441c47cb7f122961f37a2518afe1bd2824a5991a8e1418c62ce80d856554087"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AtomicTypeComparator.isContainedBy: MethodTooLong \u2014 isContainedBy runs 557 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 457 over it, 5.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b7cb6ffced2dafd4200e2fd50758cad6ec05dba99e6f77a1aadde4a9a38a52"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SimpleAssertionReconciler: ClassTooLong \u2014 2197 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 1797 over it, 5.49\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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c69b929ce87013d49dd93b992533957f2d9737c1119ef440f2d48daab9a819d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReturnTypeAnalyzer.verifyReturnType: MethodTooLong \u2014 verifyReturnType runs 514 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 414 over it, 5.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e593bf8143ecd695aa9dee23ce347549d0b81171999b429f4250c29b1106b40"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AssignmentAnalyzer: ClassTooLong \u2014 1954 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 1554 over it, 4.89\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf1cd9b18b13b2ac3883165525f08e4a80a4cb945566ad295514fbee9a55eac"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PreloaderList: ClassTooLong \u2014 1897 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 1497 over it, 4.74\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":"src/Psalm/Internal/PreloaderList.php"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"531ee3ede5add82a1bd57db31ea91be592f19b11edfddb62ce8f6c982aa4ffeb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InstancePropertyAssignmentAnalyzer.analyzeAtomicAssignment: MethodTooLong \u2014 analyzeAtomicAssignment runs 464 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 364 over it, 4.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df05a0f10a544681866da1637763d66330639b44689ed75e0c0412b68c55cc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Type/SimpleAssertionReconciler.php: FileTooLong \u2014 2291 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: SimpleAssertionReconciler (108-3396). The bar is 500 significant lines; this is 1791 over it, 4.58\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6888592a48ae80d0a76412efa628e12146b98d0b4c0583fd7ddfd46afcf77943"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArithmeticOpAnalyzer.analyzeOperands: MethodTooLong \u2014 analyzeOperands runs 455 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 355 over it, 4.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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"7854c0bb8ba4e94d115d86770e9901f02acf4dfdd9dde056ff80fc1ead8ccdb8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClassAnalyzer: ClassTooLong \u2014 1818 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 1418 over it, 4.55\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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"68134b9b240a39278852e60a30c00cc7d755152712b92150b1d54693937d602e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionLikeAnalyzer: ClassTooLong \u2014 1806 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods. The bar is 400 significant lines; this is 1406 over it, 4.52\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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcfcac8b8703eb9b40a3f3e457df5bf684fdcce67c2692398241bdb16374439"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassConstAnalyzer.analyzeFetch: MethodTooLong \u2014 analyzeFetch runs 441 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 341 over it, 4.41\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a955921d4967592da3dff0d069bf1684957b4516e3369397b927879549b3f2be"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClassLikes: ClassTooLong \u2014 1757 significant lines (blank, comment-only and punctuation-only lines excluded), 70 methods. The bar is 400 significant lines; this is 1357 over it, 4.39\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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1858397edbb5a67e2181d2d6005379869bc0ea70c853aed1dee431fc2c8c4c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoopAnalyzer.analyze: MethodTooLong \u2014 analyze runs 436 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 336 over it, 4.36\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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a30de3bb000011ec660b5683014e30ff26743c0a7f7f2ac8ce2a591e3c9585"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AtomicStaticCallAnalyzer.handleNamedCall: MethodTooLong \u2014 handleNamedCall runs 435 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 335 over it, 4.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3602d890f40598f64c5a9dc4afbc513404cfcfd68199b279b3051844ee1149f2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaintFlowResolution: ClassTooLong \u2014 1700 significant lines (blank, comment-only and punctuation-only lines excluded), 80 methods. The bar is 400 significant lines; this is 1300 over it, 4.25\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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a60eb1bd464d210a1d745f25f1346c0a216325356e8c626ed73d432c29aba5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormulaGenerator.getFormula: MethodTooLong \u2014 getFormula runs 422 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 322 over it, 4.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c084539cbdbd00018fcdc74950b4e48e61a02c9da8b2c6a6f525ebd09f3a43"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArrayFetchAnalyzer: ClassTooLong \u2014 1687 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 1287 over it, 4.22\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a44601d98c0d550cc6c0aee9809f098dabbc12e8e0920633443fb51b52ad23"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeExpander.expandAtomic: MethodTooLong \u2014 expandAtomic runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21\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":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f67c8e9ca8892cef60f7531324179df6d5fde0622647de0028f07f8bcbf7d1d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClassLikeNodeScanner: ClassTooLong \u2014 1682 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 1282 over it, 4.21\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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5471313eee2dd4107778cf22d6ae417fc8f3ab0692faa8e2d767dc7f8585afc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Codebase: TooManyMethods \u2014 125 methods. The bar is 30 methods; this is 95 over it, 4.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce15d4ef9d38f82c1c56a07462fa5ba7e51405a006f85046699f27945abe10c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Expression/AssignmentAnalyzer.php: FileTooLong \u2014 2075 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: AssignmentAnalyzer (131-3225). The bar is 500 significant lines; this is 1575 over it, 4.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da41d12d3f744afddf6c5229671f85c68e4954918453e3e492c96150237031b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExistingAtomicStaticCallAnalyzer.analyze: MethodTooLong \u2014 analyze runs 411 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 311 over it, 4.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dd134b160580d66bdef63259fb890158d2b60fc362203c3179b8fd6b15225a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeCombiner.scrapeTypeProperties: MethodTooLong \u2014 scrapeTypeProperties runs 411 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 311 over it, 4.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d6fbfb0616b44ef679b7edc0d7ec4d94c49a0a2b1c385f44fe453f56d199c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AtomicMethodCallAnalyzer.analyze: MethodTooLong \u2014 analyze runs 405 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 305 over it, 4.05\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ed93cb1d5710ee20085c968132d915109122400ef1d2fbf715a4634c593d42"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AtomicPropertyFetchAnalyzer.analyze: MethodTooLong \u2014 analyze runs 403 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 303 over it, 4.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6cc6f86344f32a76fcd490afd17f006f5fb09ed747ad1ab428c5f94797db16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionLikeNodeScanner.start: MethodTooLong \u2014 start runs 403 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 303 over it, 4.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d9f4a62630351a25e9212b460d0b9faa180ff64b40ae69885605f8e1d1558f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeParser: ClassTooLong \u2014 1610 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 1210 over it, 4.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fca463ce973ed0ced392d0f2f58499aee928dabc36957ac16b7ff755854f831"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Codebase: ClassTooLong \u2014 1605 significant lines (blank, comment-only and punctuation-only lines excluded), 125 methods. The bar is 400 significant lines; this is 1205 over it, 4.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec3a6e0bd8f4d363447f9be0f1318fc90b5392f122d5e479b7f41f4d44de2f9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config: ClassTooLong \u2014 1588 significant lines (blank, comment-only and punctuation-only lines excluded), 96 methods. The bar is 400 significant lines; this is 1188 over it, 3.97\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":"src/Psalm/Config.php"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2950163c6a31967c4010dd15d61d0597ea902a4c168624816633482060a22222"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Analyzer/ClassAnalyzer.php: FileTooLong \u2014 1936 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ClassAnalyzer (127-2970). The bar is 500 significant lines; this is 1436 over it, 3.87\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8971fc265d586e286edf4fb915e4234726af134584e7bab6e8011638bb3e402d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExistingAtomicMethodCallAnalyzer.analyze: MethodTooLong \u2014 analyze runs 386 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 286 over it, 3.86\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3981a65a8a84b951349047a67ceae8c0507b9faedac526627951233134dde252"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Analyzer/FunctionLikeAnalyzer.php: FileTooLong \u2014 1922 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: FunctionLikeAnalyzer (128-3332). The bar is 500 significant lines; this is 1422 over it, 3.84\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"268866d3550e26efa8a1623cb0bf7da0e32626c8ea4a02891aa0245f0b6c50c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Call/ArgumentsAnalyzer.php: FileTooLong \u2014 1922 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1422 over it, 3.84\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c13777506b654045518c9551ab67eb8d16e4d80e8250f7b29477bb380a17a44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Internal/PreloaderList.php: FileTooLong \u2014 1900 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: PreloaderList (12-1911). The bar is 500 significant lines; this is 1400 over it, 3.80\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PreloaderList.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d1efd33f4d9dd0f36de8e86993a74222256cd5341789d0ea54c36ef35235d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeParser.getTypeFromGenericTree: MethodTooLong \u2014 getTypeFromGenericTree runs 373 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 273 over it, 3.73\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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a77cfbb9a7dcc67b206516a425d28de2a61dd5a5fe33ece9c1a0a10d2556a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Codebase/ClassLikes.php: FileTooLong \u2014 1840 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: ClassLikes (96-3277). The bar is 500 significant lines; this is 1340 over it, 3.68\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"544476a461fc5b2377a054425f7146168a29cc9bf0a296596c3438fed632af5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReturnAnalyzer.analyzeReturn: MethodTooLong \u2014 analyzeReturn runs 367 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 267 over it, 3.67\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":"src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fd29e1c46a21fa4d354864fafe230fbd09d61d6c178f222fd313d34a52e252"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SimpleNegatedAssertionReconciler: ClassTooLong \u2014 1456 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 1056 over it, 3.64\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f700cc010b1215930a4da9a7b2f16852bb793ec9d9d7df0ae4a0081975bfd85"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AssertionReconciler: ClassTooLong \u2014 1449 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 1049 over it, 3.62\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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1960cb708aa689c9b57ac9c0c5014d403c5d81274e798b46084d806b4077af4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Fetch/ArrayFetchAnalyzer.php: FileTooLong \u2014 1800 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ArrayFetchAnalyzer (122-2811). The bar is 500 significant lines; this is 1300 over it, 3.60\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bf58d7056a6ed3e7f0fe7b91d4eab32411ce8938a15602ac931754ed02f802"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Reflector/ClassLikeNodeScanner.php: FileTooLong \u2014 1786 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ClassLikeNodeScanner (114-2860). The bar is 500 significant lines; this is 1286 over it, 3.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43803a1e6f2afd731d045beee40075de13b25b7fd77c88ca910c710bae237c5d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssignmentAnalyzer.analyzeAfterTheKeys: MethodTooLong \u2014 analyzeAfterTheKeys runs 357 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 257 over it, 3.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"469637aae76fc8217ed45ff59825fefd95dbf025142489b7ad47d76bbb0d5ab7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Call/ArgumentAnalyzer.php: FileTooLong \u2014 1760 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1260 over it, 3.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72d7112a3ea829128774e5440a84242b76b03d6697ea86bf97969969a0a8dd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Psalm/Config.php: FileTooLong \u2014 1743 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: Config (167-3601). The bar is 500 significant lines; this is 1243 over it, 3.49\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0e9d3dcc049ceaae73d4eb3651d9277688a96c6db6390d829a5987c22f1e52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Type/TypeParser.php: FileTooLong \u2014 1737 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: TypeParser (139-2903). The bar is 500 significant lines; this is 1237 over it, 3.47\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee0dbd7bf5ccd239a4aee719872d62c5eb2ee2e61a8469358a83f72565dae76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Codebase/TaintFlowResolution.php: FileTooLong \u2014 1734 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: TaintFlowResolution (69-4236). The bar is 500 significant lines; this is 1234 over it, 3.47\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5af23ef5f9e0747d53d56b30315423fd5114207cd545f72e0edb14f8ffe5d1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ForeachAnalyzer: ClassTooLong \u2014 1387 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 987 over it, 3.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9ef872d46c85b0ee5d774c794c631b7bcb1c6f57766c49af298ec68ebc0b7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Psalm/Codebase.php: FileTooLong \u2014 1721 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: Codebase (126-3475). The bar is 500 significant lines; this is 1221 over it, 3.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c0a0175b21f8a7db89f8f998dc5cf15faa7fd5c6719091bc604dd47d867dd8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UnionTrait: TooManyMethods \u2014 103 methods. The bar is 30 methods; this is 73 over it, 3.43\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":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4479d2c17d1f2ea0bf6b6ecf859477e8230bd496c6fca46e4eefe0900d84fa16"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NewAnalyzer: ClassTooLong \u2014 1352 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 952 over it, 3.38\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75bbae8649fec53c8a205e9ea4705010dfd560879ad67011a5ee5b3e2b470b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassLikeDocblockParser.parse: MethodTooLong \u2014 parse runs 336 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 236 over it, 3.36\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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46787c82c9630f8c8128d2b45370cc0dff0d06bbea6a5809f42fddae833e23f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionLikeDocblockScanner: ClassTooLong \u2014 1339 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 939 over it, 3.35\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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"66478616bcc3f81d4b666b3fefd6f3e3c1cb032f1edae2858137ca9e0c28c3a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TryAnalyzer.analyze: MethodTooLong \u2014 analyze runs 330 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 230 over it, 3.30\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":"src/Psalm/Internal/Analyzer/Statements/Block/TryAnalyzer.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c9f993abd7557db654b2b350abe82f6f9e8a7d64daedafc6caa5704e00b786"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarTypeComparator.isContainedBy: MethodTooLong \u2014 isContainedBy runs 328 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 228 over it, 3.28\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":"src/Psalm/Internal/Type/Comparator/ScalarTypeComparator.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f28faf246a38d74e276902cade6403a8576e13bde0cfc35023e5055be029be3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config.fromXmlAndPaths: MethodTooLong \u2014 fromXmlAndPaths runs 327 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 227 over it, 3.27\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":"src/Psalm/Config.php"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c0118e688e70741b0e34a1baf38ce6b83d56e63544f438bbd50bd92a950971"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InstancePropertyAssignmentAnalyzer: ClassTooLong \u2014 1306 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 906 over it, 3.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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52e2be8bebb9261e2d8fd60f0d836a930f61eee15febebd5ab4a7863f0320af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SimpleTypeInferer.infer: MethodTooLong \u2014 infer runs 324 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 224 over it, 3.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8b488e47956ff71ef1a93f0a8f67a80b641bc302e57fefc5b7543d3a074cbe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SimpleAssertionReconciler.reconcileAssertion: MethodTooLong \u2014 reconcileAssertion runs 324 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 224 over it, 3.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"960c963c5255511631e77a883d055bc1b3789529d07acee711d429791ad96e7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCallAnalyzer.analyze: MethodTooLong \u2014 analyze runs 323 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 223 over it, 3.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9daa10b05d83ed6268c9d63c253af82774af9dfa3031b7b8c6d5993d4535c74"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionCallAnalyzer: ClassTooLong \u2014 1289 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 889 over it, 3.22\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1c27a088c243f39cbd89df5bef0d3d9f1da9bae0fbc770714424046fb6dc08"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reconciler.reconcileKeyedTypes: MethodTooLong \u2014 reconcileKeyedTypes runs 322 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 222 over it, 3.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85d0fb69ae47981b4d08674ce507b11420178d684e4beb9735242940ea27ed1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 96 methods. The bar is 30 methods; this is 66 over it, 3.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":"src/Psalm/Config.php"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef44d8287218b7f6931a56cc6708ddded8b1bba401f4c342b7b13193ebe6ed5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Reconciler: ClassTooLong \u2014 1267 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 867 over it, 3.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d0d3c46c4658d12e5cbd20dab4ba199f13384c49542b80ebf406a3c10ad08f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassAnalyzer.analyzeClass: MethodTooLong \u2014 analyzeClass runs 315 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 215 over it, 3.15\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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"618bd6aafeccc60124a6110b069487d43c46c23a75b8b13d935527c0539aff5f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IfElseAnalyzer.analyze: MethodTooLong \u2014 analyze runs 311 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 211 over it, 3.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4197d9b168bbd22e9fe311a1f1f6408b8a5a123515bcb2996aa5be6a62758f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NamedFunctionCallHandler.handle: MethodTooLong \u2014 handle runs 309 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 209 over it, 3.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"51488895204bf4471839f5fc4f088fe6fffa56fd4fb19dd11d0c8ac152a1703b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Type/AssertionReconciler.php: FileTooLong \u2014 1538 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: AssertionReconciler (98-2509). The bar is 500 significant lines; this is 1038 over it, 3.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b0b4d7d0cc57d9dd71f57a0d911bd97ffec503e5d69aeb7b6ea659bb90c77d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Type/SimpleNegatedAssertionReconciler.php: FileTooLong \u2014 1526 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: SimpleNegatedAssertionReconciler (79-2204). The bar is 500 significant lines; this is 1026 over it, 3.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26c10a04d581e970afa7eae3e960fb6078502acc10ebe421e0a003384e7d8aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VariableFetchAnalyzer.analyze: MethodTooLong \u2014 analyze runs 305 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 205 over it, 3.05\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1416646ce71fa5c5772335db6b1366e0f54ba7808eea5cfda70ef7c801e64a2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionLikeDocblockScanner.addDocblockInfo: MethodTooLong \u2014 addDocblockInfo runs 305 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 205 over it, 3.05\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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a05cc6d63a8b15a12bcc2932a86e7a4a79fb963edc71da14b6c1fcdd60f25e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionCallReturnTypeFetcher: ClassTooLong \u2014 1218 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 818 over it, 3.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"31576434d159b78af1c214b7e7630d374a169e80de902ee019712516d91b76a0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeCombiner: ClassTooLong \u2014 1207 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 807 over it, 3.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fad8ca1438ffd426aa5786417c5297aca5485551d3fc3b61e32eedb141300fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassAnalyzer.addContextProperties: MethodTooLong \u2014 addContextProperties runs 300 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 200 over it, 3.00\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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88fbe1e99b672115161a435327f1fae0f43e2947661c897749aeef939bab3fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SwitchCaseAnalyzer.analyze: MethodTooLong \u2014 analyze runs 300 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 200 over it, 3.00\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":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchCaseAnalyzer.php"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0422330877534782605a64b20a67bc439eb6964d92a2c5b0b81d099d1d2ca617"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Block/ForeachAnalyzer.php: FileTooLong \u2014 1485 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: ForeachAnalyzer (109-2375). The bar is 500 significant lines; this is 985 over it, 2.97\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aebde904d32c2a72f5bc453b69f421a9b9e6bcb18380a9839d8860773f00d56"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnionTypeComparator.isContainedBy: MethodTooLong \u2014 isContainedBy runs 295 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 195 over it, 2.95\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":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f14a5a51cb34ae7715e1ca74f86c434faca3d9b65ce393815399ef24f17b7fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFetchAnalyzer.getArrayAccessTypeGivenOffset: MethodTooLong \u2014 getArrayAccessTypeGivenOffset runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6327f8066b84ad473176cdf2e8a1d5bb5af46b04669c8fb9748d8fb7db58d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Call/NewAnalyzer.php: FileTooLong \u2014 1438 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: NewAnalyzer (96-2343). The bar is 500 significant lines; this is 938 over it, 2.88\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c50d11ada51fd5a62086b08251817939f517a938e1ba5193c793d6267a555a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MethodComparator: ClassTooLong \u2014 1147 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 747 over it, 2.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"960e82ac719a54ecdab83959b33c8eb1b31c7400634911b48344ef7ed8654026"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Reflector/FunctionLikeDocblockScanner.php: FileTooLong \u2014 1418 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: FunctionLikeDocblockScanner (88-2203). The bar is 500 significant lines; this is 918 over it, 2.84\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e260dc3b3cd4e52f26f278fc33172eb0a03bcf6324b9161211c945a91610353"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Assignment/InstancePropertyAssignmentAnalyzer.php: FileTooLong \u2014 1395 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: InstancePropertyAssignmentAnalyzer (98-2130). The bar is 500 significant lines; this is 895 over it, 2.79\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f394d7cb52d7c095dea7cb4b3c2a3e296af04af925881508120eeb034db677"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SimpleNegatedAssertionReconciler.reconcile: MethodTooLong \u2014 reconcile runs 278 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 178 over it, 2.78\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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a85a14a7bbc41a38e46460155a413f15c13b16e3fdec99ff6c4578aaabe6b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Call/FunctionCallAnalyzer.php: FileTooLong \u2014 1387 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: FunctionCallAnalyzer (108-2181). The bar is 500 significant lines; this is 887 over it, 2.77\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef63cfc7473907edde1eb304df2192c743bc972e2aa76a14d6568baa0cbe27d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArithmeticOpAnalyzer: ClassTooLong \u2014 1108 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 708 over it, 2.77\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"264e419473b2feed2d6a3b0db37829bdbc86814e201ac1287965081650d83548"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArrayAssignmentAnalyzer: ClassTooLong \u2014 1102 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 702 over it, 2.76\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f410f78767ddf2abe4477b682673751162c2b964a93fa0109cfccb0ea4cd34"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LoopAnalyzer: ClassTooLong \u2014 1099 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 699 over it, 2.75\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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"375030b97559de48dbb734ec05d1569096085b181f5eaf04fec2fe8760a8bc73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Type/Reconciler.php: FileTooLong \u2014 1368 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: Reconciler (110-2244). The bar is 500 significant lines; this is 868 over it, 2.74\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be46e35de923adf4bba7e7726d83e5ee8d1c2fa1d1d1a085744c8f9eefeb82d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AtomicPropertyFetchAnalyzer: ClassTooLong \u2014 1088 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 688 over it, 2.72\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4681240a85133cea2607c5fa231989bd5a4834f4fa48208c90a9d8ffaad86a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AssertionFinder: TooManyMethods \u2014 81 methods. The bar is 30 methods; this is 51 over it, 2.70\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f449af9ce8f4a2067c42d466cca2c92520ef57638490960a3ca075376a0cc4e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaintFlowResolution: TooManyMethods \u2014 80 methods. The bar is 30 methods; this is 50 over it, 2.67\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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e401bcd2fb12df2fb3c238a6abaa0c5e0869f550eba7d6258f5f3a09b26354"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Populator: ClassTooLong \u2014 1064 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 664 over it, 2.66\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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1708c3630badfe65f842dd20986297b763ab5473829372e44c6b24726e792ddc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ElseIfAnalyzer.analyze: MethodTooLong \u2014 analyze runs 265 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 165 over it, 2.65\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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33171eb66bb1e369eb26858199bb89ae11cb45e0d61a372a4b98e4806aa45db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ForeachAnalyzer.analyze: MethodTooLong \u2014 analyze runs 263 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 163 over it, 2.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a799cf4ca1d98258759cee3a001d5c78fc3cdece53e88409da2ee2e159b356f2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FilterUtils: ClassTooLong \u2014 1040 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 640 over it, 2.60\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"51017c1a54fcf48b5aa8e495c8f76803f60b66dc698f4fd2d6854690e4f60260"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TemplateStandinTypeReplacer.handleTemplateParamStandin: MethodTooLong \u2014 handleTemplateParamStandin runs 258 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1c5c77ad0e3e80a230efe2769616b9e7f700cb87619f81227b61584bbe91fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Call/FunctionCallReturnTypeFetcher.php: FileTooLong \u2014 1287 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: FunctionCallReturnTypeFetcher (79-2108). The bar is 500 significant lines; this is 787 over it, 2.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3093085537b6fb7ae163272cc47436807b48bf7b73804afec5da0fbfca8cf138"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OrAnalyzer.analyze: MethodTooLong \u2014 analyze runs 257 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 157 over it, 2.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/OrAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef914e22a64823124503accf7e064e5b8ea98b87b8e63fd80b22b854754eab15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Type/TypeCombiner.php: FileTooLong \u2014 1284 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: TypeCombiner (87-2050). The bar is 500 significant lines; this is 784 over it, 2.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c6b74530b78b3f1e837be5110881906066ed05e4a2b31e21aa66b0a3e3ff9f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionLikeAnalyzer.processParams: MethodTooLong \u2014 processParams runs 255 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 155 over it, 2.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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e18d550c0388debeb4ce08c92f6dea6d46b5984ac71c7fa72411480ab987dea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MethodCallReturnTypeFetcher.taintMethodCallResult: MethodTooLong \u2014 taintMethodCallResult runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"268b95aa2d034b02839523f6b2ba5de6c48007e3b5f37ffe09b0493db2099055"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Methods.getMethodReturnType: MethodTooLong \u2014 getMethodReturnType runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\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":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e5e91642fe494321ded0ea465d8e96dcb8cc5ff24805ae999fea299f1955be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReflectorVisitor.enterNode: MethodTooLong \u2014 enterNode runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\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":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fd7fd4d980c447a876c9ae756073377d4aa9ecea915460e2a6e2ceb641c073"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScopeAnalyzer.getControlActions: MethodTooLong \u2014 getControlActions runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ScopeAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b532ab03f24469113e2e1f10e5edf61f94bdcbad16d160edfb7e4dd08eea2cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticPropertyFetchAnalyzer.analyze: MethodTooLong \u2014 analyze runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b237315a05919e4a103e307f715bb625ef2d6b13714a2c16e33538fd8b826838"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Psalter.run: MethodTooLong \u2014 run runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Psalter.php"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25e5735751499eded4489eb49bc7f82ee4872776f9b81604ab8287fdd894fb8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassAnalyzer.checkPropertyInitialization: MethodTooLong \u2014 checkPropertyInitialization runs 251 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee5f769c943df01d1297b29338ff4c2f70ba1537ba7faa19d08423e4e940380"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TemplateStandinTypeReplacer: ClassTooLong \u2014 992 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 592 over it, 2.48\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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"097a30d48dea64932fc5652bef9a7e940de9a2582c4cad2756a463225ae7a93e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ForeachAnalyzer.checkIteratorType: MethodTooLong \u2014 checkIteratorType runs 248 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9921ccb5d4209536514c90e8bee14beeb10c02550fe1119d52b49fd9909d89"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCallAnalyzer.getAnalyzeNamedExpression: MethodTooLong \u2014 getAnalyzeNamedExpression runs 247 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 147 over it, 2.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c830cedb0be4ae901559757451a4167c975a597755c7b23f2ba6d5cfec55003"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeExpander: ClassTooLong \u2014 972 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 572 over it, 2.43\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":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdba4ead1b38c72e4e95962a53bafb2b4683039395dd3906ebc64d9d95cd71f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeCombiner.scrapeStringProperties: MethodTooLong \u2014 scrapeStringProperties runs 243 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09ce0304d27c01fe08a28e499cb6848733ad6e7075e8b4277ce0fc6fafd3fb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Analyzer/MethodComparator.php: FileTooLong \u2014 1196 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: MethodComparator (59-1738). The bar is 500 significant lines; this is 696 over it, 2.39\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64efe69557c5a571159c6f4cfa8305e58f491a1ecc5ea19cbd7f35513fb353d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssignmentAnalyzer.analyzeDestructuringAssignment: MethodTooLong \u2014 analyzeDestructuringAssignment runs 239 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 139 over it, 2.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c5a594a78aeb2713e6adcf9dfea9067f2fe1b9c080c37724322899a18692fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PhpStormMetaScanner.handleOverride: MethodTooLong \u2014 handleOverride runs 238 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 138 over it, 2.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Scanner/PhpStormMetaScanner.php"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"969fa76921c0380a5aa1b7ac187e55cb44754dc422f8688ace2c7cee9ab3c570"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LanguageServer.run: MethodTooLong \u2014 run runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 135 over it, 2.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b0d836f3da65dd4049690f702956cdb23e7c81e8fbddfdb95680bd65cdbcb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: BinaryOp/ArithmeticOpAnalyzer.php: FileTooLong \u2014 1174 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ArithmeticOpAnalyzer (76-1894). The bar is 500 significant lines; this is 674 over it, 2.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"675064f6e5ddba2cf9b8aa855fa8def4f59f464a31f6d3c182352952d5143deb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AtomicStaticCallAnalyzer: ClassTooLong \u2014 937 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 537 over it, 2.34\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"08484e12c83c229b65dce21bceb91a9af911aeba0fd97577dbd30dd1d119fd6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Assignment/ArrayAssignmentAnalyzer.php: FileTooLong \u2014 1169 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ArrayAssignmentAnalyzer (76-1864). The bar is 500 significant lines; this is 669 over it, 2.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccec100c3a94300059e74525207513c52817b5e1c164acdab5edf192c4d0ead"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClassLikes: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb066b0f11548a675024cef89fa9e2aeb3615358a7027e31f610f3431faf6df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Fetch/AtomicPropertyFetchAnalyzer.php: FileTooLong \u2014 1162 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: AtomicPropertyFetchAnalyzer (83-1709). The bar is 500 significant lines; this is 662 over it, 2.32\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f88355925c82649e80f810ebe763a5b681263fce3995153106b95e60eb29498"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Block/LoopAnalyzer.php: FileTooLong \u2014 1152 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: LoopAnalyzer (63-2053). The bar is 500 significant lines; this is 652 over it, 2.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38775e28f8d9c33d3bd588e3395b1c7622c8cc5496b0d087e7df5ce44eb91c51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ReturnTypeProvider/FilterUtils.php: FileTooLong \u2014 1137 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: FilterUtils (107-1814). The bar is 500 significant lines; this is 637 over it, 2.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83218a1338b26355986fddf6bfa1ec18935fceab1b609241e43cdd2064e7aa98"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionLikeNodeScanner: ClassTooLong \u2014 905 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 505 over it, 2.26\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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"21043fc24aae9d7ebf86449db34280ffd7dcef641c5d6994d2ebc1c19b5390a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MatchAnalyzer.analyze: MethodTooLong \u2014 analyze runs 226 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 126 over it, 2.26\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":"src/Psalm/Internal/Analyzer/Statements/Expression/MatchAnalyzer.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7294334338a1405119cd911ab1617d08d5b632d42207a0b62eef438688c977"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Codebase/Populator.php: FileTooLong \u2014 1119 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: Populator (67-2023). The bar is 500 significant lines; this is 619 over it, 2.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ce9fc6708b0539d4c1f6f4d26d4835d3c8d4c0c3efb1da7f0368c17f44b96a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IssueBuffer.finish: MethodTooLong \u2014 finish runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/IssueBuffer.php"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"64238a7c45c9e36aad8f8f210dc60cbbb7ba83ee7274972aa1a45b48baaff324"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Psalm: ClassTooLong \u2014 891 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 491 over it, 2.23\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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b52883269fb241be552ecd41c6e184be45005f85b15d7c289b1541dab812afe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassLikeNodeScanner.visitPropertyDeclaration: MethodTooLong \u2014 visitPropertyDeclaration runs 220 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"0303f698ce0d2b461246eee51c8a37e0e05543ee06721958be4e2cacdb5875fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BinaryOpAnalyzer.analyze: MethodTooLong \u2014 analyze runs 217 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 117 over it, 2.17\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d955e5c0051c7ed7512f062906511b90c986be314748f1ac62fca18d398630de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TernaryAnalyzer.analyze: MethodTooLong \u2014 analyze runs 217 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 117 over it, 2.17\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":"src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"54abcae71df92fb20e5fff3d29926195ada68f588a680dc9fba3fd9fc8f1777f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCallReturnTypeFetcher.fetch: MethodTooLong \u2014 fetch runs 213 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"112f645e5b52ff45a0389d8039950c5deb11941192f5b8d0a5f853ca9347882c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticCallAnalyzer.analyze: MethodTooLong \u2014 analyze runs 213 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ddc1cfd1bb4d75b9d151bdb5951a92bd3563b9eddaf264f5bae44ff597ea8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reconciler.getValueForKey: MethodTooLong \u2014 getValueForKey runs 212 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"128db175aa457748933631f836c8aa839ae8f9c25b853aa2089392807ac82018"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Type/TemplateStandinTypeReplacer.php: FileTooLong \u2014 1047 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: TemplateStandinTypeReplacer (64-1678). The bar is 500 significant lines; this is 547 over it, 2.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f79a035ac2892394f8325993d4c0b45dae3b7cb676dae602f01559a0052f028"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StatementsAnalyzer.analyzeStatement: MethodTooLong \u2014 analyzeStatement runs 209 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 109 over it, 2.09\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":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa914ab961d76e05cab2393ccf0f9fdfd2401d9e620dab45e8b9ce40bf3fe16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssignmentAnalyzer.analyzeAssignmentRef: MethodTooLong \u2014 analyzeAssignmentRef runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"6612a2306e7f1359fa6461aa015ce3e6c82d81b467e2c5984ec192930655ddcb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFilterReturnTypeProvider.getFunctionReturnType: MethodTooLong \u2014 getFunctionReturnType runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFilterReturnTypeProvider.php"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1d223a4535e23def13acad9e22ad61d7a5e45fe364fdaf8d72cfede92cdf36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Type/TypeExpander.php: FileTooLong \u2014 1031 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: TypeExpander (68-1482). The bar is 500 significant lines; this is 531 over it, 2.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2b84d4d6c7b324a52617b4d21abc489629d73a3e61dc4bedbcff2bdbb46aea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionLikeAnalyzer.getFunctionInformation: MethodTooLong \u2014 getFunctionInformation runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a0f4b00ecb1562ae994d885c161ef71d654d91fd3e2259b5baf06df7480c64"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InstancePropertyAssignmentAnalyzer.analyze: MethodTooLong \u2014 analyze runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8910a29d135598c3db1ddf04b36890df8b5a76890d2046424453b6b336f388"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AndAnalyzer.analyze: MethodTooLong \u2014 analyze runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/AndAnalyzer.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"45304c9d97898644c9d4b476abcb9531f81298393f1aff432062771fd0668650"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NegatedAssertionReconciler.reconcile: MethodTooLong \u2014 reconcile runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\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":"src/Psalm/Internal/Type/NegatedAssertionReconciler.php"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7897198218d60e9812600dd6324c129637f6aed8ad95e0b0c394ea814ac9764"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IfAnalyzer.analyze: MethodTooLong \u2014 analyze runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da2d980c3c3b37c319b7c4fcb3b5353d9782982c9c2cf234b16379c5404c7b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFetchAnalyzer.analyze: MethodTooLong \u2014 analyze runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3306ea68f08187430edeba5a74ea25b26782cc9b683d1000d6da78f3939ff622"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassAnalyzer.checkImplementedInterfaces: MethodTooLong \u2014 checkImplementedInterfaces runs 203 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cbe6325e8eb1cd81d7d180299f9358e522d38719530c29ee664fed625d0390"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FormulaGenerator: ClassTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 408 over it, 2.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c284acde3163c03e9ddbdfc43db143244e9dd48db1806349c8d8d1bbea31ec4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ForeachAnalyzer.handleIterable: MethodTooLong \u2014 handleIterable runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"408536ceb7b585d5bef5cb5cb0ffb6ebb8567574afc508fceb81c0c719c1647f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MethodCallPurityAnalyzer.analyze: MethodTooLong \u2014 analyze runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8986c03ecd05b2ddbd85e4513d609260b4d4604f6e98c248df86184d0ac4c83c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionLikeDocblockParser.parse: MethodTooLong \u2014 parse runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85f4228aa7d4f964daf616d09ce3de34d4018fa06461f0a1fc37b003a169aaa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFunctionArgumentsAnalyzer.handleSplice: MethodTooLong \u2014 handleSplice runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc1f5a0a5f3dc7e959b2b5da6e9d4005949632df0217c8a085e411794cff306"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MethodCallReturnTypeFetcher.fetch: MethodTooLong \u2014 fetch runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e96328dfe5d8f6ddc103f69299bf938800514e92939fb98b1504b41518294f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: StaticMethod/AtomicStaticCallAnalyzer.php: FileTooLong \u2014 1004 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: AtomicStaticCallAnalyzer (77-1440). The bar is 500 significant lines; this is 504 over it, 2.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5220b42ea12c8ad2983c2b6683fa049bafd78e114edb766d3b11e39401f8008"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CallAnalyzer: ClassTooLong \u2014 800 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 400 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08f2e1b22ce4554836285fcfa1c0de3639806eaee4ee7a59a22454f632f8a8c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Atomic.createInner: MethodTooLong \u2014 createInner runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\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":"src/Psalm/Type/Atomic.php"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf718637007b4d65973986525636154b41bb58bd1e3f1ffe6291736de52ab3c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayAssignmentAnalyzer.updateArrayAssignmentChildType: MethodTooLong \u2014 updateArrayAssignmentChildType runs 199 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"1993856c92dd1d21e346a16160b5dac052ea5ce1dc963b6a982f67c7ba682c11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AtomicStaticCallAnalyzer.analyze: MethodTooLong \u2014 analyze runs 199 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ae3a24de10ee95d9cd013bc4f940db9e143717c0afa77281c1f379928ecad8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Cli/Psalm.php: FileTooLong \u2014 993 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: Psalm (115-1670). The bar is 500 significant lines; this is 493 over it, 1.99\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3be1b1f1194839b3be6d0123cbdfcafb1a0c52288954fadb52a26b716340db4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Refactor.run: MethodTooLong \u2014 run runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\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":"src/Psalm/Internal/Cli/Refactor.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92d244d9f8d562c50e53e7f7dc0a1a66fb5a84f3f4a17c70c0e80b1f3032e50"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AtomicTypeComparator: ClassTooLong \u2014 788 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 388 over it, 1.97\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":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed900505f3416899d3501be8dd512ed30b040e6badf52505f4bbb55a7cbcf983"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConstantTypeResolver.resolve: MethodTooLong \u2014 resolve runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\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":"src/Psalm/Internal/Codebase/ConstantTypeResolver.php"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d492ef9533441f729ddabebd75808306c6c4c0cea8c37b52a329ffce6668cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayMergeReturnTypeProvider.getFunctionReturnType: MethodTooLong \u2014 getFunctionReturnType runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMergeReturnTypeProvider.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5fa5507e86da87012b2d9ddd601205405fa7fbedd8c0faf6cd4906fdbfd123"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Context: ClassTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded), 52 methods. The bar is 400 significant lines; this is 380 over it, 1.95\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":"src/Psalm/Context.php"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc129583522c72cc7dc9b5b48130da9c26cde8cf85d03fab456b17123eaa321"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Reflector/FunctionLikeNodeScanner.php: FileTooLong \u2014 975 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: FunctionLikeNodeScanner (79-1582). The bar is 500 significant lines; this is 475 over it, 1.95\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d9f65a1d780db2312b866c399aed234715dac07d4b562221b26610eab340c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallAnalyzer.applyAssertionsToContext: MethodTooLong \u2014 applyAssertionsToContext runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"49add465525a4f0d734b4ba47262ab57bc22e784e563d9c6326304b7a5fb973c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CastAnalyzer: ClassTooLong \u2014 777 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 377 over it, 1.94\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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde214feb23b47d09ab633c9aeb1df1d8d2dda12a1d9175a8a374df959a163aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InstancePropertyFetchAnalyzer.analyze: MethodTooLong \u2014 analyze runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"244479c5bf3bcb495f1ccd11e144fe840dd64f5bdf61ef87e41437ba062ef499"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StatementsAnalyzer: ClassTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 372 over it, 1.93\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":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66f9f86ea0208fd05570561c6d21486eea3f241cb05e712b7e8a6c3b8370453"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MethodComparator.compare: MethodTooLong \u2014 compare runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edfb2f6fdf8df915928f04a4b6b6a9e3ea4c6b63734632de58ab28e54980cc4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticPropertyAssignmentAnalyzer.analyze: MethodTooLong \u2014 analyze runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/StaticPropertyAssignmentAnalyzer.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d81f46f55abfe8f130b40aa40c51dea0fac5931853f3f95ccb920c4fc73d4b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TemplateStandinTypeReplacer.handleAtomicStandin: MethodTooLong \u2014 handleAtomicStandin runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a14f7477e244abf9817a57235b9f25c77385c88f3055a447948c452fd85dbcf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeCombiner.combine: MethodTooLong \u2014 combine runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"719d9b7b0cbfa6dfa396dd745bf398694468ca46ace816a22167aae5cddabed5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExpressionAnalyzer.handleExpression: MethodTooLong \u2014 handleExpression runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\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":"src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a85651f2ed62f7a67dcd1719c23d40692db3a0823a096b1e0811539542415b1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReturnTypeAnalyzer: ClassTooLong \u2014 755 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 355 over it, 1.89\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b27df0c0a07f1a640c40b422f8644fa763344fa05fb56f128677a7c8a15f47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFetchAnalyzer.handleArrayAccessOnKeyedArray: MethodTooLong \u2014 handleArrayAccessOnKeyedArray runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a39bc3f88911b5da0c0c1d6768b6cfa9a80233e4a0fe0548a9b0189ad247167"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProjectAnalyzer: ClassTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded), 46 methods. The bar is 400 significant lines; this is 346 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"53163b2a3bc48e17fca257885326c0dd7b310021418b776d9291661f4c0f7dbd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExpressionResolver.getUnresolvedClassConstExpr: MethodTooLong \u2014 getUnresolvedClassConstExpr runs 185 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\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":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd045e8645bc9dbe0c3a967e20d91229f5742dcc65bf6555f4dea74bded36981"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MethodCallReturnTypeFetcher: ClassTooLong \u2014 736 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 336 over it, 1.84\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5c62141a2c7bd9ad82744393fc65cb8372140db1589cd3d69ad8370636a2b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayAnalyzer.analyzeArrayItem: MethodTooLong \u2014 analyzeArrayItem runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ade90495ed2cd9e3b21d3198662f5cd53096b527a4786a3aa8bdd3affe18527"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MissingMethodCallHandler.handleMagicMethod: MethodTooLong \u2014 handleMagicMethod runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5109a5e539d74c6c94ffb9bb821dac9a28cfb7cb415637988cada5ebb39c286"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Methods: ClassTooLong \u2014 729 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 329 over it, 1.82\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":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f87d1ab7322921ccc14315e6a695c20aadedcda96469cef2f599f7e8d446163"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionReconciler.refine: MethodTooLong \u2014 refine runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ecb47fd48fc7f7d9f978c811adb521a95e5703cd05217842399d7821bab1c7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArrayFunctionArgumentsAnalyzer: ClassTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 322 over it, 1.81\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6812122f02daaa8022fd21e11639cd19f65244be867a5e23518d42a522e4408b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KeyedArrayComparator.isContainedBy: MethodTooLong \u2014 isContainedBy runs 176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\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":"src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"946b2a1eb7458a385967d7fed757a6bd0216d52ac8f187620d45b1369ca57a70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Expression/CallAnalyzer.php: FileTooLong \u2014 875 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: CallAnalyzer (84-1449). The bar is 500 significant lines; this is 375 over it, 1.75\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfbebb3f9c46e7c23aaa2717060dffff0a43ef848c177a60ce9762678727987"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionLikeNodeScanner.createStorageForFunctionLike: MethodTooLong \u2014 createStorageForFunctionLike runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"116be1ce0899fef656ba47a12b87a1c92c7451a57666c592f2164ea5468c5c7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IfConditionalAnalyzer.analyze: MethodTooLong \u2014 analyze runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\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":"src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85fd1e3933a11c383f7862f361f824583543fae88ae81ae98b7b3e7e6c9e9a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Analyzer/StatementsAnalyzer.php: FileTooLong \u2014 869 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: StatementsAnalyzer (107-1519). The bar is 500 significant lines; this is 369 over it, 1.74\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45074b8cc65c5e4e258395c527b26aa7527d9ac04856ad4287e1abe5921a202e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Context: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\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":"src/Psalm/Context.php"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58794d7f86db306cfba08de57c2abcb64d988b11ca0050137f1b6d0aeced60b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Algebra/FormulaGenerator.php: FileTooLong \u2014 855 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: FormulaGenerator (56-1396). The bar is 500 significant lines; this is 355 over it, 1.71\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f755067ef6251a789cec47fbc53926af8b152dd6a41904db639a830fc77ca7ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Type/UnionTrait.php: FileTooLong \u2014 851 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 351 over it, 1.70\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":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb9ce1b7b14b2e41182827e170069493202733d852befffd4e296e4b9bf0121"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Type: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\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":"src/Psalm/Type.php"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"28187d5b0808fbccb8b8b61e8e1423e026085a169d213e3798cdc01735fbebb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Comparator/AtomicTypeComparator.php: FileTooLong \u2014 850 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: AtomicTypeComparator (72-1373). The bar is 500 significant lines; this is 350 over it, 1.70\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a246bbb2bdf03bb51c8a93cadead5b7231c362701c5973513ca0558a4c5eba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassLikes.checkMethodReferences: MethodTooLong \u2014 checkMethodReferences runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c80706253eca0c6646e212143743917b52c3247b53123af922cdc5a19804db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionReconciler.reconcile: MethodTooLong \u2014 reconcile runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2433d84f8b2b468ab9b6c90b618896183ca8c31288aca054f35561a7b58727a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Expression/CastAnalyzer.php: FileTooLong \u2014 847 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: CastAnalyzer (79-1490). The bar is 500 significant lines; this is 347 over it, 1.69\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b9b6a00dbaa1fc184304eb6ca200ad335f8c197bae9c613817a5c47b5ee6c5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IssueBuffer: ClassTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded), 46 methods. The bar is 400 significant lines; this is 277 over it, 1.69\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":"src/Psalm/IssueBuffer.php"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"35142d2ee3ea2b0136573599b474001c716024b2eed4137f46eb3041090961cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NewAnalyzer.getNewType: MethodTooLong \u2014 getNewType runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b7b95dee4a50e93e900f1968b719df299ae90214fe5888789421c9bbce5bcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Analyzer/ProjectAnalyzer.php: FileTooLong \u2014 838 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: ProjectAnalyzer (102-1541). The bar is 500 significant lines; this is 338 over it, 1.68\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4577127299544236d72227a14e8a372494edd8a4abc6f44a118bba4e1acec9cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SprintfReturnTypeProvider.getFunctionReturnType: MethodTooLong \u2014 getFunctionReturnType runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/SprintfReturnTypeProvider.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad26772ee341585b77f6d0a624fa00db9bfedc11f48420f64a144e5fd5ca65e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Psalm/Context.php: FileTooLong \u2014 834 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: Context (64-1975). The bar is 500 significant lines; this is 334 over it, 1.67\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Context.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cfccf9f87cab80a6248e276941aedcefda476272383b76d48dbe67477ad30a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ElseAnalyzer.analyze: MethodTooLong \u2014 analyze runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5e31a774e5dc7c1fc34b3fb76049379123940e29e3cb2019893c279d328e36"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReceiverPropertyTaints: ClassTooLong \u2014 663 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 263 over it, 1.66\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":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4c7e9e67e6148b23930f3df4deaa5bf7284a58e22f3575977ef6436a87f25d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayMultisortParamsProvider.getFunctionParams: MethodTooLong \u2014 getFunctionParams runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\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":"src/Psalm/Internal/Provider/ParamsProvider/ArrayMultisortParamsProvider.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b59a7676c62ffa63107b004a7206d15b2ec24e3d23776583e044f241462f9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConcatAnalyzer.analyze: MethodTooLong \u2014 analyze runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1850590ad09eaa09ad64c40cc477e1c0ce4680acbbea679d14b65257cf043f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NewAnalyzer.analyze: MethodTooLong \u2014 analyze runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"17feddbe9e5c5ccda4a66240a9db699451ed820db6a0106cf6ff420f9c3a5ce1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NewAnalyzer.analyzeNamedConstructor: MethodTooLong \u2014 analyzeNamedConstructor runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"41efd75fdc9ec838adc83182f91b372cf9d2bb3f2c1dbe0b19c5f5ca6a9b7631"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IncludeAnalyzer.analyze: MethodTooLong \u2014 analyze runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9cd38843bead41cd388c3e50e7f8c56e90a10907b23d968e12ae249ebc678e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartialParserVisitor.enterNode: MethodTooLong \u2014 enterNode runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/PartialParserVisitor.php"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec9ad868aa6b255f59cd549af6c6c9cc3bc2aa76e863bde872967ea080b678d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FunctionLike/ReturnTypeAnalyzer.php: FileTooLong \u2014 819 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: ReturnTypeAnalyzer (73-1225). The bar is 500 significant lines; this is 319 over it, 1.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e5a6b38cea57e1a56b884c7f557a6d9ce2c9b7f34802862904eac7c6cce912"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaintFlowGraph: ClassTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 253 over it, 1.63\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":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"81df95c089ffef9c7d2bc60c674aa5322871b89212af2ba21a0e750ec7c561ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeExpander.expandConditional: MethodTooLong \u2014 expandConditional runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d44cf1bd2ec07096e5eb2ef17898d535804954621d8f3666ff504d631ebc566"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssignmentAnalyzer.assignByRefParam: MethodTooLong \u2014 assignByRefParam runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf03e70a8cc3c96914d9cb807f06ac1c01d4fdb50298469aeec26497ca11fbe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayColumnReturnTypeProvider.getFunctionReturnType: MethodTooLong \u2014 getFunctionReturnType runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9288b0b0b72c244b369d9767f1c25ca499b1f8e94bf2335088c2c324e3057618"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Analyzer: ClassTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 245 over it, 1.61\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":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e969e98c4b362b7fe9eb69fc5bd0aefd27ec1ccd12b1970d82de3c8b8c46a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YieldAnalyzer.analyze: MethodTooLong \u2014 analyze runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\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":"src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69b52e679509f5cc0ceac0d34abcde6cbaddfda80e4352f34e9ecc1e56d2cfd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Type: ClassTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 400 significant lines; this is 240 over it, 1.60\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":"src/Psalm/Type.php"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"988182f92ab85c92269a31b845b8fe8f29674ef0463f827b7f2703a7ab68bf7b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FunctionLikeAnalyzer: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c2c69dcba93858df69ca0b8ae6dc4288f30ae6e26300ff9b4ab016c3c67ead"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AtomicMethodCallAnalyzer: ClassTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 238 over it, 1.60\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5437e12b0b306c302b881ace7b0c5b78774ffd9226decc1646d42c87857d12"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClassLikeAnalyzer: ClassTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 236 over it, 1.59\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":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2687cb918d26f6e0450792ad4cc4045cc3d6821c7514e24b16c94fe3efe1bef9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClassConstAnalyzer: ClassTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded), 5 methods. The bar is 400 significant lines; this is 233 over it, 1.58\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dbdc4d75ccff118d526780772907403c7be63090b3b45a39cd038e0233c7dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClosureAnalyzer.analyzeExpression: MethodTooLong \u2014 analyzeExpression runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClosureAnalyzer.php"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dcf81853d0623addc19a817832132253911223424be1019d01f039863a2467"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionFinder.scrapeAssertions: MethodTooLong \u2014 scrapeAssertions runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f418f58ac955f845fadc8a6e7702e9b2c340137b995adee114bb3ed19d5852e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InstancePropertyFetchAnalyzer.handleScopedProperty: MethodTooLong \u2014 handleScopedProperty runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc903562e7c3b9389b4bcca56fb5134a5682548f07c5ea24f21fa021871aeac6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassStatementsDiffer.diff: MethodTooLong \u2014 diff runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/ClassStatementsDiffer.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b5c9c26b27c27ed3cf5a72dc7db54f4f321ce563bcfd1a30c84fef23028b9f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayReduceReturnTypeProvider.getFunctionReturnType: MethodTooLong \u2014 getFunctionReturnType runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReduceReturnTypeProvider.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc5da2ad03a31c021f861347d9fa63aab66653410251fc9752ae32a151e5cfd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Psalm.getHelpText: MethodTooLong \u2014 getHelpText runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"485ba2b63ea5476143d44177ff1ae2798b699d5ec42b28a68e770ea2de6f5d29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFilterParamsProvider.getFunctionParams: MethodTooLong \u2014 getFunctionParams runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ParamsProvider/ArrayFilterParamsProvider.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"de53e4bac58d9f29e9c9401b8f0d0760a565c7a42255d635d39b9ec1b300cffc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReturnAnalyzer: ClassTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 227 over it, 1.57\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":"src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4551e913bb139f8f382c61434112ae538ee239c7cef17c47f17bbf7d04bcac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Codebase/Methods.php: FileTooLong \u2014 782 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: Methods (64-1363). The bar is 500 significant lines; this is 282 over it, 1.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d761768ac21c8fa6f27ac9f5d081e06b30016c2b802edcf40ea75799840b08f0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MethodCallPurityAnalyzer: ClassTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 225 over it, 1.56\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e9added2a4b1e5fb1ef2f45334cd250db321fc9256c793b3fdb30c375847de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Method/MethodCallReturnTypeFetcher.php: FileTooLong \u2014 781 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: MethodCallReturnTypeFetcher (54-1205). The bar is 500 significant lines; this is 281 over it, 1.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ead78399754cba26c7c3b19e031201411d269a38f6071608cb6b0d01a557a7b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MethodComparator.compareMethodParams: MethodTooLong \u2014 compareMethodParams runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6149876cbd0911bf5e9d56319a0c002c820ea2b35502ac69a97c7e94106c0e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Call/ArrayFunctionArgumentsAnalyzer.php: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: ArrayFunctionArgumentsAnalyzer (65-1192). The bar is 500 significant lines; this is 278 over it, 1.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5a4964e25b6371c40040404fcf3987e47dfc349c41329a3088ef97d4694f4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CastAnalyzer.analyze: MethodTooLong \u2014 analyze 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ccd7538d891d21771375b67bdbbe48d5cd087ea34e9fcb2454d6287ecfd165"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionLikeDocblockScanner.improveParamsFromDocblock: MethodTooLong \u2014 improveParamsFromDocblock 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3ae6ac0e27fb3d903b8623d2514b3c12149389ed46e3d2a8bdb2b98ed694d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArithmeticOpAnalyzer.analyze: MethodTooLong \u2014 analyze runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0247cc404c7a74b425fceae0dbf5f878ba6445ab7f3587f7274a666d213e114c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExistingAtomicStaticCallAnalyzer: ClassTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 215 over it, 1.54\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26b0fa746ae8f976e856e23803aaf173c06c9cec847195ab0c0c06fcbdc9586"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProjectAnalyzer: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"125e2a2994946b53f6383d68e6e4c0db4f27a0ef154daff9971384ea6ffafa0b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IssueBuffer: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/IssueBuffer.php"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b096c58deace83459bd6c0e61c353e64de0109ef7e476a61775b6de9a0ddf8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeParser.getTypeFromTree: MethodTooLong \u2014 getTypeFromTree runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"a513476a43b6f96ba6b27be795b96453ffa8176964c7ddca46cdb58afe470dfb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VariableFetchAnalyzer: ClassTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 211 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaca0165fe6469d59e0b21ce8b9363ac002f452c0aad2b5800e420d29c50292"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Psalm/IssueBuffer.php: FileTooLong \u2014 763 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: IssueBuffer (96-1469). The bar is 500 significant lines; this is 263 over it, 1.53\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/IssueBuffer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db638571ec8511a50336884197c13430b89f0ef1d6b4e4d5f4686e91e887e8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFunctionArgumentsAnalyzer.checkClosureTypeArgs: MethodTooLong \u2014 checkClosureTypeArgs runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"5407a6063fd8082a752e1fc0d540672ecd85be1a9fb93173fc82f9a30ab7e49f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionReconciler.filterAtomicWithAnother: MethodTooLong \u2014 filterAtomicWithAnother runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1686509c44f63aac6c9bdbaae871f5279a96bdaf7426da074624818d45b36bcd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.intersectAtomicTypes: MethodTooLong \u2014 intersectAtomicTypes runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\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":"src/Psalm/Type.php"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24abfe924347462b8cf759bdbe4947f1a39a533f0b8f932e8a4c52ac85969b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaintFlowGraph: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\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":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f4ee99ef585305e8f9f48dbfe90439f51e2527fdd6233a119d916f31963456"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataFlowNode: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\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":"src/Psalm/Internal/DataFlow/DataFlowNode.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d46ab576aa03327867a20e019ac5e2c2647039c1c895f53008e459d02c5d856"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayAssignmentAnalyzer.updateArrayType: MethodTooLong \u2014 updateArrayType runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7109dc110fd329b0ca8c262a0ec6e015aab4838ce2cf1b859aa9ca8f8b6ce20c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReturnTypeCollector.getReturnTypes: MethodTooLong \u2014 getReturnTypes runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeCollector.php"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae52770dadc13ed08c6add5cea65d5f6e01b02a13d2a1cbf92d50d6559a6af86"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Psalm.run: MethodTooLong \u2014 run runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab533b77596733808e22278f0f9472647c2cff6feeff20ac9d793ba9db81dec8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileFilter.loadFromArray: MethodTooLong \u2014 loadFromArray runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"src/Psalm/Config/FileFilter.php"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c9f7b939f5281b163088731afef0c1316e4fea8447c2bb264b7c28cea74a00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassLikeAnalyzer.checkTemplateParams: MethodTooLong \u2014 checkTemplateParams runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"2546553ae92ddbec5c0abfdb3c465c4b95298e5254f7460c4e722651a38ecce8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFetchAnalyzer.handleArrayAccessOnNamedObject: MethodTooLong \u2014 handleArrayAccessOnNamedObject runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed151a9dfeac8f37c4ab1faad1e320c6b57fd95a00ec116bb7c87ede4e4e0a98"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VariableFetchAnalyzer.getGlobalTypeInner: MethodTooLong \u2014 getGlobalTypeInner runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"4497ef19c9a8dab5437b970b0cc4047d67c6ddcfc1c4beb7d8250cf4fa70b2dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MethodComparator.compareMethodDocblockReturnTypes: MethodTooLong \u2014 compareMethodDocblockReturnTypes runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a859e91883d928435777a1fc4995e61395fa332ae6790bb3cb16581f1df5d58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InstancePropertyAssignmentAnalyzer.analyzeRegularAssignment: MethodTooLong \u2014 analyzeRegularAssignment runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"739d33ba2b2f093f3be10dee47f121a2564a51d9f970a5a180d390a9e646c714"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticCallAnalyzer.taintReturnType: MethodTooLong \u2014 taintReturnType runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ae6e18392e0b19a8c406bc70a1930d656bbf536720aaa6a296dd2a6c02932c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionFinder.scrapeEqualityAssertions: MethodTooLong \u2014 scrapeEqualityAssertions runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"023835e12cda7bc62fac415d0001e534a8dd732ed4ac3aa8a5ac56a5e05b83bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaintFlowGraph.reportTaintedFlow: MethodTooLong \u2014 reportTaintedFlow runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a2a4f593d5c0326fca2ba89e5f73b100cf6aca69e4b74be33a1d1c4bd581ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodeUseGraph: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\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":"src/Psalm/Internal/Codebase/CodeUseGraph.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fd5eca3f335f0a49d374dd6aefc69b5f1cbe1a4f82878e6bb8ea7a44c44325"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Psalm/Type.php: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: Type (85-1307). The bar is 500 significant lines; this is 216 over it, 1.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9ebca70def12f3dc7ef909a9f2497635997f7039cf32dd421a72f45441220c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Codebase/TaintFlowGraph.php: FileTooLong \u2014 715 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: TaintFlowGraph (72-1545). The bar is 500 significant lines; this is 215 over it, 1.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61289e16560db67a8c561f85c70daaa8aebf9ced623bc9d4e3b6af7cb73826c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassLikeAnalyzer.checkFullyQualifiedClassLikeName: MethodTooLong \u2014 checkFullyQualifiedClassLikeName runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\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":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9ce884808d03407b186c7accce09f03a5687f2e6995e8132cab7200755a1f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassTemplateParamCollector.collect: MethodTooLong \u2014 collect runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ClassTemplateParamCollector.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7ee7d48efc5d859ece627cba25a0633ffa9e60461d81d51bc881604db4e84e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Populator.populateClassLikeStorage: MethodTooLong \u2014 populateClassLikeStorage runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a81e3e6e3cc88a3b06636b1ec7051c773031f1e78f5136873dfeebd7c6a4ae4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Type/ParseTreeCreator.php: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 202 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67e1e2af21a5763515ecbb5b64680edaa8584f835488c66f9ab3eabeb3aa5b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Analyzer: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f5b76bed28b92f48d00c9a1956176c30cb5066c7ab60f9e98b78fb6a44886b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TemplateInferredTypeReplacer.replaceConditional: MethodTooLong \u2014 replaceConditional runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39450aea8a0e1b7957b1de507560e41726045e037d4420e5b82a00afd3eea1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Codebase/Analyzer.php: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: Analyzer (98-1454). The bar is 500 significant lines; this is 199 over it, 1.40\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"542ac07b1a3144b02c3a7c1497c46f8f7e0faa25605e66c8dad59a751a5c899d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassLikeNodeScanner.visitClassConstDeclaration: MethodTooLong \u2014 visitClassConstDeclaration runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"4477dd4951ae6afe7f4b59bc8b972e6bd56956faaae6c5e7df283250c6c2a839"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilterUtils.getFilters: MethodTooLong \u2014 getFilters runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"441ab9b3c57ee0040654e152c8baf777f7c69e76fd618c667637b3d57d2b87c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Expression/ClassConstAnalyzer.php: FileTooLong \u2014 691 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: ClassConstAnalyzer (67-1080). The bar is 500 significant lines; this is 191 over it, 1.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"048973cc4ffefd80d7eda84b970f49893d10624f4aef00062b045e71981afb7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Analyzer/ClassLikeAnalyzer.php: FileTooLong \u2014 689 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: ClassLikeAnalyzer (62-1195). The bar is 500 significant lines; this is 189 over it, 1.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4d1271093fc81397aca780ed215a1cbf7f9f0ec04d1e6778520b65a99340fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Statements/ReturnAnalyzer.php: FileTooLong \u2014 689 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: ReturnAnalyzer (71-1109). The bar is 500 significant lines; this is 189 over it, 1.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fbfc934ba15ddd53c934c1c4027093c5238e1c2f22dd0af94cb818040a01a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Method/AtomicMethodCallAnalyzer.php: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: AtomicMethodCallAnalyzer (63-963). The bar is 500 significant lines; this is 186 over it, 1.37\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbc4d4dba0aa264980cac74bb5e1de509706de3a3d991ec72c84be2a10d9e9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Codebase/ReceiverPropertyTaints.php: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: ReceiverPropertyTaints (60-1214). The bar is 500 significant lines; this is 186 over it, 1.37\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1efb431be8f4f651ac4542c3ed2e9455ce7d2f52d007f02ffdd494d512d59d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayAssignmentAnalyzer.analyzeNestedArrayAssignment: MethodTooLong \u2014 analyzeNestedArrayAssignment runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d362a3bb4ce19fafb0d013ec4b9ab59b27bf47515590af68efa5f520c9cf4805"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCallReturnTypeFetcher.getReturnTypeFromCallMapWithArgs: MethodTooLong \u2014 getReturnTypeFromCallMapWithArgs runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"913362a437d0f3179b46206becbb6f44fa6dabddd995f71a39c37f86e4957207"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenericTypeComparator.isContainedBy: MethodTooLong \u2014 isContainedBy runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8641e000d5bf777a9fff7b2aa2d801f1984ff63fbc8964e427b4fde94ebb2434"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FileAnalyzer: 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":"src/Psalm/Internal/Analyzer/FileAnalyzer.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"96773173383283b69c6e9397a7ef3d997c776daa9fbb6729eb4dcca8c49b845d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Codebase.getCompletionItemsForClassishThing: MethodTooLong \u2014 getCompletionItemsForClassishThing runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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":"src/Psalm/Codebase.php"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfbc69e828afb1ba7e406cbec1efe01ce971ae3800e657bcf077e81aca0d186"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReturnTypeAnalyzer.checkReturnType: MethodTooLong \u2014 checkReturnType runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"14629de92539e643dbcfc42fcd999be8e0ce6755b60310d52747367446cf9f0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InterfaceAnalyzer.analyze: MethodTooLong \u2014 analyze runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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":"src/Psalm/Internal/Analyzer/InterfaceAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1356399d03348b90597bb0310f472b4b8814b26ff9421b10ac152e9fe4b02ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionFinder.processCustomAssertion: MethodTooLong \u2014 processCustomAssertion runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e846a0ab63bc7d814b5da9db140694e3a4c3cbf523692d95bc12824801fb09ed"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionLikeDocblockParser: ClassTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 143 over it, 1.36\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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c89114263f6c12a7d2902eb8a073934210a4866935b5d1efc75dd17f1e9bb0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFunctionArgumentsAnalyzer.handleAddition: MethodTooLong \u2014 handleAddition runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70782482cc6c0b95ab98ae09b7be4f4e90a53ae47ac54d4a826d8448f2f70f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SimpleAssertionReconciler.reconcileTruthyOrNonEmpty: MethodTooLong \u2014 reconcileTruthyOrNonEmpty runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":3051}}}],"partialFingerprints":{"codehealthFindingId/v1":"1814361c3d0cbb69094499571a8ca1d0457fc5048b726b56c9ece47e3168a8a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TemplateInferredTypeReplacer.replace: MethodTooLong \u2014 replace runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"368375545893e4ceb636f1bbd0c4779f4d7df7be9519a1ab0dbf9f6070a8b87c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Method/MethodCallPurityAnalyzer.php: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: MethodCallPurityAnalyzer (59-1193). The bar is 500 significant lines; this is 174 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b517a0c6ba55c59539b5a62b6553489aff1b71b05998cbe7742b4c2bfb3fd52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: StaticMethod/ExistingAtomicStaticCallAnalyzer.php: FileTooLong \u2014 672 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: ExistingAtomicStaticCallAnalyzer (66-985). The bar is 500 significant lines; this is 172 over it, 1.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46cb08bea1b3296236865e9f8b942ced2f043ae07e377bbdc80c90c3495cfee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilterInputReturnTypeProvider.getFunctionReturnType: MethodTooLong \u2014 getFunctionReturnType runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e043276223ee6200977932a1b71ab9638e5e8de6562e49be2e87bb4915e9a1d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeTokenizer.tokenize: MethodTooLong \u2014 tokenize runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeTokenizer.php"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cd9e7cca2114cf16391cc54bb964ffc372001379c54ffa046576a4f29cce35"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StatementsAnalyzer: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49e09a45a4a19b9a7777e0344bccfaf67a479a037590022e60fd0577c2c2f72"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeParser.getTypeFromKeyedArrayTree: MethodTooLong \u2014 getTypeFromKeyedArrayTree runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d07bd1fafe3496124f8974487777b90d69df0784cd83485e45489e8cb6cb09"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExistingAtomicMethodCallAnalyzer: ClassTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded), 3 methods. The bar is 400 significant lines; this is 129 over it, 1.32\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"119de91797f3a8865dddd75e1f1fee87d16884f812973882a8dfdd9d0b4638cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Algebra.simplifyCNF: MethodTooLong \u2014 simplifyCNF runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra.php"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f59825cf702f885bd94757db62c2921181725ab891fec776426a404d71770e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SwitchAnalyzer.analyze: MethodTooLong \u2014 analyze runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchAnalyzer.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7b4c4d4eff142daac775433ac902580ea8a98ce2c2ad09956e0e1b1e91307c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCallReturnTypeFetcher.taintReturnType: MethodTooLong \u2014 taintReturnType runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"78efa1407d29d706dc0310fb179fab9f810f47df457a7d72da0f1cc2129ea6d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AtomicStaticCallAnalyzer.checkPseudoMethod: MethodTooLong \u2014 checkPseudoMethod runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"0763da01d3396f5c0d7c6a6fd1dc0191266d3ee6ff2ff60404214ccc738c2d91"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionLikeDocblockScanner.handleAssertions: MethodTooLong \u2014 handleAssertions runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"83317332d57417c01f364739d522a84ff83f848ee1cfa9d8dc807cf92cc0a917"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NegatedAssertionReconciler.handleLiteralNegatedEquality: MethodTooLong \u2014 handleLiteralNegatedEquality runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"src/Psalm/Internal/Type/NegatedAssertionReconciler.php"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a602589044f200f789270d89ea5e84371582a2df8309262a923685faedcae08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Fetch/VariableFetchAnalyzer.php: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: VariableFetchAnalyzer (50-1033). The bar is 500 significant lines; this is 152 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a68df076082f81ce6624d427dec12932c238b17d676281fd4615f9d48ce2e95"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeParser: 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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f464351973a9a0f49fcc4345de0a09e56d3efae968003fb572b2be78142564"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReflectorVisitor: ClassTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 117 over it, 1.29\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":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9319f39f0dcabbfed99abe94f252a2f7d8613e2c921af543d218eb8850f162"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFetchAnalyzer.handleArrayAccessOnTArray: MethodTooLong \u2014 handleArrayAccessOnTArray runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db7af8ff41a9fe4cdf5f9e48baca9a10f39b87940c04e8772cb09aa38074600"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Atomic: ClassTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 114 over it, 1.29\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":"src/Psalm/Type/Atomic.php"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d409d6d304c4f5625021a62454cc76fbf46ffdd384d58ae85ea64c1a47ef0e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SimpleTypeInferer: ClassTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded), 4 methods. The bar is 400 significant lines; this is 112 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78494059ecf665e1f938e20d74c2b365a5eb0523ea39beea9f3befd02f597a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MissingMethodCallHandler.handleMissingOrMagicMethod: MethodTooLong \u2014 handleMissingOrMagicMethod runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ab962abbae28286376cc72e94c5900f0b62738247549d58565f77c0618ce6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Comparator/CallableTypeComparator.php: FileTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 139 over it, 1.28\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":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18597d360341f9ed4fdb64e6b8cd2fd21e8604b390697e337cd66856cfa63979"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MethodComparator.compareMethodDocblockParams: MethodTooLong \u2014 compareMethodDocblockParams runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"962a1e0887a66726736b5908c5cbe5e23294b7331a9b7ec9b4e34936781649cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExpressionScanner.registerClassMapFunctionCall: MethodTooLong \u2014 registerClassMapFunctionCall runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\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":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4229ca1987e5efe26f972f711ba3be632941d42c62ee064386a9c7cb3ce2e040"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SimpleNegatedAssertionReconciler.reconcileFalsyOrEmpty: MethodTooLong \u2014 reconcileFalsyOrEmpty runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"950eb907125d967261923407df1324f80f728ae30e3519b06974df5b59e608f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Methods.getMethodParams: MethodTooLong \u2014 getMethodParams runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\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":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9615b40e2f383433177c1e977ad280c69e1ce629a940edae7ceaa7f76fa33bbb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayMapReturnTypeProvider.getFunctionReturnType: MethodTooLong \u2014 getFunctionReturnType runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ed448df86cd54f5a8736d4ac0c573263451fd2d86f1db84862a72b3bf5c776"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArrayAnalyzer: ClassTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 101 over it, 1.25\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede69596d9a56cd60f79832b14fd9ed81843fa5f6ecdd3994e8c513f529190ae"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NamedFunctionCallHandler: ClassTooLong \u2014 500 significant lines (blank, comment-only and punctuation-only lines excluded), 5 methods. The bar is 400 significant lines; this is 100 over it, 1.25\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60d19371522b7bfd807e83149e234e0043b61ebebcb0e11fdf560195523f83d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallAnalyzer.collectSpecialInformation: MethodTooLong \u2014 collectSpecialInformation runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35a97f5c3b919648ae1d0af8a828a576e5c39b63e13ee5fa7b1740234f4bd1b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EncapsulatedStringAnalyzer.analyze: MethodTooLong \u2014 analyze runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/EncapsulatedStringAnalyzer.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"24478043a888f8f01091489f5ee55d09f9241b5f94b7af6835549e185bc9fcfa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Analyzer.loadCachedResults: MethodTooLong \u2014 loadCachedResults runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"006298ed1fc7baeaa9d15a84bbe06c0c143d5dacbbd8ae339bffab4ebaed4b92"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MissingMethodCallHandler: ClassTooLong \u2014 492 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 92 over it, 1.23\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eacdc4f3a89c62a2afda16400dc1a0bc1118b82ac5b4d904bafe3ce8ae8735a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Codebase.getMarkupContentForSymbolByReference: MethodTooLong \u2014 getMarkupContentForSymbolByReference runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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":"src/Psalm/Codebase.php"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed6ac174ff586d7604979b71d79961af4b4319b53253b1f47e451fe42fd4acf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassAnalyzer.analyzeTraitUse: MethodTooLong \u2014 analyzeTraitUse runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"d531a7f1a31c4cf7e3feb9e4389998e8f4c970923b2727fa8c1550f20d516c4a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MethodComparator.compareMethodSignatureParams: MethodTooLong \u2014 compareMethodSignatureParams runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf376696601da64920eb4c32ad5bf237494b7e7017c52bc72da5418d1adcec60"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConcatAnalyzer.analyzeOperand: MethodTooLong \u2014 analyzeOperand runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05f19e48bafe0f0f88b8d053f79e7fdd4b15b37b1bc53296a3602f467f82cfb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassAnalyzer.checkParentClass: MethodTooLong \u2014 checkParentClass runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e0cfa975976fcd5b945dbb8528ce902a25e26779819a33604e07fb3c7c87f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCallAnalyzer.handleNamedFunction: MethodTooLong \u2014 handleNamedFunction runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fe1c622aafbd59ee9d170fb952ba34a12adb859d2141bd0dcac0490d364477"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassLikes.handleClassLikeReferenceInMigration: MethodTooLong \u2014 handleClassLikeReferenceInMigration runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd5fc9baf01dcadd85b3f7cd17d88a6332328996963fbfea11b2e094c01a4fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Functions.getCallMapFunctionCapabilities: MethodTooLong \u2014 getCallMapFunctionCapabilities runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Functions.php"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac461487f6c6a9961f5b2cca36cdd9e1574d21a35ff903f5276e3af437346f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeVariableTracker.reconcileLowerBoundsWithUpperBounds: MethodTooLong \u2014 reconcileLowerBoundsWithUpperBounds runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\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":"src/Psalm/Internal/Type/TypeVariableTracker.php"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda9c3d08c8d874ab356563453a955e3cfa1edb3b3a4b139ae5f10bdc0b0afd8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SimpleAssertionReconciler: 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af81ba89bf4b6b5d0cf8b7eb1a6eba8c3ab99fcdac2eed35f31ccc0db1a1e98"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TemplateStandinTypeReplacer.handleTemplateParamClassStandin: MethodTooLong \u2014 handleTemplateParamClassStandin runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc1a708c1ce4f6fdd527d6bec1abd2b7894d7507736113f4bf044e1d2b5d51e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Type/Atomic.php: FileTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: Atomic (90-1011). The bar is 500 significant lines; this is 94 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8790172ea9d8aff4ab35d4520070a2c3b617a87d675c3b62ff06d89863c730"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaintStore: ClassTooLong \u2014 474 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 74 over it, 1.19\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":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fbde2756050a68b5e847f5b787969ce238444e7efb4cb802989810e95eb3fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AtomicPropertyFetchAnalyzer.propertyFetchCanBeAnalyzed: MethodTooLong \u2014 propertyFetchCanBeAnalyzed runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"3321542f213229d638c332d7b73d7a1cd76c1cee0e38791279b7493a55f2702b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassLikes.consolidateAnalyzedData: MethodTooLong \u2014 consolidateAnalyzedData runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf7c90c154a44f95a5f76cbd352ff7d7ccd367809b4609fbbfe54c8a15753af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ObjectComparator.isIntersectionShallowlyContainedBy: MethodTooLong \u2014 isIntersectionShallowlyContainedBy runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/ObjectComparator.php"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5672b4daa1bd0c4ca1ca4db81a906a224d860c14daa6956a67ad54f6385c275"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SwitchCaseAnalyzer: ClassTooLong \u2014 471 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 71 over it, 1.18\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":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchCaseAnalyzer.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd36c58a9a22deb1f82632863abbabde410b38f1dc7003a7f15b0039f633165"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UnionTypeComparator: ClassTooLong \u2014 470 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 70 over it, 1.18\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":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dadbc0b45772906186c8144044e85b3f968c3835f087d4bb517e739dfef06f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Method/ExistingAtomicMethodCallAnalyzer.php: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: ExistingAtomicMethodCallAnalyzer (67-873). The bar is 500 significant lines; this is 87 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c798495d7099f0156a93e6a8a5bbdfb71948112793298c67f4cd633be043b82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Reflector/FunctionLikeDocblockParser.php: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: FunctionLikeDocblockParser (52-1026). The bar is 500 significant lines; this is 85 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"642551991d4aa6ebe8c3e518f6796a9aca757a6f0e836446cabdadee390a33ad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallAnalyzer.checkTemplateResult: MethodTooLong \u2014 checkTemplateResult runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"891f5fdfdba87d5534049167988f07e4af48fc2d8cbf4367b737949a3ffc3d5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFetchAnalyzer.taintArrayFetch: MethodTooLong \u2014 taintArrayFetch runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fc21fd245da4d05d498cd9196ddfd65d87e437d800afa3597d6194e879f847"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Methods.methodExists: MethodTooLong \u2014 methodExists runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f846b7213675b8505719fd0a153d2da2ef099fda7018b9e66eec43a607dbc33"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Populator: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb27adaea7652c6041944797ca99d786f8bc9874ec6ebf3734d9ca31194c134"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayAssignmentAnalyzer.taintArrayAssignment: MethodTooLong \u2014 taintArrayAssignment runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9b564de774a18f5f295384835134253c53ec782a2cfa2ed68824a5cf81b0d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CastAnalyzer.castStringAttempt: MethodTooLong \u2014 castStringAttempt runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac93123bd3872038f4315b53b044a476b7f798ee0d6ddc3816d919dfdd3859e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionDocblockManipulator.getDocblock: MethodTooLong \u2014 getDocblock runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cfa3626029f7898968018dee5cd26c8a28fa9ae3ad7fd416f767468bd8f150"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeCombiner.getArrayTypeFromGenericParams: MethodTooLong \u2014 getArrayTypeFromGenericParams runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eff099e5d47fec3754fdfbabb67d805ad92b0638be0869672597c5e19e8356"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reconciler.addNestedAssertions: MethodTooLong \u2014 addNestedAssertions runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e57e65cfcad179ae0365a255c6a83af61301f18cfa7f68d0682a249b8d50e93"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IfConditionalAnalyzer: ClassTooLong \u2014 463 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 63 over it, 1.16\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":"src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"732add9fa98abc22fd5a426ecd1cf7711683154ad0bd31816b78e0a3ab5a506c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CliUtils: ClassTooLong \u2014 461 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 61 over it, 1.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/CliUtils.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcf50142ad0c3150a2f0bf06f89da2fea005e577791c2401a8f6081f1494f7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssignmentAnalyzer.analyzeAssignmentToVariable: MethodTooLong \u2014 analyzeAssignmentToVariable runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":2926}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c0547c6bfb68277458ff9ef294e42a1018e030c761334aabd0f977d08e022d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TKeyedArray: ClassTooLong \u2014 458 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 58 over it, 1.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea39c5e9ca8126848db03e447f6cb227b10ba43522e7e8766677cc389322187"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PhpVisitor/ReflectorVisitor.php: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: ReflectorVisitor (60-946). The bar is 500 significant lines; this is 68 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bca07d0dc000c765aad64ead45c28dab73c7e0958c748a03ce02c1cd9bf75b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionLikeDocblockScanner.handleReturn: MethodTooLong \u2014 handleReturn runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"acae69430f3eded8c4cd57d3a3619811821a88a75e5d2dc982cf410e213655a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Call/NamedFunctionCallHandler.php: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: NamedFunctionCallHandler (70-862). The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf47dc076841d286b82fa3dbbe8f5dfb2642a52ead9dbe135ff20682610df99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileAnalyzer.analyze: MethodTooLong \u2014 analyze runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FileAnalyzer.php"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df644cb8e6b03c92b450f7a49a181570ceedd4b5d491d12676ea07eada6abf9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProjectAnalyzer.interpretRefactors: MethodTooLong \u2014 interpretRefactors runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc80aeb072bf741f538030e543fa66fa1410b2f376eab1efa1dfbc5ae394b4ad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayAnalyzer.handleUnpackedArray: MethodTooLong \u2014 handleUnpackedArray runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a380ca0c948b3f4c2450ec9becfc27dfb3088da4137f589c643edb16153c0c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArithmeticOpAnalyzer.analyzeMulBetweenIntRange: MethodTooLong \u2014 analyzeMulBetweenIntRange runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c95c2ecaf87860cce9cadc1f19711eed2720add9b99cec2002a932debaaa9a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCallReturnTypeFetcher.taintCallableReturnType: MethodTooLong \u2014 taintCallableReturnType runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f48f4fdba2c11a1d5a93bffedd7db0989dd3a3783184e6be1d6a00e7a99b30"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayTypeComparator.isContainedBy: MethodTooLong \u2014 isContainedBy runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"427d4ee6877743ec8c2046403f22a8721b9ff9dca495f6305a27bf8a6f8a870d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Scanner: ClassTooLong \u2014 445 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 45 over it, 1.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Scanner.php"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f102f74bfe3a393ceb08daf30f3293a51f4b08963d1723c0337e2cf5d8100f66"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BreakAnalyzer.analyze: MethodTooLong \u2014 analyze runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef16b6e9acaf11c7db91e4f3508e4257e858e1f5b93902888dbea850f2aa779"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CastAnalyzer.castIntAttempt: MethodTooLong \u2014 castIntAttempt runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"c570209e697c1a7c5c820a798b9f66f442e81c2fef31a4b41aebde60bae1d86a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StatementsProvider.getStatementsForFile: MethodTooLong \u2014 getStatementsForFile runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/StatementsProvider.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d7065a93d38572e05113ef7051ddbf9acab57b7026095462046fb813c193ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionReconciler.handleIsA: MethodTooLong \u2014 handleIsA runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf00d4045b5589910b203d04b978c9124f460f557c0a4dacdc4ab117223abbdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Expression/ArrayAnalyzer.php: FileTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: ArrayAnalyzer (61-892). The bar is 500 significant lines; this is 52 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b64fc6dcf38916cdc238845a9f7276eb89a3e290856fe75a01a2f09e03e197c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Psalm: 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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb30079712932df3a5fcfc80bbaf24151f1fbf0345b9049e222a6fd5186d2963"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FileReferenceProvider: 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":"src/Psalm/Internal/Provider/FileReferenceProvider.php"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6967915d2456975f2ad2e54b4ac0fbf0c5a13d5ed033646561b7f9036c1f0f13"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Atomic: 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":"src/Psalm/Type/Atomic.php"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1616e3c5248f68ee79e2ecc9159c62ba47ae3a071941c2fafd7055d1e88fe823"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassAnalyzer.analyzeClassMethod: MethodTooLong \u2014 analyzeClassMethod runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffccca873af7ca7ca877c2b0f03a0a374c38f8852064eb0abe18e861c0943172"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DoAnalyzer.analyze: MethodTooLong \u2014 analyze runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b465272962b15820eefa41edc9622086c5571b50c0104eda2a96b8b5084ee3bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionFinder.scrapeInequalityAssertions: MethodTooLong \u2014 scrapeInequalityAssertions runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"038c03bfc1e8bc04970a9d8b54aca694b915ed31e0f877136b056ab96fa5ca6d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionFinder.getArrayKeyExistsAssertions: MethodTooLong \u2014 getArrayKeyExistsAssertions runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e38ff5bdb5040000343170311c2af339f17525676fdcfe06704a81d38e74e58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReceiverPropertyTaints.taintWrites: MethodTooLong \u2014 taintWrites runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f40a1ec5e1c21e4a52644c8272fd18cd31ba5cb82606c45063ab5d4408ad8a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AtomicTypeComparator.canBeIdentical: MethodTooLong \u2014 canBeIdentical runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a8ef16cb456e143ec1da0cd20f453e9795f7b1dad10cf0dee33102d73ee134"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Expression/SimpleTypeInferer.php: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: SimpleTypeInferer (48-842). The bar is 500 significant lines; this is 48 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"405299cd64fdd50c562459bc7533219ff3571b34ba47be4525ab3a41e3d44e96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CastAnalyzer.castFloatAttempt: MethodTooLong \u2014 castFloatAttempt runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"0730f0813741ea84d634e15b736724740c4aa76e33e4e3d05cbd9e420b9034c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Populator.populateOverriddenMethods: MethodTooLong \u2014 populateOverriddenMethods runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"542b0b1cc6c9a090dd6060dc03690412acf3388229248a3d4b720e99eca815f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reflection.registerClass: MethodTooLong \u2014 registerClass runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Reflection.php"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c6e1d98c99a7539fe86b369858cb56a365d151ad443d19d8e6371f728d6a13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeHintResolver.resolve: MethodTooLong \u2014 resolve runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/TypeHintResolver.php"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"443fe90a392320f67061e28259dac3347715f2fe87787f2afe663e99f58e3fa3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeExpander.expandNamedObject: MethodTooLong \u2014 expandNamedObject runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"065b82280f17369341dc0a8b6e9aeecd5a153c8b6d6d7fb814825fee7d0a9fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeTokenizer.getFullyQualifiedTokens: MethodTooLong \u2014 getFullyQualifiedTokens runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeTokenizer.php"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b3a519a88997562809757492299474f3eb5b5022cf12c71abbc1052141f32a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TemplateInferredTypeReplacer: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 30 over it, 1.08\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":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd54e68fd072c7ad8534749c4d18f05cd38e6f990f31831dee5e21480710042"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LanguageServer: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 29 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":"src/Psalm/Internal/LanguageServer/LanguageServer.php"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cd35cf77cac746a4266eaf8a7d6d4944df69de209cb69478765171913d428b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BinaryOpAnalyzer: ClassTooLong \u2014 428 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 28 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"326b3369663247661e814f850a28e679f828684a18d08c7566a8cbf8d2bde786"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Codebase.getCompletionItemsForPartialSymbol: MethodTooLong \u2014 getCompletionItemsForPartialSymbol runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"src/Psalm/Codebase.php"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95b30504eda0071608ce511e74647a179c53e908b6bd684547b8ec80b56f025"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MethodVisibilityAnalyzer.analyze: MethodTooLong \u2014 analyze runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodVisibilityAnalyzer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"599f662cacc758ec3633726bc3e2634ec322db43402cf8b3c7bcfbbcaef66f1c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilterUtils.getOptionsArgValueOrError: MethodTooLong \u2014 getOptionsArgValueOrError runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b26e555db74efd5c2e94ac07ccdc145680e59b120f8967a2dd530324f4419d1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InstancePropertyFetchAnalyzer: ClassTooLong \u2014 424 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 24 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"580b6350818d5a0c73d830ef194c5e05eaaaa37bc041bd367ac6574b6a566996"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFetchAnalyzer.handleArrayAccessOnArray: MethodTooLong \u2014 handleArrayAccessOnArray runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d14d503b466134d49cc9828c89e7662d323646c44095791bd5634af693c06a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalAnalyzer.analyze: MethodTooLong \u2014 analyze runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/GlobalAnalyzer.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3197dbdea946d74d0e3216cd8a208104d18db55901227f2ab09a5a30df98dba2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionReconciler.handleLiteralEquality: MethodTooLong \u2014 handleLiteralEquality runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8adbd4cf090df792d1614410ea8bc15c1f14877521abcc504c545a44b7d9f0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Method/MissingMethodCallHandler.php: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: MissingMethodCallHandler (45-786). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"700d3bee5415cbb30c6c0f41cf77001830d8d25fe4cf6d3fc5fca96af0128019"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Codebase/TaintStore.php: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: TaintStore (74-968). The bar is 500 significant lines; this is 26 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77f9ecdb1d816008e7a25d8631b70937739d76e883cd1c0a553a9a1708c6e16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Internal/CliUtils.php: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: CliUtils (74-981). The bar is 500 significant lines; this is 25 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/CliUtils.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e2fa62ddedfec3f35b6082e8091fcd1057baeb1a45448e274a66ca5f32cd18"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Block/SwitchCaseAnalyzer.php: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: SwitchCaseAnalyzer (61-809). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchCaseAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"518c40f2764f1b7bded2c9db4f0c79eef3ef21036a0b5f222a2634b33660ac3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExistingAtomicMethodCallAnalyzer.getMagicGetterOrSetterProperty: MethodTooLong \u2014 getMagicGetterOrSetterProperty runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cded572c9abffb31c5f87c72f49ebc80fdba2a8fff9ed3b1f9ec593abd28ea1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartialApplicationAnalyzer.bind: MethodTooLong \u2014 bind runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c50943e7311fc0ab394547dc864f6c551b4b5ec18cbc8e489069663f7023c9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArrayMapReturnTypeProvider: ClassTooLong \u2014 414 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 14 over it, 1.04\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0593d483b6efd19b0c19d67948e6f25a4a2eb7fc3bd47f3ab20d3a731d0e1fdf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NewAnalyzer: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccba6af3c26f029b9578a7197096fc53bd89a66332eaf15b12be9c9645a9e8ef"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StaticCallAnalyzer: ClassTooLong \u2014 413 significant lines (blank, comment-only and punctuation-only lines excluded), 3 methods. The bar is 400 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3549a184d69b82b71a32d701fda5b64d3b59cde3fab4a185f97314a2ef5408"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: LanguageServer/LanguageServer.php: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: LanguageServer (98-1065). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/LanguageServer/LanguageServer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37269d5b8e303683bb03234e377cf1cf7bd9f66857afcd4171d97cc4f783d42f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DataFlowNode: ClassTooLong \u2014 412 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 12 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/DataFlow/DataFlowNode.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"95438c85ff3f482fd5d9e2c29911d027dc60683e0014851eed3c0bce8719f542"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayAnalyzer.analyze: MethodTooLong \u2014 analyze runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5682d0efc82a9b2dd5f8975abe0e329071ca339419803343a00f35393c4715c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileStatementsDiffer.diff: MethodTooLong \u2014 diff runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/FileStatementsDiffer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56840d92ac8a544be1b571b74de49aed1eaf0d1666840d45eea814a2b87e217"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Comparator/UnionTypeComparator.php: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: UnionTypeComparator (54-930). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccb84285289ca6a705251622f98cbc891ce3c2cdf7e90e356cd8ffce2b0ce0f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionFinder.getTrueInequalityAssertions: MethodTooLong \u2014 getTrueInequalityAssertions runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1e591f9c217cedeef72024e72f16e8081d946dbfe74f52c6ae7067583ecd22"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CloneAnalyzer.analyzeClonedType: MethodTooLong \u2014 analyzeClonedType runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CloneAnalyzer.php"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a95ee20ab4345d7088172e06ffc750c27146ee81ae92056169d2252881593e8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IfAnalyzer: ClassTooLong \u2014 405 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"431b1775e50d484a7c83daf79bd21141b5ac1f79af90c6fde3ddb32e6ad8f54a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CodeUseGraph: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/CodeUseGraph.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d03312a62b58aa3595f4f6fa467d0c82a4b98711011186b76061586a2ee2b69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionReconciler.handleLiteralEqualityWithString: MethodTooLong \u2014 handleLiteralEqualityWithString runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"85388b287c5aae50475d4e2005dfc0dafc89106c67474e54c5bdbe33e7a0ddd8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.intersectUnionTypes: MethodTooLong \u2014 intersectUnionTypes runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"src/Psalm/Type.php"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b102bcd7717a36810fec6ecf1e52e27880b749761edc24444877ffe8d238cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 58 shared lines): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2090-2204 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2221-2331 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1898-2005 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:2021-2126 \u2014 These 4 members are variants of one another: a block of 58 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb65b207999455eff15e50947e8b1c7263b53903360b60181e81797c4ed085e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (66 shared lines): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php:53-264 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterVarReturnTypeProvider.php:42-169 \u2014 These two members are variants of one another: 66 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"70613cdd919ad88e60faa364e6811dc01b1ee4f3039017e3d5929912868d84c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:119-611 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:639-870 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea84fecf036389a18dc73254bdeb1707e7aa6fe221cfde629ff0b7ea43e2473c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (16 members, 50\u002B identical tokens): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1007-1214 | src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:350-882 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:429-1111 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:246-489 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:176-293 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:322-755 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:904-1624 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:1839-1925 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php:82-634 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php:733-845 | src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php:962-1237 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:874-1305 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1466-1528 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2562-2634 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php:76-380 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php:507-741 \u2014 These 16 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 16 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 16 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6264793a818fc462537954a3acd78ef81019c9b7aad82f8bd6d28c77510ed6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1151-1220 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1237-1319 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1336-1413 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1430-1513 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1530-1608 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1625-1712 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1729-1812 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"db51ae2cba9536ae3c7252157def41c85e9d019ca10a5902dd4c06940f16b82e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2809-2865 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2878-2925 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2938-3024 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3566-3615 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3628-3681 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3694-3786 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2809}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd8e1bfaf96cd304073904d916f27e9d287b1b6b119813190405863a1552bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2356-2441 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2457-2562 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2733-2796 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3121-3196 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3495-3553 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4efbdb59a3ee6af724e3d0c5614e07b9ef8cc5b583b59ae7752c1ff11a7ee7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:511-581 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:712-770 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:787-850 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:867-930 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1829-1882 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc1c3fe04f6669fc76d14ae3dba4781ec8f3f9910e422d08fc8de31e676bee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:511-581 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1151-1220 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1237-1319 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1430-1513 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1530-1608 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f719080dd7267370f2b2709e56eb28ac9d505059d1d83575e7a2eb680fb169"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php:31-218 | src/Psalm/Internal/Analyzer/Statements/ContinueAnalyzer.php:29-123 | src/Psalm/Internal/Analyzer/Statements/Expression/ThrowAnalyzer.php:34-132 | src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php:180-751 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e91e1b74508146a7329dd9896b2dd147d8246db90c1097844796c654994814"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2457-2562 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2579-2719 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3212-3325 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3342-3481 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2457}}}],"partialFingerprints":{"codehealthFindingId/v1":"03895d14079c8bed81fa3ea948f6a6aac91a4c7cbfac8a0572018c3148d2f0ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/Psalm/Internal/Cli/LanguageServer.php:67-432 | src/Psalm/Internal/Cli/Psalm.php:1002-1024 | src/Psalm/Internal/Cli/Psalter.php:101-503 | src/Psalm/Internal/Cli/Refactor.php:71-391 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c4924349b5a24b7adf057d0b3c976f133b42dad5a90bb00e25f23d42fee0ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/Psalm/Internal/Cli/LanguageServer.php:67-432 | src/Psalm/Internal/Cli/Psalm.php:1161-1183 | src/Psalm/Internal/Cli/Psalter.php:513-531 | src/Psalm/Internal/Cli/Refactor.php:71-391 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5f9bce376d70c9e48b4a06dc7f86d6df5e87786b007129a2e4b83eb3498e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (183 corresponding lines): src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php:360-546 | src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php:555-737 \u2014 These two members are one piece of code written twice and then edited apart: 183 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"829fb5dd46f2cb224e7ee4c206cb7309d37b42d36466f5d5a6cd30c84724ad81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (112 corresponding lines): src/Psalm/Internal/Diff/FileStatementsDiffer.php:33-176 | src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php:33-144 \u2014 These two members are one piece of code written twice and then edited apart: 112 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":"src/Psalm/Internal/Diff/FileStatementsDiffer.php"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e286ab00b7ae9c92a713c8f61dbad46da166a390b4816f217f3340f53ad0203b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (93 corresponding lines): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:4394-4489 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:4673-4765 \u2014 These two members are one piece of code written twice and then edited apart: 93 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4394}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dac5a2a8a6a8d58009809b5b5202d776c0bd46e324e968556e9313acda3204"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (105 corresponding lines): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:692-812 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:827-931 \u2014 These two members are one piece of code written twice and then edited apart: 105 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a30348ce0a86b53a3b574e3b82a1cf017dcbb2cb484d2717db95cf56e2508f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 77\u002B corresponding lines): src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1333-1409 | src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1417-1495 | src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1503-1581 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 77 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbdc60b565c35322336394a722338be85f198e06a205866bc321201930986cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 123\u002B corresponding lines): src/Psalm/Internal/Type/AssertionReconciler.php:1712-1834 | src/Psalm/Internal/Type/AssertionReconciler.php:1884-2023 | src/Psalm/Internal/Type/AssertionReconciler.php:2042-2165 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 123 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"23459af6501c640581107b5fd87e01160353d1b3edaafc46495e0de45e0b2823"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 72\u002B corresponding lines): src/Psalm/Internal/Codebase/ClassLikes.php:1328-1404 | src/Psalm/Internal/Codebase/ClassLikes.php:1496-1589 | src/Psalm/Internal/Codebase/ClassLikes.php:1594-1665 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 72 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bca82bfd588446e5f4618dc0c1a11f0871eaf76c5f52e7730d00602f1815aa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 69\u002B corresponding lines): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1059-1137 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1153-1231 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1327-1395 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1412-1480 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 69 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1e34d599054c452adb378b004f70bc25ab57706bd4618ceb2dbf2f1a64eeff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php:669-720 | src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php:643-708 \u2014 These two members are one piece of code written twice and then edited apart: 52 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcfeae4172a58e440648a423512130ad61f3159fbddb358630f2289873bd0df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/Psalm/Internal/Diff/AstDiffer.php:91-130 | src/Psalm/Internal/Diff/FileDiffer.php:79-118 \u2014 These two members are one piece of code written twice and then edited apart: 40 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":"src/Psalm/Internal/Diff/AstDiffer.php"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2a51968db9bed7277c60de3be612bab422ac480af102db156f0efbde4269d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1248-1310 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1497-1555 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfa6df95150bde53e3576fda93b55160f57d9ad93721a15552847eff80330ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 52\u002B corresponding lines): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1852-1904 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1922-1985 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2349-2400 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 52 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eb19eddf5f008643d995f2b363822eda9af3f79a15a0eccf51c3871c26a9ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/Psalm/Internal/Diff/AstDiffer.php:44-78 | src/Psalm/Internal/Diff/FileDiffer.php:39-67 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/AstDiffer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc2d142505340ad89697777f5fe3b36860ef416760d6839bd6a2e72a945304a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php:1120-1165 | src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php:2321-2365 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef45df26d0e3028bf36aee7787e58a8e37eed76fc6f7234bf32160261e63f011"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): src/Psalm/Report/ByIssueLevelAndTypeReport.php:64-104 | src/Psalm/Report/ConsoleReport.php:40-78 | src/Psalm/Report/PhpStormReport.php:40-70 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 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":"src/Psalm/Report/ByIssueLevelAndTypeReport.php"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd99074d5cc6cdb0a0070563ad907d616f1e60493a0c4a225bb9db2527b981d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/Psalm/Internal/Analyzer/ProjectAnalyzer.php:908-945 | src/Psalm/Internal/Analyzer/ProjectAnalyzer.php:1016-1051 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ca4ef7acb38df7836660d84ad4238eae20d4cf4a08cd7fd23aacfec1c4637a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/Psalm/Type/MutableUnion.php:202-235 | src/Psalm/Type/UnionTrait.php:86-122 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"src/Psalm/Type/MutableUnion.php"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c242c5c15da8724a24c48a0def789c3be3ea4b5755a6de77dcac83d0b1c83c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/Psalm/Internal/Codebase/TaintFlowResolution.php:2968-2994 | src/Psalm/Internal/Codebase/TaintFlowResolution.php:3033-3059 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":2968}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44af77fdb0496e93e2cd70c448e24b607b19293b3b25822be0fc36019106bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): src/Psalm/Codebase.php:2037-2086 | src/Psalm/Codebase.php:2094-2137 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa7b44db64f9a915fe08548c4dcb2ff933251753de9a0b5cd9dbdbbfef57443"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (89 corresponding lines): src/Psalm/Internal/Provider/ReturnTypeProvider/PdoStatementReturnTypeProvider.php:57-145 | src/Psalm/Internal/Provider/ReturnTypeProvider/PdoStatementReturnTypeProvider.php:150-264 \u2014 These two members are one piece of code written twice and then edited apart: 89 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/PdoStatementReturnTypeProvider.php"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"15957d84da8ff318eb0c08629c2dd7e4306cc955e4071efc101dcbaa0af18db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/Psalm/Type/Atomic/TKeyedArray.php:89-117 | src/Psalm/Type/Atomic/TKeyedArray.php:149-180 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"54674bf7f5e08b67ab940337b0e5b1546f92ee037d14df1f1d240190749d3b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php:418-453 | src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php:462-497 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91b9d3ed58f0bbf9d4efca204d9b0f7c72175a048006f62369809f8466845e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): src/Psalm/Report/ByIssueLevelAndTypeReport.php:115-141 | src/Psalm/Report/ConsoleReport.php:87-113 | src/Psalm/Report/PhpStormReport.php:79-108 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 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":"src/Psalm/Report/ByIssueLevelAndTypeReport.php"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b44186190d9a27e46f1abef7996428602f2009576041f091845a5c9a67abf6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/Psalm/Internal/PluginManager/Command/DisableCommand.php:52-84 | src/Psalm/Internal/PluginManager/Command/EnableCommand.php:52-84 \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":"src/Psalm/Internal/PluginManager/Command/DisableCommand.php"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1e9fe0cd59e063936e4940e6bd66989dbee2b76f1dfa03332bfce808f021e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 38\u002B corresponding lines): src/Psalm/Internal/LanguageServer/Server/TextDocument.php:165-204 | src/Psalm/Internal/LanguageServer/Server/TextDocument.php:216-253 | src/Psalm/Internal/LanguageServer/Server/TextDocument.php:333-374 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 38 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":"src/Psalm/Internal/LanguageServer/Server/TextDocument.php"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bd93c2e4daf663dbb0e484dfab39523b0757742761df9a5c7ba36ed3fc3ebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): src/Psalm/Internal/Codebase/ClassLikes.php:372-403 | src/Psalm/Internal/Codebase/ClassLikes.php:414-445 | src/Psalm/Internal/Codebase/ClassLikes.php:456-487 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f154f1c842d00f09d873ad1d318c0929950ed9f61f8cf87fc658ac8fe5a66025"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/Psalm/Internal/Codebase/TaintFlowResolution.php:3512-3542 | src/Psalm/Internal/Codebase/TaintFlowResolution.php:3752-3770 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":3512}}}],"partialFingerprints":{"codehealthFindingId/v1":"509af83fd3954ee1c3bf8cd698f997399ee6ea1b19c8f5c3399c8d9d496ac518"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/Psalm/Internal/Type/TypeCombination.php:133-153 | src/Psalm/Internal/Type/TypeCombination.php:164-186 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeCombination.php"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c191a5d547524cff733d06f4ed8b45eb287a95a12047229ed07698abfee9847"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/Psalm/Internal/Codebase/TaintFlowGraph.php:977-1003 | src/Psalm/Internal/Codebase/TaintFlowGraph.php:1011-1037 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"691f842623848f65d2f47bdb74f736802df0474e0cb50bef906b25397c095cc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php:191-207 | src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php:243-259 \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":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7333fe0e33a3f83490f96bf3a934b91d6618ff66499bc8d8563d569ea1e355bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/Psalm/Internal/Analyzer/Statements/Expression/BitwiseNotAnalyzer.php:124-142 | src/Psalm/Internal/Analyzer/Statements/Expression/UnaryPlusMinusAnalyzer.php:120-140 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BitwiseNotAnalyzer.php"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0416a1c6a4bd801575b1b253482533a67a2996068aa414c540617b5dedd1011"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/Psalm/Type/UnionTrait.php:256-287 | src/Psalm/Type/UnionTrait.php:295-329 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f4f3d0661404ded35a2ec26235ad9e8ad92d3b8c48705d99bf995edb504261"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/Psalm/Internal/Provider/ClassLikeStorageCacheProvider.php:31-56 | src/Psalm/Internal/Provider/FileStorageCacheProvider.php:32-57 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ClassLikeStorageCacheProvider.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29f73d87dd490cd22b412739f399da8ec86cf75ceccf034afa1c5cdffa9d8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/Psalm/Internal/Provider/FileProvider.php:49-72 | src/Psalm/Internal/Provider/FileProvider.php:80-102 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/FileProvider.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc2c77bbdb77195fc06512e2ac9468fa68edc20249bfe5941b595e18ffd51dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ConstFetchAnalyzer.php:146-166 | src/Psalm/Internal/Codebase/InternalTaintSourceMap.php:60-78 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ConstFetchAnalyzer.php"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"644a1d21952be5d94ae1f5d94f4a41a8b8dea2840f0e3f978b89035013dd6a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/Psalm/PluginFileExtensionsSocket.php:54-73 | src/Psalm/PluginFileExtensionsSocket.php:91-110 \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":"src/Psalm/PluginFileExtensionsSocket.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cb424c34012751250e16ed87956307641017403853c8e0977124d14458ba3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/Psalm/Internal/Codebase/ClassLikes.php:1993-2019 | src/Psalm/Internal/Codebase/ClassLikes.php:2032-2057 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1993}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fa2ca11410571fe8e1ad425c433c1e08f2c8b43794a77c8c10b15fa798bccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/Psalm/Config.php:1001-1018 | src/Psalm/Config.php:1027-1044 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc21fb3adbb6c23226395a02809d9efc69376b259e7508aa9229d2b9416e9f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/Psalm/Storage/FunctionLikeStorage.php:463-486 | src/Psalm/Storage/FunctionLikeStorage.php:494-512 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Storage/FunctionLikeStorage.php"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec291c53e19bfc568a25428a28a83aa14c9f0d262c9dc92204e1ea4d35a2334"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/Psalm/Internal/LanguageServer/Client/Progress/Progress.php:36-63 | src/Psalm/Internal/LanguageServer/Client/Progress/Progress.php:96-125 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/LanguageServer/Client/Progress/Progress.php"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"813bbf196d6cbdb5aae7a85371429c679950032f3ae4c1eb6ccb18cb20931597"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/Psalm/Internal/Codebase/Properties.php:123-143 | src/Psalm/Internal/Codebase/Properties.php:154-176 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Properties.php"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0412f96bd62ee38dee543ddd5c5cb8a18d495c6f9dc54fe15a33787ea799ff3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/Psalm/Type/UnionTrait.php:1127-1144 | src/Psalm/Type/UnionTrait.php:1152-1175 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee76cf1735a8fd76def1bbb4bb0059ae4ec718aacccad2d8f7af7ec1039d32d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/Psalm/Internal/Type/AssertionReconciler.php:980-1012 | src/Psalm/Type.php:996-1034 \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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"028b2d0d51683406c630ab8d925fedf1cf392566bb51de66172e1d05562f1d06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): src/Psalm/Type/Atomic.php:600-618 | src/Psalm/Type/Atomic.php:623-641 | src/Psalm/Type/Atomic.php:661-679 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic.php"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"3614940f7bbb1cddcf92363b0035fb3294ecfbb11200ff837affd74c070bfc61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php:905-925 | src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php:939-958 \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":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b74e717678452b4fa7f00a66354a16937ab46b50021c211cb524101f4fb7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/Psalm/Internal/Codebase/Properties.php:185-200 | src/Psalm/Internal/Codebase/Properties.php:209-221 \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":"src/Psalm/Internal/Codebase/Properties.php"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2a69811b7f550079490850a795ebb72bdd8314af251b79c036ccfe0755bab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/Psalm/CodeLocation/ParseErrorLocation.php:29-42 | src/Psalm/CodeLocation/Raw.php:28-40 \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":"src/Psalm/CodeLocation/ParseErrorLocation.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8725d763df1b5ec022436db2941fc3d24ce126eeebd686c0726589268eddac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/Psalm/Internal/Codebase/TaintStore.php:336-342 | src/Psalm/Internal/Codebase/TaintStore.php:356-363 \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":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce60f1e98a42e52838019f8b46024c68273ea6c353cd3859336ce02d2216e03b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/Psalm/Config/ErrorLevelFileFilter.php:27-39 | src/Psalm/Config/ErrorLevelFileFilter.php:48-60 \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":"src/Psalm/Config/ErrorLevelFileFilter.php"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3541a3131968ee51ad0fad51c66f477ff4056ad9a23a690b2c3e7726b5e0576d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php:619-639 | src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php:656-669 \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":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d5f9c5c2692fd31f04711762f0a907dca233241acad625916ef3759ecd92f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php:607-627 | src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php:635-655 | src/Psalm/Internal/Analyzer/StatementsAnalyzer.php:943-961 | src/Psalm/Internal/Analyzer/StatementsAnalyzer.php:969-987 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"b061ee57a57c3da8362837867ea40747ab52588e392508cc2a546ab8568c5471"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/Psalm/Internal/Codebase/ClassLikes.php:230-241 | src/Psalm/Internal/Codebase/ClassLikes.php:249-260 | src/Psalm/Internal/Codebase/ClassLikes.php:268-279 | src/Psalm/Internal/Codebase/ClassLikes.php:287-298 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cf30faff8b2ed42d2225acf96442e977d5ee4eca0384c4029bd7683d951c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/Psalm/Storage/Capabilities.php:332-357 | src/Psalm/Storage/Capabilities.php:369-388 \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":"src/Psalm/Storage/Capabilities.php"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0338cce918c7b070120f181c23f9d1f43c0aff717c3a60e54c137d08db83987"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2121-2139 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2160-2173 \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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b675893193be91f29f8a5c9c925a6e41dc3ecc920952b55c69e90fb3991c5ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/Psalm/Type/Atomic/TArray.php:80-101 | src/Psalm/Type/Atomic/TGenericObject.php:128-146 | src/Psalm/Type/Atomic/TIterable.php:175-189 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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":"src/Psalm/Type/Atomic/TArray.php"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7848d55256b41ac21fc29bd3d7eab17fc2a9eeb194f20169fcac6069438cb804"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/Psalm/Internal/Provider/ReturnTypeProvider/FirstArgStringReturnTypeProvider.php:39-55 | src/Psalm/Internal/Provider/ReturnTypeProvider/GetClassMethodsReturnTypeProvider.php:34-48 | src/Psalm/Internal/Provider/ReturnTypeProvider/GetObjectVarsReturnTypeProvider.php:165-184 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FirstArgStringReturnTypeProvider.php"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"875efa6804dadc2850070ab42ce7ab6c71e7b07b38590cc2764af0152dc13241"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/Psalm/Type/MutableUnion.php:465-481 | src/Psalm/Type/Union.php:365-382 \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":"src/Psalm/Type/MutableUnion.php"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"76363bec4de0155f3ec319fe65ca8e337241e612c6827ab1b3a5719b1a6469b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/Psalm/Internal/Analyzer/AlgebraAnalyzer.php:67-79 | src/Psalm/Internal/Analyzer/AlgebraAnalyzer.php:96-110 \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":"src/Psalm/Internal/Analyzer/AlgebraAnalyzer.php"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"72700b69537ec5253c926b00f05e8303075ed02fcad1f44e7bf7c50a3e47be5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1589-1601 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1611-1625 \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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf44b64550b23d4805da6b48331b99fcfd853bc1af314a133437b56c9f875d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/Psalm/Internal/LanguageServer/Server/TextDocument.php:65-76 | src/Psalm/Internal/LanguageServer/Server/TextDocument.php:88-99 \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":"src/Psalm/Internal/LanguageServer/Server/TextDocument.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbf68bcd1989aa056a518eacdd8b6a322860ba6d47f6376b0bc1e4a7d5f0076"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/Psalm/Report/EmacsReport.php:25-39 | src/Psalm/Report/TextReport.php:25-38 \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":"src/Psalm/Report/EmacsReport.php"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4749e60e1b65d8b4e0373c1d7c871242e123e76ca7a6a253de5d309c78c441d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/Psalm/Internal/Provider/FileReferenceProvider.php:606-616 | src/Psalm/IssueBuffer.php:1314-1322 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/FileReferenceProvider.php"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6ab668b873e3d195337dc85d38e9abe52ec07565883e57e016d0f0e4c81e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/Psalm/Internal/Provider/MethodCapabilitiesProvider.php:78-94 | src/Psalm/Internal/Provider/MethodReturnTypeProvider.php:93-112 \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":"src/Psalm/Internal/Provider/MethodCapabilitiesProvider.php"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d72f2e46b0ac6ef15d171efb2f40233bb1ffecd38a0fffba6dfc5cf83ebae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/Psalm/Type/Atomic/TTemplateKeyOf.php:93-109 | src/Psalm/Type/Atomic/TTemplateValueOf.php:93-109 \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":"src/Psalm/Type/Atomic/TTemplateKeyOf.php"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ed83fc6abc85e3e70ce86deadad104c930da692a67b6462e588fd645e60e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): src/Psalm/Internal/Provider/MethodExistenceProvider.php:71-85 | src/Psalm/Internal/Provider/MethodParamsProvider.php:86-102 | src/Psalm/Internal/Provider/MethodVisibilityProvider.php:76-91 | src/Psalm/Internal/Provider/PropertyTypeProvider.php:77-96 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/MethodExistenceProvider.php"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1065225a45e6b2e6f5d7b1ad0cb2c66b3ffe63888d3ed1a8e5b1431563dce74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/Psalm/Internal/Codebase/TaintFlowGraph.php:1348-1357 | src/Psalm/Internal/Codebase/TaintFlowResolution.php:986-995 \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":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e544810f975a27563a1437162972dfeed8559bd6098fefc74ae0d867c703df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/Psalm/Internal/Type/IterationPurity.php:115-129 | src/Psalm/Type/UnionTrait.php:1597-1611 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/IterationPurity.php"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4234348f7abf79a03167976d1f64ed870432377ef6c96ff3ec454db2a44c10b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:5009-5019 | src/Psalm/Internal/Analyzer/Statements/Expression/IntMaskComparisonAnalyzer.php:204-214 \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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":5009}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c84efa1c1e605939b54a78fbb8309fe2238145a4417a4a62e2d00d68f598bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/Psalm/Type/Atomic/TArray.php:135-152 | src/Psalm/Type/Atomic/TNamedObject.php:238-255 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TArray.php"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0655fe06f049d72072c012df6b0aad7df416a5466254b42390db84a550294f4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/Psalm/Internal/Analyzer/InheritedMethodTaints.php:205-211 | src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:983-989 \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":"src/Psalm/Internal/Analyzer/InheritedMethodTaints.php"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03e144eca91cfe339eab15a5ef3a3c29de145c28c75e5a45e0974dc5cfda6b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/Psalm/Internal/GzipSerializer.php:47-53 | src/Psalm/Internal/Lz4Serializer.php:41-47 \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":"src/Psalm/Internal/GzipSerializer.php"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c6e988e1084ed568e3c4dc1a82d4ea47c9c0da580d273a8393ac8730b0eb47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/Psalm/Internal/Provider/FileReferenceProvider.php:442-451 | src/Psalm/IssueBuffer.php:629-635 \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":"src/Psalm/Internal/Provider/FileReferenceProvider.php"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"135aabf4cf659736b25eb3fc63e28363b7f4dfe2f919700e61bb2103471d6cae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): src/Psalm/Storage/Assertion/IsIdentical.php:65-68 | src/Psalm/Storage/Assertion/IsLooselyEqual.php:65-68 | src/Psalm/Storage/Assertion/IsNotIdentical.php:74-77 | src/Psalm/Storage/Assertion/IsNotLooselyEqual.php:74-77 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Storage/Assertion/IsIdentical.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc52305207d3f05b923fb861ac95548c7faba005e76c750f02610df7463ca84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php:547-558 | src/Psalm/Type/Atomic/TKeyOf.php:69-79 | src/Psalm/Type/Atomic/TValueOf.php:112-123 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d80ffca5155ce86d4806e61cf5d30b2bb68c9bab9cad033c7c6df4dc7777461"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/Psalm/Internal/Provider/FunctionExistenceProvider.php:41-47 | src/Psalm/Internal/Provider/FunctionReturnTypeProvider.php:141-147 \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":"src/Psalm/Internal/Provider/FunctionExistenceProvider.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"018b6792d80106eccbc0d39f957c07241e1f1dc4112d22831cb65de155c9db16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 7\u002B corresponding lines): src/Psalm/Internal/Provider/MethodCapabilitiesProvider.php:40-46 | src/Psalm/Internal/Provider/MethodParamsProvider.php:48-54 | src/Psalm/Internal/Provider/MethodReturnTypeProvider.php:53-59 | src/Psalm/Internal/Provider/MethodVisibilityProvider.php:43-49 | src/Psalm/Internal/Provider/PropertyExistenceProvider.php:43-49 | src/Psalm/Internal/Provider/PropertyTypeProvider.php:43-49 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/MethodCapabilitiesProvider.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a6147ec70d1f0942651c7fa038b6eb48add5c9d8d4af3ae4be98c3c2b0a269"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/Psalm/Type/MutableTypeVisitor.php:31-42 | src/Psalm/Type/TypeVisitor.php:24-34 \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":"src/Psalm/Type/MutableTypeVisitor.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60ff424ab728f5135da80c08b868cda8ce0246ddbe7e560a3ae86c8335e3dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php:1184-1200 | src/Psalm/Type/UnionTrait.php:1502-1517 \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":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1960ce53e9e11de83cf3808badfd95cabb3aba6c5fc5966f8075fac7af9defd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php:1971-1976 | src/Psalm/Internal/Codebase/InternalTaintSourceMap.php:39-44 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"755ea1a11f211dac557f002236f87da2ac16aa6bbbb7e17e18eebe0c5c817262"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): src/Psalm/Internal/GzipSerializer.php:34-41 | src/Psalm/Internal/Lz4Serializer.php:28-35 | src/Psalm/Internal/ZstdSerializer.php:63-69 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/GzipSerializer.php"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a438d50fed184f2ad7f588b4527f095297eb82f427c31f3c8cae0c52776c45ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php:974-980 | src/Psalm/Type/Atomic/TKeyedArray.php:204-207 \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":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"653207cdc034232a7315372876928cc575ef6f8029c719914e7a4c7488c5b7f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php:113-116 | src/Psalm/Internal/Analyzer/TraitAnalyzer.php:31-36 \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":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ba7e4fcde6f6b73bf303dbaf2034b5f6a89a6bd4209788d38cc3df95a964e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/Psalm/Type/Atomic/TCallable.php:47-50 | src/Psalm/Type/Atomic/TClosure.php:57-66 \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":"src/Psalm/Type/Atomic/TCallable.php"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"33873bb50201c1d51d3698abbc5098fd495893693c4e3f6aee633d75684b8e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/Psalm/Internal/Provider/MethodExistenceProvider.php:41-45 | src/Psalm/Internal/Provider/PropertyVisibilityProvider.php:42-46 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"src/Psalm/Internal/Provider/MethodExistenceProvider.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4a649f5f21c1c122b3798c0d8405a235386392a1ed28e666fd51d9538ca4e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53\u201395 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/PdoStatementReturnTypeProvider.php:93-145 | src/Psalm/Internal/Provider/ReturnTypeProvider/PdoStatementReturnTypeProvider.php:170-264 \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 \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/PdoStatementReturnTypeProvider.php:93\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/PdoStatementReturnTypeProvider.php"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bca8c1bc6471d66a1eadc18ba08c18117fdcde2698611c7bf2d83d9bd0d7dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (73\u201376 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2609-2681 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3372-3447 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2609\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2609}}}],"partialFingerprints":{"codehealthFindingId/v1":"baff15ed1c24e273b753d3e9f1d657d69f2f516906549d2b0d99d01d2d9fff4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1837-1885 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1898-1946 \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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2d5d162bc3068445fbc700e6656c7223c308296ee0dd6c0439b3eebb1d5cd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:408-456 | src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:748-796 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:408\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b0756a61e288b671b0a3d15be5104a85c2eb09fc4bc115f9de276a7c1abc53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:331-378 | src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:684-731 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:331\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:330\u0060 calls \u0060getFirst\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:683\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2f40bb3cf84657f837f9256dee130f32f794ab4b88aff6f1a248dac1bea3d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 4): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2158-2204 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2285-2331 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1959-2005 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:2080-2126 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php\u0060 and \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 139 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2158\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"613dc3e61f995f9f4301f40a068c6fa5315e27417d67723065a667b3dbcb3add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201347 lines \u00D7 2): src/Psalm/Internal/Cli/Psalter.php:274-320 | src/Psalm/Internal/Cli/Refactor.php:314-359 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Cli/Psalter.php\u0060 and \u0060src/Psalm/Internal/Cli/Refactor.php\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Cli/Psalter.php:274\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/Cli/Psalter.php:321\u0060 calls \u0060elseif\u0060, \u0060streamIsInteractive\u0060, \u0060LongProgress\u0060 and \u0060src/Psalm/Internal/Cli/Refactor.php:360\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Psalter.php"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89da8f3faf23549d8e64d699c495d432898b1a97367055e1ac8009349f2936b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201345 lines \u00D7 2): src/Psalm/Internal/Diff/FileStatementsDiffer.php:46-88 | src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php:45-89 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php\u0060 and \u0060src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php:46\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/FileStatementsDiffer.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"73afa21bc4704cc050b576828204d1fe2f4d98b451e1619c64b726e8a66a7b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php:436-479 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php:511-554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fbe57567551094cae60d21e1a7bec967cb1de199e6b4cf36b1f09871ced311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): src/Psalm/Internal/Stubs/Generator/ClassLikeStubGenerator.php:230-273 | src/Psalm/Internal/Stubs/Generator/StubsGenerator.php:224-267 \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":"src/Psalm/Internal/Stubs/Generator/ClassLikeStubGenerator.php"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9ab8c16ad3d56048a5b6084c0deb40e872fe513447716896ea7d965657fc00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): src/Psalm/Internal/Provider/AddRemoveTaints/HtmlFunctionTainter.php:31-73 | src/Psalm/Internal/Provider/AddRemoveTaints/HtmlFunctionTainter.php:82-124 \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":"src/Psalm/Internal/Provider/AddRemoveTaints/HtmlFunctionTainter.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9c9ee1b5573ed40cd514d5120d3ebe14135d96f22ec564f870d5129ce56a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201339 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:753-791 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:1574-1610 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:1574\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2903abab62ee587f496d1eb5e4c45acbe118a5d630bb16f36b3ef5afd0978a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): src/Psalm/Internal/Codebase/ClassLikes.php:1368-1404 | src/Psalm/Internal/Codebase/ClassLikes.php:1553-1589 \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 \u0060src/Psalm/Internal/Codebase/ClassLikes.php:1368\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecbd498564962502ba30b861c0e7b855d5a05affcb58ff9ea76fd489f87dad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 3): src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1333-1368 | src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1417-1452 | src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1503-1538 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1333\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6088b69cb05181abcd3e9f715cb4cc904622f0ddcaf1ac81b2c0f566c3856b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php:107-142 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterVarReturnTypeProvider.php:86-120 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php\u0060 and \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterVarReturnTypeProvider.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php:107\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20966eb601949899c8bf20dff7095f5fa8b1a5ee00f72de63ffeaf82b631b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:1641-1675 | src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:2235-2269 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:1641\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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"97057ba942a43420c3132382059a4a4c272e1137806a0c7b204d813dce34fb58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:483-517 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:706-740 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:483\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bab54f539ea0dc8182431fa478353f44edb196ad282807e71cb0a5e36e6a9f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:202-236 | src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:246-280 \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 \u0060src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:202\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba34df4b5c546235e0866092891e85a3209dd1a644775447db9de5d5d3c230d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:807-839 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:887-919 \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 \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:807\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"1402d94c4eff13ffe9943573ba4314141bc9cf189efb74dca176db1f6f2b6966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): src/Psalm/Internal/Algebra/FormulaGenerator.php:73-103 | src/Psalm/Internal/Algebra/FormulaGenerator.php:128-159 \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 \u0060src/Psalm/Internal/Algebra/FormulaGenerator.php:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdcb6e651145ec010a65dcec349c146645e504c487eacc9440d4faee82662c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:2095-2126 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:807-838 \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 before the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:805\u0060 calls \u0060setType\u0060, \u0060Union\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:2093\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b9af2cfada76ab8ce28c72200c374a1a33f9087d47f60917a01201540ae582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2485-2516 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2697-2728 \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 \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2485\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2485}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c159fc88fe66208e8641e32c5db65fa92b6694dc41b1c5e8349b7b2e5f3d40c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 4): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:740-770 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:820-850 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:900-930 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1852-1882 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:740\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9734a24276f72f190b4f3a9602e81ab5fd6fcef384b8e594ef431ab8a12ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2938-2968 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3694-3724 \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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70549e5b15cd56d3ae19f6d9713ed8f4f1138a7ac4383ab8c9167a9ab4af9d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/Psalm/Internal/PhpTraverser/CustomTraverser.php:42-72 | src/Psalm/Internal/PhpTraverser/CustomTraverser.php:104-134 \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 \u0060src/Psalm/Internal/PhpTraverser/CustomTraverser.php:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpTraverser/CustomTraverser.php"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c803da28a35a144db770d0fe8acef88b25f2d87f4edea1ef619ec8c0520185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:91-120 | src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php:161-189 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php:159\u0060 calls \u0060spl_object_id\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:89\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4b6a9667a68b4c97b5ff6a76c9e7ec09da64ed9533544c3cdd1871014bd1a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2254-2283 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1928-1957 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php\u0060 and \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 139 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2254\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f177ff864c34e51856e46276e22962393d30311dd936425c4beecef114300222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1280-1309 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1673-1702 \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 \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1280\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b0338021484f155f237f6e053216ddd6c60959dbda20f3620c2e45e1298e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2814-2842 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2883-2911 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3633-3661 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2814\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2814}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1be482a9d211ab421b094336f12cd5ce2e6821a6ea8eaedacf47444ad58106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:172-200 | src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:206-234 | src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:250-278 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:172\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4377c5b6f295fc3e8d95a8071f63e59078e76975346bf6c1a8adf0fc36358d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:553-581 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:760-788 \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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d65110107f6c7f798a6c2c0e837dac0bbb2ff0f67cb5ed1a676174833c3d34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1684-1712 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1784-1812 \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 \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1684\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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b39a80e7e7d3528d8a26503b8d09a5ad8b1588c1c48214969c5ba0634d71051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 5): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1193-1220 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1292-1319 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1386-1413 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1486-1513 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1581-1608 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1193\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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"310d37a5b73e354f54fc068504eb7edf3e8501778ba4811966e8a796b3d885d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php:167-194 | src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:375-402 \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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fb50d9ca795af3b8e5f98d03e38250eb6e803d1e90fec9e3f506b765d1067d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php:521-548 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php:557-584 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php:521\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68cfe48199e76d6bf35ae88bab16a07460245d6cc3ac260b4c542ea8de47eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:1596-1623 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:1661-1687 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:1596\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d0555a1703ee5595c690ca2c0f14b412f22b5323c922f32fa2180a09767ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:267-293 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:295-321 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:295\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"23563e7fe08de2db54f4cadec0497e59deffc2d92aab389f13042a55e6c7d3fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/Psalm/Internal/Type/AssertionReconciler.php:1808-1834 | src/Psalm/Internal/Type/AssertionReconciler.php:1997-2023 \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 \u0060src/Psalm/Internal/Type/AssertionReconciler.php:1808\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"2233a29ee17fb209ab44be3cc4a300bbddedfad3e0f3319b7416eaf360b7fd35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 4): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1110-1135 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1283-1308 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1528-1553 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1631-1656 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1110\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1107\u0060 calls \u0060elseif\u0060 and \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1281\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1bd1d2880b85b78c5b65fafd331df7278e7a83fac4c3e73c413b29b1912f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:106-131 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:133-158 \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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccaf5bddb76bc8a697d7121b0e865a3d04a7d53f382e7a0abead32948712896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php:505-530 | src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php:696-721 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php:505\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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"1196e3d18a89532159432948f8c7be6c7b6474971d73efb8e23f2beec52cfb3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/Psalm/Internal/Cli/Psalter.php:229-254 | src/Psalm/Internal/Cli/Refactor.php:175-200 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Cli/Psalter.php\u0060 and \u0060src/Psalm/Internal/Cli/Refactor.php\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Cli/Psalter.php:229\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":"src/Psalm/Internal/Cli/Psalter.php"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d058d2a49c559b583168e7e7ae855cb63f7a549eb2f9db12aee8705d25b1b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/Psalm/Type/Atomic/TClosure.php:139-164 | src/Psalm/Type/Atomic/TGenericObject.php:181-206 \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 \u0060src/Psalm/Type/Atomic/TClosure.php:139\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TClosure.php"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3db445aa93377737750ad40683c13462a961b4fdcd0025f001aa90cbc74db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 7): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1369-1393 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1454-1478 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1752-1776 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1808-1832 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1878-1902 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1959-1983 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2374-2398 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1369\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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dbabb30a6641b140e8c44ccbb0e67d2db1a5640779bf17cc6633449b160608"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php:715-739 | src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php:748-772 \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 \u0060src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php:715\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":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"3238726835bb9976eda13ff696e7b2aa4ab1435f55e0f3647c270226d274a789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:165-188 | src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:306-330 \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":"src/Psalm/Internal/Scanner/PhpStormMetaScanner.php"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcba30a640b19a10b9ec39490432e660fc7990ac3d7665963b9d8e8e92ca924"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 5): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:1516-1539 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:1604-1627 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:1638-1661 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:1676-1699 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:1714-1737 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db6ba84003c91f8d0ef5c8a6eed05e4d1b8510675141a4688aec6c5477119ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4): src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php:156-179 | src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:175-198 | src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:209-232 | src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:253-276 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php:156\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":"src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6261d5178948d2e8dfd7c5ed599ce621fcfc75b4a51b564c6aa825798517d305"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:201-224 | src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php:211-231 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d3355dda9cc6b398b3408a976079da6b0db00670601fc9093a519315409f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:523-546 | src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:571-593 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:523\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:547\u0060 calls \u0060getRemovedTaints\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:594\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"05915775d9569b3866f78975ed5176a45efbdbbc0cf68acf43f988b457a6ff90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php:293-314 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php:665-688 \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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f3519fe3f1a1eccb06a1d1fa7e08a67e8ee6866afbec797b313c4791fafc79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/ExitAnalyzer.php:65-88 | src/Psalm/Internal/Analyzer/Statements/Expression/PrintAnalyzer.php:35-57 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ExitAnalyzer.php:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ExitAnalyzer.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e5b7197c890b54bd5d69bbf039fa94ca68b6b4ecba4766be7d7ef86d9dd1df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/Psalm/Internal/Diff/AstDiffer.php:108-130 | src/Psalm/Internal/Diff/FileDiffer.php:95-118 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Diff/AstDiffer.php\u0060 and \u0060src/Psalm/Internal/Diff/FileDiffer.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Diff/AstDiffer.php:108\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/AstDiffer.php"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"422100ebd4d63bb4fd166ef7a7158daf84425a5bdb5ef96f7edc31923fd276ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/Psalm/Internal/LanguageServer/Server/TextDocument.php:166-189 | src/Psalm/Internal/LanguageServer/Server/TextDocument.php:217-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/LanguageServer/Server/TextDocument.php:166\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/LanguageServer/Server/TextDocument.php"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c96787b95acf384eeb9ca5fec2caf18e1297b61d5846d662980649ceb0ee7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php:228-251 | src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php:343-365 \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 \u0060src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php:228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"732a40bf4e00328f340d7290ecf10d2521b9ea4c4735a56dcc63ed38b3e2fb1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:332-355 | src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:362-385 \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 \u0060src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:332\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Scanner/PhpStormMetaScanner.php"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"832dff572440c8b6177dbd0af39b0ba4debdde243e2f5f7f65d6a0779f374bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2780-2803 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2841-2864 \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 \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2780\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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2780}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab2db8b6faab40dcd947d5f963e008071a9cc2cd006e2aab792af35c0e83660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2582-2604 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3345-3367 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2582\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"93270a140f630ce2c91b930834a996c57eeb4a7f34a0dfd98630eadf0c4341ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/Psalm/Internal/Codebase/ClassLikes.php:2295-2317 | src/Psalm/Internal/Codebase/ClassLikes.php:2631-2653 \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 \u0060src/Psalm/Internal/Codebase/ClassLikes.php:2295\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d8d89943861854a978ee4377d6765b421cd03e382ffd640d6db8ecfad1212a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/Psalm/Internal/Codebase/ClassLikes.php:2450-2472 | src/Psalm/Internal/Codebase/ClassLikes.php:2496-2518 \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 \u0060src/Psalm/Internal/Codebase/ClassLikes.php:2450\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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a62f3f36e48d63485ea8804b8b6673abf3e396b058e3050450307e3034efca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2483-2504 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2614-2635 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3247-3268 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3377-3398 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2483\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"f698a55878d76825799eb66b3b13834e7885d4bb9b3803e9bf21b82e02457567"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/Psalm/Config/FileFilter.php:152-173 | src/Psalm/Config/FileFilter.php:269-290 \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 \u0060src/Psalm/Config/FileFilter.php:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config/FileFilter.php"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d7e35b41548973039840e453050c244589dc37a44bef8b77a1c175a43006ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/Psalm/Internal/Analyzer/CommentAnalyzer.php:646-667 | src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php:226-247 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/CommentAnalyzer.php:646\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":"src/Psalm/Internal/Analyzer/CommentAnalyzer.php"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db93331cac4bd03120e16adad08d673a1d2a67b2f5c3baf1fd1aaf26c8fbeeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php:2182-2203 | src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php:2216-2237 \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 \u0060src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php:2182\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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9220713048aac0ec710321bb2cfef5199940d6529c15f21b2c1446286ff45b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:1884-1905 | src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php:1208-1229 \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 before the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php:1207\u0060 calls \u0060isset\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:1883\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b1ea18795eab736bc8d86f3793cf41ea6a7a2d39b2af4e50ef5565d454c81d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php:287-307 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php:766-787 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php:766\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php:284\u0060 calls \u0060getInstance\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php:763\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb482e07a089f2d8305e171bc4e2d9fbc655bb550007c4e0c5b8d14ae95d9e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php:444-463 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php:478-499 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php:444\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28754f4c9596463453b2bd11e5814003e5aa45e46166a3789fb64c60f40d6c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php:204-225 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php:80-101 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php:204\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e664124de280d1703b5ab6db41675151dded348962c48f7da8c3b23b4328efd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:307-328 | src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:662-683 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:307\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:330\u0060 calls \u0060getFirst\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:684\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fddac9cab3151b7a252218c2adb91840e6fe41657b40d77f067c5c8d018a79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/Psalm/Internal/Codebase/StorageByPatternResolver.php:35-56 | src/Psalm/Internal/Codebase/StorageByPatternResolver.php:68-88 \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 \u0060src/Psalm/Internal/Codebase/StorageByPatternResolver.php:35\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/StorageByPatternResolver.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0454deca1bc190905b6403b15d8fe289e30a2565718bb21230374f9b648a2a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1233-1254 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1358-1379 \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 \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1233\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f585b005cb74f56a715d88199c5ad6f6de4a23f6f7071ef9eeb53db4cf9079c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/Psalm/Internal/Type/AssertionReconciler.php:1955-1976 | src/Psalm/Internal/Type/AssertionReconciler.php:2099-2120 \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 \u0060src/Psalm/Internal/Type/AssertionReconciler.php:1955\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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5453f099bbc4a967ea38117ac18ff3b8d94eedda6fd072baadf05c54276850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1807-1828 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2981-3002 \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 \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1807\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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"9268919a1d1b07050ce19c12e3ef6d3d70ef3ab6eb7f02bfff37e5296aed82fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 12): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1022-1042 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1117-1137 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1290-1310 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1375-1395 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1460-1480 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1535-1555 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1638-1658 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1758-1778 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1814-1834 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1884-1904 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1965-1985 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2380-2400 \u2014 all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1022\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7b1a393e67e49a101bf1339f7774e614843ee960992ce91071ba3f46ba2e48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 8): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1369-1389 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1454-1474 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1752-1772 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1808-1828 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1878-1898 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1959-1979 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2374-2394 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2982-3002 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1369\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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f3d9abb96b5764a4537b583fb72f08db5712b94eb9214993eb03ecb15f953d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2409-2429 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2531-2551 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2686-2706 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2409\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee0c67356419ed6dfc1a4e686e4ed930e30bb3564a5ae9c7d2ebfcb7e7f11d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:147-166 | src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:199-219 | src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:233-253 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:147\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Scanner/PhpStormMetaScanner.php"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a9cad17ef1913910ccb1cbd222f94175c836fb4b0b70df9ad26798dabca027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): src/Psalm/Report/ByIssueLevelAndTypeReport.php:121-141 | src/Psalm/Report/ConsoleReport.php:93-113 | src/Psalm/Report/PhpStormReport.php:88-108 \u2014 before extracting anything, compare \u0060src/Psalm/Report/ByIssueLevelAndTypeReport.php\u0060 and \u0060src/Psalm/Report/ConsoleReport.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Report/ByIssueLevelAndTypeReport.php:121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Report/ByIssueLevelAndTypeReport.php"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c541b2ce1b837f5d8af6450697ebd3805bfe92830df264bbc5f830055b3509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:4439-4459 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:4713-4733 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:4439\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4439}}}],"partialFingerprints":{"codehealthFindingId/v1":"5936f5c59ee019ab2657e648b1f555a93c81e434b6220909cbd0f9415ce378e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php:620-640 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php:594-613 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php:620\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa36e8a19fff09f14978516fb25227176cf35b8e2f0ad3788be5fd2b618d6a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/Psalm/Internal/Provider/ClassLikeStorageCacheProvider.php:31-51 | src/Psalm/Internal/Provider/FileStorageCacheProvider.php:32-52 \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 \u0060src/Psalm/Internal/Provider/ClassLikeStorageCacheProvider.php:31\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ClassLikeStorageCacheProvider.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06d50a6f2e6c544babb29372a96208dbce365b4cd3fa762794f26f0fe503a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 5): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:556-575 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:745-764 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:825-844 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:905-924 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1857-1876 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:556\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:743\u0060 calls \u0060unset\u0060 and \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:554\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"01484f07da45a3fa42b45b30ad4aef1d5095cc76b9917e0e772250d5be3d3096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2381-2412 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2420-2439 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2442-2461 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2381\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1027846e98f9d53a3b4bf85dedc6c02d45e12debf9417b51669ed7b6c18ca02a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/Psalm/Internal/Codebase/ClassLikes.php:1375-1394 | src/Psalm/Internal/Codebase/ClassLikes.php:1560-1579 | src/Psalm/Internal/Codebase/ClassLikes.php:1636-1655 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Codebase/ClassLikes.php:1375\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbdfa50a17151de4ef31460b4cd138a2326388560b85beec0381c617884521e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1241-1260 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1366-1385 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1446-1465 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1241\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e38b93eb12b391ff2e0116c15cbc389439523f690d7afbcd7ffe1faa05c339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:793-812 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:912-931 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:676-695 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php\u0060 and \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 139 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:793\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"39474f20a1cec4b445f25cd49f6fc9f3a3da57db1aae7926ca623720204ce88b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1365-1384 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1450-1469 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2482-2501 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1365\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8d83563b504c56a8f423da92430ac44cf534cd9e9feea888d7160c17f0dfe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Psalm/Internal/Analyzer/ClassAnalyzer.php:2008-2027 | src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php:1144-1163 \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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f9884ad8428f8822d52d55aeeee0282cebeba7d7289f1da575468f26035798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1733-1752 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:570-589 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1733\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"1238ab4f88a174485e6ec4a305a935e377027e40900380eac624d96756beca95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php:734-753 | src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:534-553 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php:734\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e75da517b33b564e29223c2348b174833b66fe1c43ef12db3a6fac3390a194a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Psalm/Internal/Cli/LanguageServer.php:149-168 | src/Psalm/Internal/Cli/Refactor.php:90-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Cli/LanguageServer.php:149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df1823948ecfcc86800379bba53b1f8096652462d2b7d540378e5dca2a06f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Psalm/Internal/Codebase/TaintFlowGraph.php:977-996 | src/Psalm/Internal/Codebase/TaintFlowGraph.php:1011-1030 \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 \u0060src/Psalm/Internal/Codebase/TaintFlowGraph.php:977\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd825a18cc6655675aaea9a5fbb806c3c6b234b3c26a4622d0bf80fa4c30647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php:196-215 | src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php:1373-1392 \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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41a455151527a8efe3f0c8d2fc50e481b8dd9f7fd9b548861a8d81f886ded8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Psalm/Internal/PluginManager/Command/DisableCommand.php:54-73 | src/Psalm/Internal/PluginManager/Command/EnableCommand.php:54-73 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/PluginManager/Command/DisableCommand.php\u0060 and \u0060src/Psalm/Internal/PluginManager/Command/EnableCommand.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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":"src/Psalm/Internal/PluginManager/Command/DisableCommand.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb59ccea2f031761fd4228b7c03a2809de317669ce433bb84c58af1540046d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Psalm/Report/ByIssueLevelAndTypeReport.php:151-170 | src/Psalm/Report/ConsoleReport.php:121-140 \u2014 before extracting anything, compare \u0060src/Psalm/Report/ByIssueLevelAndTypeReport.php\u0060 and \u0060src/Psalm/Report/ConsoleReport.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 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":"src/Psalm/Report/ByIssueLevelAndTypeReport.php"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa02ac3a4428914ea30c52ddb5c0e4de6a557e0fa1e4d58c943bb9c185285ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Psalm/Type/Atomic/TKeyedArray.php:627-646 | src/Psalm/Type/Atomic/TObjectWithProperties.php:255-274 \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 \u0060src/Psalm/Type/Atomic/TKeyedArray.php:627\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"1136708fcea299969043cd029d7cfb32efa1dfab7de9fc907a3f54a2e25d7238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Psalm/Type/MutableUnion.php:211-230 | src/Psalm/Type/UnionTrait.php:100-119 \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":"src/Psalm/Type/MutableUnion.php"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"399a43af921352fc62cc009a827f03bffa812d63296d0dada8f472cb68b6255b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/Psalm/Internal/Codebase/ClassLikes.php:2307-2325 | src/Psalm/Internal/Codebase/ClassLikes.php:2574-2592 | src/Psalm/Internal/Codebase/ClassLikes.php:2643-2661 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f9c6046ad44e3d5761634eb22a8fe7db357a9ed09d3da7dfa4d6b28028f469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php:1666-1684 | src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php:1725-1743 | src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php:1787-1805 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php:1666\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08aaa767de1687b8f6a1d669906b127f4abd0dbfe90429c4b4c7995634d4e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1347-1365 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1440-1458 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1635-1653 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1347\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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a61d57a666169600f539ce48ab7d90ebd96ca30dfadd4b2e8884f91e7fc272"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/Psalm/Report/ByIssueLevelAndTypeReport.php:76-94 | src/Psalm/Report/ConsoleReport.php:50-68 | src/Psalm/Report/PhpStormReport.php:50-68 \u2014 before extracting anything, compare \u0060src/Psalm/Report/ByIssueLevelAndTypeReport.php\u0060 and \u0060src/Psalm/Report/ConsoleReport.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Report/ByIssueLevelAndTypeReport.php:76\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":"src/Psalm/Report/ByIssueLevelAndTypeReport.php"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"543b57a70b4e9a111271308023e07bba9a444d1ce6d006c10c96cb6afdc1443f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Psalm/Internal/Algebra/FormulaGenerator.php:277-295 | src/Psalm/Internal/Algebra/FormulaGenerator.php:580-598 \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 \u0060src/Psalm/Internal/Algebra/FormulaGenerator.php:277\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92aa81f1635ff941fc94ddf94e723fdf4553293236b472ffea6555ca256890b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:329-347 | src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php:132-150 \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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f014ae7044e0c6809cf2c3bf9df802a0d31a1051289c60ab2495da7f4934d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php:273-291 | src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php:176-194 \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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e27d6b2a6fe096d0e7e7e1c32d4f7fbd9e503c7468850327f0f4f923a8c9087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:184-202 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2789-2807 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:184\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ad0d2d9dcffc12f86100e7224029b23e3f6455bf1039ae00e5b10d7b128b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3853-3871 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3875-3890 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3853\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3853}}}],"partialFingerprints":{"codehealthFindingId/v1":"676a6811708fad566c9d44369d845ff36e42946f03371b06bf17a38c3d4116a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:154-172 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:180-198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:154\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d272f55824c37fb12c2767dd14f642b5f3785885cb543205113622bc464d4bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:1733-1751 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:1380-1398 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:1733\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdc15f87e1a6788006698cc83abebf0be04c2df4fea4f3fdb4aad63874cf067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php:199-217 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php:365-383 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php:199\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d398c58c762cd23781e970b8ed5b139132d3b4f10a3ba4a90876bb0025761a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/Psalm/Internal/Codebase/ClassLikes.php:2937-2954 | src/Psalm/Internal/Codebase/ClassLikes.php:2969-2987 \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 \u0060src/Psalm/Internal/Codebase/ClassLikes.php:2937\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d5efa62788072e2e3b1e14a2b3d35d02273b0b38d44e8c21b82a516375d9ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Psalm/Internal/Diff/FileStatementsDiffer.php:125-143 | src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php:106-124 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php\u0060 and \u0060src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php:125\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/FileStatementsDiffer.php"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cbdb9e82f9f13f72f7062e0dfb2f21d75e1655b8ea5749f632f78a793302e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Psalm/Internal/Diff/FileStatementsDiffer.php:158-176 | src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php:126-144 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php\u0060 and \u0060src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/FileStatementsDiffer.php"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ada295fe7904a2852a9b33659f05701e42080d8945be90b23f7e31ddfb07e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php:87-105 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterVarReturnTypeProvider.php:66-84 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php\u0060 and \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterVarReturnTypeProvider.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php:106\u0060 calls \u0060getContext\u0060 and \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterVarReturnTypeProvider.php:85\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"34898e39de810b3f67457844fac0603e49c64bc39dc563d844cde41f0a1deb68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1247-1265 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1739-1757 \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 \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1247\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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9812b46d28b69ea04b035959a4f2db1c65a9c4b44efb86784cf94dab7e8ea980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2809-2826 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2878-2895 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3566-3583 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3628-3645 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2809}}}],"partialFingerprints":{"codehealthFindingId/v1":"13729d3660f063786bc57bec702f81d08aa9d046a9d3d64655e6994b3a5f2e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:269-286 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:296-313 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:962-979 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:1396-1413 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:269\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:266\u0060 calls \u0060hasMixed\u0060, \u0060CodeLocation\u0060, \u0060getSource\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:960\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccaac9b0fbea13fe19c2e02cebe59871cb555e8c6c04ee9706acddfdc8db76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:1395-1412 | src/Psalm/Internal/Analyzer/Statements/Expression/EvalAnalyzer.php:58-75 | src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php:138-155 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/EvalAnalyzer.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:1395\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/EvalAnalyzer.php:54\u0060 calls \u0060getCodebase\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:1390\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9f2fc6dbdca113269de913cf007eed4d1272f2a435a9a7c7ed7f59aa93549a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Psalm/Internal/Analyzer/ClassAnalyzer.php:1005-1022 | src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php:214-231 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/ClassAnalyzer.php:1005\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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1aa73e0707a6f4ee9b8d5a9214bac598317db32663236edc3560e927b29239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php:121-138 | src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php:119-136 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d8fae86a8ab71dea04585775536bc813ca97ba6f9ba994beff757a345949c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:240-257 | src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php:113-130 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:240\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b946630a95aa20f8e25713eeb58ff1970eb9166dae2a239f6233349f24e54b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:445-461 | src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php:692-709 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:445\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78ac6f3f816a9f8e0f19e6c43d5446274d1e088d9d2bdaf5e6e5b5bd21348b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1142-1159 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1232-1249 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1142\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96e6f36ce4d069e7f5a23340c4b21cced739adaae7c718d0ca6ea127023b85d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:1209-1227 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php:356-373 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:1209\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b316d933c877aea139b96ddce0f9cafe0a0dc814d2d80bdff9a09999b16af78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php:344-360 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php:483-500 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php:344\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fd19a04d509fefe291e48af703ea5cd89c4d5d3fffc71fe1cd574a28de4985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): src/Psalm/Internal/Cli/Psalm.php:607-622 | src/Psalm/Internal/Cli/Psalm.php:916-933 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4b24fe7dd456e0ab6eca96a753ddb6f49043b5b9cfd4fe34833b3a8265bdd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Psalm/Internal/LanguageServer/Client/Progress/Progress.php:69-86 | src/Psalm/Internal/LanguageServer/Client/Progress/Progress.php:96-113 \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":"src/Psalm/Internal/LanguageServer/Client/Progress/Progress.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"322696f3be5cdaee3907a662c105045e0497200f4089b10c285baab9995d0204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Psalm/Internal/LanguageServer/LanguageServer.php:785-802 | src/Psalm/IssueBuffer.php:807-824 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/LanguageServer/LanguageServer.php:785\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":"src/Psalm/Internal/LanguageServer/LanguageServer.php"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4de2209070814cef5d81054ecb9f09bcaad7955a0a8b392042e4b60486e04a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): src/Psalm/Internal/Provider/ParamsProvider/ArrayMultisortParamsProvider.php:80-95 | src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayUniqueReturnTypeProvider.php:82-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayUniqueReturnTypeProvider.php:82\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ParamsProvider/ArrayMultisortParamsProvider.php"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56b747cfb75c03592984dd8b5e9472865b7ed8ab0f558296fe1b24801c3e29d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:272-288 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:294-310 | src/Psalm/Internal/Analyzer/Statements/Expression/BitwiseNotAnalyzer.php:90-106 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03851884ab4f93df8ec95d467c7b0e6fefecfc013f04c6194e17c0ac7f461aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:875-891 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:1044-1060 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:1071-1086 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:875\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"578185f4c822490398318d831e4976e6d713377221e8a8c51fa53dca56b7e372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/Psalm/Internal/Cli/LanguageServer.php:264-280 | src/Psalm/Internal/Cli/Psalter.php:226-242 | src/Psalm/Internal/Cli/Refactor.php:172-188 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/Cli/Psalter.php:245\u0060 calls \u0060captureServer\u0060 and \u0060src/Psalm/Internal/Cli/LanguageServer.php:282\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb35c0c7697df3739cf29ec8071f025a6a693f83afc77de686bb3df484c63411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1372-1388 | src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1458-1474 | src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1544-1560 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1372\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be6984a4f45cb4292ec2206f39fd1e070fb594cb3b717a838d8c2c7e6fc2cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Psalm/Internal/Algebra/FormulaGenerator.php:357-373 | src/Psalm/Internal/Algebra/FormulaGenerator.php:436-452 \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 \u0060src/Psalm/Internal/Algebra/FormulaGenerator.php:357\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebb6f6f6096e9ebb2f5e1529aef1d8595091715d67a65b6e15c71fe99758a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Psalm/Internal/Algebra/FormulaGenerator.php:375-391 | src/Psalm/Internal/Algebra/FormulaGenerator.php:454-470 \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 \u0060src/Psalm/Internal/Algebra/FormulaGenerator.php:375\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb9ac924cae8d587c3b65de6e5456456a9e9ceba97c289445b1e985b72b0091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Psalm/Internal/Algebra/FormulaGenerator.php:365-381 | src/Psalm/Internal/Algebra/FormulaGenerator.php:401-417 \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 \u0060src/Psalm/Internal/Algebra/FormulaGenerator.php:365\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"12673ea673f606372fec203ff7afc96f72ffb59901c4892cb0ba722bc6ba3802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Psalm/Internal/Algebra/FormulaGenerator.php:393-409 | src/Psalm/Internal/Algebra/FormulaGenerator.php:472-488 \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 \u0060src/Psalm/Internal/Algebra/FormulaGenerator.php:393\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ae94ddaa739314f7d3d00ff5efd11a1d0872e1aee377a259f113c05c8c3366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Psalm/Internal/Algebra/FormulaGenerator.php:444-460 | src/Psalm/Internal/Algebra/FormulaGenerator.php:480-496 \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 \u0060src/Psalm/Internal/Algebra/FormulaGenerator.php:444\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c8932254b89207b56e823886c9de3cbf3d5bf3c761f182bce2ec1700459c61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:230-246 | src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php:245-259 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php:243\u0060 calls \u0060removeClausesOfVarsChangedSince\u0060, \u0060simplifyCNF\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:230\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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"135eb545b73203aaa23bb31bb18846a161eadf1d36949577a4e80afbdc919910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1195-1211 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1278-1294 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1195\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4278faa4a2a12677391332da7d4e856a42e9ebdcc74958d9620e3cec62fd2c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:2539-2555 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php:951-967 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:2539\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e8d67ba2a115843a14d2bf4fd9635a04287e29493236c3951fad3f293e08a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Psalm/Internal/Codebase/DataFlowGraph.php:60-76 | src/Psalm/Internal/Codebase/VariableUseGraph.php:68-84 \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":"src/Psalm/Internal/Codebase/DataFlowGraph.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a6d7641ea43c3b42c8737d21745441b55ba3efa8531533f0c9b7ad8afe1655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): src/Psalm/Internal/ExecutionEnvironment/BuildInfoCollector.php:91-104 | src/Psalm/Internal/ExecutionEnvironment/BuildInfoCollector.php:172-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/ExecutionEnvironment/BuildInfoCollector.php"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"80728aa0f3ff30fb560fb014c24b292baca6bf32941805a97c0bf9ae181f486d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1680-1696 | src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:2021-2036 \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 \u0060src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1680\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a4edc4bf429e6767c5e9414b7d3cfb9b5bc99415530be2d6bd998e76039ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:909-925 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1107-1123 \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 \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:909\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b541c16f22995347674c58210d4b4afc5b3c6a8714449a6b096c7cdc77ffa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php:736-752 | src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php:756-770 \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 \u0060src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php:736\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"1936fab71b9d9f82d71515e94340c348ddf49da7d583b5b902579a11fc70f82a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php:154-169 | src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php:314-330 \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 \u0060src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php:154\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a9a7249151c7ab9d20cd1a3f8b5e81d779b8dd7cfd02761d5bab9f81057361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/Psalm/Internal/Type/TypeParser.php:818-834 | src/Psalm/Internal/Type/TypeParser.php:2342-2357 \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 \u0060src/Psalm/Internal/Type/TypeParser.php:818\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba03d53dca289ab8fb17a90ad2d96bff29de533c794156c2ca73d65a33bb65bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): src/Psalm/Internal/Analyzer/MethodComparator.php:1069-1083 | src/Psalm/Internal/Analyzer/MethodComparator.php:1087-1102 | src/Psalm/Internal/Analyzer/MethodComparator.php:1106-1119 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/MethodComparator.php:1069\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"db85dc82c0214a71df3b6c6367402b0b89ade537cae97198c5b124a9934eefd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/Psalm/Internal/Analyzer/ProjectAnalyzer.php:930-945 | src/Psalm/Internal/Analyzer/ProjectAnalyzer.php:1036-1051 | src/Psalm/Internal/Analyzer/ProjectAnalyzer.php:1102-1117 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/ProjectAnalyzer.php:924\u0060 calls \u0060visitPreloadedStubFiles\u0060, \u0060checkDirWithConfig\u0060, \u0060initializePlugins\u0060 and \u0060src/Psalm/Internal/Analyzer/ProjectAnalyzer.php:1100\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ProjectAnalyzer.php"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"445b3c70d2abfecc99a2f741b0c09f604ec87ccd24aef520aea44a79192ff03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2579-2594 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3212-3227 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3342-3357 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2579\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2579}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e41293f45700b8cfcd9a023eab59a934db9e3b6c555b3c5438d082be6528e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php:222-237 | src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php:1753-1767 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:910-924 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php:222\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f860ec8a1b4a6be83c9e8860b16015946fa1f5723522ebe461a5846cfdf3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:756-771 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:1578-1593 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:1679-1693 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:756\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fe2d7d0589a47ebff6ceec333ee0ad3cdc1a2882c176b2d41b238961ce556d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/Psalm/Internal/Provider/ParamsProvider/ArrayMultisortParamsProvider.php:80-95 | src/Psalm/Internal/Provider/ParamsProvider/PregReplaceCallbackParamsProvider.php:128-143 | src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayUniqueReturnTypeProvider.php:82-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ParamsProvider/ArrayMultisortParamsProvider.php"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"da131ab05218c342851e5b20dfb67de5102fa2a53126a50ff8d6b4a0df2e3214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:232-247 | src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:1161-1176 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:232\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f083252049bf27abe52a87cc62718c4a530d75614cdcdb207d18a8e18631c06c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:306-321 | src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php:205-217 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:306\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a395f67e8a64888c812878ff2384c6756324d6559110e4e3281d7b73f4aa0206"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:4436-4451 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:4685-4700 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:4436\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4436}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6887a7a7c3893905c92ddb36356e8228f0862187630736b8907835750a4c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1049-1064 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php:170-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1049\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e3a134470a01252993ca224b87e98763e8903bf3f3e3048a0d6a8bc34d776c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:1397-1412 | src/Psalm/Internal/Analyzer/StatementsAnalyzer.php:739-754 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:1397\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbf7d8f10ca1e070d021a4d19bd690f13bb8764f05e8d9f0d3cb008eefeb7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:3108-3123 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php:571-586 \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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":3108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c23053f5892da55518e7c2a9b4ef0c35e112b80a874127dd4571aca4e2b3318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/BooleanNotAnalyzer.php:41-56 | src/Psalm/Internal/Analyzer/Statements/Expression/EmptyAnalyzer.php:63-78 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/BooleanNotAnalyzer.php:41\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BooleanNotAnalyzer.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d0aa5f8066324710d1e82892c64001d990c5f88eb8775e9483a8e5764dbed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php:450-465 | src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php:641-656 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php:450\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"e159d2abe8b9cd566f0bd01d44508acb32fbaced566a0f327a09dd9a2e4b0194"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:243-258 | src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:628-643 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:243\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:240\u0060 calls \u0060getUnAliasedName\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:625\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e007706cd75bdd29c80d77b41a764fda88892e8ceab7869380d90aecf70c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:1337-1352 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php:329-344 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:1337\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"395a296882e9c66b0e0aebadd5331cefaf3513ef94595527a9259afcfe1f82fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:602-617 | src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:652-667 \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 \u0060src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:602\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:619\u0060 calls \u0060fromType\u0060 and \u0060src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:669\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1ca3e3c4a5194aa7832c130ae2e9d5b3458dd88413f5a021e0fc0624c9fa4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/PowReturnTypeProvider.php:46-61 | src/Psalm/Internal/Provider/ReturnTypeProvider/PowReturnTypeProvider.php:63-78 \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":"src/Psalm/Internal/Provider/ReturnTypeProvider/PowReturnTypeProvider.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedd10f67395a4ec37e1b5ab649a4c0ebe03621f2361ab609acac06b30cb3ecd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:251-266 | src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:385-400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Scanner/PhpStormMetaScanner.php"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3738d8443fad6ef6fe24b0283d0702a0f46e76fffae4ecf58841b9e9e32beea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2356-2370 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2457-2471 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2733-2747 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3121-3135 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3495-3509 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0772aa4c0da1560fdd6107d907d0c33971ff142a9dd4b6786fc9749e8a35d48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php:164-178 | src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:118-132 | src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:183-197 | src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:217-231 | src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php:261-275 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4bba2d6b7a24f131e5a11cb9d62f01c618a0d2936e253a8970d32859e0b77f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Psalm/Internal/Analyzer/ClassAnalyzer.php:473-487 | src/Psalm/Internal/Analyzer/ClassAnalyzer.php:1754-1768 \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 \u0060src/Psalm/Internal/Analyzer/ClassAnalyzer.php:473\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/Analyzer/ClassAnalyzer.php:488\u0060 calls \u0060getAliases\u0060 and \u0060src/Psalm/Internal/Analyzer/ClassAnalyzer.php:1769\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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8b0e1b319b94aedd7b7c00bf24701e1d47f4f92a3e3dffcdbdc11226db3639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/Psalm/Internal/Analyzer/MethodComparator.php:763-776 | src/Psalm/Internal/Analyzer/MethodComparator.php:780-794 \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 \u0060src/Psalm/Internal/Analyzer/MethodComparator.php:763\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"be43549c1b06fceda5a8991b812adf4e0bb27a93056b33e5c1f51d709e2e7370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php:190-204 | src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php:526-544 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php:190\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d82704768f2735b578aa09fc79546d12d1afd4e5e9e992a77a614c5c47340a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:4407-4421 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:4710-4724 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:4407\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4407}}}],"partialFingerprints":{"codehealthFindingId/v1":"87826cf6e5305530767d896f99b0e0875c85081a78f6850391e89b0c891cca83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:307-321 | src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/StaticPropertyAssignmentAnalyzer.php:282-293 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:307\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e400b33575d387218d77e6c0835df693c0e760efdf8f78fd54268445fb9bc5b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:776-790 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:1089-1105 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:1089\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"675436e08a3eebece146e6b60d985a6601a6f039e346a5e9c79bd3750a791ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Psalm/Internal/Codebase/Populator.php:1537-1551 | src/Psalm/Internal/Codebase/Populator.php:1597-1611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"92696278ba2fe53382446c7273503e62bf6cd7af5c228549a47a1b6197ef5e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Psalm/Internal/Codebase/Properties.php:123-137 | src/Psalm/Internal/Codebase/Properties.php:154-168 \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":"src/Psalm/Internal/Codebase/Properties.php"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"224a7718e804860ddcf849c733e5467c86a5fa87144b8189af295205193120b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Diff/AstDiffer.php:91-106 | src/Psalm/Internal/Diff/FileDiffer.php:79-94 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Diff/AstDiffer.php\u0060 and \u0060src/Psalm/Internal/Diff/FileDiffer.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Diff/AstDiffer.php:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/AstDiffer.php"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1239b064297725bb17b11eb3389f5d5fed8e8758e18d6f87842e939cd38424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php:681-695 | src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php:655-669 \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 \u0060src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php:681\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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d59f9a0ff94524a076edab1f584e961f56139337d631ed9fac967c23b81d19e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayCombineReturnTypeProvider.php:47-61 | src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayCombineReturnTypeProvider.php:63-77 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayCombineReturnTypeProvider.php"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2510b0b0c787b74b9ea1867fca5239d0ab4e7633d135cbc103202c58dfa7eb7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:883-897 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1081-1095 \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 \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:883\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"317ec566adc3f2abc21033917c00b5aeb65ebacee2677bbe9c88026182d81837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1898-1912 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:2021-2035 \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 \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1898\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1089a507e37d717103fd99eb0cf327d2fbdf1fbf99c6edd0ccfb0773e868a2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:574-586 | src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:419-432 | src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:759-772 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:574\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19b339c1d7840e027efc86c4e6129d95dd76a7757e5d47efd4a46f68846b3ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/Algebra/FormulaGenerator.php:708-721 | src/Psalm/Internal/Analyzer/Statements/Expression/NullsafeChainState.php:107-120 \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. 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":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e076460407fed2a91e45d492fb002f97303dd5a913e4e4319a7c0e57895b027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/Psalm/Internal/Analyzer/ClassAnalyzer.php:347-359 | src/Psalm/Internal/Analyzer/InterfaceAnalyzer.php:130-143 \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 \u0060src/Psalm/Internal/Analyzer/ClassAnalyzer.php:347\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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bdfa734d0d172f1881d7e53b1bafd7ec906d9aa9ae11f7cbb528691049e5f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php:1129-1140 | src/Psalm/Internal/TypeVisitor/TypeChecker.php:440-453 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php:1129\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f24dc63870b3a0b86f72e19d0452a7003f18edee90e0cb72a48e44856fbe9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php:261-274 | src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php:516-529 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php:261\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27a6a5670cf45f9a30023a6434c4924a8635d2965db0523e9ec6560b2cc5131"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php:166-179 | src/Psalm/Internal/Analyzer/Statements/ContinueAnalyzer.php:108-121 \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 \u0060src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php:166\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":"src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"034c2d4118f24848d02385f156b5b1601ac159d87f43db8069a930071d9c6ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2973-2986 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3727-3740 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2973\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2973}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a955c3b47b9fe585a9e4e24906d1e2516239fcc292315746301e5a6afe0c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:2124-2137 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php:643-653 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:2124\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ae7a7dfcd506b6ea6498d375ef9a049c70c04915b57e435e0b30c4f4f1000e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:2793-2806 | src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:3180-3193 \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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b07f32ba16f7f14d53adc12a49fc579cd5243aaa841726c7b60f34b8b8ccfa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php:1610-1623 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php:561-574 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php:1610\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbd7bd046aa18fbc3b3d33c017bcfc3fb6c9e413a124b6ba5a8de8d853dfd3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:280-293 | src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:647-660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f18fcd78c5af8325a11fedfab02d17c023e9fdb47f886c765f279743dcfd51e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/Cli/Psalm.php:1170-1183 | src/Psalm/Internal/Cli/Psalter.php:514-527 \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 \u0060src/Psalm/Internal/Cli/Psalm.php:1170\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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2ec943b941efb0b62d9d842d2d2b54fcdbc6ae59e17eeabf1386a129fb572a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/Codebase/ClassLikes.php:1062-1075 | src/Psalm/Internal/Codebase/ClassLikes.php:1097-1110 \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 \u0060src/Psalm/Internal/Codebase/ClassLikes.php:1062\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"1095f514b7756850fed570366588862f33a31f08209a5f7e336ea38806dd09fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php:365-378 | src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php:381-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4887dd96a6e6dffa7c0cdb4d75d7815a435a87759e1c9555f7f8f49da2a10d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1910-1923 | src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:2218-2231 \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 \u0060src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:1910\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebd3ae7355c8857b03b210cb59841d92152e3bebe7e3ec6182aa11d1ad84bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:825-838 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1022-1035 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"887e0a22cf90bdd2af89a59c4d7b124de29cc78967f905bd4b3b54f516499d6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Type/Atomic/TKeyedArray.php:679-692 | src/Psalm/Type/Atomic/TKeyedArray.php:719-732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c1894bdd7904f1d278231a0381e1475c9e63fa4b7fc632192ad66cc964bc12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Psalm/Type/UnionTrait.php:1129-1142 | src/Psalm/Type/UnionTrait.php:1160-1173 \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":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c828ed2b8b99bd8df9804842d03c7a3d49fdc7335ce6c11b1a358469c834c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php:166-178 | src/Psalm/Internal/Analyzer/Statements/ContinueAnalyzer.php:108-120 | src/Psalm/Internal/Analyzer/Statements/Expression/ThrowAnalyzer.php:80-92 | src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php:323-335 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15d6886de53fca2e7d4bfbbfef3fc81c7b46b8a82e0164a9488b6c83f08559b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): src/Psalm/Internal/Cli/LanguageServer.php:266-278 | src/Psalm/Internal/Cli/Psalm.php:1010-1022 | src/Psalm/Internal/Cli/Psalter.php:228-240 | src/Psalm/Internal/Cli/Refactor.php:174-186 \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 4 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/Cli/Psalter.php:245\u0060 calls \u0060captureServer\u0060 and \u0060src/Psalm/Internal/Cli/LanguageServer.php:282\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb3418ac9506e2e787f24b5560fc3e6d4d40e2196c3f1113e1ac4cd1ee7a082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): src/Psalm/Type/Atomic/TArray.php:87-99 | src/Psalm/Type/Atomic/TGenericObject.php:133-144 | src/Psalm/Type/Atomic/TIterable.php:176-187 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Type/Atomic/TArray.php:87\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":"src/Psalm/Type/Atomic/TArray.php"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a323dd0823bfaabdf3e9c2c0be23b1a5924fead87fb10463e51c415c83eac468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php:418-430 | src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php:453-465 \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 \u0060src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php:418\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php:417\u0060 calls \u0060isMixed\u0060 and \u0060src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php:451\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec2ed4f3742856fedfa9fa5521b22042dfa1c6c355f5e80a0472f5d25eda927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/Psalm/Internal/Analyzer/MethodComparator.php:1227-1239 | src/Psalm/Internal/Analyzer/MethodComparator.php:1248-1259 \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 \u0060src/Psalm/Internal/Analyzer/MethodComparator.php:1227\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a491b8a8f92f57ce9f83f9c453213c0a9caf9c2ce0ef9d7b58b9c267936f42c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:1846-1858 | src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:1860-1872 \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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d9894c96135e4b9f981d2da38f4962be6500b414a29f6bfe793692673ab412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:404-415 | src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php:182-194 \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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f2978aebfcf965d3bcc8dae78f62be1d2f209ecab83910413145ce41cf8b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1668-1680 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1702-1714 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1668\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e63d3396b32fd6cc843129e0e640f998c41b1513de4fd457747734c7e1df3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php:565-577 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php:597-610 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php:565\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"4635c6adeb5ae5b6587fbf28bd7cda216ab6d4878ddee5e6c76f3265030e8df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php:1378-1389 | src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php:1393-1405 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php:1378\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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e6f932c5537398f6455d9a32839f0194265897c4493a6d2142f6bab34dbb68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1231-1242 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2576-2588 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1231\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"309d5c1ebbc2b019b967cc9825cb149cb2e842a4d45dd6d8a2c2a12754af236a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php:446-458 | src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php:467-479 | src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php:488-497 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php:446\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"144dd46718fb6f373a44940d84637ea414860f497e032c2dc0a7df9b4f008cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Psalm/Internal/Codebase/ClassLikes.php:1750-1762 | src/Psalm/Internal/Codebase/ClassLikes.php:1907-1919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Codebase/ClassLikes.php:1906\u0060 calls \u0060foreach\u0060 and \u0060src/Psalm/Internal/Codebase/ClassLikes.php:1748\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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f8d73e18b06f187c44a35fd17c9342ee8332c883486a4804ef211ee2d436a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Psalm/Internal/Type/ParseTreeCreator.php:657-669 | src/Psalm/Internal/Type/ParseTreeCreator.php:673-685 \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 \u0060src/Psalm/Internal/Type/ParseTreeCreator.php:657\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afcfebc0650defc53df3390330a046e6205641ea0076f25884b6884fe2900c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Psalm/Internal/Type/ParseTreeCreator.php:1070-1082 | src/Psalm/Internal/Type/ParseTreeCreator.php:1149-1161 \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 \u0060src/Psalm/Internal/Type/ParseTreeCreator.php:1070\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f50b324380337a3ff4c12a6df9606ccf9f661a51128e7fba06f949760e23e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2098-2110 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2228-2240 \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 \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2098\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0188e2b520233db7e1b222c3107d5fd8fa8d848e1386a67b3fb521a23749d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2127-2139 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:2049-2061 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php\u0060 and \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 139 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2127\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce324f9e9913e8c4d09891518ba535deac1f1b5a057f2b8acfbe712151e2f446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/Psalm/Type/Atomic/TClosure.php:108-119 | src/Psalm/Type/Atomic/TClosure.php:161-173 \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 \u0060src/Psalm/Type/Atomic/TClosure.php:161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TClosure.php"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf59bc0d62b896774bc5a03be85543a94f6aa168dc3756a0fc79f253202e2ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Psalm/Type/Atomic/TKeyedArray.php:220-232 | src/Psalm/Type/Atomic/TKeyedArray.php:298-312 \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 \u0060src/Psalm/Type/Atomic/TKeyedArray.php:220\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":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c7c106cff2495d38d7334f3f3b995477d8ffa3136a5fd52a940ff598dc76ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:1745-1756 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:1392-1403 | src/Psalm/Internal/Analyzer/Statements/Expression/EvalAnalyzer.php:55-66 | src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php:135-146 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:1745\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/EvalAnalyzer.php:54\u0060 calls \u0060getCodebase\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:1743\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"a554102ab16d56c804ae1f9ae79522b774efcb652ef34980674340896657d450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:297-308 | src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:346-357 | src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:376-387 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:297\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":"src/Psalm/Internal/Scanner/PhpStormMetaScanner.php"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa1274f6aed357db4b4ea07dc0972273cc642366672c6a0f8d6b22f2f8846f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Psalm/Config.php:2831-2842 | src/Psalm/Config.php:2979-2990 \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 \u0060src/Psalm/Config.php:2831\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":"src/Psalm/Config.php"},"region":{"startLine":2831}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50823ceec0296ddbf226d12f6ce3ae48c27b3a3942c2b91c5514b09e4c4c9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php:257-268 | src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php:163-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php:257\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb7a3a5758e551ef0a97b8fea71ba9788f528d9a4efb8801bf80ed30156d9f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php:660-671 | src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php:704-715 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php:660\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72886b52b0a10702a7cb0c19f6fff35c9f36431ceea0a48f85904de515ab6af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1510-1521 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1531-1542 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1510\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"0375a4875855b5cdf04e063679cf76dfee231ca65d8770353c442a8e3bc2bdec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1732-1743 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php:928-939 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1732\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c59c6581715b8fbf8c3378dc0ae6d8145a7a30a2ced7f9381b34eea8bf2c8f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:399-410 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php:476-487 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:399\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"069b7948e3f799bce3d82eb4168017b6eae8e0f5ef1d5a659f118f625ebc4f94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:641-652 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php:973-984 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:641\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"5baf5b3c483466787ae510fffc7562d9736fded3cb57bf35d8555a3c0d210c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php:371-382 | src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php:384-395 \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":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"506bbc661b6c49b45f022477c7dd42d56c6f4b6086343b4d45b219deec462365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php:59-70 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterVarReturnTypeProvider.php:49-60 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php\u0060 and \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterVarReturnTypeProvider.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 67 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab84d4b3f54ba7cbabea8c55f4c697105904ec67efc898b03b5329bb2066c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:854-865 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1021-1032 \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 \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:854\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfebd9cf64f20b26cfba0c7772c089be2a7a7007a707843e85356be8ea9b6af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2828-2838 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2897-2907 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2970-2980 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3647-3657 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2828\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dff3f36401c5ab20c7d434c1b4a27a002659479f6b7cfb8f6cd0255378a1fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/Psalm/Internal/Cli/LanguageServer.php:149-159 | src/Psalm/Internal/Cli/Psalm.php:1169-1179 | src/Psalm/Internal/Cli/Psalter.php:513-523 | src/Psalm/Internal/Cli/Refactor.php:90-100 \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 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c3c03f640185179524875e1a44ebc69fdca6a36c31c2c423da5585718ca7e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2096-2106 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2226-2236 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1901-1911 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:2024-2034 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php\u0060 and \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 139 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2096\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"91067166fecfc2f1f0794ccbda1274ff189e314629c5c52fff21fdc702c35ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:1643-1653 | src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:2237-2247 | src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php:496-506 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e767fbf74f7dd442a52f82467833fe7462cb3ae7df6a9b3926bd44dc985fec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:1669-1679 | src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:2263-2273 | src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php:547-557 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"16413b30b386727d610331c0f5be947de08c01652774fde7d02cc9bd04d9576f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php:119-129 | src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:330-340 | src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php:133-143 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php:119\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:341\u0060 calls \u0060array_key_exists\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php:130\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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"21983ed1707fe927b9aed85dba1b5ad39e344aae00ec93d7a9b8fbe308330867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1481-1491 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1509-1519 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1530-1540 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1da26caea9a575094b2ff77c470eb012e1ac1a1bc97d41c2bf45df111f11d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php:476-490 | src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php:494-508 | src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php:512-526 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php:476\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce34961dc7f36f5d6242fc73e7bfd0a7012a51deb32d1685dc36c95eecf967f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:825-835 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:855-865 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1022-1032 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:825\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d9e458dc1daf41201b157d30a9768fabe36de64e052c37cdf46ea117fe07a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/CodeLocation/ParseErrorLocation.php:32-42 | src/Psalm/CodeLocation/Raw.php:30-40 \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":"src/Psalm/CodeLocation/ParseErrorLocation.php"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6cce309af5156677ba61b51ce00909ac2a51296c036a1cb5230d132796fda6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Config/ErrorLevelFileFilter.php:29-39 | src/Psalm/Config/ErrorLevelFileFilter.php:50-60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config/ErrorLevelFileFilter.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f6b2dd6d166f49a2b916fd7e567b00a9558b94b812f8d554c7c7ef1ddfa6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Internal/Analyzer/CommentAnalyzer.php:269-279 | src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php:243-253 \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":"src/Psalm/Internal/Analyzer/CommentAnalyzer.php"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f58d38198336324dc3b2ca1b35a19c727d8dd6f8e098f085863fba50eeeb85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php:205-215 | src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php:410-420 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php:205\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5960cc1c5f27436afdf43cb6951b1ba51cdf6149ee1921f5d5e3a19416ed40fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2852-2862 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2913-2923 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2852\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e188a87a7149efb35ac55094ff1d8fdd8a630a61a9f118a4ece96a0be898bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1042-1052 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1216-1222 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1042\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"085c81623d76cf799507e92326023c20035509b9977d00090c379bb0c9c25ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Internal/Codebase/TaintFlowResolution.php:2974-2984 | src/Psalm/Internal/Codebase/TaintFlowResolution.php:3039-3049 \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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":2974}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bdaeb07d3bccec9bfd49b8313354ef73709a491633999624a4debd206eaa3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Internal/Codebase/TaintFlowResolution.php:3637-3647 | src/Psalm/Internal/Codebase/TaintFlowResolution.php:3753-3763 \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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":3637}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc19e66f2834726efcfef94dcf7882876d9e52b415b35f723af9672f62171fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayRandReturnTypeProvider.php:41-51 | src/Psalm/Internal/Provider/ReturnTypeProvider/ArraySpliceReturnTypeProvider.php:40-50 \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 \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayRandReturnTypeProvider.php:41\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayRandReturnTypeProvider.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"305dfc025952b49f756c1d389f3b1bf4c106fdd19eb719528d8913374e5682ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:855-865 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1057-1067 \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 \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:855\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:851\u0060 calls \u0060TFloat\u0060 and \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:1055\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9d067e0daba4509c4bf389622b87969d2bbce267c62e0417a05c065b2ee0d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/RoundReturnTypeProvider.php:48-57 | src/Psalm/Internal/Provider/ReturnTypeProvider/RoundReturnTypeProvider.php:60-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/RoundReturnTypeProvider.php:60\u0060 calls \u0060count\u0060, \u0060getType\u0060 and \u0060src/Psalm/Internal/Provider/ReturnTypeProvider/RoundReturnTypeProvider.php:72\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ReturnTypeProvider/RoundReturnTypeProvider.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b04adb18a79784ea5f52f84c9fd7ae96dedbcc1158bd3ab3809c944176223e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Internal/Type/AssertionReconciler.php:980-990 | src/Psalm/Type.php:1009-1019 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/AssertionReconciler.php:980\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f4c87eff0dd1368f8e565d2c2e9af2094b0870d0d882ab9bf766adbb54bd54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:712-722 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1829-1839 \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 \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:712\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce6c2c661a063b29183fa69850bfe20dc53fdc8dc711b58320af4d879102705"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 6): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1077-1084 | src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:743-752 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:1053-1060 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1136-1143 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1237-1244 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php:513-520 \u2014 there are 6 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1077\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83c9cfddbeed8d7939345a69c4572409aa0b3fa59ffb30db24373a446ff1f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:689-698 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php:652-661 | src/Psalm/Internal/Analyzer/Statements/Expression/EncapsulatedStringAnalyzer.php:127-136 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:649-658 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/EncapsulatedStringAnalyzer.php:140\u0060 calls \u0060getTaintsRemovedAfterUrlOrigins\u0060, \u0060foreach\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:700\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"52787740751e093a9aff2cfd60212c9ef34b0198f287e86563470464d6ed7a84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:579-589 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php:939-948 | src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:424-435 | src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php:764-775 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:579\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c87fca01603161b75405067c21829b25d94db173b690192722ee43faf646e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:491-500 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1218-1227 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2565-2574 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:491\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"019ce37e1a55148540077d3c775236e7dcd27a3228ce5d7d3f51f19b9bd7b758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/Psalm/Internal/Codebase/Analyzer.php:754-763 | src/Psalm/Internal/Codebase/Analyzer.php:790-799 | src/Psalm/Internal/Codebase/Analyzer.php:826-835 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Codebase/Analyzer.php:754\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":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"2341fda1ea2f76b2d201fae45315acde2b8c5d1ae711ea2b06c3951908f9b609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/Psalm/Internal/Diff/FileStatementsDiffer.php:163-173 | src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php:116-125 | src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php:131-141 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php\u0060 and \u0060src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php:163\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/FileStatementsDiffer.php"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"895b9a03f35d92209f3af153000500fd05fe4fe89e6a40e3e4d8f40f714296b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Psalm/Internal/Analyzer/ClassAnalyzer.php:2543-2554 | src/Psalm/Internal/Analyzer/ClassAnalyzer.php:2789-2798 \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 \u0060src/Psalm/Internal/Analyzer/ClassAnalyzer.php:2543\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"230b4e25cc0c953d79d4434b0c5ef63ad801fd60abde7784cac709d777c5ba19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:1789-1798 | src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php:1800-1809 \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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa2e9ec3f3952ef7dca2d0756b381445e729d70c79432c32fc90b059c83678d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2844-2853 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3588-3597 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:2844\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":2844}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e94220ee3be6f9e74860a43aa75bafbeacae4b63fda6b827c8e2a7d62e6223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3596-3612 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3663-3679 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:3596\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":3596}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc20070210554ab1841f6fb8b58af28bbb94623725bf3e456c2423b92aff768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:326-335 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php:177-186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:326\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecdef31f1280a6ef97739b64804653898bc98d337305e099ae261be245b6451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php:1128-1137 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php:1170-1179 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php:1128\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2123088879c7c8cc7f284f5e18119ac74e2f90fe76f0024ecd0de733d0751d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php:104-113 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php:169-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61c2e32e9b9281a3c7e693c2c1e8bebf6ec787fbccd601520d46449ee679bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Psalm/Internal/Cli/Psalm.php:220-229 | src/Psalm/Internal/Cli/Psalter.php:116-125 \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 \u0060src/Psalm/Internal/Cli/Psalm.php:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a5f66e456dbaf99e8ffcb470c5a8ee20c1dc5ec9d8fa597d7b8c141fe0af63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Psalm/Internal/Diff/FileStatementsDiffer.php:94-103 | src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php:99-108 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php\u0060 and \u0060src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php:94\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/FileStatementsDiffer.php"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5748c95b3b3743029f1d7a9061be0f6cf78c0dd2410e1c35d3491ad38c018805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php:198-207 | src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php:250-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9db05f86242888267ed333e9af80638cb5bf875c2682c85e535f92d88e55dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/Psalm/Internal/Type/ParseTreeCreator.php:223-231 | src/Psalm/Internal/Type/ParseTreeCreator.php:314-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/ParseTreeCreator.php:223\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":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d002e788b7ad8b6ef7323563a4e0cab5cc942421e6768981113351ed933c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2111-2120 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:2036-2045 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php\u0060 and \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 139 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2111\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"461d2d32e5466ad37da47a6f3dc38bbdbeed9d27411f170e2de801bb984f78f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 12): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1047-1055 | src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:694-702 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:560-568 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:256-264 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:184-192 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:490-498 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:952-960 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php:756-764 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1217-1225 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1466-1474 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2564-2572 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php:168-176 \u2014 there are 12 copies across 8 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 12 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:266\u0060 calls \u0060hasMixed\u0060, \u0060CodeLocation\u0060, \u0060getSource\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:962\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fd545225d7fac36e38537df417ca2fe7eb71f324642b32beb3d6f54e94b6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1076-1084 | src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php:742-750 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:644-652 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:329-337 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:1052-1060 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php:180-188 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1135-1143 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1236-1244 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2582-2590 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php:512-520 \u2014 there are 10 copies across 8 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 10 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"0707d7da8dabb5f1ccebfc767cec0d190e39a233a0cef2322212df5e15c92772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/Psalm/Internal/Diff/FileStatementsDiffer.php:135-143 | src/Psalm/Internal/Diff/FileStatementsDiffer.php:163-172 | src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php:116-125 | src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php:131-140 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php\u0060 and \u0060src/Psalm/Internal/Diff/NamespaceStatementsDiffer.php\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Diff/FileStatementsDiffer.php:135\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":"src/Psalm/Internal/Diff/FileStatementsDiffer.php"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"22698012e1d6b667f8a076b4b64ee4ac5bfc0304b5a80430f9149c3628d9c197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:1760-1767 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:1779-1786 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:1810-1818 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:1760\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e944c784c8d63fd7334f3ea23c479ba8b0a5d7d416e9c1763e33eae3bf759f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/Psalm/Internal/PluginManager/Command/DisableCommand.php:52-61 | src/Psalm/Internal/PluginManager/Command/EnableCommand.php:52-61 | src/Psalm/Internal/PluginManager/Command/ShowCommand.php:47-55 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/PluginManager/Command/DisableCommand.php\u0060 and \u0060src/Psalm/Internal/PluginManager/Command/EnableCommand.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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":"src/Psalm/Internal/PluginManager/Command/DisableCommand.php"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf3ced97f255ba37e169915acfbb6849a8be94aa94b27bdbcd2cfb9162e8d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1184-1192 | src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1264-1272 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php:1184\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"314f080b841578b8af3ebea76d90d4ac99a331adac44753b3f62e5ffcd375243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Psalm/Internal/CliUtils.php:442-450 | src/Psalm/Internal/CliUtils.php:503-511 \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 \u0060src/Psalm/Internal/CliUtils.php:442\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/CliUtils.php"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c341e88e941712a28a8907a503a07f4c5fcf32849ddbb6bb20fcb44411d82f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Psalm/Internal/Codebase/Properties.php:185-193 | src/Psalm/Internal/Codebase/Properties.php:209-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Codebase/Properties.php:185\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Properties.php"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c41d8a87070db75d7e7bf9eb77fd34e9cb93a265cd1a66b2b2182f9e397331"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Psalm/Internal/FileManipulation/ClassDocblockManipulator.php:50-58 | src/Psalm/Internal/FileManipulation/PropertyDocblockManipulator.php:60-68 \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. 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":"src/Psalm/Internal/FileManipulation/ClassDocblockManipulator.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfcc94c5881c4fa171881d7b9b161cfaa39b313b0be7f8af34b5637465528a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php:357-365 | src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php:406-413 \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 \u0060src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php:357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php:367\u0060 calls \u0060count\u0060, \u0060implode\u0060, \u0060array_slice\u0060 and \u0060src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php:414\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c941f8ead140e75662474d1ff49ec27a901cdca6a9d82ab481f621147fe5b2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Psalm/Internal/Type/TypeCombination.php:138-146 | src/Psalm/Internal/Type/TypeCombination.php:169-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/TypeCombination.php:138\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeCombination.php"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f178ce13ef322f22b220aa6508489135b5a2d92fd4fb14281b62279084226a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:534-541 | src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:582-589 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:1745-1752 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php:1392-1399 | src/Psalm/Internal/Analyzer/Statements/Expression/EvalAnalyzer.php:55-62 | src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php:135-142 \u2014 there are 6 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:534\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/Statements/Expression/EvalAnalyzer.php:54\u0060 calls \u0060getCodebase\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:1743\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"088e7cb2707d4af73251900db3ffa5cecb4ca74ace91576c485cc3ffb279b341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:511-518 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1151-1158 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1237-1244 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1430-1437 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1530-1537 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:511\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c7e7f80d1a67e619c0a806013bac9ff3a9c6017fb3e89a7ed29705ec376af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php:672-679 | src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php:177-184 | src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php:646-653 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php:672\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"35de95e99f18835c347abd24a08c298ca4c0e3fd8cf13e1a7a240dfcbe45fdb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php:471-478 | src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php:489-496 | src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php:507-514 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php:471\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c520722beb394bdbdedbe4456c50b5e3c58e3afdab9f8d1cfe02bbe1ed0fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Psalm/Internal/Analyzer/NamespaceAnalyzer.php:282-289 | src/Psalm/Internal/Analyzer/NamespaceAnalyzer.php:291-298 \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 \u0060src/Psalm/Internal/Analyzer/NamespaceAnalyzer.php:282\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":"src/Psalm/Internal/Analyzer/NamespaceAnalyzer.php"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16935c486305d9a87f8685589518b9da2982f1721f788db21136b0d7acc676a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:559-566 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:643-650 \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 \u0060src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php:559\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b114be6db2ab057da317d7cb22c07bcda957ce3bb660cff3095fbdb3bf55d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Psalm/Internal/Codebase/ClassLikes.php:195-202 | src/Psalm/Internal/Codebase/ClassLikes.php:211-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Codebase/ClassLikes.php:195\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"da740ff1485335c328003c79fc9a65065955213df52ef54623e8194f92afe897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/Psalm/Internal/FileManipulation/ClassDocblockManipulator.php:106-113 | src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php:472-478 \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 \u0060src/Psalm/Internal/FileManipulation/ClassDocblockManipulator.php:106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php:468\u0060 calls \u0060isset\u0060, \u0060reset\u0060 and \u0060src/Psalm/Internal/FileManipulation/ClassDocblockManipulator.php:104\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/FileManipulation/ClassDocblockManipulator.php"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"47586d464945584431b9b498d74cb6a96e52a075bccac232bc19f7ff9d5d2aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:504-511 | src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php:2098-2105 \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 \u0060src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php:504\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7409ed6c7fe9f7583e862b0d7d7a3804cf94c71a4736773d8db494aeedeb74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:586-593 | src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php:595-602 \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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"9210cac03628c3f6d38b279aedb9834f9b92710821825c67cd8e28c15b27610f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:103-110 | src/Psalm/Internal/Scanner/PhpStormMetaScanner.php:112-119 \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":"src/Psalm/Internal/Scanner/PhpStormMetaScanner.php"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"495442d00679818fb0c6e8f358ca503c22fb8dd9aaa7a8992c1a77eb8a0df4d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2149-2156 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:2071-2078 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php\u0060 and \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 139 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:2149\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3473b4d7ba4ef8e8d92dd210968b7cbdf1975f1b1ec0b4ef1ea8c69e8b4b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1625-1632 | src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1729-1736 \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 \u0060src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php:1625\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c60d4a3816b2379a821c2f60c052d282c0db674b6f36a4d69e599207bfad22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1047-1053 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:256-262 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:490-496 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:952-958 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php:1889-1896 | src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php:1213-1220 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1217-1223 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2564-2570 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php:168-174 \u2014 there are 9 copies across 7 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 9 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1047\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"894428c3ead94e9b9ae428c672a97904c1b3f29ee4f181b0a34a64f330a7c5f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1076-1082 | src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php:329-335 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php:1052-1058 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php:180-186 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:1135-1141 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php:207-213 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php:1076\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"075e3d3dad58acc852990ef37d0f002b864f9abccbac4b72dec0a6524b8d5a38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php:651-657 | src/Psalm/Internal/Analyzer/Statements/Expression/EncapsulatedStringAnalyzer.php:126-132 | src/Psalm/Internal/Analyzer/Statements/Expression/EvalAnalyzer.php:54-60 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:648-654 | src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php:134-140 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Analyzer/Statements/Expression/EvalAnalyzer.php\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cde0569327f48791dfec47673ea281f7aa30b38521ad640542ac01bff287ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php:1575-1581 | src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php:474-481 \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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c55bd16bb8ca725a15ef0c28ce4bd092166fd616b04b7eba3d5db47e7b0a788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Internal/Diff/AstDiffer.php:50-60 | src/Psalm/Internal/Diff/FileDiffer.php:44-54 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/Diff/AstDiffer.php\u0060 and \u0060src/Psalm/Internal/Diff/FileDiffer.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Diff/AstDiffer.php:50\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Diff/AstDiffer.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1763c5f47e8c9c0cdd65d6ab28ba8167a3120a118486ac8e8f473822822f1b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php:534-540 | src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php:570-576 \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 \u0060src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php:534\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"892f67befbda73d44caf5048f673038dc5c1815ebcf67ff1b4998a4735777039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:187-192 | src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php:2792-2797 | src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php:346-351 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php:187\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d8f33f1143e41eeb73cb03bc629ea064ffcdaf9562a1e7d067e5da49822b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/Psalm/Type/Atomic/TKeyedArray.php:92-97 | src/Psalm/Type/Atomic/TKeyedArray.php:680-685 | src/Psalm/Type/Atomic/TKeyedArray.php:720-725 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Type/Atomic/TKeyedArray.php:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caec327626b5dd18d5e741b498c0f6615b6df7fb87afc9f93f0029acc6d237a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Psalm/Internal/Analyzer/CanAlias.php:116-121 | src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php:746-751 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Analyzer/CanAlias.php:116\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Psalm/Internal/Analyzer/CanAlias.php:114\u0060 calls \u0060getCodebase\u0060 and \u0060src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php:744\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/CanAlias.php"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"953441f68772b232aced2e743f21db12de6412c6b7eee8170735b379942f69a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1348-1353 | src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1433-1438 \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 \u0060src/Psalm/Internal/Type/SimpleAssertionReconciler.php:1348\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0a2f0fbb98a7173278e7d346bb22999216316c2cc0291db1580928afa0e8c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Psalm/Type/UnionTrait.php:825-830 | src/Psalm/Type/UnionTrait.php:910-915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/UnionTrait.php"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2626f1a8b289bdab460fb0c1c0c093d7d71e4865c1423f560794489ed389981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/Psalm/Internal/Codebase/TaintFlowResolution.php:2936-2940 | src/Psalm/Internal/Codebase/TaintFlowResolution.php:3110-3114 | src/Psalm/Internal/Codebase/TaintFlowResolution.php:3199-3203 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Codebase/TaintFlowResolution.php:2936\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":2936}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c36e7716f3062ec8b49d40ef4f28cc8fb92b1bf81436719a6356c8e51c48e9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Psalm/Internal/Cli/Psalm.php:727-732 | src/Psalm/Internal/LanguageServer/LanguageServer.php:228-233 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Internal/Cli/Psalm.php:727\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"52100d518e8c08c9cc7e3682307bc8b40f9a2bdb58da7d4b32550a7cad4b4e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 4): src/Psalm/Plugin/EventHandler/Event/AfterExpressionAnalysisEvent.php:40-82 | src/Psalm/Plugin/EventHandler/Event/AfterFunctionCallAnalysisEvent.php:42-101 | src/Psalm/Plugin/EventHandler/Event/AfterMethodCallAnalysisEvent.php:46-128 | src/Psalm/Plugin/EventHandler/Event/BeforeExpressionAnalysisEvent.php:40-82 \u2014 before extracting anything, compare \u0060src/Psalm/Plugin/EventHandler/Event/AfterExpressionAnalysisEvent.php\u0060 and \u0060src/Psalm/Plugin/EventHandler/Event/AfterFunctionCallAnalysisEvent.php\u0060 as WHOLE FILES: 83% 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Plugin/EventHandler/Event/AfterExpressionAnalysisEvent.php:40\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Plugin/EventHandler/Event/AfterExpressionAnalysisEvent.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e23ed762750a50f3db8b714b3f2ea0b0b0583f3198536c5f37c9fdae88ea7fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): src/Psalm/Plugin/EventHandler/Event/AfterFunctionLikeAnalysisEvent.php:44-102 | src/Psalm/Plugin/EventHandler/Event/AfterStatementAnalysisEvent.php:40-82 \u2014 before extracting anything, compare \u0060src/Psalm/Plugin/EventHandler/Event/AfterFunctionLikeAnalysisEvent.php\u0060 and \u0060src/Psalm/Plugin/EventHandler/Event/AfterStatementAnalysisEvent.php\u0060 as WHOLE FILES: 84% 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Psalm/Plugin/EventHandler/Event/AfterFunctionLikeAnalysisEvent.php:44\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Plugin/EventHandler/Event/AfterFunctionLikeAnalysisEvent.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b199939a4a219887c3cc913487896841ed3678ac9e7714fc9741841a3f958d4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): src/Psalm/Plugin/EventHandler/Event/MethodCapabilitiesProviderEvent.php:36-86 | src/Psalm/Plugin/EventHandler/Event/MethodReturnTypeProviderEvent.php:45-105 \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 \u0060src/Psalm/Plugin/EventHandler/Event/MethodCapabilitiesProviderEvent.php:36\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Plugin/EventHandler/Event/MethodCapabilitiesProviderEvent.php"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4ee3d67d49d47fda27f4de18caf4dce54eb8fb69f7e94fbde1995ba717a000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Psalm/Internal/Analyzer/FileAnalyzer.php:687-691 | src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php:2812-2816 \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":"src/Psalm/Internal/Analyzer/FileAnalyzer.php"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f59c818d7deb1643486c539f52f4209b7bf0a8e8a5c709d524d33fb4f9f056"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Psalm/Internal/Analyzer/FileAnalyzer.php:701-705 | src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php:2826-2830 \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":"src/Psalm/Internal/Analyzer/FileAnalyzer.php"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"7800bb5f84c3d69e3e789033f23a88dc75b85ca7bb334c82a9e6a9c6c3a99ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Psalm/Internal/PluginManager/Command/DisableCommand.php:36-46 | src/Psalm/Internal/PluginManager/Command/EnableCommand.php:36-46 \u2014 before extracting anything, compare \u0060src/Psalm/Internal/PluginManager/Command/DisableCommand.php\u0060 and \u0060src/Psalm/Internal/PluginManager/Command/EnableCommand.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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":"src/Psalm/Internal/PluginManager/Command/DisableCommand.php"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"323940cf4f4ba71f11ebeee179aaf2b7659f397351f9010c590fe472d2914c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Psalm/Internal/Provider/ClassLikeStorageProvider.php:46-53 | src/Psalm/Internal/Provider/FileStorageProvider.php:45-51 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ClassLikeStorageProvider.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b902a7ed9d455f7015841bee727cbdbe9e586a25e5a997dd863ecb54c9e013ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Psalm/Report/ConsoleReport.php:27-32 | src/Psalm/Report/PhpStormReport.php:27-32 \u2014 before extracting anything, compare \u0060src/Psalm/Report/ConsoleReport.php\u0060 and \u0060src/Psalm/Report/PhpStormReport.php\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Report/ConsoleReport.php"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"92df8fcdc4a4f9812ce034130f7d6e3dd61c1db3b30270483d71c9ba7e75f5d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Psalm/Type/Atomic/TNamedObject.php:213-219 | src/Psalm/Type/Atomic/TTemplateParam.php:171-177 \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. 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":"src/Psalm/Type/Atomic/TNamedObject.php"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ad9849aee64b97568c18bd1035de19f55abb189fdfc79c8373719085622560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Psalm/Type/Atomic/TTemplateKeyOf.php:42-46 | src/Psalm/Type/Atomic/TTemplateValueOf.php:42-46 \u2014 before extracting anything, compare \u0060src/Psalm/Type/Atomic/TTemplateKeyOf.php\u0060 and \u0060src/Psalm/Type/Atomic/TTemplateValueOf.php\u0060 as WHOLE FILES: 89% 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. 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":"src/Psalm/Type/Atomic/TTemplateKeyOf.php"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee40c7e1a0c1ecfd19762a059472c54ead0d46a5af71adee24553fa822d2f8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Psalm/Internal/Provider/ClassLikeStorageProvider.php:174-180 | src/Psalm/Internal/Provider/FileStorageProvider.php:145-151 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ClassLikeStorageProvider.php"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cad010ddb5c02e3945da649aabf89bcf2d872cd1caef2c19fa7d55e7d659fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Psalm/Internal/Provider/DynamicFunctionStorageProvider.php:40-44 | src/Psalm/Internal/Provider/FunctionParamsProvider.php:50-54 \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":"src/Psalm/Internal/Provider/DynamicFunctionStorageProvider.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"41db8248e9c1544f3b1dd6a815ab2bdb138316a6eb8e0bf209a3dca4fca380c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Psalm/Internal/Provider/FunctionParamsProvider.php:85-100 | src/Psalm/Internal/Provider/FunctionReturnTypeProvider.php:178-193 \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. 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":"src/Psalm/Internal/Provider/FunctionParamsProvider.php"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e107f37dbb006bed4d2dba4019dd4619c660f07a490b0e7d1e2b56d50707ae06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Psalm/Internal/Provider/PropertyExistenceProvider.php:77-93 | src/Psalm/Internal/Provider/PropertyVisibilityProvider.php:74-90 \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. 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":"src/Psalm/Internal/Provider/PropertyExistenceProvider.php"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f213616c731191fb78c95a76e519694ce4dac9256e572df1440c8d250d94990b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): examples/plugins/TaintModelFields.php:29-41 | examples/plugins/TaintPageComponents.php:32-46 \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 \u0060examples/plugins/TaintModelFields.php:29\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":"examples/plugins/TaintModelFields.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0425eb20b048a054d09fb94e8e4bc85c6f603c1a5686c6f9955d983910fa8130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/TemplateChecker.php:51-63 | examples/TemplateScanner.php:36-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 \u0060examples/TemplateChecker.php:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/TemplateChecker.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c998060ace46cae5851580a236db8aa6856b81f9b5a787b4568396a054b458"}},{"ruleId":"D5","level":"error","message":{"text":"Circular dependency: dictionaries \u2192 src/Psalm \u2192 dictionaries"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dictionaries/ImpureFunctionsList.php"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb28db0740de06c73bf42e7708946f31b16a8a85ce64028c00fc33765873061"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Codebase (LCOM4 9): Codebase\u0027s methods fall into 9 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 9 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":"src/Psalm/Codebase.php"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e7ec47d2f1678174bf3c69803110f4380b33a928111a5351cec2d64a9f9dc4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ClassLikeStorage (LCOM4 6): ClassLikeStorage\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":"src/Psalm/Storage/ClassLikeStorage.php"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"069a0b90a6d7218fde40bd9c2e7362f8154e031450e05bdaad8502ba0d73d441"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Union (LCOM4 6): Union\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":"src/Psalm/Type/Union.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f427857d1d49b06f9e55f81c37fd875f0a601101423856efa03247ddcaada532"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Config (LCOM4 5): Config\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":"src/Psalm/Config.php"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"568d8eb5abe05d05a52766d97170fc7db2beb17b7582e88883d1918fa190dc84"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Context (LCOM4 5): Context\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":"src/Psalm/Context.php"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2eace643839457be5a7efea387c810fa331be82bf4251b502693eb2f1d20686"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NodeTable (LCOM4 5): NodeTable\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":"src/Psalm/Internal/DataFlow/NodeTable.php"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecadba1d7a27bffc59ed52f7a0a018bf4120c7a85671ed3f474073ef5139d33"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvalidParamDefaultButAllowedInConfig: 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":"tests/AnnotationTest.php"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9163db6bb800833c3b4dee275638884fb83a9628bb1e1c6f2fa8e0644bff3db"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPseudoPropertyOfAClassWithoutAMagicGetterIsReadableWithTheConfigOption: 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":"tests/ArgTest.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d047fd16323ab5ff2696794b338daf1b3f93d21cc2c5108d1257a5c6074fa9b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEnsureArrayOffsetsExistWithIssetCheck: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"779a5e45e9267730302af3c29d7231030f1d2f0127f252452a85713266acd989"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEnsureArrayOffsetsExistForOffsetsPassedByReference: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7113a235470a58003aa3ed05f5aab70c39c769fb61542456c561065cc29c3cc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDontEnsureArrayOffsetsExist: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d624d42581bed983b6bd18b8e43db236e96861399f65bfb3f0513ba031cbaa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEnsureArrayOffsetsExistWithIssetCheckFollowedByIsArray: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c144346ef9b1c507f47e1ac2b7cd9c14c43e7da0c57dd3ea022b0ee09d998938"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNoIssueWhenUsingArrayValuesOnNonEmptyArray: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"233386b39f8675c751f36f7be2afa03a46c28219f43dbf35f9ade8b1d1f317e8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNoIssueWhenUsingArrayValuesOnNonEmptyArrayCheckedWithSizeof: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb3bb9e00a67174d47924df81b7c3462fea3946edb7755fe121922e713cd198"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNoIssueAfterManyIssets: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e727c3f2f5755d299e0742b8c5d6f92e9c44a7dd427d1265aeec9cf53bad1d6b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEnsureListOffsetExistsNotEmpty: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1feea3cb1bfc2f85c5733375cbbfd435376983cf2a616a61ee73fc9609edea07"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEnsureOffsetExistsAfterArrayPush: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8fff31d96bca6428daed59b7819d16624c5e13260193c97ec17ad785f6eb1c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEnsureOffsetExistsAfterNestedIsset: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5c1ad5c9ef4fc9aa3377f8c0caa16fe8910953063111db25be9e2bcf3d1664"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEnsureListOffsetExistsAfterCountValueInRange: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b293641815ab7b0c9906aea015c53f97216b9dc0f5776317f8fef9db1cacfc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCountOnKeyedArrayInRange: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bad5aa5df9d473eff49857a41611ce931c24c92482ef2111c5fb57db40bd857"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCountOnKeyedArrayInRangeWithUpdate: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7a13bdaa36d564b96114ca13e106a9d90ea813314078c1a1e63f1cea311b68"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDontWorryWhenUnionedWithPositiveInt: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f326743208ef71e5fc0f5cb402b9a7ef63b4f10a62e0cb80eb52137b03db50c4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testListOffsetAfterIssetCheckWithTaintAnalysis: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"2affec43694a85372305523c9274c9c84d749c10411ce3d50ce39ecd6ac39d51"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testListOffsetFromVariableAfterIssetCheckWithTaintAnalysis: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2017971dc36d6e2ec674019bfcdfbbf4884faec25d8f22f6bf7c3f952b89d755"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testListOffsetAfterAssignmentInABranchWithTaintAnalysis: 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":"tests/ArrayAccessTest.php"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b633506764e9ba0c03e7c69f549c619b26c07d97a4f670fcf217ac0a7bb8acdb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDontForgetAssertionAfterMutationFreeCall: 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":"tests/AssertAnnotationTest.php"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2845cad898c0f2b83f41ddccd0e8758db841fbb9efb40c6cd6ba27c1d270aad0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testArrayKeyExistsAssertionOfAnArgumentOffset: 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":"tests/AssertAnnotationTest.php"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"024eb7cd38adc48b555a19c46a6b365e4750617fe2bc0d3a52917e61f965c10c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testArrayKeyExistsAssertionOfNamedArguments: 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":"tests/AssertAnnotationTest.php"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae1eb74fc58f53af7a359cb12d9811710a5899f96e5684fd012c9c8725b7e7d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAssertsAlongCallStaticMethodWork: 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":"tests/AssertAnnotationTest.php"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ccfa6a9790cc608f42fb74a88d88de7d59bea62d7215dd37fee69872ba14ea"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubsWithDifferentAttributes: 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":"tests/AttributeTest.php"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0105b4afe59b3bbb74f1e9dba954f726c960d3e4163b37698261e8e9c896b50"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPowOfDifferingNumericLiteralTypesInStrictMode: 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":"tests/BinaryOperationTest.php"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce9e3f40c9204382bd213eeeb7c0602e0d2f122729df9dd38179b254bfbb831"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPowOfDifferingNumericTypesInStrictMode: 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":"tests/BinaryOperationTest.php"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf7266e3b4d5a94bcf2509e084b7524f3328d29994f5762cf101b2c7ff071b6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testConcatenationWithIntInStrictMode: 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":"tests/BinaryOperationTest.php"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc373aae9fe0d82436143253f94e5e81bdd68bb3c39d835e80d7ee83124d1b3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testConcatenationWithArrayKeyInStrictMode: 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":"tests/BinaryOperationTest.php"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"af685b78df7d5f9f39c022de2f68402303632a65512855fad7a9e24cec551c31"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testConcatenationWithAllowedUnionTypeInStrictMode: 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":"tests/BinaryOperationTest.php"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1f9090a314dffafad448c3858a80e0474799d262fdfa4aacbdd190c1a85bd2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testConcatenationWithIgnoredNullOrFalseInStrictMode: 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":"tests/BinaryOperationTest.php"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6061fc8a3c9c9105a9b5c77018e1737ffe391a6954ef516b2d82adc56fea60"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNullableComparisonIsAllowedByDefault: 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":"tests/BinaryOperationTest.php"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"20133410abbe6b241bab89dd59d49a9fd5fe59fe204b23bb96f08ce87e49cbc2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNarrowedComparisonInStrictNullableMode: 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":"tests/BinaryOperationTest.php"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"388e675db18c8a31f8a3139712802446e529ef169748b1eddaa84e4526391f00"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNullEqualityIsAllowedInStrictNullableMode: 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":"tests/BinaryOperationTest.php"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a01e42911cfdd79394f6b627d8222bc392b4dfa8ef4f93168b9bfd9001d22a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRequiredClosureParamIsAcceptedForAnOptionalCallableParamByDefault: 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":"tests/CallableTest.php"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d174df2b89f8b1258e49f334dbb18c2c7237c07c90927a3dcd4c1e3a08b52801"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStrictOptionalCallableParamsAcceptsAnOptionalClosureParam: 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":"tests/CallableTest.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c16c5ab5963713b71e736b6aee44d0ee98b898317b9fa3f48f4aa07930f55f1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStrictOptionalCallableParamsAcceptsAVariadicClosureParam: 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":"tests/CallableTest.php"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a31211be66fe6a8298c0ff456f2192dfb05beb46590094b3c9f10da0676ac1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStrictOptionalCallableParamsAcceptsAClosureWithoutParams: 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":"tests/CallableTest.php"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0988809bf7ced8c1bec133f379332f936bb51a5dd67db39c59e80ca07256124d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStrictOptionalCallableParamsKeepsARequiredContainerParamStrict: 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":"tests/CallableTest.php"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a049b8fba5fc1c6984c0c8298a6f4768c4e75f9d86000e4f43e482d154adc0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPureNewAndStaticCallsKeepPropertyRefinements: 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":"tests/CapabilitiesTest.php"},"region":{"startLine":7217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83c384d084ee85c45e0969b6dcb6dfa0be004ae71112f0277f67ad0aedd3ad8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPureMagicStaticCallKeepsPropertyRefinements: 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":"tests/CapabilitiesTest.php"},"region":{"startLine":7264}}}],"partialFingerprints":{"codehealthFindingId/v1":"30830109f8d5726e83c1bcbe94cca203410fb9a53b0d2a1696d5639f050cfd8c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCallsThatCannotWriteGlobalsKeepSuperGlobalRefinements: 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":"tests/CapabilitiesTest.php"},"region":{"startLine":7453}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad5131ed80184655b2b31860f8f55e5d6c4bb1f285bbb4b6f058dc8e35f994f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMethodCallsThatCannotWriteGlobalsKeepStaticPropertyRefinements: 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":"tests/CapabilitiesTest.php"},"region":{"startLine":7521}}}],"partialFingerprints":{"codehealthFindingId/v1":"f570e9c93b29b18d11d909d48a3a78eb868335e3d3a68c6a9592fe87a50e7750"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPureClassMethodCallsAreRememberedLikeImmutableOnes: 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":"tests/CapabilitiesTest.php"},"region":{"startLine":7643}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec4a9ac41644bbba4de45e12f8fa12e3c1b27517dfd3f3a99b84a957cdd694c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testExtendsMysqli: 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":"tests/ClassTest.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"99098453ef356414a22e2e638e0b02069c8f237483f507f098d6999854f74224"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAllPossibleIssues: 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":"tests/Config/ConfigTest.php"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"713a85bb9712f12d1ce01c88ec76ac3a3595c2c9022b3163b9abe7650622f68c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testThing: 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":"tests/Config/ConfigTest.php"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b889abf90cce0f5236687ec6c279cdf4a82921441c95b8792682e3df05abe4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMutableDependencySuppressedForAReferencedClass: 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":"tests/Config/ConfigTest.php"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5c37753d48c76b50e65bd47e11e88e4e7a54e4b716895f8e8e22a5c1b2302c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testImmutableDependencySuppressedForAReferencedClass: 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":"tests/Config/ConfigTest.php"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e670840252bba26f6213d6432d117196bf86852e2c72c5df8e84b02efa1d9f1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testValidThrowValidCatch: 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":"tests/Config/ConfigTest.php"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"069b5748fa647401dc9fabf859d304237938daa646e32060875b1ff2843e4b12"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testGlobals: 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":"tests/Config/ConfigTest.php"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c30296087424417ef80a3e48ce466d88438bcc6cc5a0973cb5647091ceb9ca6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testIgnoreExceptions: 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":"tests/Config/ConfigTest.php"},"region":{"startLine":2260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b257a14e87ca99339f7a54929ec5526992c7032bf7b918bd5649c0eb07ca64aa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintBadDataVariables: 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":"tests/Config/Plugin/EventHandler/AddTaints/AddTaintsInterfaceTest.php"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11e15114ba954a6c082ef31431a2b49e571a795fc7dc07561cf4ab5c5ea3801"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintsArePassedByTaintedAssignments: 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":"tests/Config/Plugin/EventHandler/AddTaints/AddTaintsInterfaceTest.php"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6606fe0ef2fe92d71e469b51abe232991299e46fab3c549162929fe7910f45f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintsAreOverriddenByRawAssignments: 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":"tests/Config/Plugin/EventHandler/AddTaints/AddTaintsInterfaceTest.php"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c47a7298608b9da7465c66deb84bc2d7bf52272d0f392b0c677a980f598b1a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintsArePassedByTaintedFuncReturns: 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":"tests/Config/Plugin/EventHandler/AddTaints/AddTaintsInterfaceTest.php"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afd0ec826b20e1e4a4ea44325fdbd904d9d385589ea7e56c91384b19aa8dc93"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintsArePassedByTaintedFuncMultipleReturns: 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":"tests/Config/Plugin/EventHandler/AddTaints/AddTaintsInterfaceTest.php"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd1751d0d5fbbd05baf70108f22613a9d5fdce3f97f08d325b8533fd3882d94"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintsArePassedByTaintedMethodReturns: 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":"tests/Config/Plugin/EventHandler/AddTaints/AddTaintsInterfaceTest.php"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ab92c6d6e77f5633c4541761b3b740e42ab13879aa76f300316b5004bd720b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintsArePassedByTaintedStaticMethodReturns: 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":"tests/Config/Plugin/EventHandler/AddTaints/AddTaintsInterfaceTest.php"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b34b8e5dd59cace1dc2226944739ea945af5a89c8d88064c9f07341ee3a6de6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintsArePassedByProxyCalls: 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":"tests/Config/Plugin/EventHandler/AddTaints/AddTaintsInterfaceTest.php"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d2eab00a4ff05d783485e90de76458f24bfff1e30f568952f3a999de8d331f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAddTaintsActiveRecord: 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":"tests/Config/Plugin/EventHandler/AddTaints/AddTaintsInterfaceTest.php"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"86437b342440b0e6589771e48d375c72fb10a6a2e4e12e10d9cd589982260ff9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAddTaintsActiveRecordList: 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":"tests/Config/Plugin/EventHandler/AddTaints/AddTaintsInterfaceTest.php"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2c0c60d95c70e2fa5d4a04bcdff0a4cc0693937a26cdad913d12dcac45537c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAddTaintsActiveRecordListItem: 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":"tests/Config/Plugin/EventHandler/AddTaints/AddTaintsInterfaceTest.php"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6e6bb72a9f91b40e542e59e24f90a5074c76f3de2b9e72ab3265a0e9abe97e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRemoveAllTaints: 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":"tests/Config/Plugin/EventHandler/RemoveTaints/RemoveTaintsInterfaceTest.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd407b453c0d371b37b6f3d9a5ff89da9cd691c90db09c54dc398939588c9899"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRemoveTaintsOfCallOfDeclaredMethod: 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":"tests/Config/Plugin/EventHandler/RemoveTaints/RemoveTaintsInterfaceTest.php"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5990b8263cf1d49c34de3b61be8bda5dc862fd31f636d3a122c9c1112b433c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRemoveTaintsOfCallOfInheritedMethod: 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":"tests/Config/Plugin/EventHandler/RemoveTaints/RemoveTaintsInterfaceTest.php"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"696ffe0ae083b5d452ecb8a329d6dabc6db1db5b954c0842067d2a7427b10e37"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRemoveTaintsOfSpecializedCallOfDeclaredMethod: 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":"tests/Config/Plugin/EventHandler/RemoveTaints/RemoveTaintsInterfaceTest.php"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bf884fd0d6cf76789df0a3970e7c4517fdc7265237852477b76095f25881e2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRemoveTaintsOfWhatOverridesReturn: 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":"tests/Config/Plugin/EventHandler/RemoveTaints/RemoveTaintsInterfaceTest.php"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f6c301497f20721a74783d909041a29b40c88d74d5311f0a98e1f16705ec53"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: pluginsAreEnabledInConfigFile: 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":"tests/Config/PluginListTest.php"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56bc6ed53b884981d1265566c0951883172734fa0b5ba75f6747c7aa515cea1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: pluginsAreDisabledInConfigFile: 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":"tests/Config/PluginListTest.php"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90afc9b2fda1ca37620c30a8f2fad1fb3b7cae1dcf051b1c43f47024cea9e41"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEchoAnalyzerPluginWithJustHtml: 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":"tests/Config/PluginTest.php"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"649c891f1ef1b4d09e8ef924be51a4d40fae5d5b5a40ce21970a4a2891a982fd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFloatCheckerPluginIssueSuppressionByConfig: 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":"tests/Config/PluginTest.php"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9b7033949c515cf0d1c7a136aa9b83d093fb73d6d01b18289b7ba6741880aa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFloatCheckerPluginIssueSuppressionByDocblock: 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":"tests/Config/PluginTest.php"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75929c66b424a567b5933e7027ca678de8e0b6fbd3d22522c345088e2fe8a60"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPropertyProviderHooks: 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":"tests/Config/PluginTest.php"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"3315cadd4eb46057a4a75898476df4221492391974f185223f1485d9e32c0154"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMethodProviderHooksValidArg: 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":"tests/Config/PluginTest.php"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"73716b12ecf6ddb0e89c2d60c911ad81895410ede3c93a842d22540e2a827a86"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMethodParamsProviderReceivesTheLocationOfTheCall: 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":"tests/Config/PluginTest.php"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82ccb4d000b9fda0df434639e2b6b3adced47f0e8128751bcd68011dd4ceefb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMethodProviderAnalyzesNarrowingArgumentOnce: 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":"tests/Config/PluginTest.php"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f0c64d31ed66c83d54efa66fbf83f7b5d342ed382bae4926fac5d3730b895c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMethodProviderSeesResolvedTypeVariables: 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":"tests/Config/PluginTest.php"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da5ebe7b27c152183968174980fa26cb078552bb5b368911d09053087ee5ca9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFunctionProviderHooks: 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":"tests/Config/PluginTest.php"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24149c20bc75b6f822581df9142ba4bd46e4d3a2ba6c70bb2af1afe8748b804"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMethodCapabilitiesProviderGivesTheCallsLevel: 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":"tests/Config/PluginTest.php"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2009e345459507f3b821be881ac1fe2d485a02bffd3720e9d675520e8b63d613"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMethodCapabilitiesProviderIsNotAskedAboutAFirstClassCallable: 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":"tests/Config/PluginTest.php"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d3d5484dfec5fc1d8de8b8de15945ee214e4f85bd7464ba8120f5d38bf63d3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPluginFilenameCanBeAbsolute: 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":"tests/Config/PluginTest.php"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9230550bf4df37736d1bffbe09005fde52cfa5230bfbb2f544b0542d38783d16"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintReceiverNodeOfPlugin: 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":"tests/Config/PluginTest.php"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37dfdfa07f8381548a124c9e87feef6d4f035f35a56401a19b120a1e3bbbf20"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintArgumentNodeOfPlugin: 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":"tests/Config/PluginTest.php"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1b122d6ebec08647e64e586748314b26dcd5fda44bbec34d34c2a4d60e20df"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintPropertyAssignmentOfPlugin: 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":"tests/Config/PluginTest.php"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3a5b4f01273f8ef14f78181654f527ddb8a6bb11930d7516c8c68e2a87fd3a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFunctionDynamicStorageProviderHook: 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":"tests/Config/PluginTest.php"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae1a4dd95227fa5f1392ab0876e8d9014efce01d0af62d63aa1fd0444f9bd84"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testConstantDefinedInSeveralBranchesIsTheUnionInAnotherFile: 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":"tests/ConstantTest.php"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a133660304dd6239e0c600af13128ba67c9586d3182123d03d0a974f85af367"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTheNamespaceConstantsOfAnEarlierAnalysisAreForgotten: 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":"tests/ConstantTest.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9f84369cadf8e22f3d7e8431759bb9c8bd5461c7a7abd625b5fd49b92286d0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testGlobalConstantOfEnumCasesFromAnotherFile: 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":"tests/ConstantTest.php"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c82092c5027a38fc850e6406335f60aaac60437a92fed56c07bef18dba09e7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testGlobalConstantOfClassConstFetchFromAnotherFile: 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":"tests/ConstantTest.php"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"349472671866527a82a8325c9590a2bffa8d17e488a91e7309875edbfe97b443"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testGlobalConstantWildcardOfConstantsFromOtherFiles: 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":"tests/ConstantTest.php"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6454b95d068f2eacaec3d68bbbb7cef92765976a535713e0bc52dae6ec109937"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUseObjectConstant: 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":"tests/ConstantTest.php"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e73cb34f32eef42cdf591c932be32a1f46f64a34841c36f9d4015c52b3f60f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPsalmAlterDryRunExitsWithCode2WhenFilesWouldChange: 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":"tests/EndToEnd/PsalterDryRunEndToEndTest.php"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b401989c2600301ecc2a5030c63e409de6f60399fd9fd4f42615a7aa221baa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInheritedMethodReturningBinaryEnumValueWithTaintAnalysis: 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":"tests/EnumTest.php"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bcc0f6ca2de81c0a2dd7431a22ea0e77fab1bb7a26c894fca851a7a494fe4d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAllowedEchoFunction: 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":"tests/ForbiddenCodeTest.php"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"699659883d75460f06c2daab6884471b53ef91cf346b72d68a4d3f2711880274"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAllowedPrintFunction: 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":"tests/ForbiddenCodeTest.php"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc83dc3b5d85148a9a62d4158c83abfa084d2c8cab40445cf281124a40121f1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAllowedVarExportFunction: 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":"tests/ForbiddenCodeTest.php"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d40a8ca29fdc15903274b8127af32565357eb2e77760e94c8be50ce08b2e874"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNoExceptionWithMatchingNameButDifferentNamespace: 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":"tests/ForbiddenCodeTest.php"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee784a66c8465226860232bbf952a3535c0ab44d6c1ff2103c48d5487408387"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testValidInclude: 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":"tests/IncludeTest.php"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc393ff3d8d33976794602683e0dc0468a4ecc9fc39c17d4f04f0ba733824f1c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInterfaceAnalysisDoesNotCrashWhenStorageOverwritten: 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":"tests/IncludeTest.php"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcf462833fa3460caf0a98342e7ccda6281ee17837da7f3d97ea8af2bc107a0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testHookedInterfacePropertyProvider: 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":"tests/InterfaceTest.php"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7f718e2a71a64114881d40f36c79e48933a82c47b3330af47f335925d4a9c1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLoadCallMaps: 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":"tests/Internal/CallMapTest.php"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"af08907db1fb3343496b2e8e68d659e0efb657b313c79647679fdeaf791f3d90"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMissingThrowsDocblockSuppressed: 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":"tests/IssueSuppressionTest.php"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9bd030143aa81c3d327fe666df5e33b27cd10be5d462a4924444cde6cb1eb2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUncaughtThrowInGlobalScopeSuppressed: 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":"tests/IssueSuppressionTest.php"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61d3f616b41ee168dcbeefe6d932a02910249e566c79aeeacba67221ee3ef96"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPossiblyUnusedPropertySuppressedOnClass: 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":"tests/IssueSuppressionTest.php"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d48ca982b67cc875c9f387a516581b56b68d2a3875251afb282d05eb6876c9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPossiblyUnusedPropertySuppressedOnProperty: 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":"tests/IssueSuppressionTest.php"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"065c2a276427da78d4bf5b6269f9eac4831e4a7a825643a961b15e8f0bd321dd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPluginAppendedClassSuppressionIsNotReportedAsUnused: 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":"tests/IssueSuppressionTest.php"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec35474ca34a261976dca2ad5bd5c00f2b8cfa476b5ba04231b6de3c48800d8e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPluginAppendedMethodSuppressionIsNotReportedAsUnused: 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":"tests/IssueSuppressionTest.php"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"007d386b50d6100e480b5382a8340be39833929b78013dd578261cb41416815d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNoCrashOnLoopId: 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":"tests/LanguageServer/CompletionTest.php"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28edecfd2f6076e9e5c7a4e9a3ed15ddf890d6792e5806d93f28fac494f38a5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPhpDocMethodWhenUndefined: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b7d8b369d07e72b12bd9ddd8a2bd0bdff6e4895f92197e18fed7dc2149c72a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPhpDocMethodWhenUndefinedWithStatic: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabd4bf781d76a078d8b1ee117af9b0dcaab026a5430a492599c9bf579b05a02"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPhpDocMethodWhenTemplated: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f039cd8696cd47ed7869a2cbd24b7d5365866d7c8be311427601daa8720595d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testOverrideExceptionMethodReturn: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"096f1eed6e968f7a08678eae86c874cdb203d47d80459fe53a04ff75abca0f4e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSealAllMethodsWithFoo: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":3166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf62488f1cc939c21ec0806fdd493a59a2aac15ed81f55d5f3b331a989f204d0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSealAllMethodsWithFooWithStatic: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":3188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5698df7910eabe4682a0c68b83e735d1b2027db8e1b625d9ad83b21b496e9651"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSealAllMethodsWithFooInSubclass: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":3209}}}],"partialFingerprints":{"codehealthFindingId/v1":"221c511c846325f115546a424e25c82c43bd0b080f48cc9b1970b64bfc3d39e5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSealAllMethodsWithFooInSubclassWithStatic: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":3232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df7c24084c509ae5fc35f1d10dabb42e6404e2b0833e28e53e01e1ecb1b6583"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSealAllMethodsWithFooAnnotated: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"691b00c2489d2317ed54948ce410b4d4e690db307f607bb31cb84bf2a9ee9a21"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSealAllMethodsWithFooAnnotatedWithStatic: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":3276}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fc46134d3d90c063bc23858b60f20abf8f4b4932369b3e88f5103a33ca53e3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSealAllMethodsSetToFalse: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":3297}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb7d03ad2750d2dc38ebd7aa31813182ead8aeb52996ae413fa4cd4e0e00304"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSealAllMethodsSetToFalseWithStatic: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":3318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf571e84efee82ee8688fc1949e41b9f508633fda733e418f66690b40fe003f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testIntersectionTypeWhenMagicMethodDoesNotExistButIsProvidedBySecondType: 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":"tests/MagicMethodAnnotationTest.php"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a706fe7777d36ca8ab749239cd07ede2e094a5d715e42606bb9462c9e2b356f4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPhpDocPropertyWithoutGet: 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":"tests/MagicPropertyTest.php"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0da75b2c2dbfad071ec50016136f5398a73f7646c2c9ceac0ed2baae4e803ea"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPhpDocPropertyWithoutMagicGetterIsExpanded: 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":"tests/MagicPropertyTest.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c255e511fd60355e9c8684a746e56ba3dc7aeff3b1ff9bb8dd6d0ddde6a424"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPhpDocPropertyAssignmentWithoutSetInheritedFromParent: 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":"tests/MagicPropertyTest.php"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ccbc02c30dc4fd22f047df17e63f8b260edc8181c26fa276cd4347e23ff66"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNoSealAllProperties: 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":"tests/MagicPropertyTest.php"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9ce432ac658d6aec25a53dee580dccdd98909566fa3622e6dc20e7cd862590"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testExtendDocblockParamType: 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":"tests/MethodCallTest.php"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5784b4ee54836bdcb745165aa4440b3d94d0e179510620b21556b9c64f01130"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMethodCallMemoize: 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":"tests/MethodCallTest.php"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fa223b05e2c10e13a7a3b806399428a172ca14fc3a1cb7d19e5be8ba2edbb3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPropertyMethodCallMemoize: 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":"tests/MethodCallTest.php"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"194f37d38748fa79f9146e829d279198b2730e9c795de1585ce601b4d97ac43f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPropertyMethodCallMutationFreeMemoize: 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":"tests/MethodCallTest.php"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b83260b531c5077a7b946879f38932577ddf8193b4047fd2382765dfdc9a19b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUnchainedMethodCallMemoize: 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":"tests/MethodCallTest.php"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"933cd01207b66c77e3461d398a936f0aac775af1563679817302eee1708f3712"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUnchainedMutationFreeMethodCallMemoize: 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":"tests/MethodCallTest.php"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d77914070eda469ea1294e5d50a3fa2a13a2767dbda773937cedc4ea27aa35"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMethodAssertionOnMethodCallingTheAssertingMethodMemoize: 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":"tests/MethodCallTest.php"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fcc033cf85a35add04ae2c2ef1dfd7266a6e5c15f4412559d8c012fb20edaa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMethodAssertionOnIteratorCurrentCallingValidMemoize: 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":"tests/MethodCallTest.php"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe7c38bcf0a8b27b510fed0cccfd394c3e799471610566fcf22eb9f7b3069da"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLegacyVersionDoesNotRequireTentativeReturnSignature: 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":"tests/MethodSignatureTest.php"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5ac6ee0c0f076d957b7c825483fa1f4c89a87e3940fd1cba83449a0e84694f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testExtendSoapClientWithDocblockTypes: 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":"tests/MethodSignatureTest.php"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2cda6ef6340bf8b65e1db1de3f57e6fedb1ad866768caf0766a93087d7f8f7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testExtendSoapClientWithNoDocblockTypes: 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":"tests/MethodSignatureTest.php"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e808306bb8537e0d72bdce4f5861e6c240ea074c307bd6d93aa9c245d55cc562"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testExtendSoapClientWithParamType: 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":"tests/MethodSignatureTest.php"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"941e87b7ad47fa175331b41aeb8278d14863585be2931e3e451ea6fc0ff5b7f3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMismatchingCovariantReturnIn74: 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":"tests/MethodSignatureTest.php"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab34d0ed9785fe85428f95b065738a21a6823604f1f392b3dafb0d1dd36b86c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMismatchingCovariantReturnIn74WithSelf: 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":"tests/MethodSignatureTest.php"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f0393fbd27eea1c19e03f497f397e14b55b2248d2cc84a138f18f2039ab46a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMismatchingCovariantParamIn74: 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":"tests/MethodSignatureTest.php"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb8e22215df1d0479961a93e50614a5b1f8568010eaaec468f4307fe36ea6f5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testForgetPropertyAssignmentsPassesNormally: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b796dbe6356fa4deb35f138bf38a8d553c199ee29102b9b9b95d941414eb1d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFooBar: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"35196c5dd354a4ec1e872712c13e6ba3a73962ce219471f3b9486a6d84741eb3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testForgetFinalMethodCalls: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9927a760cfd336e2e0dbc1b3c21252e53ff5da95b7d70a0a2925de4fa3287d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNoCrashInTryCatch: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c362318bd0251692d043f4b2832ab3efd97aa53ea236d7aa95b9bf862a7f1f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAssertionInsideWhileOne: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf816e00706d637c53198df6113f0b0d82b47250c5857da79139ed1fef42dd0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAssertionInsideWhileTwo: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a64293f8a281a68090511e5383add0163b4117d8ab4a7e4c8fa12279e05c6d4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAssertionInsideWhileThree: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd0da8d628bea9bf01257c92b1edbcc3605a70c0cca6012f5199effa4f75de4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAssertionInsideWhileFour: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b020f6649efc0233835e60f40e79496f71d5329d627417ee8bb8166bc9333bc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAssertionInsideWhileFive: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5a37b5cda6df13b64e13990a45eacb69ceaf2366467f6326b805b7ef37d891"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUniversalObjectCrates: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f23f72fad660728a48e659e95ae86ac89bea88f7e11a22a1ea84b3d97d62da"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUniversalObjectCratesOfAnInterface: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dea6ed9a52934688ea5e372c535531fd5a6e24c99a74f3c86347747062f9686"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUniversalObjectCratesOfAParentClass: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb57b822d004ae5a8c1d8663d827796989ea9aa2324c6e7e30f0291c4a3aaa82"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testForgetPropertyAssignmentsInBranchWithThrowNormally: 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":"tests/PropertyTypeTest.php"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e578b2d9f3857a6d062caa6bd01fa24d5d51119482630aab0c193d7aeb2aa1d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: passesExplicitConfigToPluginListFactory: 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":"tests/PsalmPluginTest.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7f05695d213352c442a1293513916c63c73ac7ca13332ba792400aa0588619"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testVoidParameterType: 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":"tests/ReturnTypeTest.php"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec7e163db187394d5780e942b52b74b1b113ede0c081f050eb9cb8a5605ea5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubDirectoryFunctions: 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":"tests/StubTest.php"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4921acac312985bec5690f432962cca718e3224143c67e721c206256091bb4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubFileClass: 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":"tests/StubTest.php"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bbf7f7bb12aa279d839a4c6de2fcbf7935c2e317189ac04141a9b64e4246ee"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubFileConstant: 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":"tests/StubTest.php"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"f355a9a2ae964c0746c3655690eda407332bad507a2ad4bfdeada45681ed406a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNamespacedStubClass: 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":"tests/StubTest.php"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"c053a7aceee1cdd62c50677b454ea03b62c5597d74b19feaf05cc3d016cac8cc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubRegularFunction: 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":"tests/StubTest.php"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"583586a02f60b69b521d9d2e23f1b9c1f4e13bb8945951d6d91f88e7bd5bd6b9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubVariadicFunction: 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":"tests/StubTest.php"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baf2134837ada95796e5652eef4a90d66cbd1014573ecbcf710ceb1a7dca6a4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPolyfilledFunction: 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":"tests/StubTest.php"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3b71fd1f5debbcf9515b7620d64a07db60e8951b2f0704ed207b316eb45fed"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testConditionalConstantDefined: 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":"tests/StubTest.php"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4b57170ffffe87a22ed2a9176f9ce768b48ad76e85e412a4f34051c673d5d3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubbedConstantVarCommentType: 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":"tests/StubTest.php"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf66a52cf0ea3f23434c1ba087f70a8e89235441d2ac4f7c37f9db096940742b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testClassAlias: 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":"tests/StubTest.php"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"9837ee0aba391445beffb830cda7aa6a50d807085704b57d827cb6f53b3410d4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubFunctionWithFunctionExists: 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":"tests/StubTest.php"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"df643b2a86673464f6384da659bf159f2a6803c30cbfe53495efa1a997f0c880"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNamespacedStubFunctionWithFunctionExists: 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":"tests/StubTest.php"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ab577c3ef4593745a14873b88f083c62539d5902a4afdea5746cc87130c27e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNamespacedStubFunction: 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":"tests/StubTest.php"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbccfadf9c30abd8de6ed5c7fb190649d54b955785c331dbb7c1bd329128f41"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testConditionalNamespacedStubFunction: 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":"tests/StubTest.php"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8faaf6f26b28a4fa44b0c4025d2386d587ad36735bae4ecbc25f0872be7b76ae"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testConditionallyExtendingInterface: 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":"tests/StubTest.php"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bff197ae82e861df4b9b74bc33c1375c4a78fa48aaed5f2d25840f227892d9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubFileWithExistingClassDefinition: 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":"tests/StubTest.php"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b7b25083982a21ee166061a211ca708cf651b79b3e3283f9df0871d96d6619"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testVersionDependentStubs: 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":"tests/StubTest.php"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"072ad293412212825c85a707bf7615f8244f2ebef859d2c95b2b6136b68f94a8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPreloadedStubOfBuiltinClassKeepsUndeclaredMethods: 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":"tests/StubTest.php"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ff85b3aaa4439a06a23eae5cd88fa63b87d76f8ecd8c6c8735c02add0a56cf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubOfBuiltinClassDeclaresPromotedProperty: 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":"tests/StubTest.php"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bf67a986e8c0e763aaf1dd466ba5429fd8b18483c2a9620e61e5ff2def7a0b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubPropertyDocblockTypeWinsOverPropertyMap: 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":"tests/StubTest.php"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"605fb533da41404a1d68da420049a8d96967357930d364cd1137c69bd12ccef4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubPromotedPropertyTypeWinsOverPropertyMap: 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":"tests/StubTest.php"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a75b4a781c4cf2992d2b578a63f38af21f8c9a922a1973edd89c01cebeaf21b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPropertyTypeInferredFromStubConstructorDoesNotWinOverPropertyMap: 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":"tests/StubTest.php"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cfbcb768b39e3f126e1a7194b0950510a9414a535ae78dcab68640c4b81c0d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubPromotedPropertyWithOnlyVarDocblockWinsOverPropertyMap: 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":"tests/StubTest.php"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caafd3811487d54a91c24d7b1d491c5274100cbd3fd1a15d77a963b22c44183"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubPropertyWithoutTypeGetsPropertyMapType: 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":"tests/StubTest.php"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f140c3052f365fdf4d0231ad07435aef0f526810c45bb6d428686ef378123870"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubOfMappedClassKeepsPropertiesItDoesNotDeclare: 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":"tests/StubTest.php"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"06224c202a7f28b9d816b18c36fd3d9290a51e865867ed0c222486f3b10ccced"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDateIntervalDaysKeepsIgnoringFalsableIssues: 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":"tests/StubTest.php"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"40831b225e62b169dc5555537f38e878567fcf282390ca7e5f5546cc41537083"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testBundledStubKeepsPropertyMapTypeOfPdoExceptionCode: 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":"tests/StubTest.php"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"684cd6834142e0a0eed96179448c6d454e1e74ebae18d489d19d617436972c1a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testBundledStubKeepsPropertyMapTypeOfRdKafkaMessageHeaders: 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":"tests/StubTest.php"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4eb18cac259333c68d7e82276b6466fe3e2dd437f1b29cc07eca84e9cbe2214"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPropertyMapStillOverridesPropertyTypeOfRealSource: 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":"tests/StubTest.php"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"853c9e44207f94085f1df621e48e153f926244d4accc46f977765fb8233cb1ee"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubRedeclaresPropertyOfAnotherStubWithPromotion: 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":"tests/StubTest.php"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff654f1b4a753caa19f26694da012e1eb1fadd774ba10935a4dc2605597e262f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubFileWithPartialClassDefinitionWithMoreMethods: 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":"tests/StubTest.php"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e8a95fa7604564b312fdacf773852dda84329f5ff2f3d55d26c464ab857d5a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubbedMethodWithConditionalReturnOverridingSource: 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":"tests/StubTest.php"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1ee633437008899e6dbc69d4c7fb3a36ed467ff99b06b03aafef5e43324dc9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testExtendOnlyStubbedClass: 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":"tests/StubTest.php"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9db18f9d570ab1a059ae64dff99c3d87ceb6f0db2761c72decf7f640c542d7b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubFileWithExtendedStubbedClass: 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":"tests/StubTest.php"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"6620537b5ebbac6173210388c0c2a980c6d116d2026d3583b645a4163c3c58f0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStubFileWithTemplatedClassDefinitionAndMagicMethodOverride: 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":"tests/StubTest.php"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6c6b35ba7c33c56f6cbedbd33816713894afb5f19402c6e60b6d3deed1dd90"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInheritedMethodUsedInStub: 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":"tests/StubTest.php"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f10fda4d2e341e64960ba170fb4ac0e9b7a91bcbc2efffe184ddb2805e7591"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testValidCodeTrackingUnusedVariables: 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":"tests/Taint/TaintCasesTestCase.php"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e2db96b7eb6603e71676d723f9c2367f12e5163b0851b4718b3d1519e93ca2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvalidCodeTrackingUnusedVariables: 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":"tests/Taint/TaintCasesTestCase.php"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9812295a89b580fb5804f6c1589e51b37839d6551104fd2f816fd0ebfb1d926a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTaintKindNoHoles: 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":"tests/TaintTest.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5520da1d6826a62895995e3ddf8ec581f642d79f6894522049baed5f9ce12eae"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testImportAliasNamedLikeClassTemplateInDocblockMethodParamDefault: 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":"tests/Template/ClassTemplateTest.php"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e89e23eaf5a22d398e4364db548e9f5218f777c5ecbb00b3b53b9e06859e0ca"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInheritedThrowableClassAsThrows: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30b62f7f1ab0fcd81118cf54f839dd30ff8a6fb444672c0c3043ab2919b2166"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testGenericThrowableClassAsThrows: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faf177683e194f32ea919bcd921f62d07a8a2d73b5cc9c66c2c8253e82fc667"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCaughtThrowInLoopIsNotReported: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"feda05340675afe9ba6b525f44871d244d106cdec601a76bd29ce708a41f7e38"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDocumentedThrow: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bedf4926efcb784148e03b8c6616b3c615b1f0aefb1a96f51758c059b5f626"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDocumentedThrowUnionWithSpacesAroundPipe: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f59aa51d403161168e74d195e415bfb9cf6f79e6761b3d696d454ce87390f36"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testThrowsTypeFollowedByDescription: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ec5220a38dd8f3817bd8a0aa0b95f193143a0296d0ec97160199988a0c6024"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDocumentedParentThrow: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d6267a1b32e3fd5008b2010250b45a2391cf6ed68f7b4d31b38c1eda452d65"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testThrowableInherited: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6c6a3dfe7bd9baed9bb99ec302be2c7be0c3d70cf0eb5a006547c85fea593a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDocumentedThrowInFunctionCallWithThrow: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e0ef181d9d68125b999e902cc33f8d6e5a7260f5aaf31dd18098c17dc768af"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDocumentedThrowInFunctionCallWithoutThrow: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de192d1d20e615773ab3fdfefd7a5f2a2e1fd7f353e442dbd02e51033ddc925"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCaughtThrowInFunctionCall: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d84f751fe87264dead45629a0bc934f504be534537e5a911314540d99e1f20a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCaughtAllThrowInFunctionCall: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ba445fb4405f8de6d69a24b4e2cde881ad8cd8c4904fa75049df4a404490be"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDocumentedThrowInInterfaceWithInheritDocblock: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"9450d96714dc4fae7d6b37eebe2d4bd4c5360df6a9e3931eee440a7cfbab07da"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDocumentedThrowInInterfaceWithoutInheritDocblock: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a05e7d7d6e1f1388aff0a44f6522957bf495cae713f829938bb365e4a3c2aa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDocumentedThrowInSubclassWithExtendedInheritDocblock: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"221bf26d831d56e22d4b01b886c6eba73369a697e62d465848c12b4f7d7caad1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDocumentedThrowInInterfaceWithExtendedInheritDocblock: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b236a08960fcdd4ba88b90f98f61e7c1b651f7217be551e22cc682638ee2a6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNextCatchShouldIgnoreExceptionsCaughtByPreviousCatch: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"339b2a81155fdb82521406cf077e956c1dd32f5b8c94035cd78a50ae6aeabaaf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDocumentedThrowInterfaceWithFunctionCallWithImplementedExceptionThrow: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5df6b7b7a52fbf51f21ebbc605a7967aa5314708bc52f1b1de92315f519036"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPseudoMethodThrowsSuppressedAtCallSite: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"828a960bb2e7c212037a9f6041d6f52f500a55d29635a9d9b5328377051f9411"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPseudoMethodThrowsDocumentedByCaller: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"544eee8cfd1555a34330ce9cb7c76ce0fe8617948d3f909e63e620fc6d8c8d20"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPseudoMethodThrowsNotPropagatedForFirstClassCallable: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fa44e68198a90abbd953e5c58338f28a8405d7f6397f78af2fcab4c3ca8c22"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPseudoMethodThrowsNotPropagatedForFirstClassCallableWithoutMagicCall: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f480879d474c33f6a5c9fa2829c02733656ba6f0c9fc36e373caf1cdf93e1d7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPseudoMethodThrowsCaughtByTryCatch: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b198aed882cb30728695a702ae36bd9c09e75570b3f0e9b21223384b7c1559"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPseudoStaticMethodThrowsNotPropagatedForFirstClassCallable: 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":"tests/ThrowsAnnotationTest.php"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe076ed8a9aec426d8a81865024b8cd5d3cfbb018728b6c9bcce7f0b7a391c05"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCaughtDocumentedThrowCall: 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":"tests/ThrowsInGlobalScopeTest.php"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15b44790f62f0dbac3d05a8e17a5c2256fbfcf48ce46bc873374c54f335cc20"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUncaughtUndocumentedThrowCall: 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":"tests/ThrowsInGlobalScopeTest.php"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8c0ba4989cd39cf75636011cc421f667ff0340cad692fcf05ff132ae976f45"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCaughtThrow: 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":"tests/ThrowsInGlobalScopeTest.php"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fba61d9f72cb63e8ce895b6028ae940dd9ca3819184950ec5ade03522565f3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUncaughtThrowWhenSuppressing: 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":"tests/ThrowsInGlobalScopeTest.php"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"65da02b1b5047f91c0dd0cec7f3dc8df60bb584be10da73a8513bdbafee76cbd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUncaughtThrowInNamespaceWhenSuppressing: 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":"tests/ThrowsInGlobalScopeTest.php"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"275176717b603bc574a1f271202d171dbd2608fb439c9974cfe702d1e1b2372b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUncaughtDocumentedThrowCallWhenSuppressing: 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":"tests/ThrowsInGlobalScopeTest.php"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b57a72114fd4cde7215a42449f23d542f2f8076941bbd0671f5116d702fa7d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUncaughtDocumentedThrowCallInNamespaceWhenSuppressing: 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":"tests/ThrowsInGlobalScopeTest.php"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8855044efe746e593ed9b204194f6b732e38eab58f3fd5b78024ef4d17c31f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testBracketInUnion: 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":"tests/TypeParseTest.php"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"f930ea1b54ff7da7a601189dd56d4f9de25f5fe6eb765bdb5bd9182838faad19"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCallableWithGoodVariadic: 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":"tests/TypeParseTest.php"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd098538ed202ae0a7721990c5f6f63359306519ee6c43f88323c424984f1162"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAllowPropertyFetchAsNeedle: 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":"tests/TypeReconciliation/ArrayKeyExistsTest.php"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ab1075f8bdee7c2a51db3cfd0aa9c14e6a7e1b2e31e49d408d515fd3de165d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAllowStaticPropertyFetchAsNeedle: 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":"tests/TypeReconciliation/ArrayKeyExistsTest.php"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ca8be2b93bb62b046dfb0986817ce7b0650359d5c11f665096273040614c8a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDeclaredPropertyOfObjectShapeIsKeptAfterACallWhenPropertiesAreForgotten: 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":"tests/TypeReconciliation/IssetTest.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5c8e3b9ae23441681e8af835592762174a735a53dd68fbdf0531ba8d6dda29"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPropertyThatAMethodCalledInTheConditionWritesWithoutRememberingPropertyAssignments: 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":"tests/TypeReconciliation/RedundantConditionTest.php"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e137c3921182cb80d88786dfaf6c905df3ea8ebda012987d80f3d65a9e82c9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testShouldNotThrowUnresolvableInclude: 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":"tests/UnresolvableIncludeTest.php"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9695d423ad0a2a8e209a812a690e511722e62442d2fa4a62066ba3d26e8b08e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCallStaticReachedWhenAMethodExistenceProviderAnswersForTheClass: 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":"tests/UnusedCodeTest.php"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"b527f84b6befcd9815f7fa289d2a8f4c910ecac39ce6a246e599797f86247236"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testVariadicFunctionFromAutoloadFile: 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":"tests/VariadicTest.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5e67009969dacc3959d954022d2bacc9e887bf4536c374d70009528bf578e9"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: tests/LanguageServer/DiagnosticTest.php: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022Flaky on Windows\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/LanguageServer/DiagnosticTest.php"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"930990ab9c4d4ec0efdc343a35ce88c10ea7133242b0933cbddf521e57ad5ff8"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: tests/LanguageServer/DiagnosticTest.php: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022Flaky on Windows\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/LanguageServer/DiagnosticTest.php"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"892dd73ff0805a854873bbac9b7ae23110be7848b3432c84087b1e353b066897"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php: src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php changed 101 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 235 in FunctionLikeAnalyzer.analyze at line 304. 30 of those changes were fix/bug commits, and the other 71 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php\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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5480d8753d2ce1d7b665d6613b4f7a7d95f02c3ea83e134a578c6127e753a2be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php changed 90 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 133 in ArgumentsAnalyzer.checkArgumentsMatch at line 1057. 37 of those changes were fix/bug commits, and the other 53 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"826cef8f354cb499dbcffaf1707de301f0565aea09ce9e9934bcc66012699af7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php: src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 169 in ClassLikeNodeScanner.start at line 155. 31 of those changes were fix/bug commits, and the other 35 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php\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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b49a7ab49ced22776eefd04aa28a8ec595a62772243fe4944082c6288613093"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php changed 103 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 102 in AssignmentAnalyzer.analyzeAfterTheKeys at line 339. 33 of those changes were fix/bug commits, and the other 70 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e63803d2bcb9cae655e24fad68f0ee32da98b02b1b39fb839338ed24cd703e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Type/Reconciler.php: src/Psalm/Type/Reconciler.php changed 67 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 142 in Reconciler.reconcileKeyedTypes at line 134. 32 of those changes were fix/bug commits, and the other 35 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Type/Reconciler.php\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":"src/Psalm/Type/Reconciler.php"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2afbb1b9d2975604247d41f821632c7753a1994c8de187f39543ca83a4ecaf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Config.php: src/Psalm/Config.php changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 143 in Config.fromXmlAndPaths at line 1089. 19 of those changes were fix/bug commits, and the other 45 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Config.php\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":"src/Psalm/Config.php"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"8849ec533d2aa1de9dd40f5dee2d8e83433c20b3576d475c2af93d72465a9d82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php: src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 244 in AtomicTypeComparator.isContainedBy at line 77. 15 of those changes were fix/bug commits, 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php\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":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"46862f4a9c955f2ffd3793254fa897deeadec0a8398ecd6ee1870e0627a6feb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 225 in ArithmeticOpAnalyzer.analyzeOperands at line 412. 24 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ArithmeticOpAnalyzer.php"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4753fa25d9187568ae322b4fe6f07e93fb4caa9f417203717b7b7609989f94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 151 in ArgumentAnalyzer.verifyType at line 883. 24 of those changes were fix/bug commits, and the other 29 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0d2d9b64482dcea0268dd507b46cb8b58efcb23cf6ac42f24a465c631a17b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 130 in InstancePropertyAssignmentAnalyzer.analyzeAtomicAssignment at line 1221. 22 of those changes were fix/bug commits, and the other 36 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b6510f1ddfca795463bdbc5a311e9906477d22d96c50066663e0d1f5e6bfac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php: src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 164 in FunctionLikeNodeScanner.start at line 108. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php\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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd62c7af0827a853219833164e6114bcb1efaf4bf1bcae8fd1891f5b94c695c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in LoopAnalyzer.analyze at line 73. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Block/LoopAnalyzer.php"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"463418aa6154fccd70e0ef0df3d4620af4a8f75355a62fe3d99debeeea3be176"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/TypeParser.php: src/Psalm/Internal/Type/TypeParser.php changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 141 in TypeParser.getTypeFromGenericTree at line 756. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/TypeParser.php\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":"src/Psalm/Internal/Type/TypeParser.php"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"a616826915beb3e62bbb614862a43d197b78202455c251ae03879643b26a16c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 108 in AtomicStaticCallAnalyzer.handleNamedCall at line 362. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e242e9bd8ea9797a0df3adf27fdfe16c4de8956a08da5079b828e185d8f6ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php: src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 209 in ReturnTypeAnalyzer.verifyReturnType at line 135. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php\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":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9322a438d2ad7d03d0941bf10adf3b367a3093a2f77e3ce00a24914570b9421"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/TypeCombiner.php: src/Psalm/Internal/Type/TypeCombiner.php changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 168 in TypeCombiner.scrapeTypeProperties at line 485. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/TypeCombiner.php\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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc140b6ebf1832b285d944ce803a60cf2673d1ce5bbc532340e6e251a563e1ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/ClassAnalyzer.php: src/Psalm/Internal/Analyzer/ClassAnalyzer.php changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in ClassAnalyzer.addContextProperties at line 699. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/ClassAnalyzer.php\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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f5b1dad83295b9a31ff7769f9cc9d06a405b16e317c61146a7b367521ad069"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in ForeachAnalyzer.analyze at line 114. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50a514eb8ce1befe1333fafba301c2e02ff06dead1cdce246390c4a4dfdfa87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in ArrayFetchAnalyzer.getArrayAccessTypeGivenOffset at line 862. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40693f6993ac30646fe0f1f84fb1f19222f4b3006dcd0454c19369d90204344"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in FunctionCallAnalyzer.analyze at line 113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5659439045ff651bbb841df56ef91a782dd0a01a30b7c7d7dbecd8f87a41f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in ExistingAtomicStaticCallAnalyzer.analyze at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"398bc25bec8b6234f834d810a894b8754ba90ae5fc9808eacff3cc686c6139ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php changed 75 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in MethodCallPurityAnalyzer.analyze at line 356. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c3136970c7472d318e1d825f433f93c132eecc6640e007228f3f2144c63fd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php: src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in FunctionLikeDocblockScanner.addDocblockInfo at line 94. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php\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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f4d5cb2137f80c6e719d68c955a2e31cff33b1187a4e66aa7b1c309df0f405"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in IfElseAnalyzer.analyze at line 76. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ccff4a9c27d64db2d22e9579bfa5f0e19517f9d9a53a5fa9f28d4415ef5549"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Algebra/FormulaGenerator.php: src/Psalm/Internal/Algebra/FormulaGenerator.php changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 110 in FormulaGenerator.getFormula at line 61. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Algebra/FormulaGenerator.php\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":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dc47190258aa6987de6db17775319562b20440ec9363d32bc924c52330d4c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php: src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 140 in UnionTypeComparator.isContainedBy at line 59. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php\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":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20016701b21be8defe75cacd3b214cc09051e1edb47e55bb93f438ff75a3990"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php: src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 279 in FilterUtils.getReturnType at line 664. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"68653fcc038b77e1d631c508dbc3ae28f280690e90f39e2e1089928d24f20996"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php: src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php changed 75 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in AssertionFinder.scrapeAssertions at line 154. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"796d64fecf099421d64fddb8d935275a5e16514ca3ed31a21160b329dd92fbd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in AtomicPropertyFetchAnalyzer.analyze at line 89. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"77988e7347e3b589a8dd6a320d62a60f3605ffb3e3cf6471698ba02fc9a14277"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in AtomicMethodCallAnalyzer.analyze at line 69. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5dd6949952155538dbb00793c07ec20c8c09bce36508fc97c4a3d138cdfcca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in StaticCallAnalyzer.analyze at line 51. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeca325a03b6a9e652d7bae70933c340f72920ad1a2a9146c55e9c38f206f690"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in ArrayAssignmentAnalyzer.updateArrayAssignmentChildType at line 927. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c308ca7d710c0b047f743a83b20f50b325136538e20a3dedd45082530bbf4b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in NewAnalyzer.getNewType at line 1544. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"727904b5fe7f4e8870245d8d520d83586a1fd2e54838bcbcc1de4b07ee4a4445"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in ReturnAnalyzer.analyzeReturn at line 175. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"72612ffe90700ed96104cd73fa3ccce513203f543c77172f5937489f8b07ccd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in VariableFetchAnalyzer.analyze at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"be95e594aa1ec496eefb474cacc763113689c366e4f88923f48406f6aa0a9401"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php: src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in ClassLikeDocblockParser.parse at line 60. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php\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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4accf6652431d9d9df31f0b52deb37dd858163b4b71decaa1bb5f11bfe5ac9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in MethodCallReturnTypeFetcher.fetch at line 60. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a786c009e3d7cc93227b658a100047d1bec0ad88dccded69e8abfed34e5c628"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/Populator.php: src/Psalm/Internal/Codebase/Populator.php changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in Populator.populateClassLikeStorage at line 529. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/Populator.php\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":"src/Psalm/Internal/Codebase/Populator.php"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d769b86e43a89bfeea19f12e446c13deb48737c0484bc95abdbd7e1b3b83d3eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/TypeExpander.php: src/Psalm/Internal/Type/TypeExpander.php changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in TypeExpander.expandAtomic at line 235. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/TypeExpander.php\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":"src/Psalm/Internal/Type/TypeExpander.php"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ba59d9323d8d22f4bf752fbcf340d109cca266dddb63c8323bb17740587896"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/StatementsAnalyzer.php: src/Psalm/Internal/Analyzer/StatementsAnalyzer.php changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in StatementsAnalyzer.analyzeStatement at line 615. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/StatementsAnalyzer.php\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":"src/Psalm/Internal/Analyzer/StatementsAnalyzer.php"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efeaf1a8356f1370872083fbf66530ec34d9de7bfb6650741ea41f0a36d2b67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/MethodComparator.php: src/Psalm/Internal/Analyzer/MethodComparator.php changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in MethodComparator.compareMethodParams at line 700. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/MethodComparator.php\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":"src/Psalm/Internal/Analyzer/MethodComparator.php"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"885340226a51815f397865246f85ae5b245558d6c29c04c6bb86bdb0ee712e70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/ClassLikes.php: src/Psalm/Internal/Codebase/ClassLikes.php changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in ClassLikes.checkMethodReferences at line 2290. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/ClassLikes.php\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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ada287c05a50e0054139bb699fb25d5e397676becc3bc48e58c6d6ffdbe6ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php: src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in ReflectorVisitor.enterNode at line 113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php\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":"src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"32155ebe584cf32ce654e8699283b1b23354e294bfe39632561544b993579e22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Block/TryAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Block/TryAnalyzer.php changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in TryAnalyzer.analyze at line 43. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Block/TryAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Block/TryAnalyzer.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e22ad544d3fb44ad7f2b74c6916afc83d8a2e72e1a813fdb2282dcd8d50b58a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php changed 61 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in FunctionCallReturnTypeFetcher.fetch at line 84. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallReturnTypeFetcher.php"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2f7718808684bee9d5e291b9410565146bc28db82c16820edaeaec1acb7d81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 141 in ClassConstAnalyzer.analyzeFetch at line 113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6926b97c44b19afd2834821cbc90217a13092cc1ea25cca93034df49493ff2e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Block/SwitchCaseAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Block/SwitchCaseAnalyzer.php changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in SwitchCaseAnalyzer.analyze at line 66. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Block/SwitchCaseAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchCaseAnalyzer.php"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2405a989f7794302ef51addb03581f1a742206ee70b07a76a30eaf5aa46efee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Context.php: src/Psalm/Context.php changed 93 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Context.findReferenceRebinding at line 832. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Context.php\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":"src/Psalm/Context.php"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8d4f566812f4089125173202fe7ae223af9b3c17d5691211eabf1496bbedbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/TaintFlowGraph.php: src/Psalm/Internal/Codebase/TaintFlowGraph.php changed 75 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in TaintFlowGraph.reportTaintedFlow at line 1363. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/TaintFlowGraph.php\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":"src/Psalm/Internal/Codebase/TaintFlowGraph.php"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae19cdd4084a6b007e617834ca6f791d091e6786c72e6cf826eb473af1b3565"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/AssertionReconciler.php: src/Psalm/Internal/Type/AssertionReconciler.php changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in AssertionReconciler.filterAtomicWithAnother at line 1154. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/AssertionReconciler.php\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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb45cff177c59408a34fe12b422a7fd04c44749e8098dfef6799841872ffa82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in InstancePropertyFetchAnalyzer.analyze at line 69. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"662dd5982596aedc66d439a76658745b68cedd5dd00f51e4b8e042286357805d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/Methods.php: src/Psalm/Internal/Codebase/Methods.php changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in Methods.getMethodReturnType at line 629. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/Methods.php\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":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db5c8bd2c97d415ce7bae11a5c451d4be2af4ef0f7f73dc1b3fe99cbaab48c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php: src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in FunctionLikeDocblockParser.parse at line 63. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php\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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e4f4607172a9a450afe86db88239b34b752654252d673c15323090d8c13940"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in CallAnalyzer.applyAssertionsToContext at line 951. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"943112c41661088715eb8dfe3ecf128322f03288996359141c5d20c84a1dce2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in ExistingAtomicMethodCallAnalyzer.analyze at line 74. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc417f4ce2047161fb9829070333035c475719be4a3cf727208a9bcf55ded31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php: src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in TemplateStandinTypeReplacer.handleTemplateParamStandin at line 735. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php\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":"src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd7fad26f70f811a0edb978677f516d1f49ea930c63ff59db962418bf8408b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/MethodCallAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/MethodCallAnalyzer.php changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in MethodCallAnalyzer.analyze 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/MethodCallAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/MethodCallAnalyzer.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"280a613fe335cb8f8dcbde8407e563ad0aede66761c1837afb050441c9f50aee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/ClosureAnalyzer.php: src/Psalm/Internal/Analyzer/ClosureAnalyzer.php changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in ClosureAnalyzer.analyzeExpression at line 332. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/ClosureAnalyzer.php\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":"src/Psalm/Internal/Analyzer/ClosureAnalyzer.php"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"16080e5eb583243b12d5cce8ff5b502af8cc5fc1b7e9ac5c1e02dde24f2d51f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in IfAnalyzer.analyze at line 60. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8617f4cbf29a1ece5a2a6cedef786ae42eba5e72b7aa2b5c693be96ab8239456"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/SimpleAssertionReconciler.php: src/Psalm/Internal/Type/SimpleAssertionReconciler.php changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in SimpleAssertionReconciler.reconcileTruthyOrNonEmpty at line 3051. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/SimpleAssertionReconciler.php\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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":3051}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72ae56f68a0a12649c26c09615060639ee65012b0ed975619e4540d33f7385e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/Functions.php: src/Psalm/Internal/Codebase/Functions.php changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in Functions.getCallMapFunctionCapabilities at line 458. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/Functions.php\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":"src/Psalm/Internal/Codebase/Functions.php"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b953cb90ab2f0146b949725b86324f3c8626719ebfe81f2ebd3823b823fc4af8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/TaintFlowResolution.php: src/Psalm/Internal/Codebase/TaintFlowResolution.php changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in TaintFlowResolution.getNextOpenAssignments at line 1380. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/TaintFlowResolution.php\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":"src/Psalm/Internal/Codebase/TaintFlowResolution.php"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f581848d8412586698d4e7190d57430eebb19e5a41f24124a1cf98788a94ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Codebase.php: src/Psalm/Codebase.php changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Codebase.getCompletionItemsForClassishThing at line 2366. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Codebase.php\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":"src/Psalm/Codebase.php"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4edeaf19356ab6566c15eed5ed3b8ab68997a7cd22f1466a8d7333adc7323f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/NegatedAssertionReconciler.php: src/Psalm/Internal/Type/NegatedAssertionReconciler.php changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in NegatedAssertionReconciler.reconcile at line 57. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/NegatedAssertionReconciler.php\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":"src/Psalm/Internal/Type/NegatedAssertionReconciler.php"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcedfb37ff3e303d048af90cbf445439560d1d6eb5a311203e0d326af0fefcff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/IssueBuffer.php: src/Psalm/IssueBuffer.php changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in IssueBuffer.finish at line 748. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/IssueBuffer.php\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":"src/Psalm/IssueBuffer.php"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d90325e270f8796f168fcd5c7baf010795e8b1b1431850c1edc7553d104350"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php: src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in ClassLikeAnalyzer.checkFullyQualifiedClassLikeName at line 335. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php\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":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d9b92e9a530ef346973b09e20f2f224d06978278615d1410c97d9e6c38ad5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php: src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in CallableTypeComparator.isContainedBy at line 58. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php\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":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1d929288ba7d959d766ae466397591d2917a403490294c333e2438333a200d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in CastAnalyzer.analyze at line 89. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadb80f3460526c166d83038d64a9bcf8c8d2dfc2e5c8e4b17349ae0553fe063"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in NamedFunctionCallHandler.handle at line 75. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NamedFunctionCallHandler.php"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae01f93fcf26cf6e3167d5047f8f0063a44ab42ecb42004db768bb359a2aa35d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in ArrayAnalyzer.analyzeArrayItem at line 365. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5aa8efef044725b5d141a475c6b0ac4222f9976b52349a4a6ac363d9e0b646"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in TernaryAnalyzer.analyze at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3846eef56cfd222b5d4ed5c969ad97d6f0846d207a95d0776952b459a6d76086"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Algebra.php: src/Psalm/Internal/Algebra.php changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in Algebra.simplifyCNF at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Algebra.php\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":"src/Psalm/Internal/Algebra.php"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb765d693791617ea36e191ea3c16a361a6590ba02f726ca77092ae09114a60b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in BinaryOpAnalyzer.analyze 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"462c7ff49748b1154cd38cdd77dda8ac9f36fec62516b7b019a4138dc102a7d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Cli/Psalm.php: src/Psalm/Internal/Cli/Psalm.php changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Psalm.run at line 194. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Cli/Psalm.php\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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a37f921bbec350fb3e0369b9161d05ed95b5f95369b28527d8371bc33156a81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Type.php: src/Psalm/Type.php changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in Type.intersectAtomicTypes at line 1037. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Type.php\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":"src/Psalm/Type.php"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"491405f90966fc45dd1c93aec97838a5972f247019c06fbd164fd950ee3230e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in ArrayFunctionArgumentsAnalyzer.handleSplice at line 368. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f770ed27b4dfda79b8562e576ce4efa4aaac90a8f9b09833d0cdfffb7a57a86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Type/Atomic.php: src/Psalm/Type/Atomic.php changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in Atomic.createInner at line 185. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Type/Atomic.php\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":"src/Psalm/Type/Atomic.php"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7083ae01d3dbe7324443ad53bd6785e0b8ba318e934a7403f157a9180ba16adb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Cli/Psalter.php: src/Psalm/Internal/Cli/Psalter.php changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in Psalter.run at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Cli/Psalter.php\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":"src/Psalm/Internal/Cli/Psalter.php"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5134b9d65493aaeccc9188290c98437ae7526d5c69b3876069663f8be37927c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in ElseIfAnalyzer.analyze at line 128. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7a44c8d139d5f5e6ff244cbba961f092e9ad889172a27db26a0d741d0220cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/TypeTokenizer.php: src/Psalm/Internal/Type/TypeTokenizer.php changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in TypeTokenizer.tokenize at line 142. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/TypeTokenizer.php\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":"src/Psalm/Internal/Type/TypeTokenizer.php"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"78823f19622f077e3ca947ab57eb0442b9aae0323d2f3e3447dcc005d2ea7f10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/ConstantTypeResolver.php: src/Psalm/Internal/Codebase/ConstantTypeResolver.php changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in ConstantTypeResolver.resolve at line 120. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/ConstantTypeResolver.php\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":"src/Psalm/Internal/Codebase/ConstantTypeResolver.php"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc72ff1eda608d23758e46a2d8a858144433ec5e66b47c4944969cdd2446358"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/AndAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/AndAnalyzer.php changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in AndAnalyzer.analyze at line 41. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/AndAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/AndAnalyzer.php"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e16ba4fc019007c3582fc3ea27c61209691b1514ea746eadcb5fb6a6b56a6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/Comparator/ScalarTypeComparator.php: src/Psalm/Internal/Type/Comparator/ScalarTypeComparator.php changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 202 in ScalarTypeComparator.isContainedBy at line 55. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/Comparator/ScalarTypeComparator.php\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":"src/Psalm/Internal/Type/Comparator/ScalarTypeComparator.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6483c97e84f11133efa5193200dde12480b8ecaafee8901d2e7d2a18c9e34104"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php: src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in SimpleNegatedAssertionReconciler.reconcile at line 85. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php\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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19bf309e20d66b30cc452f9f284db605cb3e02758110e17f35654dfe022ba3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/ScopeAnalyzer.php: src/Psalm/Internal/Analyzer/ScopeAnalyzer.php changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in ScopeAnalyzer.getControlActions at line 44. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/ScopeAnalyzer.php\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":"src/Psalm/Internal/Analyzer/ScopeAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"75abf0c3e3ace226875d8cc88c0283ddc73d8683019786cd0092135c1aca02fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/CliUtils.php: src/Psalm/Internal/CliUtils.php changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in CliUtils.getPathsToCheck at line 462. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/CliUtils.php\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":"src/Psalm/Internal/CliUtils.php"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"546e1331a59358845021f296d9ec227978cb83d51ab2730fbc359fec04d27fca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in ConcatAnalyzer.analyze at line 239. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cca69c72bb7afc502e17dc86f971541c4a89764ae52c0c388126ab774add2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/ParseTreeCreator.php: src/Psalm/Internal/Type/ParseTreeCreator.php changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in ParseTreeCreator.create at line 72. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/ParseTreeCreator.php\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":"src/Psalm/Internal/Type/ParseTreeCreator.php"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc0dbdac05e3d1ab5154794aa7bb8a6a564b8d70c15f194a2909762d66f6b4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/Analyzer.php: src/Psalm/Internal/Codebase/Analyzer.php changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in Analyzer.loadCachedResults at line 419. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/Analyzer.php\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":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee171e36d79d9ccdf14b5ab2a4197c5379ab42143f1f51a6b26b79fcb14fc66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in ElseAnalyzer.analyze at line 40. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9193c5b9d2b3b886beb818d1f1a514d3a16124b6abf38438dda2deabef088e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php: src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in TemplateInferredTypeReplacer.replace at line 58. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php\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":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff7b02608ffc9d00b43b6ec5a4fd276ad69c7034612cae83d2178a60d5dacb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in DoAnalyzer.getUnsureBounds at line 338. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Block/DoAnalyzer.php"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9c674c8969fa551520cbcdb94b8bf6af6cc6bcbdc50d5a62ea03503d5c0a2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/InternalCallMapHandler.php: src/Psalm/Internal/Codebase/InternalCallMapHandler.php changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in InternalCallMapHandler.getMatchingCallableFromCallMapOptions at line 134. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/InternalCallMapHandler.php\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":"src/Psalm/Internal/Codebase/InternalCallMapHandler.php"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2261812059f20fb5578f4614ce4b0cf0c3c945776e4518e1acc01b01fe7aeeb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php: src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in ExpressionResolver.getUnresolvedClassConstExpr at line 74. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php\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":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionResolver.php"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1641706342612b1349e2554fa58f4c3445ee6bc104ba7fd0ff4e2d769b78d12e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/OrAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/OrAnalyzer.php changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in OrAnalyzer.analyze at line 44. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/OrAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/OrAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa25f75f0a62bb8a3ce4fabe3163612d37a8b398f7838c1079ca8c2b8b2256a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/MatchAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/MatchAnalyzer.php changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in MatchAnalyzer.analyze at line 55. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/MatchAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/MatchAnalyzer.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc5868601267c8beeae768050cab123bf6fd86f7a99d5b130944b1fdfaf4c15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/Scanner.php: src/Psalm/Internal/Codebase/Scanner.php changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Scanner.scanFile at line 693. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/Scanner.php\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":"src/Psalm/Internal/Codebase/Scanner.php"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea61aa7474d8010563b07e31476fe498e86c715d3106447e5c6a9d7b56734b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php: src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 128 in SimpleTypeInferer.infer at line 53. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9880adda157590ecd3eed4f946e89281ecebd9961ce23e6ed2fcb4a311a2d83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in StaticPropertyFetchAnalyzer.analyze at line 49. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abc859763b1b4cb574db115d080a6a171e19e064e4834e789f6025f78f15b38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in BreakAnalyzer.analyze at line 26. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/BreakAnalyzer.php"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4614763c53b2a2587a22a9ee21e44427c697caf6318d3b297643212108c86dd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/ExpressionIdentifier.php: src/Psalm/Internal/Analyzer/Statements/Expression/ExpressionIdentifier.php changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in ExpressionIdentifier.getExtendedVarId at line 160. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/ExpressionIdentifier.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ExpressionIdentifier.php"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5374d2983fd5185d4b4a5fe4c112ec6bfd3fde075560cd6ec2bbb2c5e8bc63f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in ExpressionAnalyzer.handleExpression at line 241. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/ExpressionAnalyzer.php"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4147835e7bdae8cb4286584bb736167a54330d91eca43c92e759f8eda237ddc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/TypeVisitor/TypeChecker.php: src/Psalm/Internal/TypeVisitor/TypeChecker.php changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in TypeChecker.checkGenericParams at line 342. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/TypeVisitor/TypeChecker.php\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":"src/Psalm/Internal/TypeVisitor/TypeChecker.php"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a727c550d8ea2c1fe1c14d8971c0f75a0949f84a9d5730ec5baac25bd74516a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php: src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in FunctionDocblockManipulator.__construct at line 125. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php\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":"src/Psalm/Internal/FileManipulation/FunctionDocblockManipulator.php"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"08647fe0ca1115ed919bd384419c6a804184ccb3c7e265e6e8ada00159fba06f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/GlobalAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/GlobalAnalyzer.php changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in GlobalAnalyzer.analyze at line 50. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/GlobalAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/GlobalAnalyzer.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdeb31b53bce6e7739bafd3b99260826473c9bd9331535e6c3de90d296c2991c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/CommentAnalyzer.php: src/Psalm/Internal/Analyzer/CommentAnalyzer.php changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in CommentAnalyzer.splitDocLine at line 299. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/CommentAnalyzer.php\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":"src/Psalm/Internal/Analyzer/CommentAnalyzer.php"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a789a890648ce76bb6833c00ff72ee788b21e6a0fcf4e4aaf644c3b69a0dd7ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/FileAnalyzer.php: src/Psalm/Internal/Analyzer/FileAnalyzer.php changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in FileAnalyzer.analyze at line 119. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/FileAnalyzer.php\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":"src/Psalm/Internal/Analyzer/FileAnalyzer.php"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f3626c445a8b049d303513f8d454189aa57700188e3b60a37109cb7b24fc9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in IncludeAnalyzer.analyze at line 60. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/IncludeAnalyzer.php"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f49e183e5a98b428a9a99e84ee9f57ff1ccd93305fa4d95e262cdb054d72b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/TaintStore.php: src/Psalm/Internal/Codebase/TaintStore.php changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in TaintStore.getKnownStart at line 466. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/TaintStore.php\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":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a527a7a621b26d397f559e552cbb8e10d99f0e3e31a10d0eaeeb9064717ad60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ArrayMapReturnTypeProvider.getFunctionReturnType at line 78. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMapReturnTypeProvider.php"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"192d33bf4e9028abdee5022e50efa8c193dc7d497327210d2a1412419517aaf0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Cache.php: src/Psalm/Internal/Cache.php changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Cache.consolidate at line 196. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Cache.php\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":"src/Psalm/Internal/Cache.php"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10eb713d21a579e826b8c41e60a9284ae034550ba75fcea5886f432dc8c418d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in IfConditionalAnalyzer.analyze at line 46. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Block/IfConditionalAnalyzer.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a464aa4261d50cfdaecc22b8c59b270b02d2e3b95784dd743c590d8d05f633d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/ClassTemplateParamCollector.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/ClassTemplateParamCollector.php changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in ClassTemplateParamCollector.collect at line 37. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/ClassTemplateParamCollector.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ClassTemplateParamCollector.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e5b9d14ccfcd78184f48ddf978468a40c4d7d8e5a3ecb83c2b07e89447ced3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in MissingMethodCallHandler.overloadAcceptsArgs at line 666. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"102d39e0c7f9210e8866e26e0741f241951100d5fbd7c8d1ef17eb780828208e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/AlgebraAnalyzer.php: src/Psalm/Internal/Analyzer/AlgebraAnalyzer.php changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in AlgebraAnalyzer.checkForParadox at line 307. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/AlgebraAnalyzer.php\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":"src/Psalm/Internal/Analyzer/AlgebraAnalyzer.php"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1a147af612f914160c8e696670fa7270a016c0acf03f9292e7cd492653242b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Cli/Refactor.php: src/Psalm/Internal/Cli/Refactor.php changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in Refactor.run at line 69. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Cli/Refactor.php\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":"src/Psalm/Internal/Cli/Refactor.php"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23852adbe27b38fc20839bb5a44353cb52ce2184260659f27cbd69de75f480c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/CoalesceAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/CoalesceAnalyzer.php changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in CoalesceAnalyzer.analyze 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/CoalesceAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/CoalesceAnalyzer.php"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bcab58d7868998ed90632b54c5e1a1f90e42f8e9069b6399407fde974b6737"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMergeReturnTypeProvider.php: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMergeReturnTypeProvider.php changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in ArrayMergeReturnTypeProvider.getFunctionReturnType at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMergeReturnTypeProvider.php\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMergeReturnTypeProvider.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"455d66c97b5cced4f0f471222c409d86fd389f08b54932aab393a3e85b50a6bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/UnsetAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/UnsetAnalyzer.php changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in UnsetAnalyzer.replaceElement at line 345. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/UnsetAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/UnsetAnalyzer.php"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"381f1b02e8caa9d02decd39a359de2e9df6c383480a05c851c81646eaa8251b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/Reflection.php: src/Psalm/Internal/Codebase/Reflection.php changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Reflection.registerClass at line 72. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/Reflection.php\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":"src/Psalm/Internal/Codebase/Reflection.php"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d8da45db0097076d78dcfe7f2c9f844c8e859e9560046acea523c9884303a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in ArrayColumnReturnTypeProvider.getFunctionReturnType at line 58. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6253abe42aea11944f3d184f75c1b09dda11392727123693c4f5d3d479f131de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Block/SwitchAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Block/SwitchAnalyzer.php changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in SwitchAnalyzer.analyze 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Block/SwitchAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Block/SwitchAnalyzer.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bf96e3104306603a093691a9741013bc58e7cb3a51df12fcd697dfffc370b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/StaticPropertyAssignmentAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/StaticPropertyAssignmentAnalyzer.php changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in StaticPropertyAssignmentAnalyzer.analyze at line 46. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/StaticPropertyAssignmentAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/StaticPropertyAssignmentAnalyzer.php"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7177a8825cdb8ba2b336cf5f7ebd011be7c931cd97290130980e922c9c5b5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/CloneAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/CloneAnalyzer.php changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in CloneAnalyzer.analyzeClonedType at line 233. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/CloneAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/CloneAnalyzer.php"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"191eb6a5ae29d663f36d1a044f6ebe65fe8dd6309a2619121c5946d92f575646"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFilterReturnTypeProvider.php: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFilterReturnTypeProvider.php changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in ArrayFilterReturnTypeProvider.getFunctionReturnType at line 56. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFilterReturnTypeProvider.php\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFilterReturnTypeProvider.php"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b7001e2fcae5582ae7c45152a3d29f6132cbfa0d46ddce21e6f59fd1010403"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/EncapsulatedStringAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/EncapsulatedStringAnalyzer.php changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in EncapsulatedStringAnalyzer.analyze at line 37. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/EncapsulatedStringAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/EncapsulatedStringAnalyzer.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d219084f24c0cec34ae4f8353ee47bfd786e253b0066dad0b353c86316b37c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Cli/LanguageServer.php: src/Psalm/Internal/Cli/LanguageServer.php changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in LanguageServer.run at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Cli/LanguageServer.php\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":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc8d3518b3ad1a405a64378d28ae60b9827bf837e82a76688c139d191e75f4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/SourceAnalyzer.php: src/Psalm/Internal/Analyzer/SourceAnalyzer.php changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in SourceAnalyzer.signalMutationOnlyInferred at line 246. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/SourceAnalyzer.php\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":"src/Psalm/Internal/Analyzer/SourceAnalyzer.php"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3ec6f8cc2401e0b7b2c8e11020b44dfb566a1d0bbb552b88e82c53386d68ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/PhpVisitor/Reflector/TypeHintResolver.php: src/Psalm/Internal/PhpVisitor/Reflector/TypeHintResolver.php changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in TypeHintResolver.resolve at line 78. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/PhpVisitor/Reflector/TypeHintResolver.php\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":"src/Psalm/Internal/PhpVisitor/Reflector/TypeHintResolver.php"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8450b287d1f5696edd2b9ec6951724251b1b35d439af78b3904376264790d750"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/CodeLocation.php: src/Psalm/CodeLocation.php changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in CodeLocation.calculateRealLocation at line 248. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/CodeLocation.php\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":"src/Psalm/CodeLocation.php"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f468bd510a5c7c41e398bd44ce45ef31edf920c03d54c12d50e348f9b1fbb0aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ConstFetchAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ConstFetchAnalyzer.php changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ConstFetchAnalyzer.getConstType at line 315. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ConstFetchAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ConstFetchAnalyzer.php"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8009a98a07fe34d2e12e955cd000caedc39c843b3ef538e9e7cebcaacdfc345"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php: src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in ExpressionScanner.registerClassMapFunctionCall at line 204. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php\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":"src/Psalm/Internal/PhpVisitor/Reflector/ExpressionScanner.php"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7fd19f47c8b5d488b79e696e7b67a2942a7aef5e08c29c191ee481851b6557"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/CodeUseGraph.php: src/Psalm/Internal/Codebase/CodeUseGraph.php changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in CodeUseGraph.reach at line 720. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/CodeUseGraph.php\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":"src/Psalm/Internal/Codebase/CodeUseGraph.php"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"788e258eecc229c33515a32c0fecbe2376d7d0b43686e904fad587e4927e8801"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/AttributesAnalyzer.php: src/Psalm/Internal/Analyzer/AttributesAnalyzer.php changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in AttributesAnalyzer.analyze at line 58. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/AttributesAnalyzer.php\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":"src/Psalm/Internal/Analyzer/AttributesAnalyzer.php"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"556f237a03c07f45eafecb50a412a253e6a376fdc3c0f85a98acd90c795d2d9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/InterfaceAnalyzer.php: src/Psalm/Internal/Analyzer/InterfaceAnalyzer.php changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in InterfaceAnalyzer.analyze at line 44. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/InterfaceAnalyzer.php\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":"src/Psalm/Internal/Analyzer/InterfaceAnalyzer.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"858024aaa423e614d96812dd108c65f4b019c4815347778d174bd28b60797b25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/TypeVariableTracker.php: src/Psalm/Internal/Type/TypeVariableTracker.php changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in TypeVariableTracker.reconcileLowerBoundsWithUpperBounds at line 246. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/TypeVariableTracker.php\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":"src/Psalm/Internal/Type/TypeVariableTracker.php"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6659378fe6ed0a1ef109bcf7eddc5931b2f8e4558b33e32ccb2d63f9aea78d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/NullsafeAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/NullsafeAnalyzer.php changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in NullsafeAnalyzer.analyze at line 66. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/NullsafeAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/NullsafeAnalyzer.php"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f736c6a7a5cc6f648c680717f9169d6fdc2b76523ecf5f9f05103226ec48361"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Provider/StatementsProvider.php: src/Psalm/Internal/Provider/StatementsProvider.php changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in StatementsProvider.getStatementsForFile at line 113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/StatementsProvider.php\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":"src/Psalm/Internal/Provider/StatementsProvider.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f21c7c23516b807c1ee9cbc1c88457cd25fc51b4227c819304eb5333606a772"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in PartialApplicationAnalyzer.analyze at line 63. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a54841ed62f7a00b325bf667058573057eb19c4df13882688df13d43d20b2fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Clause.php: src/Psalm/Internal/Clause.php changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Clause.calculateNegation at line 292. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Clause.php\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":"src/Psalm/Internal/Clause.php"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"df022cbc6901036795ecc00acbf5d514fc04028815a65a4f0284561a41bc005d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php: src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ReceiverPropertyTaints.taintCall at line 173. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php\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":"src/Psalm/Internal/Codebase/ReceiverPropertyTaints.php"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b6d5fe41ad91271b1b0557a1f1c518a22a559193da621dbcfd9314472f8b25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in YieldAnalyzer.analyze at line 37. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c608c467f009c7dab24fe564f6764498e785ab4346505b3dab590f336ad30fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/InheritedMethodTaints.php: src/Psalm/Internal/Analyzer/InheritedMethodTaints.php changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in InheritedMethodTaints.getBodySuffix at line 45. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/InheritedMethodTaints.php\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":"src/Psalm/Internal/Analyzer/InheritedMethodTaints.php"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fcd9f0237bca80574016a178c389593710e5e6c88d32980e52a26ca0e70ec3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php: src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in GenericTypeComparator.isContainedBy at line 26. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php\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":"src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb7274d8b242da77c5c4442c2d2e588fa867ed5c08b333a53e233d0e9ac8673"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/ContinueAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/ContinueAnalyzer.php changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ContinueAnalyzer.analyze at line 24. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/ContinueAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/ContinueAnalyzer.php"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fb3717308502466a9a207053686d08baf37ffde3124fcc27d2cf968a92d4b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFirstLastReturnTypeProvider.php: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFirstLastReturnTypeProvider.php changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ArrayFirstLastReturnTypeProvider.getElementType at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFirstLastReturnTypeProvider.php\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFirstLastReturnTypeProvider.php"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cdc788fe033749da17f339ed72fd106c4ec9f790d6464a89930f4f68f53400"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/NamespaceAnalyzer.php: src/Psalm/Internal/Analyzer/NamespaceAnalyzer.php changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NamespaceAnalyzer.collectAnalyzableInformation at line 55. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/NamespaceAnalyzer.php\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":"src/Psalm/Internal/Analyzer/NamespaceAnalyzer.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee65844758254757237dbcbd30f7cb8ef763bb6864f04b86149797b33a4b1cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Cli/Review.php: src/Psalm/Internal/Cli/Review.php changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Review.run at line 68. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Cli/Review.php\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":"src/Psalm/Internal/Cli/Review.php"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d03ef3432192b1cb08a19b84368e2126fd2da5faf43da35f0aacef4edbfbb56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/BitwiseNotAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/BitwiseNotAnalyzer.php changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in BitwiseNotAnalyzer.analyze at line 34. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/BitwiseNotAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BitwiseNotAnalyzer.php"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c9934d1dad930f22391171ec678eab6d720360157af5c3fec9e22f914322ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/NonComparisonOpAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/NonComparisonOpAnalyzer.php changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in NonComparisonOpAnalyzer.analyze at line 23. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/NonComparisonOpAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/NonComparisonOpAnalyzer.php"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"34af3f84c5ee30286fac27c38d4a4e41061bed284c6463175fc4afb13254ef2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/ThrowAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/ThrowAnalyzer.php changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ThrowAnalyzer.analyze 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/ThrowAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/ThrowAnalyzer.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5164c35951e474dcd543bfb4dd297ec7a10e651c58c2ac885f937b3730d9e262"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php: src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in StringStartScanner.getReturnStart at line 364. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php\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":"src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7c52ccfa33f951d4469e9cc80cc26ef7dd1d81d09983c9264a051fb439e186"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/PhpVisitor/AssignmentMapVisitor.php: src/Psalm/Internal/PhpVisitor/AssignmentMapVisitor.php changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in AssignmentMapVisitor.enterNode at line 45. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/PhpVisitor/AssignmentMapVisitor.php\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":"src/Psalm/Internal/PhpVisitor/AssignmentMapVisitor.php"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c77608ef74e32eda04501426f65655ccb56db7e5a506fa43ccb0449a715fbd7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Provider/ReturnTypeProvider/ImplodeReturnTypeProvider.php: src/Psalm/Internal/Provider/ReturnTypeProvider/ImplodeReturnTypeProvider.php changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in ImplodeReturnTypeProvider.getFunctionReturnType at line 50. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ReturnTypeProvider/ImplodeReturnTypeProvider.php\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ImplodeReturnTypeProvider.php"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14b438fb922766333801163bd932cbb39326c676565d65e97508cba1c1e467f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Provider/FileReferenceProvider.php: src/Psalm/Internal/Provider/FileReferenceProvider.php changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in FileReferenceProvider.loadReferenceCache at line 278. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/FileReferenceProvider.php\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":"src/Psalm/Internal/Provider/FileReferenceProvider.php"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b7c864cc456d21658504be006908b706405fa2b0cc4b1622ceaa142ca8e57f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/AtomicParts.php: src/Psalm/Internal/Type/AtomicParts.php changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AtomicParts.split at line 53. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/AtomicParts.php\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":"src/Psalm/Internal/Type/AtomicParts.php"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e9f6b604d935a7b8c5e839a6793d37c03ad0e5b7c5923ea2a819f03ef02d21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Codebase/TaintFlowAnnotation.php: src/Psalm/Internal/Codebase/TaintFlowAnnotation.php changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TaintFlowAnnotation.parse at line 115. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/TaintFlowAnnotation.php\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":"src/Psalm/Internal/Codebase/TaintFlowAnnotation.php"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d9b53be20c2e6fee43225d4649c0993e57ee0b2da72961c1f3d8f6c3baccaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodVisibilityAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodVisibilityAnalyzer.php changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in MethodVisibilityAnalyzer.analyze at line 31. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodVisibilityAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodVisibilityAnalyzer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc205f6be7513558a38908ba6b89b489f5531499239d0ad843f857782f19d198"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReplaceRecursiveReturnTypeProvider.php: src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReplaceRecursiveReturnTypeProvider.php changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ArrayReplaceRecursiveReturnTypeProvider.replaceArray at line 179. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReplaceRecursiveReturnTypeProvider.php\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReplaceRecursiveReturnTypeProvider.php"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1494cda7c5dc4da1217e0c6697bbeafbb0bf769d2f3a73811d46bea60300deb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php: src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in KeyedArrayComparator.coerceToObjectWithProperties at line 351. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php\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":"src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"579606a9371fe1c73a08bf1e524c4381ab29c2dcd6a6ae3378c33ead8d6b613b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/DestructorAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/DestructorAnalyzer.php changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in DestructorAnalyzer.getHeldType at line 123. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/DestructorAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/DestructorAnalyzer.php"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f30ecc171954a246496a3c24d06b6b24ef32849cdcede253db4d7844c3be4d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: examples/plugins/TaintSqlTables.php: examples/plugins/TaintSqlTables.php changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in TaintSqlTables.afterExpressionAnalysis at line 27. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- examples/plugins/TaintSqlTables.php\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":"examples/plugins/TaintSqlTables.php"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"926173cd027becbe7b83d7bdaa7d03b3b65f5d33a7a25637169b7d64b6423d7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/InstanceofAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/InstanceofAnalyzer.php changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in InstanceofAnalyzer.analyze at line 27. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/InstanceofAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/InstanceofAnalyzer.php"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb52d17d8c5421decbf95694f6cbd38dc40181a9f4634c7a4ec1971ef57b0a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/IssetGuardedProperties.php: src/Psalm/Internal/Analyzer/IssetGuardedProperties.php changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in IssetGuardedProperties.walk at line 68. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/IssetGuardedProperties.php\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":"src/Psalm/Internal/Analyzer/IssetGuardedProperties.php"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f552a5b8f2c920672b1f5ef60054cca5d9607f66ac5fbf8db16b6bafeb4ea918"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/MagicConstAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/MagicConstAnalyzer.php changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in MagicConstAnalyzer.analyze at line 31. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/MagicConstAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/MagicConstAnalyzer.php"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59b3f395276955424ce099c13f037b6a947a5e9f1dac7ca0f900ea0ccf86be1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Analyzer/Statements/Expression/IntMaskComparisonAnalyzer.php: src/Psalm/Internal/Analyzer/Statements/Expression/IntMaskComparisonAnalyzer.php changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in IntMaskComparisonAnalyzer.analyzeBinaryOp at line 43. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/Statements/Expression/IntMaskComparisonAnalyzer.php\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":"src/Psalm/Internal/Analyzer/Statements/Expression/IntMaskComparisonAnalyzer.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6efa8ae8d40d711981089d94a27da3d2e39d3ee74466b601180fe751332a90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Psalm/Internal/Provider/ReturnTypeProvider/ClosureReturnTypeProvider.php: src/Psalm/Internal/Provider/ReturnTypeProvider/ClosureReturnTypeProvider.php changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ClosureReturnTypeProvider.getMethodReturnType at line 37. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ReturnTypeProvider/ClosureReturnTypeProvider.php\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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ClosureReturnTypeProvider.php"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdd1a2d6336bb4008cf53ec0ae817c4fd4d669d48edbd010adf077b2e9fee5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Internal/Provider/ClassLikeStorageProvider.php: src/Psalm/Internal/Provider/ClassLikeStorageProvider.php changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is ClassLikeStorageProvider.addMore at line 118), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(language-server): keep consolidated cache entries when evicting storages #13779\u201D; \u201Cfix(language-server): evict class storage cache entries by the removed file #13779\u201D; \u201Cfix(language-server): drop cached storages that reloadFiles() removes #13779\u201D; \u201CFix: warm-cache crash when a file is reached under two spellings of its path\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ClassLikeStorageProvider.php\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":"src/Psalm/Internal/Provider/ClassLikeStorageProvider.php"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa4f51d61770f2489734efc9825a30e714aa2b8abd69207ed07d754bebb7997"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Internal/Provider/FileStorageProvider.php: src/Psalm/Internal/Provider/FileStorageProvider.php changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is FileStorageProvider.has at line 65), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(language-server): keep consolidated cache entries when evicting storages #13779\u201D; \u201Cfix(language-server): drop cached storages that reloadFiles() removes #13779\u201D; \u201CFix: warm-cache crash when a file is reached under two spellings of its path\u201D; \u201Cfix: remove only the class-like storages exhumed for the rescanned file\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/FileStorageProvider.php\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":"src/Psalm/Internal/Provider/FileStorageProvider.php"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c171ad81f0c395ace9fc67c36208be4b9c60dc03cfee585a5c061aeb77a03a9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Internal/Codebase/MixinLookup.php: src/Psalm/Internal/Codebase/MixinLookup.php changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is MixinLookup.find at line 122), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mixins): trait self/static, magic member reachability, deprecated 7.5.0 members\u201D; \u201Cfix(mixins): a static call goes to a non-generic mixin, through a generic one to the class\u201D; \u201Cfix(mixins): static calls go through the instance call, provider methods of the class first\u201D; \u201Cfix(mixins): a static call by class name binds static to that class\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Codebase/MixinLookup.php\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":"src/Psalm/Internal/Codebase/MixinLookup.php"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a23e89984e8742f09351890bff9dbd6c79c97b60ebebdc7fbe8a48e4d175efe"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Internal/Analyzer/TraitAnalyzer.php: src/Psalm/Internal/Analyzer/TraitAnalyzer.php changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is TraitAnalyzer.analyze at line 73), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mixins): trait self/static, magic member reachability, deprecated 7.5.0 members\u201D; \u201Cfix(mixins): keep shared scopes bound to the class, check trait mixins\u201D; \u201Cfix: report the scan-time issues of a file when it is analysed, whatever the early returns of the analysis\u201D; \u201Cfix: report the issues found while scanning when the analysis skips the file or the trait is unused\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Analyzer/TraitAnalyzer.php\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":"src/Psalm/Internal/Analyzer/TraitAnalyzer.php"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c7cdc709b3bccf5f6e672b8c7d1ac4a92df3dd7da8e52f68ce636019c0a346"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Internal/Provider/ClassLikeStorageCacheProvider.php: src/Psalm/Internal/Provider/ClassLikeStorageCacheProvider.php changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ClassLikeStorageCacheProvider.__construct at line 29), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(language-server): keep consolidated cache entries when evicting storages #13779\u201D; \u201Cfix(language-server): drop cached storages that reloadFiles() removes #13779\u201D; \u201Cfix(populator): inherit parent @var of a redeclared property #6575\u201D; \u201CFix: warm-cache crash when a file is reached under two spellings of its path\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ClassLikeStorageCacheProvider.php\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":"src/Psalm/Internal/Provider/ClassLikeStorageCacheProvider.php"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf91bcf9935a0016366ef7165adf73fa352c99de5096734823490d31bfa76082"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Storage/Possibilities.php: src/Psalm/Storage/Possibilities.php changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is Possibilities.getUntemplatedCopy at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(assert): self of a trait assertion is the class the method appears in, at any depth, for every call #6165\u201D; \u201Cfix(assertions): resolve static in an assertion to the receiver type with its template arguments #6164\u201D; \u201Cfix(assertions): inherit assert-if-true/false from an overridden method and resolve static to the called class #6164\u201D; \u201Cfix(assert): resolve self in an assertion of a trait method to the class using it #6165\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Storage/Possibilities.php\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":"src/Psalm/Storage/Possibilities.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"870a8bfad9f9303014868a65ccdfa3740cb135ccf0c38be4c20aecd19c916eb6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Internal/Type/TemplateDefaults.php: src/Psalm/Internal/Type/TemplateDefaults.php changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is TemplateDefaults.parseDefaults at line 383), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(templates): mark TemplateDefaults::getUsedTemplates pure #5407\u201D; \u201Cfix(templates): check method defaults in their class and report undefined classes #5407\u201D; \u201Cfix(templates): resolve key-of and value-of of earlier templates in defaults #5407\u201D; \u201Cfix(templates): say \u0022at least N\u0022 when trailing purity templates may be left out #12446\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/TemplateDefaults.php\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":"src/Psalm/Internal/Type/TemplateDefaults.php"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c8df29056987b1ea3df98c7e83904ec76065a933f8439ab4a132f115f2f86d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Internal/FileManipulation/PropertyDocblockManipulator.php: src/Psalm/Internal/FileManipulation/PropertyDocblockManipulator.php changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is PropertyDocblockManipulator.getManipulationsForFile at line 199), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CMerge remote-tracking branch \u0027origin/master\u0027 into fix/6891-conditional-on-never\u201D; \u201Cfix(analysis): check property initialisation at every constructor return #5422\u201D; \u201Cfix(psalter): leave properties declared together alone instead of crashing #8636\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/FileManipulation/PropertyDocblockManipulator.php\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":"src/Psalm/Internal/FileManipulation/PropertyDocblockManipulator.php"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a91988573a55f88a43c7416dd4a01a72c897df80ecf2a3c5bda45af1b5795ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Internal/Provider/ParserCacheProvider.php: src/Psalm/Internal/Provider/ParserCacheProvider.php changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is ParserCacheProvider.loadStatementsFromCache at line 48), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix: cache reads crash while another worker rewrites the entry\u201D; \u201Cfix(cache): reanalyse files without a usable stored hash and reject truncated headers\u201D; \u201Cfix(cache): replay parse errors on a parser cache hit\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Provider/ParserCacheProvider.php\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":"src/Psalm/Internal/Provider/ParserCacheProvider.php"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"eceeb577b3f08dedcb0e324f5e6f8e943e2cfb5374f68d861a5e439dec0adc74"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Internal/Type/TemplateResult.php: src/Psalm/Internal/Type/TemplateResult.php changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is TemplateResult.__construct at line 64), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(types): set the call\u0027s static context only where it is known before the arguments #13488\u201D; \u201Cfix(types): keep the call\u0027s static context when merging template results #13488\u201D; \u201Cfix(types): decide param conditionals on static in callee scope #13488\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/Type/TemplateResult.php\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":"src/Psalm/Internal/Type/TemplateResult.php"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f241e541bf0dc16317d7694db9f2b8ea58a7fc5980ca9bbb536de7d0e4ecec0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Type/Atomic/TObjectWithProperties.php: src/Psalm/Type/Atomic/TObjectWithProperties.php changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is TObjectWithProperties.equals at line 206), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(isset): the narrowed property of an object shape is forgotten with the property fact #5077\u201D; \u201Cfix(types): only keep named objects next to an object with properties #3474\u201D; \u201Cfix(types): keep named objects and other shapes next to an object with properties #3474\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Type/Atomic/TObjectWithProperties.php\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":"src/Psalm/Type/Atomic/TObjectWithProperties.php"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"421f5f40bcb3fdc6ef4108c6e5d7ccc9903cd341d96d4de2c59d4020caca7ae9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Psalm/Internal/TypeVisitor/ContainsStaticVisitor.php: src/Psalm/Internal/TypeVisitor/ContainsStaticVisitor.php changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is ContainsStaticVisitor.enterNode at line 32), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(types): keep master\u0027s decision when a bound holds the declared static #13488\u201D; \u201Cfix(types): set the call\u0027s static context only where it is known before the arguments #13488\u201D; \u201Cfix(types): decide param conditionals on static in callee scope #13488\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 15:22:17 \u002B01:00\u0027 --until=\u00272026-11-17 15:22:17 \u002B01:00\u0027 --full-history --no-merges -- src/Psalm/Internal/TypeVisitor/ContainsStaticVisitor.php\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":"src/Psalm/Internal/TypeVisitor/ContainsStaticVisitor.php"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b615fd6587bbd9d1e220047e272db119ae418adb2164f1098b8dea13e2b5d31"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 37 significant file(s) lose their only recent owner: src/Psalm/Internal/Codebase/TaintFlowResolution.php, src/Psalm/Internal/Codebase/TaintStore.php, src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php, src/Psalm/Internal/Type/TypeVariableTracker.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/CallPurityResolver.php, src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReplaceRecursiveReturnTypeProvider.php, src/Psalm/Internal/Codebase/TaintFlowAnnotation.php (\u002B29 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7c0eed8bbd759e0dbc9e95040263da222132df0a60a33f571613a9b8dccf0a69"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 15 significant file(s) lose their only recent owner: src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php, src/Psalm/Internal/LanguageServer/Server/TextDocument.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMergeReturnTypeProvider.php, src/Psalm/Internal/Diff/ClassStatementsDiffer.php, src/Psalm/Type/Atomic/TObjectWithProperties.php, src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/CoalesceAnalyzer.php, src/Psalm/Config/IssueHandler.php, src/Psalm/Internal/Analyzer/Statements/Expression/ThrowAnalyzer.php (\u002B7 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"addb00e9eec80ff8fa23915e1de7f1810c4b2f8b8975f61f98dbe29b7737afeb"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 10 significant file(s) lose their only recent owner: src/Psalm/Internal/Provider/ParamsProvider/ArrayMultisortParamsProvider.php, src/Psalm/Internal/FileManipulation/FileManipulationBuffer.php, src/Psalm/Type/Atomic/TClassString.php, src/Psalm/Internal/Provider/FileStorageProvider.php, src/Psalm/Internal/IncludeCollector.php, src/Psalm/Config/CiCreator.php, src/Psalm/Internal/Type/TemplateResult.php, src/Psalm/Plugin/EventHandler/Event/MethodReturnTypeProviderEvent.php (\u002B2 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b54e4413d070a42fae7026d2434c1fc95a61a4f2e658362bd87d09b472c3dabc"}},{"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 (63 single-owned of 412 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; 412 of the 1318 production source files in this repository met that bar). They are anonymized user #4 (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: src/Psalm/Report/JunitReport.php."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve key type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ArrayFunctionCallTest.php"},"region":{"startLine":3480}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bd3389bf5ab377b1f7f0fa037a39c8ea21083855b624bc25f3602a3cf1560a"}},{"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":"tests/ArrayKeysTest.php"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1967e6f475dd5fed2551024c982c2db2d3adb8874f359c3172b06d8fbded04c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Waiting for https://github.com/vimeo/psalm/issues/7125"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ConstantTest.php"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"51643cb4d5d64bba7acbd3df79e572917f384c6fcf9e1596b1cdc717c43a5e06"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment repeated across 14 files: The identical HackComment appears in 14 files (14 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 14 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// hack to isolate Psalm from PHPUnit cli arguments\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ExtImagickStubTest.php"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d384e44879d3e314ad42f4af4651646f94ee7613dd748764075dd39eeebb6af6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack\u0027s expected-type propagation, not of its constraint solving, and \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/HackConformanceTranspiledTest.php"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0867fab729665312483abfc7ad7ecea79f08d73ec829994cc862b2c83968dcc4"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // (Hack: \u0022Expected Item ... But got mixed\u0022). \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/HackConformanceTranspiledTest.php"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d23dad09f36d28911cb9899478d3c8c94e3ba08bca5b2b1f1540198c53b78cd"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack to stop Psalm seeing the phpunit arguments \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ProjectCheckerTest.php"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"53607b19fdef2e300af0d6cc59ab0d76c20a2355de97de67c900c0b3338402ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The XML parser only return strings, all int value are casted, so the assertSame failed \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":"tests/ReportOutputTest.php"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"74652ccdc8e6054f271690d71f552f3823dee4c4872f8e5154b7ba7cb8af32a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The XML parser only return strings, all int value are casted, so the assertSame failed \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":"tests/ReportOutputTest.php"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"022ffc26e441b477575f5559db72e4ed8338b7e79ecd69fa8dfb75d241ec876f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: (\u0022Caught\u0022 . $e) does not 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":"tests/TaintTest.php"},"region":{"startLine":15508}}}],"partialFingerprints":{"codehealthFindingId/v1":"722bf10a364772d365d0f3cacf1f1937f5a79054c1d692b9dd4b202238690d6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO turn this into an InvalidDocblock with a better error message. This is difficult because 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":"tests/ValueOfTest.php"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"10484a67b04566b04978d40e7cbb535674ce7e40d068253ff8751fb57bb7a66a"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // (Hack reports the invariant \u0060nothing\u0060 mismatch, \u0022Expected nothing \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/Template/TypeVariableTest.php"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ac0e7a01c9e3076a24f10ac86055f878f13ccc7367ddd382c2eb48c699628e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack for Symfonys own argv resolution. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71471bf096cc40a576f0084ba874bf2bfb237776ecb176e0de766d56542d830"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO implement TUppercaseString \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":"src/Psalm/Type/Atomic.php"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abff7d98dbe2c3cb84271059de147e7bd4fb67b39681cdc8bb63907c447786d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO implement TNonEmptyUppercaseString \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":"src/Psalm/Type/Atomic.php"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f4b3e3aac7f01470bc08a8cb0682d722f9bbbd6d5dfca667037adb89b8b780"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack required for JsonMapper \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/CliUtils.php"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5132d2f5f20acb720a0cda5787659addec2bee30aa0df51caf5636825b3e4932"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is technically wrong, but for some reason we get a \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":"src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"080e1410bd97ccb8b82eb82b14f6356cc1afa83410ed00cf44a5887e22b07773"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: figure out what to do with class-string\u003CA\u0026B\u003E|class-string\u003CA\u0026C\u003E \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":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dbbddc4891b61cac961214a88370cb30c79881b143d7a22ed8f7a8b7dca906"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Missing analysis for additional cases, for example : \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":"src/Psalm/Internal/Type/Comparator/ObjectComparator.php"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"98952bb7090106541413a22800785f0718d7e666edaaff7f8585d0f8700aee79"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // assert($psalm_internal === array_filter($psalm_internal)); // TODO get this to 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":"src/Psalm/Internal/Scanner/DocblockParser.php"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec43d44949ec1a0ad2adee35c57625ec3f10ab3aebf9ae23fad648b86b8f59a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: Investigate if we can use error_log instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/LanguageServer/LanguageServer.php"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"55aaec26ba94a1410edadd4fafd11894e410b0ece32f578286d6d0ecbeb763cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme: this looks like a crazy caching hack \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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc6ce308cc34fb2f1800e4484ce9af8e96dcae31e6ad4553653c8ddea96ba2a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme: this looks like a crazy caching hack \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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b265d661e770423af30faa94d8786d38f9fd8a052e673c347b4d77d7a26310"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme: this looks like a crazy caching hack \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":"src/Psalm/Internal/Codebase/ClassLikes.php"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e3c848147a91a5207ae55eea8138b605bcbb27226c6f6c9a7409667af94756"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: why TString? Perhaps it should be string|int? \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":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"40da7fb42e2b4925db1c7c6b42df27c45fa9fd0ce938eda7cff4a3e1bd2dcc41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix \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":"src/Psalm/Internal/Codebase/Methods.php"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1f42cac4b69caa6aaf7d36dcd8c9d66c09383b42248799966e790aa48abaa6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO get node type provider here somehow and check literal ints and int ranges \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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d65efb508965f7fc807f38645aab61f7348a151188fd6e1345eb1321d6ebd0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle differently so it\u0027s detected as unused if the array is unused? \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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3048f6e1834230f560e89b4e06b6ae987209c77ead2884f1e2567d2dead5125e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle differently so it\u0027s detected as unused if the object is unused? \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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef08145b6d9c1b3798799d13da1d5730082144eb961154429d9c8b622be4fda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: emit error 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26bae6e538c87bc2db2e567580f2c4b5a6b9263b89495e2dcb3e05843cf2743"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: emit error 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a80b884f72f08c96483b4a5cedbaa1c2a79b46fe5fdd761748867192aeb035"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: emit error 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d76f38669ad7195833fb349b380aa0d4534f5c592ef36072d3e4f792eb94e15"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack has a similar issue: https://github.com/facebook/hhvm/issues/5164 \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5553c7568461f64005d9a38bcc29c78482fd9f1feb4fb4d244a6f0748b99b6af"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack has a similar issue: https://github.com/facebook/hhvm/issues/5164 \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeea1f9273d1c8ac0c4f4cebab3712174d9e5c518df97a8bb55ac5876dfd80b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the following line look superfluous, but removing it makes \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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5daf3dba3a0ca266a259b6a951b9d151eb52a944d469fbaa124f3e291a260d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: There are weird ::__construct calls in the AST for \u0060extends\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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentMapPopulator.php"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed69db78b33ff1cca3e60aeaa3ab456ba4aaa28a36486c569f2ba1cf1ad9083"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: what if we need both? \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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"357b8653a54b5ee24ae2d3dd545f35a148c3c5a713a90a9199c00549d86210e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support references with destructuring \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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bd689a82d7568f6df3ebd792197be2a3783e414c2bfa27d6d22a31a1ddd113"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060psalm-phar\u0060 is a command-line package (\u0060bin\u0060 in \u0060composer.json\u0060) and neither \u0060assets/psalm-phar/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/psalm-phar/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e837aa118d876841a164ddb381611b58a58c215623660aac3be055b3a9af19d"}},{"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":"045e6eaae4b71ab53c8a245b4aed2e1169c039a48e71ba67843ffcf2b1750a1f"},"properties":{"commitSha":"d3e74ac6e440489385ea73fa7702fa278d2ac51d"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"d3919c627d13778d88aee0662134dea4d59d8a27ae9b93b0016e3f6bf33d78ba"},"properties":{"commitSha":"d3e74ac6e440489385ea73fa7702fa278d2ac51d"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"d39c0a63512d2d2adc2ecd9d31c9f816125818c5d8ac14acd9ec59ca8ddfe3f9"},"properties":{"commitSha":"ebab0216a20521028c57fab792052b3e90bbc061"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"7a86c2fe559c26c1011f5bf321868049c640ec4971e575d1b012aa8b3faf1ede"},"properties":{"commitSha":"d3e74ac6e440489385ea73fa7702fa278d2ac51d"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"8d193b006bdb24fd6d92e1ec0ba39eb99f9cf69c37fe61f61ca59f007e6ffe96"},"properties":{"commitSha":"d3e74ac6e440489385ea73fa7702fa278d2ac51d"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"224eec152ab59641b5a4c7acee751e5c1dd11d2513baf513560bcbe51a242e40"},"properties":{"commitSha":"21741c8d9eb39d539eba0dc9acaef9114482c12e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"d73d5909d0eb93a7218f5796bee368234b3805bdd9a2648307d3ad75562cbeb8"},"properties":{"commitSha":"21741c8d9eb39d539eba0dc9acaef9114482c12e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"b5ccdbb4f94bf4ccf0ca287f2ad270f88200f7b47357057f8b4aaca0872fd8fb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"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":"9a382d79c970997625f9d3d9d7627ff8f4c8c660b2638db5e03ab25361a1615d"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 27 of 412 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; 412 of the 1318 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: src/Psalm/Internal/Provider/ReturnTypeProvider/SprintfReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php, src/Psalm/Internal/LanguageServer/LanguageClient.php, src/Psalm/Type/Atomic/TValueOf.php, src/Psalm/Internal/LanguageServer/Server/Workspace.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentMapPopulator.php, src/Psalm/PluginFileExtensionsSocket.php, src/Psalm/Internal/Analyzer/Statements/DeclareAnalyzer.php (and 19 more). 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/SprintfReturnTypeProvider.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7196ffd471bdb1c212189f44ca60302e1870a0514efd8c6ec0769a88bad699d5"}},{"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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76d3795fea0d6f735a587e49a76e18a382b586b3c9808d9253a0d5a46470ad4"}},{"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":"src/Psalm/Internal/LanguageServer/LanguageClient.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7b0f81a2d0ea3e0225e9c76263f99aa3e8f8bd41970384725715cba38ba36d"}},{"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":"src/Psalm/Type/Atomic/TValueOf.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cc5109c3246125228fd57c80823dad72c5a3f119e553bdcbb8b0eb393cd366"}},{"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":"src/Psalm/Internal/LanguageServer/Server/Workspace.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31817d57eff8a0f4172d9f42ea1709d39a8455eaf7dadfd611be716eb4f78c7c"}},{"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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentMapPopulator.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3281618b541cf8edbac7bd8aa83b199b10f2376cfc83977a974ef5d39292ef2"}},{"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":"src/Psalm/PluginFileExtensionsSocket.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dd0ee6f9ad32cbf6c7c55a83b67482223f125aaeb5e9b452620e5d22f1ca4f"}},{"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":"src/Psalm/Internal/Analyzer/Statements/DeclareAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"345411b8f485e542d4e267ad4cd23e40a846b417064faa2c32ac0972757f3eff"}},{"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":"src/Psalm/Report/PhpStormReport.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3ede2e599221c05ab17ba8b11c55118e8535939750caa2f10748ea64c798a5"}},{"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":"src/Psalm/Internal/LanguageServer/Client/Progress/Progress.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65faa02098fdde0b0e94039042cfa9a6c1ae6db13b9f5ba15619ca497757ee2"}},{"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":"src/Psalm/Internal/PluginManager/ComposerLock.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7596b2b002ad6025baacc6ccacaf53969538c84a24e004b84315c7166fa3c9"}},{"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":"src/Psalm/Internal/Provider/DynamicFunctionStorageProvider.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c610aa30a0dfab463d6d44d6620ded1f601479b232118cafa3fa3466a94a3fd"}},{"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":"src/Psalm/Internal/Provider/ReturnTypeProvider/DirnameReturnTypeProvider.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c75cf425eecd4aece6c60d0e1cf0933b590d3d0cedbc3089fffa7d66b6cd635"}},{"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":"src/Psalm/Internal/PluginManager/PluginList.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66734430b584298ed9326786c4a2ae0f26a359bb0a73c3c811dfc21ba2de708"}},{"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":"src/Psalm/Internal/Provider/ReturnTypeProvider/PowReturnTypeProvider.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7208f675c752b31b7c640cf4b7dd7f80aa4c6ab1707fce0030faec321ee64ce8"}},{"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":"src/Psalm/Type/Atomic/TKeyOf.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0922fa4f8bf00dedb33b011f6b7840b5a368ab650d5256f69697fee418f2d00b"}},{"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":"src/Psalm/Internal/Json/Json.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"796f054f56a72c5585e38d8d23779580ab1fa1e18628ce50dab0f054fd2039fb"}},{"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":"src/Psalm/Internal/VersionUtils.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"913a5c7be8270f759c7597e79f19e4c9144d200ca5934d67b885390d33bde1cc"}},{"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":"src/Psalm/Report/CodeClimateReport.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20db75c576f50c2dbf7fc464e5fbae1b01f6d55f3306bb34406546e5116199d"}},{"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":"src/Psalm/Internal/ErrorHandler.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce821b6fba28da9d7c1241633c18b8f2cdc9d539aa7122266a8d5ee8f262443"}},{"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":"src/Psalm/Internal/Provider/ReturnTypeProvider/BasenameReturnTypeProvider.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc73d8efae79d11ab3abc8c0c8bdb07ae62a900811000d161245ead33ffb4d03"}},{"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":"src/Psalm/Internal/PluginManager/Command/ShowCommand.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab09627dd30b4eec45e3cced48a7aa5342768340b7072aa9e28f4dccece3c1f"}},{"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":"src/Psalm/Internal/Provider/ReturnTypeProvider/RoundReturnTypeProvider.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f1511cb2438c3c58ee42513f5c723d7ebfb7f7f350c3b3e322262c3bffff5d"}},{"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":"src/Psalm/Internal/Analyzer/Statements/Expression/EmptyAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a081d6b4e40af6a7f3c14a2b73a37342544e462a033b646bac4d42659b61157a"}},{"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":"src/Psalm/Internal/Provider/ReturnTypeProvider/InArrayReturnTypeProvider.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bd72d4f1ac6055e4c8d8fdd418780e6b2610f1df209f0de15121c730466423"}},{"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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayPadReturnTypeProvider.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a262e6c69cdb7ea8dada81bba3c94f596e0ef187b59791d3e83f5eed35d8825a"}},{"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":"src/Psalm/Internal/PluginManager/PluginListFactory.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63223029ebf93f3b24aaeb1fbc0656d7e57231899f3efadbc4d8821983e91706"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: ClassLikeStorageCacheProvider.php, FileStorageCacheProvider.php, ParserCacheProvider.php, ProjectCacheProvider.php: 4 files \u2014 \u0060src/Psalm/Internal/Provider/ClassLikeStorageCacheProvider.php\u0060, \u0060src/Psalm/Internal/Provider/FileStorageCacheProvider.php\u0060, \u0060src/Psalm/Internal/Provider/ParserCacheProvider.php\u0060, \u0060src/Psalm/Internal/Provider/ProjectCacheProvider.php\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 6 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Provider/ClassLikeStorageCacheProvider.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"535ec6db7ba1fda7338ecd76bea0250ea20f3ef5e0a1e2dc89b45de51fd980ad"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Cache.php \u2194 Providers.php: \u0060src/Psalm/Internal/Cache.php\u0060 and \u0060src/Psalm/Internal/Provider/Providers.php\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006014e670ff\u0060 cs-fix; \u0060567601d0\u0060 Cleanup; \u006042690e75\u0060 Fix \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cache.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac61ddddff5a57ad893de48e8880e95317236ca76b7b2d176eb52d9c24aad7bd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: CallMap_80_delta.php \u2194 CallMap_81_delta.php: \u0060dictionaries/override/CallMap_80_delta.php\u0060 and \u0060dictionaries/override/CallMap_81_delta.php\u0060 change together 60% of the time (9 of the 15 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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060ed1ea524\u0060 Fix #10398: add missing methods of ReflectionProperty class in CallMa\u2026 (at that commit the files were still \u0060dictionaries/CallMap_80_delta.php\u0060 and \u0060dictionaries/CallMap_81_delta.php\u0060); \u00608bd22670\u0060 Fix DOM callmaps (at that commit the files were still \u0060dictionaries/CallMap_80_delta.php\u0060 and \u0060dictionaries/CallMap_81_delta.php\u0060); \u006074a67a04\u0060 Update Phar callmaps (at that commit the files were still \u0060dictionaries/CallMap_80_delta.php\u0060 and \u0060dictionaries/CallMap_81_delta.php\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dictionaries/override/CallMap_80_delta.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa50138e0faa8a882bba440c52c87bb94749ce70014d42cd8601336879dd583"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: InterfaceAnalyzer.php \u2194 TraitAnalyzer.php: \u0060src/Psalm/Internal/Analyzer/InterfaceAnalyzer.php\u0060 and \u0060src/Psalm/Internal/Analyzer/TraitAnalyzer.php\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060c827f537\u0060 fix(mixins): trait self/static, magic member reachability, deprecated\u2026; \u00605f1a1374\u0060 fix(templates): check method defaults in their class and report undef\u2026; \u0060a08c951c\u0060 feat(templates): apply class template defaults #12446 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/InterfaceAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d940280db8fbc2b6853b7721ed0a637fd0ec9f15f621087e8299d401da4a3d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: FunctionDocblockComment.php \u2194 FunctionLikeStorage.php: \u0060src/Psalm/Internal/Scanner/FunctionDocblockComment.php\u0060 and \u0060src/Psalm/Storage/FunctionLikeStorage.php\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060a0f81174\u0060 fix(docblock): check the classes of @global types #9182 #9183; \u00600852633f\u0060 refactor(templates): tighten the comments #5407; \u0060fe0120dc\u0060 feat(templates): apply function and method template defaults #5407 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Scanner/FunctionDocblockComment.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"116cc3d4b7c56012736c27d2fd8f85460cc075ee7a9058f772e64eb9e1f0c833"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: IfElseAnalyzer.php \u2194 TernaryAnalyzer.php: \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php\u0060 change together 50% of the time (15 of the 30 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u0060c8189ea5\u0060 Address review: switch, ternary, property roots made non-null; \u006067e58dec\u0060 Count a variable passed by reference in a condition as assigned there; \u0060d7369600\u0060 Rebuild a too complicated negation only where master did, keep $this \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12c25e9c85222c2284ce186d6d3b5e1dadfe84120cafda776460e0c14edc47b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ElseAnalyzer.php \u2194 ElseIfAnalyzer.php: \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php\u0060 and \u0060src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php\u0060 change together 50% of the time (9 of the 18 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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060c8189ea5\u0060 Address review: switch, ternary, property roots made non-null; \u006034f38735\u0060 Address review: references rebound in blocks, raw generics, array-ite\u2026; \u00609c8673b5\u0060 Keep the clauses a condition\u0027s reconciled types do not express \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d68dd377857e41b408ae13faca1f19cc7a9f8e7190f041790a7d0aef50ef00f"}},{"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":"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":"a784210f8de33a9dc23ed16d501e209c1c033cc444c1b3055198c36833051a99"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46309b325c2b89ecd3d5232827fc652ce46b428def68b8c1766f5ecc91a1b654"},"taxa":[{"id":"CICD-SEC-4","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":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"AX3","level":"error","message":{"text":"Project dependency cycle: The projects dictionaries \u2192 src/Psalm \u2192 dictionaries form a reference cycle. Cyclic dependencies prevent independent build/test/deploy, blur ownership, and tend to grow into a big ball of mud. Break the cycle by extracting the shared types into a separate project both can reference."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dictionaries/ImpureFunctionsList.php"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c2a3dbc335dd0c2ec456dd1de85fd625ae494a46e7c49218e23daa35340926"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: StatementsSource (20 methods): \u0060StatementsSource\u0060 declares 20 methods: \u0060getNamespace\u0060, \u0060getAliasedClassesFlipped\u0060, \u0060getAliasedClassesFlippedReplaceable\u0060, \u0060getFQCLN\u0060, \u0060getClassName\u0060, \u0060getParentFQCLN\u0060, \u0060getTemplateTypeMap\u0060, \u0060setRootFilePath\u0060, \u0060hasParentFilePath\u0060, \u0060hasAlreadyRequiredFilePath\u0060, \u0060getRequireNesting\u0060, \u0060isStatic\u0060, \u0060getSource\u0060, \u0060getCodebase\u0060, \u0060getSuppressedIssues\u0060, \u0060addSuppressedIssues\u0060, \u0060removeSuppressedIssues\u0060, \u0060getNodeTypeProvider\u0060, \u0060signalMutationOnlyInferred\u0060, \u0060signalMutation\u0060. Counted over its public instance methods, once per name; constants and static methods are not counted. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/StatementsSource.php"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee7eb317e378ba52ed325abe3b2cddae7c0ef7ce18e992516439fd8044bc90e"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 1 ADR-shaped document(s) detected by content \u2014 \u0060.agents/skills/purity-capabilities/SKILL.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"P3","level":"warning","message":{"text":"SAST runs, but gates no merge: \u0060announce-release.yml\u0060, \u0060apply-queued-changes.yml\u0060, \u0060auto-release.yml\u0060, \u0060build-docker.yml\u0060 run(s) a static-analysis scan, but no workflow that runs one is triggered by a pull request (or a merge queue, or an unfiltered push) \u2014 the scan fires on a schedule or a manual dispatch only. A vulnerable change therefore merges clean and is reported on the next scheduled run, by which time it is on the default branch and the only remedy is a follow-up fix. Add the pull-request trigger to the workflow that runs the scan so the finding arrives before the merge rather than after it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"73211886541038635ced0208da9cedd27ed1caa9132fd6aa5e44d2976a4de6d6"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch composer/gitsubmodule: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060composer\u0060, \u0060gitsubmodule\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":"7c152d45539001690365c1aba55db4e9d65fe2d26f0d01709f388e71ce96339d"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$atomic_type instanceof TNamedObject || !$codebase\u0060 appears character-identically in 4 files \u2014 src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php, src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/ThrowAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"875ffc3ecac1db98743d777e0e729504964e916949523a845c0f2ffd7a86a0df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$callmap_callables || $callmap_callables[0]\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php, src/Psalm/Internal/Codebase/Methods.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e648bd575acfb65946b5b99079ca58e6669c5a3913b46c31c72e5c678a6c07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$go_to_source \u0026\u0026 isset($this-\u003Etemp_files[$file_path])\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Provider/FakeFileProvider.php, src/Psalm/Internal/Provider/FileProvider.php. 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":"src/Psalm/Internal/Provider/FakeFileProvider.php"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6714694469003b4f78ed8cea9205a48b308d27b4ab632da4fef989440623830d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$has_continue_statement \u0026\u0026 !$has_break_statement\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdd69d74efccf07227940c232d02a2846fbb42213eef1945eae30885bed9093"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$inside_loop \u0026\u0026 $redundant \u0026\u0026 $var_id \u0026\u0026 $code_location\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/SimpleAssertionReconciler.php, src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php. 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb80ed392c6714f766721547d3a1da5272e78e5b9ed22d92d6489494ba339f38"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$statements_source instanceof StatementsAnalyzer || !$call_args\u0060 appears character-identically in 6 files \u2014 src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFilterReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayMergeReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/FirstArgStringReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/GetClassMethodsReturnTypeProvider.php. 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFilterReturnTypeProvider.php"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb2c9bf4765dadb77443be89d4b50804b5f7eebc19402937b10b4feb3bcee1a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$statements_source instanceof StatementsAnalyzer || count($call_args) \u003C 2\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayCombineReturnTypeProvider.php. 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7cba58f2f6b51f584a20d5da675d9db8605527e2567404f1a78a45c754406c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$storage instanceof MethodStorage || !$storage\u0060 appears character-identically in 3 files \u2014 src/Psalm/Codebase.php, src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php, src/Psalm/Internal/PhpVisitor/ReflectorVisitor.php. 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":"src/Psalm/Codebase.php"},"region":{"startLine":3175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d80e4cadf0627096ea535a3f44dc0df22d2a4cef27450e1d68a34db872fd0e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$type instanceof Atomic \u0026\u0026 !$type instanceof Union \u0026\u0026 !$type instanceof MutableUnion\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/TypeVisitor/FromDocblockSetter.php, src/Psalm/Internal/TypeVisitor/TypeChecker.php. 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":"src/Psalm/Internal/TypeVisitor/FromDocblockSetter.php"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"da610cff07514a48009b5dda7c3811c89938ee07b419c085a0a4f64e52f2701e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$type instanceof TNamedObject || !$codebase\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php, src/Psalm/Internal/Type/SimpleAssertionReconciler.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d7eef996c2bbcf20323206ab479b8196da08cd542947b768704ebf6cb408ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$type instanceof TTemplateParam || $type\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php, src/Psalm/Internal/TypeVisitor/TemplateBoundNarrower.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"6423512da8c7a9f4a5fad93a4fb60a97712766966d26dbc165a07be837ca119c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$type_match_found \u0026\u0026 !$union_comparison_results\u0060 appears character-identically in 4 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/StaticPropertyAssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7124476bad9cd69c2e081a4e543f30378794ff959df71f2ac0156c180033d882"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isset($call_args[0]) || !isset($call_args[1])\u0060 appears character-identically in 4 files \u2014 src/Psalm/Internal/Provider/ParamsProvider/ArrayFilterParamsProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReduceReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/InArrayReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/PropertyExistsReturnTypeProvider.php. 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":"src/Psalm/Internal/Provider/ParamsProvider/ArrayFilterParamsProvider.php"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"464e52a4ca90c663bb0ce28aef559957fc5da0f79a1df2ace5573cddf4302167"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!str_starts_with($var, \u0027$this-\u003E\u0027) \u0026\u0026 $var !== \u0027$this\u0027\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/ExistingAtomicStaticCallAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"839e8581a50828e4081f6a973187ae6b91f7b6fd47489605d681a26111eafadd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$array_atomic_type instanceof TKeyedArray \u0026\u0026 $array_atomic_type\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php, src/Psalm/Internal/Type/SimpleAssertionReconciler.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"1509e19a3d2675a4c745f98cd05db637b3e4cf0c1a7627eecd3f0d21be37f137"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$array_template_type instanceof TKeyedArray \u0026\u0026 ($offset_template_type instanceof TLiteralString || $offset_template_type instanceof TLiteral\u2026\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php, src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php. 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":"src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d374e8163ff0b62f0715427a3cc469d0721fe3401dda1f8e1a936d84d494778"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$assertion instanceof IsIsset || $assertion instanceof IsEqualIsset\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/AssertionReconciler.php, src/Psalm/Internal/Type/SimpleAssertionReconciler.php. 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb4de2f2429c62ca8725a3dd55011247602229fe8039cb496bda73dc469f59a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$assertion_type instanceof TNamedObject \u0026\u0026 $assertion_type\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/NegatedAssertionReconciler.php, src/Psalm/Internal/Type/SimpleAssertionReconciler.php. 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":"src/Psalm/Internal/Type/NegatedAssertionReconciler.php"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"528f03840544c86d02597488450e896d195838a412e9d4c392bcea23ad6f1425"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$atomic instanceof TArray || $atomic instanceof TKeyedArray\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/NullsafeAnalyzer.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReplaceRecursiveReturnTypeProvider.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/NullsafeAnalyzer.php"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a95deb7543cef9a01dbefdb85af8e190622791c2d567d108549ea1e3352c7b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$atomic instanceof TClosure || $atomic instanceof TCallable\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/CallPurityResolver.php, src/Psalm/Storage/Capabilities.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/CallPurityResolver.php"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8695002244febe6abd57156e4eb41aa935637450a024a7a88333bb2975a8daa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$atomic instanceof TTemplateParam \u0026\u0026 $atomic\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/PurityWildcardInference.php, src/Psalm/Internal/Type/PurityWildcard.php. 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":"src/Psalm/Internal/Analyzer/PurityWildcardInference.php"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"7417476f68a3ea9b1601aee748ca1310965b351eac2b8238a099c57fdf0041fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$atomic_comparison_result \u0026\u0026 $atomic_comparison_result\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/Comparator/ClassLikeStringComparator.php, src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php. 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":"src/Psalm/Internal/Type/Comparator/ClassLikeStringComparator.php"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77a291e4a731c1546cf947392195f2f428ea84a764be154accfebe6c1f4ca89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$atomic_type instanceof TArray \u0026\u0026 !$atomic_type\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/UnsetAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"233497d088d1e9f9c4743d1eaaaf30b8818c1980f1b87d5892a1b775125a21ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$atomic_type instanceof TArray || $atomic_type instanceof TKeyedArray\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php, src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/YieldFromAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssertionFinder.php"},"region":{"startLine":4134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adfb236b408368ae1af31dbe93f60d26554ae98a111afbb1037b09f9f7c3eb4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$atomic_type instanceof TFloat || $atomic_type instanceof TInt || $atomic_type instanceof TNumeric\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php, src/Psalm/Internal/Provider/ReturnTypeProvider/FilterUtils.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"e924e968f33a375f6678ed0c3d5dd6fb6c80f3b8217f2b4837e4dd65d12f5909"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$atomic_type instanceof TNamedObject || $atomic_type instanceof TObjectWithProperties\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php, src/Psalm/Internal/Provider/ReturnTypeProvider/StrvalReturnTypeProvider.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/CastAnalyzer.php"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"44955d807f537851e8fc6cd3d7845c34c780ac8349606c11c672f2b9aeecadcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$atomic_type instanceof TTemplateKeyOf || $atomic_type instanceof TTemplateValueOf\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php, src/Psalm/Internal/Type/TemplateInferredTypeReplacer.php, src/Psalm/Internal/Type/TemplateStandinTypeReplacer.php. 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":"src/Psalm/Internal/Type/Comparator/UnionTypeComparator.php"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"949be35be6ef3784a744a0deeda332a15e28db025bf25682bcc5b80a8f8e3925"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$atomic_type instanceof TTemplateParam \u0026\u0026 $atomic_type\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php, src/Psalm/Internal/Type/SimpleAssertionReconciler.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c72f623686b3510cabdb954378224d12fc5d59fbba8c601007b201dedb4022"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$atomic_type::class === TNamedObject::class \u0026\u0026 $atomic_type\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/AssertionReconciler.php, src/Psalm/Internal/Type/NegatedAssertionReconciler.php. 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f522f30a978ce30f0bd6c8ab6fc44084b666c8ae57b306b8a4a55f773db1130e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$classlike_storage \u0026\u0026 !$classlike_storage\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php, src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php. 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":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bea105414456b60c6f774dbc8787f4bfcb22703686f9a381b5141fab98817d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$config_file_path !== null \u0026\u0026 !is_string($config_file_path)\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/PluginManager/Command/DisableCommand.php, src/Psalm/Internal/PluginManager/Command/EnableCommand.php, src/Psalm/Internal/PluginManager/Command/ShowCommand.php. 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":"src/Psalm/Internal/PluginManager/Command/DisableCommand.php"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3966b9e0410c85331e5069cd1febdfee55ffcebbef30ff7591b038b09c94e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$container_type_part instanceof TKeyedArray \u0026\u0026 $container_type_part\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php, src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php. 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":"src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ab59ea41d2a853af1245b7e086997ec7fc27886a071a117dbd7c00ebfcdcb9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$existing_property \u0026\u0026 $existing_property\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php, src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php. 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"183ba3ce5cce927ed074b53f8faa2a13c82d5fa079508e44c3dd51c6b9149cb6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$filter_int_used === FILTER_VALIDATE_REGEXP \u0026\u0026 $regexp === null\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/FilterVarReturnTypeProvider.php. 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/FilterInputReturnTypeProvider.php"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6661fe168b6bb151145f885b80536843e511932a414cd8706558444119be55a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$first_appearance \u0026\u0026 isset($context-\u003Evars_in_scope[$var_id]) \u0026\u0026 $context\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/CallAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e53e169278db274fe6bf8cc761a4a662ee8e2ffd5bc3826c948f6731e6f481d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$first_arg \u0026\u0026 ($first_arg_type = $statements_source-\u003Enode_data-\u003EgetType($first_arg)) \u0026\u0026 $first_arg_type\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayRandReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayReverseReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArraySpliceReturnTypeProvider.php. 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayRandReturnTypeProvider.php"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f883f447350fb0ca149fa4b191323364a449e8d863e69dfe08167de5e371ec59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$has_ending_statements || (count($final_actions) \u0026\u0026 !in_array(ScopeAnalyzer::ACTION_NONE, $final_actions, true))\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Block/IfElse/IfAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef84a93daabcf9acbcc7c732098ee49127d747128e29979aa2465cc77ea090fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$implementer_appearing_method_id \u0026\u0026 $implementer_appearing_method_id !== $implementer_declaring_method_id\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/ClassAnalyzer.php, src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24090ceda82db6ca49cca18868a2d020c98bcf227e838906d57cd9e8f364dd8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$in_ci || !CliUtils::streamIsInteractive(STDERR)\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Cli/Psalm.php, src/Psalm/Internal/Cli/Psalter.php. 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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a14cf517c4f47df44f90941ff02173ce062d445c1cb3a581fe4310f3dbc5bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$input_type_part instanceof TNamedObject \u0026\u0026 $input_type_part\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php, src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php. 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":"src/Psalm/Internal/Type/Comparator/AtomicTypeComparator.php"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e00972d6883b9b487af9fc82c9d79e8ee9dbcda1bc11542b0728576d30206e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$intersection === false || $analysis_php_version_id \u003E= 8_01_00\u0060 appears character-identically in 2 files \u2014 src/Psalm/Type/Atomic/TGenericObject.php, src/Psalm/Type/Atomic/TNamedObject.php. 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":"src/Psalm/Type/Atomic/TGenericObject.php"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a465428455ec7a921afd18dc35da7939fdb328b995081696f1bd243e8634bf3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$intersection_type instanceof TNamedObject \u0026\u0026 $codebase\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"400c077279627faf0c899e99f9ce9dd98de8582055e70a317c7729c0b5637425"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$item_key_value !== null \u0026\u0026 count($array_creation_info-\u003Eproperty_types) \u003C= $config\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"41893d7d9846785ab3aaf525aeff889c9d9e6363b2f672142a1a295542d14950"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$item_key_value \u003C= PHP_INT_MAX \u0026\u0026 $item_key_value \u003E $array_creation_info\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"320a524c7db2d5f734860e19b992af36df576e989937160d5fa2b4db167a0b72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$k === -$d || ($k !== $d \u0026\u0026 $v[$k - 1] \u003C $v[$k \u002B 1])\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Diff/AstDiffer.php, src/Psalm/Internal/Diff/FileDiffer.php. 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":"src/Psalm/Internal/Diff/AstDiffer.php"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cf0d738a5fa64d1ae6367ed95902d56adba9f9b36d9097329fddd577e41ef1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$lhs_type_part instanceof TTemplateParam \u0026\u0026 !$lhs_type_part\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad9c346ecb123626b63d3dc60dc575742bbf85c85486eb03c1372981e2f3ab0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$line_parts[0] === \u0027\u0027 || ($line_parts[0][0] === \u0027$\u0027 \u0026\u0026 !preg_match(\u0027/^\\$this *(\\||$)/\u0027, $line_parts[0]))\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Analyzer/CommentAnalyzer.php, src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php, src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php. 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":"src/Psalm/Internal/Analyzer/CommentAnalyzer.php"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed99e379657c1b981e72d4fce61490a1704cf9993c64cb99d0d2ece2c41af6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$method_storage instanceof MethodStorage \u0026\u0026 $method_storage\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php, src/Psalm/Internal/TypeVisitor/TypeChecker.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"db368f03d0531a5dd4de8d2550b140084ce5bb3ef2a4cee892cac76e2255c1e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$property_storage === null || $property_storage\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"632535647a0a5eb6a3b1a07bbc9caec7d63b571a7ba4afbdf50d2c1a2f1633ae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$root_var_id !== null \u0026\u0026 isset($context-\u003Evars_in_scope[$root_var_id]) \u0026\u0026 ($variable_use_graph = $statements_analyzer-\u003Evariable_use_graph)\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/PartialApplicationAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3c202c35db0cd685f99465184e1c5c33d12a0edfcebddd1f8bdad8725cdea8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$static_type instanceof TNamedObject \u0026\u0026 $codebase\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/ExistingAtomicMethodCallAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/AtomicMethodCallAnalyzer.php"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c996401ed4c814890f0a6a354a5c29e98b044f02eaf1f37424dc4b630e2d1f70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$storage instanceof MethodStorage \u0026\u0026 !$storage\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Codebase/CliOutput.php, src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php. 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":"src/Psalm/Internal/Codebase/CliOutput.php"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93f4160ea2aed007eb06b3bb7c19c14ba0936aae344397aa2edb4dd955f5084"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$storage instanceof MethodStorage \u0026\u0026 $storage\u0060 appears character-identically in 5 files \u2014 src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php, src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/CallPurityResolver.php, src/Psalm/Internal/Analyzer/Statements/ReturnAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/FunctionLike/ReturnTypeAnalyzer.php"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a0d4ef471ccd2966223b9eaca9f2b8c7b67c0a0de3bd2f9a7ccc25115eb1cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$taints !== 0 \u0026\u0026 !$graph instanceof VariableUseGraph\u0060 appears character-identically in 5 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOpAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/EncapsulatedStringAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"7936221075c55749fcd5bdbc4f33db6e020e6bf0e3e744be0da8df24408e0898"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$template_map[1] !== null \u0026\u0026 $template_map[2] !== null\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php, src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php. 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c808d2ce2832f56c7593001e3f0d888435ffb25692c0704ee9bb822158e838"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$type instanceof Atomic \u0026\u0026 PurityWildcard::isPlaceholder($type)\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/TypeVisitor/PurityWildcardBinder.php, src/Psalm/Internal/TypeVisitor/PurityWildcardFinder.php. 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":"src/Psalm/Internal/TypeVisitor/PurityWildcardBinder.php"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cafc2802f35afa459ecfeeab4824e2cfc4172874879e46e0247ad9016af7e3a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$type instanceof TClassString \u0026\u0026 ($type-\u003Eas_type || $type instanceof TTemplateParamClass)\u0060 appears character-identically in 2 files \u2014 src/Psalm/Type/MutableUnion.php, src/Psalm/Type/UnionTrait.php. 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":"src/Psalm/Type/MutableUnion.php"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e09848a5628d2d0c045ed9b3b29a7aef8cc1b3406df19545bb088a59e0b77a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$type instanceof TNamedObject \u0026\u0026 $codebase\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Type/SimpleAssertionReconciler.php, src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php, src/Psalm/Internal/Type/TypeExpander.php. 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d19af88539bbfce1b823c5e2c0a5e3846f8c782fdec2b838ff038ce2b6a401"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$type instanceof TTemplateParam \u0026\u0026 $type\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Type/SimpleAssertionReconciler.php, src/Psalm/Internal/TypeVisitor/FromDocblockSetter.php, src/Psalm/Type/UnionTrait.php. 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d06116e9aeda9c0ad72bba694f55fc6d2946441b19d8610b0838b432fc062b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$type_1 instanceof TLiteralString || $type_2 instanceof TLiteralString\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/StringRefinement.php, src/Psalm/Internal/Type/TypeParser.php. 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":"src/Psalm/Internal/Type/StringRefinement.php"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc156ad1f399ea597650ef7c5eb0b05c68b4a318976167941a6dd06d01e9d297"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$type_1_atomic instanceof TNamedObject \u0026\u0026 $type_2_atomic instanceof TNamedObject\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/AssertionReconciler.php, src/Psalm/Type.php. 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae34fc4bf48864006d8b2adb11710d4cab1c970c0368b79c5978be4ed70eecf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$type_1_parts === null \u0026\u0026 $type_2_parts === null\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/AssertionReconciler.php, src/Psalm/Type.php. 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":"src/Psalm/Internal/Type/AssertionReconciler.php"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6b282ffd246487cecb2df94633f23c492225d2e0629b6fcb5a3de425631fff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$var_id !== null \u0026\u0026 isset($context-\u003Evars_in_scope[$var_id])\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php, src/Psalm/Internal/Analyzer/Statements/Expression/DestructorAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallReturnTypeFetcher.php"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e41eaa099be394928b7c305556089dfd05f7683456a3939be638b1bb641aea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$var_id \u0026\u0026 isset($context-\u003Evars_in_scope[$var_id])\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/IncDecExpressionAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8d7d28bb724e307aefd2fceea93d2da06b12620fee2539970b018d5021863d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060($arg_value_type = $statements_analyzer-\u003Enode_data-\u003EgetType($arg-\u003Evalue)) \u0026\u0026 $arg_value_type\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArrayFunctionArgumentsAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentsAnalyzer.php"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9095b3d3e1517c4279479c9235feb064e32bd9fb722bed0a6bcb04e7e615365f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060($atomic_type instanceof TMixed \u0026\u0026 !$atomic_type instanceof TNonEmptyMixed) || ($atomic_type instanceof TTemplateParam \u0026\u0026 self::canBeNull($a\u2026\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Algebra/FormulaGenerator.php, src/Psalm/Internal/Analyzer/Statements/Expression/NullsafeChainState.php. 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":"src/Psalm/Internal/Algebra/FormulaGenerator.php"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb2199ddb370b50717b36aa855c6c2c1ff05cce1acfa01fede4851aa4157b3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060($first_arg_type = $statements_source-\u003Enode_data-\u003EgetType($call_args[0]-\u003Evalue)) \u0026\u0026 $first_arg_type\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/FirstArgStringReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/GetObjectVarsReturnTypeProvider.php. 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayColumnReturnTypeProvider.php"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f29757e20ae4bf9de1bceeda147e8fc18ba5624457a106425451b75801ef586"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060($graph = $statements_analyzer-\u003Edata_flow_graph) \u0026\u0026 $result_type\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/BitwiseNotAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/UnaryPlusMinusAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/BitwiseNotAnalyzer.php"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c398a4bf2a60998e85efca78eb85f79d072c9024003ecaa3dceed47def971da3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060($stmt_var_type = $statements_analyzer-\u003Enode_data-\u003EgetType($stmt-\u003Evar)) \u0026\u0026 $stmt_var_type\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/IncDecExpressionAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"24114976d39f65c6eefd6be6e5b07460d2985f4603f8160670773e1ae6577763"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060VariableFetchAnalyzer::isSuperGlobal($var_id) || isset($context-\u003Ereferenced_globals[$var_id])\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/GlobalStateAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef16a14abab8af85e85c62ab0c8b499189aebb4b6d506cbca51b71201d9bfe6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060alter_code \u0026\u0026 isset($project_analyzer-\u003EgetIssuesToFix()[\u0027UnnecessaryVarAnnotation\u0027])\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"381b9e28bc273f40a3e19de18bf220f5fed1ae8462b7022ace16f27571af3c24"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060array_key_exists(\u0027debug\u0027, $options) || array_key_exists(\u0027debug-by-line\u0027, $options)\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Cli/Psalm.php, src/Psalm/Internal/Cli/Psalter.php, src/Psalm/Internal/Cli/Refactor.php. 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":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"514d271d9c1f41c99f2ecd23bd6b88bbe43752e98f1a9102cb46de4fe3dc8a6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060classExtends($fq_class_name, $context-\u003Eself) \u0026\u0026 $codebase\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d07a7759a1cf8ca120443247d7bbc53528ed9924f652e60ff2bf89e99d0c04"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060collect_mutations \u0026\u0026 $statements_analyzer\u0060 appears character-identically in 11 files \u2014 src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee14db7c3a84b71dd954717186951340069b0caea3f5f43abeb1f5d7c31c634"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060collect_mutations \u0026\u0026 ($stmt_type = $statements_analyzer-\u003Enode_data-\u003EgetType($stmt))\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/VariableFetchAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/InstancePropertyFetchAnalyzer.php"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a968e31ada632ec9a042149c2af394ecd63160e45d4b020b9afe55a1f2bb1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060count($if_context-\u003Eclauses) === 1 \u0026\u0026 $if_context\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91025f1d43d26d39e79f4c3be8182a40f5e2049dadda497e6e92c8765fa851c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060count($line_parts) === 1 \u0026\u0026 isset($line_parts[0][0]) \u0026\u0026 $line_parts[0][0] === \u0027$\u0027\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php, src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php. 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92bc5c6a926da5f79e34c02147a462f34cd45ce2e4036571c7689b348465a20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060count($stmt-\u003Eclass-\u003EgetParts()) === 1 \u0026\u0026 in_array(strtolower($stmt-\u003Eclass-\u003EgetFirst()), [\u0027self\u0027, \u0027static\u0027, \u0027parent\u0027], true)\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/ExpressionIdentifier.php, src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/StaticPropertyFetchAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a4d7e29def4debedf072169f606f08eefac51f88979f2221f036bba1b02e94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deprecated \u0026\u0026 $fq_class_name !== $context\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/ClassConstAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f765a96867931e3b84261608f73417f3152c1ebdb4f248c341ac056c0221592"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doesFilterNullOrFalse() \u0026\u0026 ($existing_var_type-\u003EhasType(\u0027null\u0027) || $existing_var_type-\u003EhasType(\u0027false\u0027))\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/SimpleAssertionReconciler.php, src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php. 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"6886d5084e0f5e4cb9a031da28674f7d7823d2a5678902d532f5827a7c2bd743"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060find_unused_variables \u0026\u0026 $type_location \u0026\u0026 !$var_comment\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7556db9909e45e0532767e798190e82121c69928a74606ef97ac62e419ca73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fq_class_name === \u0027Psalm\\\\Deprecated\u0027 || $attribute\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php, src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php. 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1367fc62423b3458df0d444d0912c926010ffd95f5a6f0b37e4238b4460541ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fq_class_name === \u0027Psalm\\\\Internal\u0027 \u0026\u0026 !$storage\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php, src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeNodeScanner.php. 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeNodeScanner.php"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c375dc266c61b75347087c0538209ed1f183a88e08c817334c20760e345133c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060from_phpstan \u0026\u0026 isset($context-\u003Evars_in_scope[$var_comment-\u003Evar_id]) \u0026\u0026 $context\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/YieldAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Block/ForeachAnalyzer.php"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"e081ed11c7439b70a1ed4c68c35b219e4e7d96e6636c226cf0348f2dc3742f2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getRootFilePath() \u0026\u0026 (!(($parent_source = $statements_analyzer-\u003EgetSource()) instanceof FunctionLikeAnalyzer) || !$parent_source-\u003EgetSource(\u2026\u0060 appears character-identically in 9 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/AssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/ConcatAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/ArgumentAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"3491ab08e5e10461bd0b5b710cd36cf7b15e639388d37fc52c950c93c547d58b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getSource() instanceof TraitAnalyzer \u0026\u0026 strtolower($declaring_method_class) === strtolower((string) $source-\u003EgetFQCLN())\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/MethodAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodVisibilityAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/MethodAnalyzer.php"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57e2e15c90812b2387020f5b8f7ed5882a4aea6e1a35b2d93f0e4f9401205fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasArray() \u0026\u0026 ($array_type = ArrayType::infer($array_arg_type-\u003EgetArray()))\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayChunkReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayPadReturnTypeProvider.php. 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayChunkReturnTypeProvider.php"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a852d818207940925d451735031406e9d1098eed3ab97bb543e4a799147c6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasMixed() \u0026\u0026 ($redundant || $existing_var_type-\u003EisUnionEmpty())\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/SimpleAssertionReconciler.php, src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php. 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"816978a16f1a1557a840e07761ff0cd49dc54e50d3ba895a80e95f2138d65edd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasType(\u0027array\u0027) \u0026\u0026 (($array_atomic_type = $first_arg_type-\u003EgetArray()) instanceof TArray || $array_atomic_type instanceof TKeyedArray)\u0060 appears character-identically in 4 files \u2014 src/Psalm/Internal/Provider/ParamsProvider/ArrayFilterParamsProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFilterReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayRandReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArraySpliceReturnTypeProvider.php. 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":"src/Psalm/Internal/Provider/ParamsProvider/ArrayFilterParamsProvider.php"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd01c4f497e00322a927cab9d5d5c70aafb6ca3b8e924869a526cde9f6c1030"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isMixed() \u0026\u0026 isset($context-\u003Evars_in_scope[$var_id])\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/TernaryAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElseAnalyzer.php"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae33d019ab29417fbae0aefb4b0f577965495870ee27be8474f2f86592a428ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isSingleIntLiteral() \u0026\u0026 $second_arg_type\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFillReturnTypeProvider.php, src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayRandReturnTypeProvider.php. 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":"src/Psalm/Internal/Provider/ReturnTypeProvider/ArrayFillReturnTypeProvider.php"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd0db0d45d0caec80f7b0cb2ffca97db4311d8aee0fa2d46774bba6a771be40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_string($item_key_value) \u0026\u0026 $item_key_literal_type instanceof TLiteralClassString\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/SimpleTypeInferer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/ArrayAnalyzer.php"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76557f3e3ae8acaccbf1550f53b958d40d7de2e075159872b6102a9ac7546d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isset($options[\u0027c\u0027]) \u0026\u0026 is_array($options[\u0027c\u0027])\u0060 appears character-identically in 4 files \u2014 src/Psalm/Internal/Cli/LanguageServer.php, src/Psalm/Internal/Cli/Psalm.php, src/Psalm/Internal/Cli/Psalter.php, src/Psalm/Internal/Cli/Refactor.php. 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":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c8adf8a117d4080ff459f72174db0e7de0a9b1bb552d8d064b3de625f73a60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isset($options[\u0027no-progress\u0027]) || (!$in_ci \u0026\u0026 CliUtils::runningUnderAiAgent())\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Cli/Psalter.php, src/Psalm/Internal/Cli/Refactor.php. 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":"src/Psalm/Internal/Cli/Psalter.php"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada18cb42e0ccfd68dd931112e065a6f833fbdfa6e159cdc95279220d6fd9595"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isset($options[\u0027r\u0027]) \u0026\u0026 is_string($options[\u0027r\u0027])\u0060 appears character-identically in 4 files \u2014 src/Psalm/Internal/Cli/LanguageServer.php, src/Psalm/Internal/Cli/Psalm.php, src/Psalm/Internal/Cli/Psalter.php, src/Psalm/Internal/Cli/Refactor.php. 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":"src/Psalm/Internal/Cli/LanguageServer.php"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89552519f8735b9ea9af2cc300005ed8c2507852956a11b1a70d555d4b2d935"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isset($outer_context-\u003Ebyref_constraints[$var_id]) \u0026\u0026 ($outer_constraint_type = $outer_context-\u003Ebyref_constraints[$var_id]-\u003Etype) \u0026\u0026 $byref_c\u2026\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a12bf0e5767a3fb490c3eafd7e99839863552d7ac2ef63a952c22bb40d0c34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isset($parsed_docblock-\u003Etags[\u0027psalm-api\u0027]) || isset($parsed_docblock-\u003Etags[\u0027api\u0027])\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php, src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockParser.php. 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":"src/Psalm/Internal/PhpVisitor/Reflector/ClassLikeDocblockParser.php"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ae1f29e9edc4943891d7dc2b1c441782ac985a2df4d77fe4c45ccc02b7509b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name === \u0027GLOBALS\u0027 \u0026\u0026 ($taint_flow_graph = $statements_analyzer-\u003EgetTaintFlowGraphWithSuppressed())\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/ArrayFetchAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/ArrayAssignmentAnalyzer.php"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42869e846b43d743d36ebb14fcf35b6a01a91e555bae2e7f609b57d67c87fb4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060possibly_undefined || $existing_var_type\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Type/SimpleAssertionReconciler.php, src/Psalm/Internal/Type/SimpleNegatedAssertionReconciler.php. 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":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa087ae1937a509e5533c9564daab2e29f6661be914eb3977e95f6fff6d9ae4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060remember_property_assignments_after_call \u0026\u0026 !$context\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b342ef32706c8e84dac5572e9377543dc369458ecfcfa73eaca0ea406bbf33f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scalar_type_match_found === true \u0026\u0026 $atomic_comparison_result\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php, src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php, src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php. 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":"src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3419b5168c26323f1723c41eaeefff091b41d6bc70701f09bb71641bfca417"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source instanceof NamespaceAnalyzer || $this\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php, src/Psalm/Internal/Analyzer/FunctionLikeAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a71dda01be658f693a560135f7c24842fc5031c4d45661aeaf0c38e62c5788"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060store_node_types \u0026\u0026 $fq_class_name \u0026\u0026 !$context\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticCallAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/InstanceofAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/NewAnalyzer.php"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc22a709def87ad013a45273ac62f8c1c9eece7ea4458993bfb1215d44ff7ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060substr($format, $conversion, 2) !== \u0027%s\u0027 || !isset($args[$argument])\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Codebase/TaintStore.php, src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php. 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":"src/Psalm/Internal/Codebase/TaintStore.php"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd1be6e4958b85f92f8b968836cad27bc189983b08627dec258e46e1c3d30bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060taint_flow_graph \u0026\u0026 $pool_data[\u0027taint_data\u0027]\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Codebase/Analyzer.php, src/Psalm/Internal/Codebase/Scanner.php. 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":"src/Psalm/Internal/Codebase/Analyzer.php"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ab5f1aa395ebf243126fc55425c0da56eedef18969e5f36fc94e241ed09d6c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060taint_flow_graph \u0026\u0026 $stmt instanceof PropertyFetch \u0026\u0026 $stmt\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Expression/Fetch/AtomicPropertyFetchAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Assignment/InstancePropertyAssignmentAnalyzer.php"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1e8e38e0da4afecfb08563f5b39242f79d11b8751370f69c393d6b03016a60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060template_types !== [] || $template_result\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php, src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MissingMethodCallHandler.php"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e58d5f0b45b77cda7202b05489dcf19c0e46ed278db6d5a59bca3a2121a0f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type \u0026\u0026 !UnionTypeComparator::isContainedBy( $codebase, $byref_constraint-\u003Etype, $outer_constraint_type, )\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php, src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseIfAnalyzer.php. 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":"src/Psalm/Internal/Analyzer/Statements/Block/IfElse/ElseAnalyzer.php"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdac642ef361c73f06523a4e79f5025d69bf288e0f6bc7fa62ac7d092e15111"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type_coerced === true \u0026\u0026 $atomic_comparison_result\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php, src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php, src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php. 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":"src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"57512ff87b82997bd04e6ac22ee3edf8c497839919292846c5ebe827c0fa256d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type_coerced_from_as_mixed === true \u0026\u0026 $atomic_comparison_result\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php, src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php, src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php. 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":"src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4395bbfcc32757502e3b07021cd0abf36b79714360c3121a114d026d6e24154a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type_coerced_from_mixed === true \u0026\u0026 $atomic_comparison_result\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php, src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php, src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php. 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":"src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"afeb713323ac1e1faca75582485a3293e305ee159e24c9df2d28246726af9648"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type_coerced_from_scalar === true \u0026\u0026 $atomic_comparison_result\u0060 appears character-identically in 3 files \u2014 src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php, src/Psalm/Internal/Type/Comparator/GenericTypeComparator.php, src/Psalm/Internal/Type/Comparator/KeyedArrayComparator.php. 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":"src/Psalm/Internal/Type/Comparator/ArrayTypeComparator.php"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb480cead7e77581c2c179401175e508ce425aa1bb2b2acbf329cb427981c3d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060var instanceof Variable \u0026\u0026 is_string($param-\u003Evar-\u003Ename)\u0060 appears character-identically in 2 files \u2014 src/Psalm/Internal/Codebase/CliOutput.php, src/Psalm/Internal/PhpVisitor/Reflector/StringStartScanner.php. 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":"src/Psalm/Internal/Codebase/CliOutput.php"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ddac729102f99cafd506e944170816714b0aed354bf70d399d2b5e2c357c6b"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060loadDomDocument\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the process working directory (changed at line 870, put back at line 876) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, not a \u0060finally\u0060, so it is skipped by any exception thrown in between: PHP then keeps the overwritten value for the rest of the request \u2014 and in a CLI command, a queue worker or a long-running server (Octane, Swoole, RoadRunner, FrankenPHP) for the rest of the process\u0027s life \u2014 and every later relative path, child-process launch, date, number format, XML parse or error report in ANY class reads it. That failure is silent and remote from its cause: the function that breaks is not the function that moved the value. The durable fix is not to widen the restore but to stop mutating the global: pass the value to the operation that needs it \u2014 \u0060cwd\u0060 and \u0060env\u0060 to Symfony \u0060Process\u0060 (\u0060new Process($command, $cwd, $env)\u0060) or \u0060proc_open($command, $spec, $pipes, $cwd, $env)\u0060, absolute paths instead of \u0060chdir\u0060, an explicit \u0060DateTimeZone\u0060 or locale to \u0060DateTimeImmutable\u0060/\u0060IntlDateFormatter\u0060/\u0060NumberFormatter\u0060, an explicit encoding to the \u0060mb_*\u0060 call, \u0060LIBXML_NOERROR\u0060/\u0060libxml_get_errors\u0060 handling in one place. Where the global genuinely must move, wrap it \u0060try\u0060/\u0060finally\u0060 so the restore runs on every path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a202b005b56ca23d36cbfa58d46488f83f5b5c57d0be4ebcdb6d3e279b0aca5"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060validateXmlConfig\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 libxml\u0027s internal-error mode (changed at line 893, put back at line 921) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, not a \u0060finally\u0060, so it is skipped by any exception thrown in between: PHP then keeps the overwritten value for the rest of the request \u2014 and in a CLI command, a queue worker or a long-running server (Octane, Swoole, RoadRunner, FrankenPHP) for the rest of the process\u0027s life \u2014 and every later relative path, child-process launch, date, number format, XML parse or error report in ANY class reads it. That failure is silent and remote from its cause: the function that breaks is not the function that moved the value. The durable fix is not to widen the restore but to stop mutating the global: pass the value to the operation that needs it \u2014 \u0060cwd\u0060 and \u0060env\u0060 to Symfony \u0060Process\u0060 (\u0060new Process($command, $cwd, $env)\u0060) or \u0060proc_open($command, $spec, $pipes, $cwd, $env)\u0060, absolute paths instead of \u0060chdir\u0060, an explicit \u0060DateTimeZone\u0060 or locale to \u0060DateTimeImmutable\u0060/\u0060IntlDateFormatter\u0060/\u0060NumberFormatter\u0060, an explicit encoding to the \u0060mb_*\u0060 call, \u0060LIBXML_NOERROR\u0060/\u0060libxml_get_errors\u0060 handling in one place. Where the global genuinely must move, wrap it \u0060try\u0060/\u0060finally\u0060 so the restore runs on every path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config.php"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9af5e540d4ecf17216d58c1fca244cf6f18235062e53bc37fd919b0602d3c92"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060isRegularExpression\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the error handler (changed at line 471, reset at line 476) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, not a \u0060finally\u0060, so it is skipped by any exception thrown in between: PHP then keeps the overwritten value for the rest of the request \u2014 and in a CLI command, a queue worker or a long-running server (Octane, Swoole, RoadRunner, FrankenPHP) for the rest of the process\u0027s life \u2014 and every later relative path, child-process launch, date, number format, XML parse or error report in ANY class reads it. That failure is silent and remote from its cause: the function that breaks is not the function that moved the value. The durable fix is not to widen the restore but to stop mutating the global: pass the value to the operation that needs it \u2014 \u0060cwd\u0060 and \u0060env\u0060 to Symfony \u0060Process\u0060 (\u0060new Process($command, $cwd, $env)\u0060) or \u0060proc_open($command, $spec, $pipes, $cwd, $env)\u0060, absolute paths instead of \u0060chdir\u0060, an explicit \u0060DateTimeZone\u0060 or locale to \u0060DateTimeImmutable\u0060/\u0060IntlDateFormatter\u0060/\u0060NumberFormatter\u0060, an explicit encoding to the \u0060mb_*\u0060 call, \u0060LIBXML_NOERROR\u0060/\u0060libxml_get_errors\u0060 handling in one place. Where the global genuinely must move, wrap it \u0060try\u0060/\u0060finally\u0060 so the restore runs on every path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Config/FileFilter.php"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9541cdbf2c836704cc5e980e5c24a7f38aa157945589ede22ddce1c235c9e701"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060logDebug\u0060 at line 715 is called with an argument built by \u0060array_keys($files)\u0060 (line 716), whose cost grows with the collection it walks. PHP evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because logDebug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isHandling\u0060 test, no debug flag, and no placeholder context array that lets the logger build the text only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/LanguageServer/LanguageServer.php"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19077308e34c2ea420753f4d599ac14a25d0a1a479df6fe082c50005133574b"}},{"ruleId":"X27","level":"warning","message":{"text":"Collection is structurally changed while it is being enumerated: line 122 walks \u0060$cloned_clauses\u0060 by value, so the walk is the snapshot taken when the loop began, and line 200 changes that same collection with \u0060unset($cloned_clauses[\u2026])\u0060 before the next iteration: the removed element is still visited by the rest of the loop. PHP raises nothing, so the loop completes over a different set than the code meant."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Algebra.php"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5541129a2464f01b3f47d6389ba55acbfd25301e93c8f85aecfda6b073171d"}},{"ruleId":"X27","level":"warning","message":{"text":"Collection is structurally changed while it is being enumerated: line 3219 walks \u0060$types\u0060 by value, so the walk is the snapshot taken when the loop began, and line 3237 changes that same collection with \u0060$types[] = \u2026\u0060 before the next iteration: the added element is never visited by this loop, so whatever it was added for is not done here. PHP raises nothing, so the loop completes over a different set than the code meant."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/SimpleAssertionReconciler.php"},"region":{"startLine":3219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfeae6339b32c94f037540b1526f99b16ae6ff78818b965d319725303fca074"}},{"ruleId":"X27","level":"warning","message":{"text":"Collection is structurally changed while it is being enumerated: line 728 walks \u0060$fixed_type_tokens\u0060 by value, so the walk is the snapshot taken when the loop began, and line 777 changes that same collection with \u0060unset($fixed_type_tokens[\u2026])\u0060 before the next iteration: the removed element is still visited by the rest of the loop. PHP raises nothing, so the loop completes over a different set than the code meant."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/Reflector/FunctionLikeDocblockScanner.php"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c73eef181527405316c4450639b1ff5f1134983aa9c0e4ec5dbd81efa75b2ba"}},{"ruleId":"X27","level":"warning","message":{"text":"Collection is structurally changed while it is being enumerated: line 197 walks \u0060$lhs_types\u0060 by value, so the walk is the snapshot taken when the loop began, and line 199 changes that same collection with \u0060$lhs_types = \u2026\u0060 before the next iteration: the loop carries on over the old value while the body now works on the new one. PHP raises nothing, so the loop completes over a different set than the code meant."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/MethodCallAnalyzer.php"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ce00d52691c49b728760a57c9aad46b71d5bfc395aa8058868f31d48306157"}},{"ruleId":"X29","level":"warning","message":{"text":"Per-element action decided by a fixed element: This loop runs once per element of \u0060$context.vars_in_scope\u0060, and the statement it guards acts on the element it is on \u2014 \u0060$var_id\u0060. The test deciding whether that statement runs does not: \u0060$getter_receiver_id === $receiver_id || str_starts_with($getter_receiver_id, ...\u0060 reads \u0060$context.vars_in_scope[$getter_receiver_id]\u0060, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One \u0060if\u0060 names the same collection at two different subscripts \u2014 the fixed one at line 920, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The \u0060if\u0060 is in the wrong place under both readings. Give the test the loop variable, or hoist it out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/Method/MethodCallPurityAnalyzer.php"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a505e22d9a02908088b726d00fd6957f3e661195c31cfcac4d886c3b8f78bc5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":2613}}}],"partialFingerprints":{"codehealthFindingId/v1":"80685ebb8e4a6336b9c783eecf9fdfb0eac3c53c9e5548068e19c439b616838e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Codebase.php"},"region":{"startLine":2688}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb37c7e2a75af4e38f4330c02077a3fdfd3dcfca13dfd75419dd385ca00b1ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Throwable)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Type/Atomic/TKeyedArray.php"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"405ae092651ffd99c330504faecd7b09987e8953ab9ba8fd55f72b97680e2a42"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/Comparator/CallableTypeComparator.php"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ed3e89fe310833334fa54e02883c2a5217a8a115371ac17d41ba57e39b2131"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Throwable)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/PhpVisitor/TraitFinder.php"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"553dd2dc9abed5bb7b1aad97cd712f036c22a88ff248d8ea4757f13c94a5e18a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/LanguageServer/LanguageServer.php"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"faed733b41d875a92be9e491b1543fa2d5687b35c02978425f92c9caf25793fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/LanguageServer/ProtocolStreamReader.php"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f76388e70f59ae16c4da3de9514ad9863a0b23f9b380f99a0e51e7dd96df78"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Functions.php"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5147fb8c179bb3fe8107c2f4bb1a3d82d7991e68838bb083903ba9993b1c980"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/Functions.php"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afc803f56340af26d4af1dc5217f6af8931b3748f4d4639db50d65c0eb4ea12"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Throwable)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Codebase/MutationLevelResolver.php"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f7087653ad78f774c5d9580b68103ae77354ee1788994af3a1a39187bcd695"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Cli/Psalm.php"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"38aec669158de059e81dbee883c5f481a81f307d326b630484f2e5ff85957a08"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassAnalyzer.php"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d66ac0d7110bc3be0be5ce10b64bea5707464ac8d8a9cd5dc5c78985188639"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (PhpParser\\Error)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/FileAnalyzer.php"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0cdc9fa64e337505c7957f437dbdf74743603f73524069664e5f75e6e92c91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/StaticMethod/AtomicStaticCallAnalyzer.php"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64b4f2c8c22823f9318b5530937b5314a0457f365503174e565da8c01110893"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Error)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/CoalesceAnalyzer.php"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c4b962d8be42f4d2a7e85cd0b4865c5b9664bd16f2bca418eb83702327292d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060getClassesForFile\u0060 returns \u0060[]\u0060 when \u0060InvalidArgumentException\u0060 is thrown, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the docblock, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/ClassLikeAnalyzer.php"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c148c54b1210848540e972aa419db553ea854d5ede0b978d5dfdf48bece71dd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060printOperand\u0060 swallows every exception into \u0060return \u0027left operand of ??\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the docblock, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/BinaryOp/CoalesceAnalyzer.php"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65f2fd9bc762c2e6579fb279c0bb2cdfe8008e9146e7e89b03d3c2232fae992"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060getFunctionCallableSignatures\u0060 returns \u0060[]\u0060 when \u0060UnexpectedValueException\u0060 is thrown, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the docblock, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Analyzer/Statements/Expression/Call/FunctionCallAnalyzer.php"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"c675140b629e2d4018596bd818129059d52bad8b719c67992a9143509d286b65"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060getClassLikes\u0060 returns \u0060[]\u0060 when \u0060InvalidArgumentException\u0060 is thrown, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the docblock, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Psalm/Internal/Type/TypeCombiner.php"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"c440ca824415792030877a9f269dfbea0245e2275a0b9089b5ccc8647a5b9db7"}}],"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-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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.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-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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":16,"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."]}]}