{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"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":"StructurallyValidatedTypeShapeDslFunction::evaluate_expression (cyclomatic 278): StructurallyValidatedTypeShapeDslFunction::evaluate_expression has cyclomatic complexity 278 (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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6986}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e292534432c3fcb674fcd30705ef539339a17c9e118ff3a99d2404debe06f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Subset::is_subset_eq_no_recursive_check (cyclomatic 251): Subset::is_subset_eq_no_recursive_check has cyclomatic complexity 251 (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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7def1c8a1b703514ae56c465e2df603a04418c55cb7a6f45931b54b14a2d66"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::stmt_impl (cyclomatic 188): BindingsBuilder::stmt_impl has cyclomatic complexity 188 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b66fe51acbbe2ef2033346c29f53f9bdabce1b5031ec5788f3f4dd5569ee8e"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeDisplayContext::fmt_helper_generic (cyclomatic 160): TypeDisplayContext::fmt_helper_generic has cyclomatic complexity 160 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93d3a904299e0111a20d1c421a8a44ba7f11f9f84117f9da3ec638e4d093433"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::callable_infer_params (cyclomatic 147): AnswersSolver::callable_infer_params has cyclomatic complexity 147 (threshold 15). Of this number, 145 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc0072f1fb7f0fe18fc72723affd7a23a774322c32ed68be8343a519df8a5f6"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::process_event (cyclomatic 136): Server::process_event 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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd605984ac0bfcfb9336fb6395da5f98fa5294bf6ddf82ff993409a6e87b172"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::calculate_class_field (cyclomatic 132): AnswersSolver::calculate_class_field has cyclomatic complexity 132 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bd1ae890fee0559f0a7af2eac62c6fa3801a8d6100fbe9cf4e8d5dd687667b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::atomic_narrow (cyclomatic 127): AnswersSolver::atomic_narrow has cyclomatic complexity 127 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa747627ee5f3c0f45da8ce78cbd30ea585818d31138fd989ee5e27c9b5b3907"}},{"ruleId":"D1","level":"warning","message":{"text":"StructurallyValidatedTypeShapeDslFunction::evaluate_condition (cyclomatic 105): StructurallyValidatedTypeShapeDslFunction::evaluate_condition has cyclomatic complexity 105 (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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8129}}}],"partialFingerprints":{"codehealthFindingId/v1":"11212996d9887d82fbf699f6e179250b10671caefc38ac85e7ac8a8241c4aaf4"}},{"ruleId":"D1","level":"warning","message":{"text":"DefinitionsBuilder::stmt (cyclomatic 98): DefinitionsBuilder::stmt has cyclomatic complexity 98 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/export/definitions.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c17beb89d53adf967140b55d397b899b86eded14af3df742a1a1f0d9cfd390"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::as_call_target_impl (cyclomatic 96): AnswersSolver::as_call_target_impl has cyclomatic complexity 96 (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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c4c8bb36a81954a532a7fda6fc2e6ea0f7483393e1e7bc05a0d12070963b2b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::subscript_infer_for_type_with_key_present_inner (cyclomatic 94): AnswersSolver::subscript_infer_for_type_with_key_present_inner has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4863e03e10a36ca353838007e69f6e34fa5a3487212f0b1e13e9eb00f169332b"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::bind_pattern (cyclomatic 86): BindingsBuilder::bind_pattern 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":"pyrefly/lib/binding/pattern.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ab1584d93424277769ab7e42c405c498242f7385b81ad4616659f42e9f4b2e"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::validate_type_shape_dsl_declaration (cyclomatic 80): AnswersSolver::validate_type_shape_dsl_declaration has cyclomatic complexity 80 (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":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9162f489e7e86f3ef7a45d230ee8fb5b7354c4315d0c1d7da2a67a8c7d80bb8"}},{"ruleId":"D1","level":"warning","message":{"text":"Binding::fmt (cyclomatic 80): Binding::fmt has cyclomatic complexity 80 (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":"pyrefly/lib/binding/binding.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"5174fc66a9e89121d4e1324fc3e5cef38d837b82ab9bdc371cbc93f284cb2db8"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::ensure_expr (cyclomatic 80): BindingsBuilder::ensure_expr has cyclomatic complexity 80 (threshold 15). Of this number, 79 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c41e94b5b65ef2dd5c56a8ebadca19bf155cd178b9c52262c312cdd93a1772"}},{"ruleId":"D1","level":"warning","message":{"text":"DslValidator::validate_condition (cyclomatic 79): DslValidator::validate_condition 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":4652}}}],"partialFingerprints":{"codehealthFindingId/v1":"4093e1077c7642ca782ce368924ce61fdc379030d58db7fb06eb3dd586aaec15"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::as_attribute_base1 (cyclomatic 77): AnswersSolver::as_attribute_base1 has cyclomatic complexity 77 (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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bf412b0382c7ca4367a9413905e0dae888d9148557963731636504e1e9462b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::check_consistent_override_for_field (cyclomatic 76): AnswersSolver::check_consistent_override_for_field 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":4468}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbc1bc31867734ff5508172571610f8ad176c34848214805e8c6bb8947cb65d"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::binding_to_type (cyclomatic 75): AnswersSolver::binding_to_type has cyclomatic complexity 75 (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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7166}}}],"partialFingerprints":{"codehealthFindingId/v1":"856492774b48f9bbd615097ac695785df1f7c2f36eb868acb611a5d4ef26adc3"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::lsp::wasm::hover::keyword_documentation (cyclomatic 73): pyrefly::lib::lsp::wasm::hover::keyword_documentation has cyclomatic complexity 73 (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":"pyrefly/lib/lsp/wasm/hover.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec90ae49488ebab2d25629b83f630192beabf1930c8d67f07f026a75bb882a94"}},{"ruleId":"D1","level":"warning","message":{"text":"Subset::is_subset_param_list_impl (cyclomatic 71): Subset::is_subset_param_list_impl has cyclomatic complexity 71 (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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9bcdd2104a88fd3d31366789937fa1a1f372f9ab49bba469a7879dd0ca9b46"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::solve_expectation (cyclomatic 70): AnswersSolver::solve_expectation has cyclomatic complexity 70 (threshold 15). Of this number, 65 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd3dbb360f2de20269670912d98c211bea4f3a666268105e14de882fbc3353d"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::lookup_attr_static1 (cyclomatic 68): AnswersSolver::lookup_attr_static1 has cyclomatic complexity 68 (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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee9026f8fa835773273bacd6747c551c1513378b547c1f006d29438abe679e3"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::expr_infer_impl_helper (cyclomatic 68): AnswersSolver::expr_infer_impl_helper has cyclomatic complexity 68 (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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc325aa8deb828a52486b32da295bdb9a39b93e21727ecff69956d368d52bf6b"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckArgs::finish_cli_run (cyclomatic 63): CheckArgs::finish_cli_run 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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac8c35b170c8b2cf4f7dda99c7745e162303bcefcf8b5fd139b46868aa94223"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::completion_sorted_opt_with_incomplete (cyclomatic 58): Transaction::completion_sorted_opt_with_incomplete 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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"025b630631946c123a643db622e6921c22edef3edf82422cd7416c88aa7dbc53"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::local_quickfix_code_actions_sorted (cyclomatic 57): Transaction::local_quickfix_code_actions_sorted 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":3803}}}],"partialFingerprints":{"codehealthFindingId/v1":"262ccfa2460886362705034ed1070bcb4c41eb8953c8a7dcdb770c1ba8612d12"}},{"ruleId":"D1","level":"warning","message":{"text":"NarrowOps::from_expr_helper (cyclomatic 56): NarrowOps::from_expr_helper has cyclomatic complexity 56 (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":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"327c6d71b4474e5d55b251de290639c00c2c81453c595b4c270faf0d5395b7f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Subset::is_subset_eq_var (cyclomatic 55): Subset::is_subset_eq_var 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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcd2d5df702415d1bddcb27ac428a9c0aeec5d6c750b6e698b2a836bf3e9665"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeConverter::convert (cyclomatic 55): TypeConverter::convert has cyclomatic complexity 55 (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":"pyrefly/lib/tsp/type_conversion.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5994b1cb1f7f1df47eb2ad4d70d37cd30734067f9862a24e6cb7d0b73e9efcc4"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::call_functools_partial (cyclomatic 54): AnswersSolver::call_functools_partial 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":"pyrefly/lib/alt/functools.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"188f0341d2683847256bfc26dfcf53c33d9dec5954cdb72f1c24a599fbc752e3"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::error::suppress::update_suppressions_in_files (cyclomatic 52): pyrefly::lib::error::suppress::update_suppressions_in_files 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":"pyrefly/lib/error/suppress.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8491407e6a01f9d4bedd331bced25a66024fe8e12b4cb5c23f662c69227fb129"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::find_definition (cyclomatic 51): Transaction::find_definition 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":3076}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7fe8d4987493d2481678e9402c8dbccc40c8130bd1d9358c9d2447ed0c9bff"}},{"ruleId":"D1","level":"warning","message":{"text":"DslValidator::validate_return (cyclomatic 50): DslValidator::validate_return 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":5137}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c4fda9b05621422c15b4bf0211d7f1793e1f39644bab9651a2d3539066c211"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::as_attribute_base1_of_type (cyclomatic 49): AnswersSolver::as_attribute_base1_of_type has cyclomatic complexity 49 (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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2927}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed1c3d936cef7b32c5142f3b5fc4136aa026e8ccc3e29907c241757edde5f9f"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::inlay_hints (cyclomatic 49): Transaction::inlay_hints 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":"pyrefly/lib/lsp/wasm/inlay_hints.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2ff4df564f7e0f592dc3630bb50abae61fbe8ab91836198551bb08547d4df0"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::expr_call_infer (cyclomatic 48): AnswersSolver::expr_call_infer has cyclomatic complexity 48 (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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ab2f84c28be237b58c2f6c56094a9d084aa17846cca5dcf7ef7b14f3de3366"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::decorated_function_type (cyclomatic 48): AnswersSolver::decorated_function_type 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2f7282e9321a1328a9ae2be2307a989edb0c924901cd29ec5cd77d75076a87"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::report::cinderx::convert::type_to_structured (cyclomatic 48): pyrefly::lib::report::cinderx::convert::type_to_structured has cyclomatic complexity 48 (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":"pyrefly/lib/report/cinderx/convert.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bc46b5a219c817e116b9eced2c0d9ff4924268be829f4461f30864203eec82"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::is_class_attribute_subset (cyclomatic 47): AnswersSolver::is_class_attribute_subset 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b42085a611e0cc2ae349bf514db8f36a2b3a6a704ffb81192aee9cf3efa0a52"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::class_metadata_of (cyclomatic 44): AnswersSolver::class_metadata_of 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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8b17c29ebeb2114b48a9a9ab848695d57d6cebddc5a55b969aca89662f11ff"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::parse_dimension_expr_with_context (cyclomatic 43): AnswersSolver::parse_dimension_expr_with_context 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3e88a8dc379e1959439f8f2e0e0ebe58be472e41fed53ee98ef30b231fe83d"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::subscript_str_literal (cyclomatic 43): AnswersSolver::subscript_str_literal 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":"pyrefly/lib/alt/subscript.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"172eb69fe71e9904eb3b98d9fc876dd3ee4266555414d55199fcbc8a3697f455"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::narrow (cyclomatic 42): AnswersSolver::narrow 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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"117e435678a3e222e2424f2fa9f46a3b70ed8aecbc8f48e7850c6764672805c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::code_action (cyclomatic 42): Server::code_action 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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28236ea8c916d4b99a95023cee2a8e5c9d6dc8028f503c3ff685a2ac2ade470"}},{"ruleId":"D1","level":"warning","message":{"text":"SysInfo::evaluate (cyclomatic 41): SysInfo::evaluate has cyclomatic complexity 41 (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":"crates/pyrefly_python/src/sys_info.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9adda22b16792b33ec8900b676cee5956e407f44cb24d451df0837313a403d6"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::call_infer_with_callee_range (cyclomatic 41): AnswersSolver::call_infer_with_callee_range 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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"17014800c52b01f34244783e2e3a828af3961fd94b6ea700c0bc5798774f833f"}},{"ruleId":"D1","level":"warning","message":{"text":"Solver::finish_quantified_with_captures (cyclomatic 41): Solver::finish_quantified_with_captures 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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dcddcf6e3797fc8c2065781bf4a755a9c79efd8f08ed4924889c8eaa2fa66a"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::commands::coverage::collect::parse_functions (cyclomatic 41): pyrefly::lib::commands::coverage::collect::parse_functions 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":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"487700d16d87ac6f3e0fcff1609ddc661f62b1455f4ea19f350456f0cdedeb17"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::einops::evaluate_einops_pattern (cyclomatic 40): pyrefly_types::einops::evaluate_einops_pattern 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":"crates/pyrefly_types/src/einops.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb3affc6b003f4e4ef5a83890f1b8a39d5b0f744ef62453e0b6b8cab8b8a83c"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::shape_index::lower_index_type_in_position (cyclomatic 40): pyrefly_types::shape_index::lower_index_type_in_position has cyclomatic complexity 40 (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":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7f3bbf6bc950442e2d7956986a2817e6ce2283167be0cbae0f48d3edc2a52d"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigOverrideArgs::override_config_at (cyclomatic 39): ConfigOverrideArgs::override_config_at has cyclomatic complexity 39 (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":"crates/pyrefly_config/src/args.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"636108d24192483d4090907d9d7c553f31d6da97b9763745ca5ec26ea1d59bf4"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_python::folding::folding_ranges (cyclomatic 38): pyrefly_python::folding::folding_ranges 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":"crates/pyrefly_python/src/folding.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab660406b694e10a5b8518c92bc408a68f57e3b4e3b8e8806a99874f5a7d0f57"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCheckKind::format_error (cyclomatic 38): TypeCheckKind::format_error has cyclomatic complexity 38 (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":"pyrefly/lib/error/display.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56152c4b958d7650423b63a5d6e497dc096f8da03756608fc66f3f0dc234deb"}},{"ruleId":"D1","level":"warning","message":{"text":"StructurallyValidatedTypeShapeDslFunction::evaluate_generator (cyclomatic 37): StructurallyValidatedTypeShapeDslFunction::evaluate_generator has cyclomatic complexity 37 (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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6726}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44d0b0bb5d948c5baa6fba6ec3ecb1bedd68e7b0b81998e49acce4640e836bc"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::declared_bool_value (cyclomatic 37): AnswersSolver::declared_bool_value has cyclomatic complexity 37 (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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":2777}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7a8a9d19159a182554305f6ef40340830a1a4a38c4e0b9bee40c45650a0272"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticTokenBuilder::process_stmt (cyclomatic 37): SemanticTokenBuilder::process_stmt 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":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"394328d6cf6fdf6f6d30c2ee3c09899aa38c65905584b80c51151033b28fb58d"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::demand (cyclomatic 37): Transaction::demand 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":"pyrefly/lib/state/state.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38ea66f55eb9fe225f56dd6db86cb0eef25c6cab4c832cd6766471c096880ef"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::simplify::collapse_literals (cyclomatic 36): pyrefly_types::simplify::collapse_literals has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/simplify.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b060acbc26f53f13610dd0e955b37e887b43c402849fd62166fa34e714a43b8"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::check_fstring_format_spec_for_type (cyclomatic 36): AnswersSolver::check_fstring_format_spec_for_type has cyclomatic complexity 36 (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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7473fd25782f9fd476513e5a5ceee805ae77849f3f4f4426f3d125620aa8c6"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::apply_special_form (cyclomatic 36): AnswersSolver::apply_special_form has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/specials.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a488511a1bf07d7cb5e649ac73f56643d1b2613f45a18e39ebc30a0f84a9eaa"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::undecorated_function (cyclomatic 35): AnswersSolver::undecorated_function 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f938a8a91be016fa64d7350f540cf139244dbc7e537f42a35c318bd1e3db42"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::try_int_binop (cyclomatic 35): AnswersSolver::try_int_binop has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9307c301b2fd91b73cea477d2a61cc4e32faea4b4c760864ac5cd5288abac37e"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::ensure_type_impl (cyclomatic 35): BindingsBuilder::ensure_type_impl has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b9457e86292403f8b79eb7ab6bc4c58ca16a5f82f9b813ed6e5bd99e12a61c"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::commands::coverage::collect::parse_variables (cyclomatic 35): pyrefly::lib::commands::coverage::collect::parse_variables has cyclomatic complexity 35 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 16 belong to 2 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e41b24521883e59e3267b06ec08008fe52c009e180831f4d1a752bc25004f10"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::parse_base_class (cyclomatic 34): AnswersSolver::parse_base_class has cyclomatic complexity 34 (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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e323c730ded04444cc1207d7b7a6cd3c57f7b6e8775cf886d1c9d9018cca24f"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::dict_items_infer_inner (cyclomatic 34): AnswersSolver::dict_items_infer_inner 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad480c2d60eaffa28376b56bdc25d0a3d8548b9ac847775cfd090a7d2779a16"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::class_def_inner (cyclomatic 34): BindingsBuilder::class_def_inner 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":"pyrefly/lib/binding/class.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"407e36e70dfef0211910b787bc565ae7b7b27ac29feca7185bb0336b67880261"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::stmt_match (cyclomatic 34): BindingsBuilder::stmt_match 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":"pyrefly/lib/binding/pattern.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ba8d8b1ea82d838c28f832670cd7005a0f8abb76da940f5820889411f08779"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::untype_opt_with_context (cyclomatic 33): AnswersSolver::untype_opt_with_context has cyclomatic complexity 33 (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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7881}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cff72fef61b1768f9464ef0f24b623e5bf501f1bb58cbc3ad7d4ca5aeafd26"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::binding::attrs::collect_attrs_decorator_methods (cyclomatic 33): pyrefly::lib::binding::attrs::collect_attrs_decorator_methods 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":"pyrefly/lib/binding/attrs.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a183e1713f9be3bf416043254a9f311fa0170e102bff0378eea7557398770d0b"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::binding::function::function_last_expressions::f (cyclomatic 33): pyrefly::lib::binding::function::function_last_expressions::f 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":"pyrefly/lib/binding/function.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34b6e8aeaf88af3e344ae501bc3bcf57cab31ea49866c4baba9eda54730ee59"}},{"ruleId":"D1","level":"warning","message":{"text":"extension.activate (cyclomatic 33): extension.activate has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 6 of the 33 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 489, 409, 551, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/extension.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"04695d138bf41097e3ee6884714fc00f86a112aa4373da98738bfa57bf445eea"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::resolve_type_shape_dsl_intrinsic (cyclomatic 32): AnswersSolver::resolve_type_shape_dsl_intrinsic has cyclomatic complexity 32 (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":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55567d89ad3c838379ed4937659fb10116bcaa5c23ca8b9820467100a34d008"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::class_bases_of (cyclomatic 32): AnswersSolver::class_bases_of 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":"pyrefly/lib/alt/types/class_bases.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6ba9714413355e1201c4838b2e74e361304f0c3870ac55c3ca0455114b79f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Subset::bind_tensor_dimensions (cyclomatic 32): Subset::bind_tensor_dimensions has cyclomatic complexity 32 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":3125}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d09e789468cab566d79055d147c330e9d60c5bc08d241f2a2d5f3d90bb3405"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::alt::regex::validate_pattern (cyclomatic 32): pyrefly::lib::alt::regex::validate_pattern 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":"pyrefly/lib/alt/regex.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabf82524205f279688d34005177ee9693bbcf82b78156d36a57040eaab19308"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_config::migration::mypy::pyproject::pyproject_to_ini (cyclomatic 31): pyrefly_config::migration::mypy::pyproject::pyproject_to_ini has cyclomatic complexity 31 (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":"crates/pyrefly_config/src/migration/mypy/pyproject.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fae25bafe1e1d00933b2ecc20c206c15ae02faf36ff0588d464f139a5e89aab"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::polars_join (cyclomatic 31): AnswersSolver::polars_join 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3528}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c94a5173bc5867fe5fc6976a6fe4f449df2257f7fd6bdccc9a198bae93268a"}},{"ruleId":"D1","level":"warning","message":{"text":"Subset::is_subset_tuple (cyclomatic 31): Subset::is_subset_tuple 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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4a4f3a9fa3e8f35e498980b7ee17fc8d1312b2e235f454d0aa39ecbb26013c"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::add_match_class_keyword_completions (cyclomatic 31): Transaction::add_match_class_keyword_completions 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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5a4ba8f944feb32c860b6518c34a3c1625683004298ced90a191bb480e2c79"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::module::finder::find_import_with_mode (cyclomatic 31): pyrefly::lib::module::finder::find_import_with_mode has cyclomatic complexity 31 (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":"pyrefly/lib/module/finder.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e218617245af87921a1668941972ac605763c925f550bcfc4c6038414e6205b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::construct_class_inner (cyclomatic 30): AnswersSolver::construct_class_inner 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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5a786625945dfddd25640773093c84f83ed9cddbd7d22cb82d6318f20f5f9a"}},{"ruleId":"D1","level":"warning","message":{"text":"DslValidator::validate_dimension (cyclomatic 29): DslValidator::validate_dimension has cyclomatic complexity 29 (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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27422aeb8713aa66aa000e1afa4c242ace92394b7f2e1844db415a729cbdda5"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::callable_infer_inner (cyclomatic 29): AnswersSolver::callable_infer_inner 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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a22b0fed83da0a685392278204763dfd0674dd73a1c1c38ae72ec6435bb661d"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::get_dataclass_synthesized_fields (cyclomatic 29): AnswersSolver::get_dataclass_synthesized_fields 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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5bb4ec7feedd47aa77a70a0cd723d3358f90efa51a3bc316a60dec8e3ecde0"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::get_params_and_paramspec (cyclomatic 29): AnswersSolver::get_params_and_paramspec 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0aac07b81d0407c7ec0591dc7fc96894db99ebb881d6342e40564ec6deea9f"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::check_shape_flag_constructor_sources (cyclomatic 29): AnswersSolver::check_shape_flag_constructor_sources 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":"pyrefly/lib/alt/shape_flag.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cbafcdefc588693fdb672d06a56ca9f14b73afd11500af1cbc4551a903b416"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::merged_flow_info (cyclomatic 29): BindingsBuilder::merged_flow_info 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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":4777}}}],"partialFingerprints":{"codehealthFindingId/v1":"226925bbc7ff91538cf216bc267c99c8100e9b3c3441596f96c3947e715576ac"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeShapeDslHelperCall::argument_domains (cyclomatic 28): TypeShapeDslHelperCall::argument_domains 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b57a0f2efb703f91cc7afd39a3b9961d81490153d63782360b7d742a11c9d2"}},{"ruleId":"D1","level":"warning","message":{"text":"DslValidator::validate_assignment_value (cyclomatic 28): DslValidator::validate_assignment_value 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":4103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11b12f998eccc01b0be326c8109669a6e65e80076303f0d05babac8b3347cc1"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::override_base_dictates_any (cyclomatic 28): AnswersSolver::override_base_dictates_any has cyclomatic complexity 28 (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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea816033ed830a98067b99a60ee872a303634637b0b5d71d97602e5943a14a41"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::intersect_guarantees (cyclomatic 28): AnswersSolver::intersect_guarantees has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbe92c7bc38f496ec27ec84ad035f5e8412b8bc01cc31765e43dedbf3cdef5b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::binding_to_type_unpacked_value (cyclomatic 28): AnswersSolver::binding_to_type_unpacked_value 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":5629}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c9a211e2b4a113c77b0feeac2ed15d79063defd875ba2a0315cd6581a993f4"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::function_body (cyclomatic 28): BindingsBuilder::function_body 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":"pyrefly/lib/binding/function.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cc21180cc0dcbcf1b1f4b52c387e470eba9bcc415cbe19752308d8d982ed2a"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::einops::parse_expression (cyclomatic 27): pyrefly_types::einops::parse_expression 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":"crates/pyrefly_types/src/einops.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80b6329771160eff7d6510978fe11bdf3b2edc39d2caf33f511dc3c22276e63"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::get_django_instance_attribute (cyclomatic 27): AnswersSolver::get_django_instance_attribute 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":"pyrefly/lib/alt/class/django.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"d121528bf3dc9ebdec8cec9aaf7789ce41f30c34308a744c890170809b91f884"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::expr_annotation_with_comment (cyclomatic 27): AnswersSolver::expr_annotation_with_comment 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"db02883273cec14a3169347f404dc4f5790e12a30332d5f3dfe5613e2471906f"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::check_type_is_class_object (cyclomatic 27): AnswersSolver::check_type_is_class_object 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":"pyrefly/lib/alt/special_calls.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdda73d6196af23ac022f58ea99716c50ccd69b1b375b29307ef2dfce4f67353"}},{"ruleId":"D1","level":"warning","message":{"text":"Scopes::finish_class_and_get_field_definitions (cyclomatic 27): Scopes::finish_class_and_get_field_definitions 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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":3806}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedc70d4a1397096bd083b77788eb02d96a4c931ed4b750fb4c1a3c1c1a2c4cc"}},{"ruleId":"D1","level":"warning","message":{"text":"CalleesWithLocation::callee_from_type (cyclomatic 27): CalleesWithLocation::callee_from_type has cyclomatic complexity 27 (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":"pyrefly/lib/query.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea97aed02701e5a50009ca00f759bd12b27bfc0dfc93f16481d3c16ff3016e6"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigFile::configure_at (cyclomatic 26): ConfigFile::configure_at 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":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b3e45d865f337b4f8ca5d0deea30dfc009b77ebc755c81492595dadebe45ec"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::check_pydantic_model_validate_input (cyclomatic 26): AnswersSolver::check_pydantic_model_validate_input 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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"874fb67e0da6c6ce0f850116d2b6c9bdccca8a4992fe000aac18c2b58191675e"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::call_overloads (cyclomatic 26): AnswersSolver::call_overloads 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":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d866ca0c0a01385770e9b21aac0fa0014cc9704bece100529322ab708165d4e"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::validate_type_form (cyclomatic 26): AnswersSolver::validate_type_form 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":8108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8fb08ce23c2b3f5704d05f99a65a427c0fd06dc479ed20d51b1289002b6297"}},{"ruleId":"D1","level":"warning","message":{"text":"Errors::collect_unused_ignore_errors_for_module (cyclomatic 26): Errors::collect_unused_ignore_errors_for_module 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":"pyrefly/lib/state/errors.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fd2ef135a7530477e679a3a5b3cf1e79f57b8bde4dae498a767bdf2315ca0b"}},{"ruleId":"D1","level":"warning","message":{"text":"PolarsScalarDType::supertype (cyclomatic 25): PolarsScalarDType::supertype has cyclomatic complexity 25 (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":"crates/pyrefly_types/src/polars_dtype.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"067529e0f3ac1ae62c5d0194e7ae807d6de5dc13008c826997bce19a2efbc071"}},{"ruleId":"D1","level":"warning","message":{"text":"DslValidator::validate_generator_source (cyclomatic 25): DslValidator::validate_generator_source 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"37586f0a2510ba5f77faf6e2ee696c932e73d96110bae400351a8d8c923612cf"}},{"ruleId":"D1","level":"warning","message":{"text":"DslValidator::validate_generator (cyclomatic 25): DslValidator::validate_generator 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c16032ef480f2d04e697e9893bd6a650c6c4108baca9bf268a4160ade362ce8"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::tuple_infer (cyclomatic 25): AnswersSolver::tuple_infer 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"873d0e141514bc0204a5251a8133b4c9f6deb7b6d75c14025f9b3c8bf47350ff"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::intersect_impl (cyclomatic 25): AnswersSolver::intersect_impl has cyclomatic complexity 25 (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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcb48c208bc93cb5d8e43403c252f5bc0b408347037bf5c012c1fb3a369fd04"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::overload_error (cyclomatic 25): AnswersSolver::overload_error 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":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"df828b714c84ed0ef358c0630410437e1759e0c3e9e41282bf22136b49b3ca8b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::find_closest_overload (cyclomatic 25): AnswersSolver::find_closest_overload 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":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"8850784ec859554860f4da8af5caf05b12927acc839dd52221e45f9e6c63d534"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::extract_pydantic_config_dict (cyclomatic 25): BindingsBuilder::extract_pydantic_config_dict 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":"pyrefly/lib/binding/pydantic.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"21065bd7277065d5a7745b7559f1466f0f3b6a1af03c7e2d232be7f7970186e8"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::merge_flow (cyclomatic 25): BindingsBuilder::merge_flow 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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":5047}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11c5b53ca883f4bda540dc6c43124c92bf11120e0f1def941a0193d922f2412"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::find_operator_dunder (cyclomatic 25): Transaction::find_operator_dunder 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30bd3503e8ade477af6d1d51c4397c285fa3112fe964bf00c00a59b8658859d"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::commands::infer::format_hints (cyclomatic 25): pyrefly::lib::commands::infer::format_hints 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":"pyrefly/lib/commands/infer.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b615a66426857982922581f7bcea268bb9997bd01d88dc8d550c21c88038961"}},{"ruleId":"D1","level":"warning","message":{"text":"stub_coverage._literal_all (cyclomatic 25): stub_coverage._literal_all 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":"tensor-shapes/stub_coverage.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"50acead241382bb1268020b636e1cc38dfc1fa684ad63c006ab5136af456e1d6"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_build::module_resolver::find_one_part_in_root (cyclomatic 24): pyrefly_build::module_resolver::find_one_part_in_root 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":"crates/pyrefly_build/src/module_resolver.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12c6b11d944bb6eb581c5e133ee28ac2a416bfb71791e622e3f61e4affbae05"}},{"ruleId":"D1","level":"warning","message":{"text":"StructurallyValidatedTypeShapeDslFunction::evaluate_any_generator (cyclomatic 24): StructurallyValidatedTypeShapeDslFunction::evaluate_any_generator has cyclomatic complexity 24 (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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":7998}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9f1c113ec7648d1b9c0be55349434fe1bf07dd7312d0dbd83c6b3915532ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::resolve_class_attr_setter (cyclomatic 24): AnswersSolver::resolve_class_attr_setter has cyclomatic complexity 24 (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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":5897}}}],"partialFingerprints":{"codehealthFindingId/v1":"d745ffe15228267f193bd3709a21004deb2a613f8ec3e396eb33fb282360ab49"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::solve_function_binding (cyclomatic 24): AnswersSolver::solve_function_binding 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b19fcf9763e8d587a794592ca35bd7e56233e87f95d82477e17a27af0bcfb1"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::eval_polars_expr (cyclomatic 24): AnswersSolver::eval_polars_expr 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":2656}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac8e864fa777b906e69a09b8686cb7f811424a465e54060e12dcfeb87c69d3e"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::polars_expr_output_name (cyclomatic 24): AnswersSolver::polars_expr_output_name 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"be176a43ab0cd5c15c5fd5fbd22fd36cd8caae13b5280e1d26cab0b31f439fe0"}},{"ruleId":"D1","level":"warning","message":{"text":"InitArgs::create_config (cyclomatic 24): InitArgs::create_config 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":"pyrefly/lib/commands/init.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fd7adc8d20d88467f0f6ddde20387f0868eeda69ea8d5636020b9ac8bc8299"}},{"ruleId":"D1","level":"warning","message":{"text":"CallGraphVisitor::resolve_and_register_call (cyclomatic 24): CallGraphVisitor::resolve_and_register_call has cyclomatic complexity 24 (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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b2ab30e1b7425d0c35b2c61e4b447d43b678fc1e8b062ef7046a65def4daac"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::deprecated_contextmanager::replace_return_code_action (cyclomatic 24): pyrefly::lib::state::lsp::quick_fixes::deprecated_contextmanager::replace_return_code_action 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":"pyrefly/lib/state/lsp/quick_fixes/deprecated_contextmanager.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"429eeec7348aa41702f76452245af1d484611db53754b49422a67b7571dc7e24"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_protocol.convert_json_to_model (cyclomatic 24): generate_protocol.convert_json_to_model has cyclomatic complexity 24 (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":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0b993dec390afcc5bc2eb9d59759a659ff09a8f99585585f521ad1487198ba"}},{"ruleId":"D1","level":"warning","message":{"text":"stub_coverage.parse_stub (cyclomatic 24): stub_coverage.parse_stub 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":"tensor-shapes/stub_coverage.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34d18d72219d28ffe8c703bfe269d1390bf1440ee6d59af681862b8e89971bb"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigBase::fill_unset_from (cyclomatic 23): ConfigBase::fill_unset_from has cyclomatic complexity 23 (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":"crates/pyrefly_config/src/base.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"af18ba7a29736e679359bcfcb21aa87550ed1dd59df29f66987b74a704885788"}},{"ruleId":"D1","level":"warning","message":{"text":"DslValidator::collect_integer_expression_sources (cyclomatic 23): DslValidator::collect_integer_expression_sources 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3fd0330f849d5286a4f6314e1adedac0b71259bbc5957436c95b69b6ff1cf6"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::as_instance_attribute (cyclomatic 23): AnswersSolver::as_instance_attribute 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":3850}}}],"partialFingerprints":{"codehealthFindingId/v1":"10286492841e3c2f88ccbbbeb8c5a0598d38c4673144dbb405a05652335b80b3"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::get_dataclass_init (cyclomatic 23): AnswersSolver::get_dataclass_init 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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6087e86f2b6f6aede0056ec088126cf0f3c71ff0c74cd97c2efd6c1e951b012"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::expand_type_for_lax_mode (cyclomatic 23): AnswersSolver::expand_type_for_lax_mode 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":"pyrefly/lib/alt/class/pydantic_lax.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f509869c9b3f11ce2ebbdbd756c94dad1e59d5abddb16607e57d507836f25474"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::check_signature_consistency (cyclomatic 23): AnswersSolver::check_signature_consistency 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cf9a66cb192e759ab35ac2e898c43f0fa116724ba763b25f50dcccd94684aa"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::binop_types (cyclomatic 23): AnswersSolver::binop_types has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d00a77ef83038b678835eccf039695a69866b9e0651d097034ed1baf78a88b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::name_assign_infer (cyclomatic 23): AnswersSolver::name_assign_infer 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad956133c7c3105924fe7dbfab26c5cd4469a97b429c48767d907f621b04909"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::check_args_and_construct_tuple (cyclomatic 23): AnswersSolver::check_args_and_construct_tuple 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":"pyrefly/lib/alt/specials.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"416adbdc33b54f7579fbc4506ff5a317c02d070aaa4dd92416aaf5f35b1995b0"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::apply_literal (cyclomatic 23): AnswersSolver::apply_literal has cyclomatic complexity 23 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/specials.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5650ae3ecf7fe46128a771adb7d157a7994a0c662d4fc91dbd09dada878201bd"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::validate_type_var_default (cyclomatic 23): AnswersSolver::validate_type_var_default 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":"pyrefly/lib/alt/type_var_declaration.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75eac92d500d3e66cd066aadd65f3b5018e0970e91c8a154b584e7e0ca45736"}},{"ruleId":"D1","level":"warning","message":{"text":"InferArgs::run_inner (cyclomatic 23): InferArgs::run_inner 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":"pyrefly/lib/commands/infer.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c5e1e4418bdada9c2052e9b190561a9f9bbb5ba18fb14264d9b3915e90feec"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::notebook_document_did_change (cyclomatic 23): Server::notebook_document_did_change 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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4457}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa6c28db5baf339ed09b7a2a6add3942e775d5e725b6f2ece52b37867cef025"}},{"ruleId":"D1","level":"warning","message":{"text":"OverrideCodeLensProvider.provideCodeLenses (cyclomatic 23): OverrideCodeLensProvider.provideCodeLenses has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/overrideCodeLens.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1997870e23e0e0d3c11245441068b54296a24f1825149b20cfeacb0802758beb"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::shaped_array::reduce_axis_shape (cyclomatic 22): pyrefly_types::shaped_array::reduce_axis_shape 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":"crates/pyrefly_types/src/shaped_array.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec890a8c54b490fa8b666359d0c463b4d47d5021a96819f70f00677689e9b79"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::validate_dataclass_transform_defaults (cyclomatic 22): AnswersSolver::validate_dataclass_transform_defaults 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8138dd8d50d51b8479a9b41990d5369003d0766557a12ff5e88853c2c46605"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::pydantic_config (cyclomatic 22): AnswersSolver::pydantic_config 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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff703020cb09667e08d291e23a4a56e1e17586e093b7cd97f027a2f165d2579"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::type_var_like_args_from_call (cyclomatic 22): AnswersSolver::type_var_like_args_from_call 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":"pyrefly/lib/alt/type_var_declaration.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4798e04d6dc79e9342c7a63606f8fcdbeb0647706375e293237f43eb60c30aae"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingExpect::fmt (cyclomatic 22): BindingExpect::fmt has cyclomatic complexity 22 (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: Key::fmt (cyclomatic 34) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/binding.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18175b294b27be4f05e674a21c8d568cbf80d38b9d0052d28c32326c5f1b711"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::stmts (cyclomatic 22): BindingsBuilder::stmts 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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e8eff8cb370af9391723b90e82be57243bcbd309d81666166cfa40a1fa4631"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::bind_single_name_assign (cyclomatic 22): BindingsBuilder::bind_single_name_assign 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":"pyrefly/lib/binding/target.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"004871d24d79d77272ebcae8e9e57f4a99096db0aadc4b016539e324dca2a13c"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticTokenBuilder::process_syntax_tokens (cyclomatic 22): SemanticTokenBuilder::process_syntax_tokens 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":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aaa0abfba5d01be6e603c13d758ecfc1ec9592906438af1030bdd6fbdeb67e0"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::commands::coverage::collect::parse_instance_attrs (cyclomatic 22): pyrefly::lib::commands::coverage::collect::parse_instance_attrs 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":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"98afc63c4b35314990b07681a58b487674dabe3a9cde95127955e1e2ddc0c862"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::lsp::non_wasm::server::dispatch_lsp_events (cyclomatic 22): pyrefly::lib::lsp::non_wasm::server::dispatch_lsp_events 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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5747bbfa01e5f8edd17762280a9ee504cb1bf544f2145836fc889c4c4d58055f"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::lsp::wasm::hover::get_hover_with_verbosity (cyclomatic 22): pyrefly::lib::lsp::wasm::hover::get_hover_with_verbosity 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":"pyrefly/lib/lsp/wasm/hover.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14434887926ab7896d26a50084c25a34b6d8cacf443a3424d3ab49af1a68d96"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::stubgen::extract::extract_stmts (cyclomatic 22): pyrefly::lib::stubgen::extract::extract_stmts 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":"pyrefly/lib/stubgen/extract.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1062a088c7f2bbf2862cc810ae98f676e9373b46ed430b6dbdf552b8311a73d4"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::type_level_dsl::lower_parameter (cyclomatic 21): pyrefly_types::type_level_dsl::lower_parameter 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8662}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c79b2f02865c0f61cc9b878cc56cefcd8b12aacb50089197225b7677f5af68"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::lookup_magic_dunder_attr1 (cyclomatic 21): AnswersSolver::lookup_magic_dunder_attr1 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"714dff4fb33b6d074003d6c214035cac234c812ff0ac7b7d52c3850ce788fa7a"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::constrain_forwarded_overload_return (cyclomatic 21): AnswersSolver::constrain_forwarded_overload_return 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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f64d73c880e25d1472243a6eafdf9fb28b20c22fea78f85fdd77b606e4dbd86"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::check_consistent_multiple_inheritance (cyclomatic 21): AnswersSolver::check_consistent_multiple_inheritance 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":5004}}}],"partialFingerprints":{"codehealthFindingId/v1":"f647f0b860b50c55b0c84e87d72006b0615c1169d4e04e5ea323fa2ac1e74c66"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::decorate_returned_callable (cyclomatic 21): AnswersSolver::decorate_returned_callable 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"71eff2bb2ef45ce445e6bb7e88a3e276592f236b908d460a46910059a9e776c0"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::dataframe_list_element_type (cyclomatic 21): AnswersSolver::dataframe_list_element_type 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1d1d955593eb080c0552fde9a6c47049767093a324241f625a15a794c59279"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::polars_fill_null (cyclomatic 21): AnswersSolver::polars_fill_null 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"027e8db854772c4f26aeeb66c1d9f5c4c7807d64a5d90fc2a19f5bba9712282e"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::ensure_name_impl (cyclomatic 21): BindingsBuilder::ensure_name_impl 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":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"625eae2f44c8651d09a62d6fbd28cafa2757f126e1eb997ee2add96e9c85e371"}},{"ruleId":"D1","level":"warning","message":{"text":"TestAssertion::to_narrow_ops (cyclomatic 21): TestAssertion::to_narrow_ops 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":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b034fa051fde28d77656a26797b5ff185b9e8118f2b1aece9ab1d7ecfe85b73f"}},{"ruleId":"D1","level":"warning","message":{"text":"GleanState::declare_statement (cyclomatic 21): GleanState::declare_statement 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":"pyrefly/lib/report/glean/convert.rs"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b1e3372766cf834e2654df9d5ecf48cb7ed6bf1049646ee29c3411af1d99a3"}},{"ruleId":"D1","level":"warning","message":{"text":"GleanState::process_statement (cyclomatic 21): GleanState::process_statement 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":"pyrefly/lib/report/glean/convert.rs"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09c77fb260a133cf31d10faafc73a952288a088d39a5bd5f6b89ab8a2a24f5e"}},{"ruleId":"D1","level":"warning","message":{"text":"Solver::simplify_mut (cyclomatic 21): Solver::simplify_mut 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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22dc42538b4db506368efef47c7029292a1ff88003993156958f9b07ac8ac87"}},{"ruleId":"D1","level":"warning","message":{"text":"Subset::is_subset_eq_quantified (cyclomatic 21): Subset::is_subset_eq_quantified 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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3745}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e56e2e6d8e83a04d563312c260ca629998148e454a6b63d35bf221931386d45"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::clean (cyclomatic 21): Transaction::clean 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":"pyrefly/lib/state/state.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee2ec35d0b876c2ec63b875590fa9847896d7f5e00385de2fc21e65ec73aeac"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::export::symbols::build (cyclomatic 21): pyrefly::lib::export::symbols::build 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":"pyrefly/lib/export/symbols.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f25cf8ddbb86c3754d8bc00e3bde2cb09bbbfc8ac8c1fb76b76ab8021ca4edf"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::inline_variable::expand_statement_removal_range (cyclomatic 21): pyrefly::lib::state::lsp::quick_fixes::inline_variable::expand_statement_removal_range 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":"pyrefly/lib/state/lsp/quick_fixes/inline_variable.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d24f7783907d7920e57e0e46d026c3386ee3eeb5a251698f51122afec15878e"}},{"ruleId":"D1","level":"warning","message":{"text":"whyPyreflyGridItem.WhyPyreflyGridItem (cyclomatic 21): whyPyreflyGridItem.WhyPyreflyGridItem has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 86, handleClick, handleKeyDown). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/components/landing-page/whyPyreflyGridItem.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a028372578b005000b9964c05c169d75f85f270e5e2071ab5345dab265ff39e8"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_build::module_resolver::find_one_part_prefix (cyclomatic 20): pyrefly_build::module_resolver::find_one_part_prefix 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":"crates/pyrefly_build/src/module_resolver.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c46068f69f3571cc2d5ac0232f7722d8ea203209c39d8cd8efeac987646b80"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeDisplayContext::fmt_params_hover (cyclomatic 20): TypeDisplayContext::fmt_params_hover 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":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0853d50ed78c48bd46a46cc6b4bb002cee9ad88b76f40be87243d3de7890bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"SideParser::parse (cyclomatic 20): SideParser::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":"crates/pyrefly_types/src/gufunc.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"589ad3cf08ff766b23e75c17cc4a44d820482df245a80a08b48d5ec30dd0f874"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::einsum::parse_einops_einsum_equation (cyclomatic 20): pyrefly_types::einsum::parse_einops_einsum_equation 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":"crates/pyrefly_types/src/einsum.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d832a0b3e0a7965c5863bda41effc10b078c0d0fb009ca943d436e223cb5cf92"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::call_intersection (cyclomatic 20): AnswersSolver::call_intersection 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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea38996a8cb9cf6c79509a9c3c6ede249ebff85c17434e90647c6e01b3ffe702"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::analyze_class_field_value (cyclomatic 20): AnswersSolver::analyze_class_field_value 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":3327}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ea1f644abea6eb1659412466da2cac51fcb8c75fce10a4c105d908e5f0a3b1"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::explicit_slots (cyclomatic 20): AnswersSolver::explicit_slots has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c24262a88255b918833a777c26909697232cb281c692efd028375970ec7a26"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::calculate_typed_dict_field (cyclomatic 20): AnswersSolver::calculate_typed_dict_field 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":"pyrefly/lib/alt/class/typed_dict.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da6b200cba4d25c70d7824e821ac139722069fb3353c5c3f45d9c0ca9d1baf1"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::polars_construct_options (cyclomatic 20): AnswersSolver::polars_construct_options 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":2107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a4fc7cd8bebdedbe6c13f914790a83644f957644a93a2edf6552b405ef77b6"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::iterate (cyclomatic 20): AnswersSolver::iterate has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d38d53b1a59fb25a9969b692c2ff017f9acf6196cd651a57786ec4ef192b5a"}},{"ruleId":"D1","level":"warning","message":{"text":"CallArg::pre_eval (cyclomatic 20): CallArg::pre_eval 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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd348f5be9ecfb5d2ae4ba8139ed334305071217797b6a4a5e4f57b050fc252"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::commands::coverage::collect::collect_module_reports (cyclomatic 20): pyrefly::lib::commands::coverage::collect::collect_module_reports 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":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d9c8599f294b7210507acdbc182591a5cd66b0ec47f0f49d95ab47e50f1031"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::report::cinderx::collect::collect_call_contextual_types (cyclomatic 20): pyrefly::lib::report::cinderx::collect::collect_call_contextual_types 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":"pyrefly/lib/report/cinderx/collect.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec6bf0451ec8a192725f95b3f24d33a94ca2b77f93697b465b21b41108024df"}},{"ruleId":"D1","level":"warning","message":{"text":"Value::compare (cyclomatic 19): Value::compare 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":"crates/pyrefly_python/src/sys_info.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa941fb55a22c97addaf64ff1eeb1876380448060cd1d8694256fefa5ef5f21"}},{"ruleId":"D1","level":"warning","message":{"text":"DslValidator::validate_flag_int (cyclomatic 19): DslValidator::validate_flag_int 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2868}}}],"partialFingerprints":{"codehealthFindingId/v1":"07761f498b3617d60f9640841021ac89b9f5cdf2bbae80df8bf4f082332aacd3"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::dimension::canonicalize_division (cyclomatic 19): pyrefly_types::dimension::canonicalize_division 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: pyrefly_types::dimension::compare_int (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"975a78a2dfebfa414f21dddfad0257baeda19afbe97057b64188401e9605e41f"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::gufunc::parse_gufunc_signature (cyclomatic 19): pyrefly_types::gufunc::parse_gufunc_signature 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":"crates/pyrefly_types/src/gufunc.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"854e143653d621086a5836ff8df1570c6045d993b02dc157e93cdea7f483457d"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::completions_inner1 (cyclomatic 19): AnswersSolver::completions_inner1 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":3630}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c8d276d24cd37ff9b8fc33ce88cffc0f1506e7b045df461dc448db8f0bc4ae"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::check_dict_items_against_typed_dict (cyclomatic 19): AnswersSolver::check_dict_items_against_typed_dict 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":"pyrefly/lib/alt/class/typed_dict.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cf29ed6eb72f239d9c9beb00ff98f3973411083d71163de739cc9b4555d7c6"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::polars_output_count (cyclomatic 19): AnswersSolver::polars_output_count 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. This is NOT this file\u0027s highest cyclomatic complexity: AnswersSolver::polars_method_call (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"17487be2b49701e1b935d83cb2234f1343b54f0e249a275f036d3cbaac9778aa"}},{"ruleId":"D1","level":"warning","message":{"text":"Bindings::new (cyclomatic 19): Bindings::new 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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefc661503b93bff3d18cc92e5751319210378b3deb9c40f1c6d3bad3d986ea6"}},{"ruleId":"D1","level":"warning","message":{"text":"Scopes::look_up_name_for_read (cyclomatic 19): Scopes::look_up_name_for_read 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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":4219}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ff1418632044f1c1c52716d3cbc7a48f9e9db71c4ed123900f4c87cea6a3aa"}},{"ruleId":"D1","level":"warning","message":{"text":"MemberRenderer::params (cyclomatic 19): MemberRenderer::params 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":"pyrefly/lib/state/lsp/quick_fixes/implement_abstract_members.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"7270e1fbebf681e9f1a5e1dc69cef395e93be0a612406fecb98670aa558d65af"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::pytest_fixture_definitions_for_parameter (cyclomatic 19): Transaction::pytest_fixture_definitions_for_parameter 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":"pyrefly/lib/state/lsp/pytest.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"800fc7bb9de554383b42bc23cc10bfd75cc94cc84e6b1529b794dc3d880e5ce3"}},{"ruleId":"D1","level":"warning","message":{"text":"CancellableTransaction::override_code_lens_targets (cyclomatic 19): CancellableTransaction::override_code_lens_targets 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: Transaction::identifier_from_covering_nodes (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":6040}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ddb8ddc503dc6be17a5a7a97817a2527c735d14de6452f8a7e5f63943e8088"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::report::pysa::types::get_classes_of_type (cyclomatic 19): pyrefly::lib::report::pysa::types::get_classes_of_type 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":"pyrefly/lib/report/pysa/types.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"868be9874eb44c44ddc30132f1d43e1ac4e3fcd433e7addac53b941858951488"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::extract_function::extract_function_code_actions (cyclomatic 19): pyrefly::lib::state::lsp::quick_fixes::extract_function::extract_function_code_actions 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":"pyrefly/lib/state/lsp/quick_fixes/extract_function.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dec759f40f501d8b998a042a08ac70528563f0a05548d97e8b7215cd5d98cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_config::migration::mypy::util::make_error_config (cyclomatic 18): pyrefly_config::migration::mypy::util::make_error_config 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 is NOT this file\u0027s highest cyclomatic complexity: pyrefly_config::migration::mypy::util::code_to_kind (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/mypy/util.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27fc902234e20695fb935ea19f6c77cd2b40683408718185d9d04a43deaa75d"}},{"ruleId":"D1","level":"warning","message":{"text":"Int::fmt_prec (cyclomatic 18): Int::fmt_prec has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: pyrefly_types::dimension::compare_int (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9732c2e3c7315b86ca4ce4e3d95ff5a57e2a3bfcde43dc4687de47927e43b8"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::dimension::int_is_provably_negative (cyclomatic 18): pyrefly_types::dimension::int_is_provably_negative 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. This is NOT this file\u0027s highest cyclomatic complexity: pyrefly_types::dimension::compare_int (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aa02a0b891e025b4a550417a597175b1e13ecc53ccc9bee410349d245f09e3"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::literal::write_escaped_string (cyclomatic 18): pyrefly_types::literal::write_escaped_string has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/literal.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"11851130b1409a187070fad0dc98fd1ff2a18da6965f2ad728093d021576d070"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::shape_index::lower_integer_tuple (cyclomatic 18): pyrefly_types::shape_index::lower_integer_tuple has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"259054740992928c947a4d4d3f1252feed8cd84103810acdf12cd651a1e7a739"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::determine_read_only_reason (cyclomatic 18): AnswersSolver::determine_read_only_reason 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":3155}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a63e74dbe278f3d6d67077c46797694a4b483d1d073d51c5507df19ae33afc"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::as_class_attribute_inner (cyclomatic 18): AnswersSolver::as_class_attribute_inner has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":4029}}}],"partialFingerprints":{"codehealthFindingId/v1":"708550227bda6adc38112e24546e59f005a7916f60f0a02b6d8033060b1501b9"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::solve_django_reverse_relations (cyclomatic 18): AnswersSolver::solve_django_reverse_relations 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":"pyrefly/lib/alt/class/django.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5dab6473d2160d7555a8a5c3cd9ffd85d37e2169041e80f40d81f3d808cb3b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::parse_fstring_format_spec (cyclomatic 18): AnswersSolver::parse_fstring_format_spec 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3a3be02f570760507854c9d81372375668b7df1c84e6c7e3063978280a8b8e"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::check_for_deprecated_call (cyclomatic 18): AnswersSolver::check_for_deprecated_call has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e219089df9a76d1efed3dfa268f021c901e6bd1e77cf398cb21db52c0e71ac"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::polars_csv_options (cyclomatic 18): AnswersSolver::polars_csv_options has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: AnswersSolver::polars_method_call (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe87156823b504cb4b80971f84553197e1e93800e54617065ed4d7b5e06c80c9"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::project_regular_nested_list (cyclomatic 18): AnswersSolver::project_regular_nested_list has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/regular_nested_list.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99c5996d5e927a03aa0b51b2d0d28ac8940a5f63c29f777a8e703115c2d9118"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::validated_tparams (cyclomatic 18): AnswersSolver::validated_tparams 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"355660f8ddf1f16163731b58360f7cb152de7ccf83f5328abe26146846a34878"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::solve_super_binding (cyclomatic 18): AnswersSolver::solve_super_binding 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"515525ad0a24cbac937a2216d3b3c751eae40b962519c2cd5a0ef07c04262086"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::call_typing_cast (cyclomatic 18): AnswersSolver::call_typing_cast 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":"pyrefly/lib/alt/special_calls.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e642cd6a02b3e894a01809f44d5500a72d18ce912fe72b8fd0a3d65ead3cf05d"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::is_type_shape_dsl_argument (cyclomatic 18): AnswersSolver::is_type_shape_dsl_argument has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"5595e481d7eec243d28286cc32917cd0ea4a55bfa14eda83e22553c0fcf54859"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::as_assert_in_test (cyclomatic 18): BindingsBuilder::as_assert_in_test has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e88f7acdebebc70eb56f775077b2e5abe1e5f1814784d13e356df056185d92"}},{"ruleId":"D1","level":"warning","message":{"text":"Scopes::current_exported_function_impl (cyclomatic 18): Scopes::current_exported_function_impl has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/ast_visitor.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"586a0bfadabbcf5fd371a6a6c6713f680abac1b673e906d80abbcd0b50eef3a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::visit_stmt (cyclomatic 18): Builder::visit_stmt has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/scip/symbols.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d00f8b5206a939464798370aed1505560b304221f8d1df61120b0302051e92d"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer::document (cyclomatic 18): Indexer::document 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":"pyrefly/lib/report/scip.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7be78f0f8bd2cabe55dfe1d05e1195aa9443b9f6177fa92d2c7dfd746eec92"}},{"ruleId":"D1","level":"warning","message":{"text":"Subset::check_targs (cyclomatic 18): Subset::check_targs 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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"435311caddea9940dd13e7e40d14dc9f8e5979bad55469943cc0ac1bf3369fda"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::extend_dict_key_suggestions (cyclomatic 18): Transaction::extend_dict_key_suggestions 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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"d910d22ee8b33e552ae3a755eb8da1a19935e7a1f1fdfe2ecca01908e7a6df72"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_protocol.replace_integer_enum (cyclomatic 18): generate_protocol.replace_integer_enum 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":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea0f1eaba42c7104865cdbc3fab3f6e13904edc44295ea75364fca2937b0c53"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_python::docstring::parse_numpydoc_params (cyclomatic 17): pyrefly_python::docstring::parse_numpydoc_params 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":"crates/pyrefly_python/src/docstring.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a35c45d320898d62a3adb4f728b4866897321cdc2c3b3f3bee7a75171e48a9"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_python::ignore::parse_ignore_all (cyclomatic 17): pyrefly_python::ignore::parse_ignore_all 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":"crates/pyrefly_python/src/ignore.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e2e645da2c3aaf74397dafa00dadb22df0cbdf3c48c6a7b37cba29894a3f90"}},{"ruleId":"D1","level":"warning","message":{"text":"DslValidator::validate_int_tuple_expression (cyclomatic 17): DslValidator::validate_int_tuple_expression has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3974}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbaafc1ddb3f27499a7e9ae175394a2ad158bcf4fd05f6d4bc6359c04b070a8"}},{"ruleId":"D1","level":"warning","message":{"text":"DslValidator::classify_deferred_integer_expression (cyclomatic 17): DslValidator::classify_deferred_integer_expression has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":4510}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfe126b2cca6caf5eced02870f79726633ea85591e73d39a8b8bec27113c5b8"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::dimension::canonicalize_product (cyclomatic 17): pyrefly_types::dimension::canonicalize_product 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. This is NOT this file\u0027s highest cyclomatic complexity: pyrefly_types::dimension::compare_int (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c45d143ef531d32348616104cd9faa6c03060091f11cb6530f51822d5bad8fa"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::type_level_dsl::evaluate_dimension_arithmetic (cyclomatic 17): pyrefly_types::type_level_dsl::evaluate_dimension_arithmetic has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8731}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd324f5c8e87ab2451d4798c2e0116d98833db912742388e0bc22eb9006f5fa"}},{"ruleId":"D1","level":"warning","message":{"text":"UpwardSearch::directory_absolute (cyclomatic 17): UpwardSearch::directory_absolute 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":"crates/pyrefly_util/src/upward_search.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3874234bd4f3eb541cc1467bdd496fde7d7e323d6fc463a9570e482da3b12ded"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::constructor_to_callable (cyclomatic 17): AnswersSolver::constructor_to_callable 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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":3016}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42b78c9d29daf81e8dd933c1deabca32935f83ee38d3d00a75814b28b939cbb"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::binary_operator_order (cyclomatic 17): AnswersSolver::binary_operator_order 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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"699f2c83f44d3060595f62050436b125cde61e2afae645cc4b1d5a684ca936ef"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::polars_group_by_agg (cyclomatic 17): AnswersSolver::polars_group_by_agg 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. This is NOT this file\u0027s highest cyclomatic complexity: AnswersSolver::polars_method_call (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3024}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c25fd699bb1f8ef02abecd3fcb635b0b74f30e352e87429c75b1a7927ec2f83"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::shaped_type (cyclomatic 17): AnswersSolver::shaped_type has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/shaped.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87b882ec05d78dc84026a7bd15ec0ad7a76ac9c608817fc8d5fdb1219db43e1"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::check_except_clause_reachability (cyclomatic 17): AnswersSolver::check_except_clause_reachability 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":5260}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c36b37d30e6f4a118e114cf48f9c03580b4a448162cecd5faeb7449beea4bfc"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::as_class_info::f (cyclomatic 17): AnswersSolver::as_class_info::f 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":"pyrefly/lib/alt/special_calls.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a47404daa8a780217a6e6dbd8a7841c7fde80586c162366c5f69710f3006d1"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::parse_type_shape_dsl_argument_inner (cyclomatic 17): AnswersSolver::parse_type_shape_dsl_argument_inner has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"91609891c6c0137df09b2767e0b27c7e812a37ab1044011cf830bbf628112a2b"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::shape_comment_target (cyclomatic 17): BindingsBuilder::shape_comment_target 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":"pyrefly/lib/binding/shape_type.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e608d8befc449b2718efa3de09931b11cad1a6527a41e1510dbdf728fa32de"}},{"ruleId":"D1","level":"warning","message":{"text":"PysaModuleIndex::build (cyclomatic 17): PysaModuleIndex::build 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":"pyrefly/lib/report/pysa/module_index.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09720d08d90aaa1b38a6b49ebd720bdf4a1e4cace2120a3d6484209c1cdbb67"}},{"ruleId":"D1","level":"warning","message":{"text":"MemberRenderer::signature (cyclomatic 17): MemberRenderer::signature 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":"pyrefly/lib/state/lsp/quick_fixes/implement_abstract_members.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f95b1bd8e94d2f88b58c08a081f4cf19e6b31f789ae8e573b71dad2b51a018"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticTokenBuilder::process_expr (cyclomatic 17): SemanticTokenBuilder::process_expr 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":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d3a6a0240582171038ac2527ba4e3330a456c478fdd219597800a4f021e140"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::move_module::build_module_member_consumer_import_updates (cyclomatic 17): pyrefly::lib::state::lsp::quick_fixes::move_module::build_module_member_consumer_import_updates 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":"pyrefly/lib/state/lsp/quick_fixes/move_module.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7146993d2a2b69addb365bc7b8a6bbe17f8ae5b686c8549eac59b6a14267c083"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::state::semantic_tokens::collect_disabled_ranges_from_stmt (cyclomatic 17): pyrefly::lib::state::semantic_tokens::collect_disabled_ranges_from_stmt 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":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc23b122a664c866e5ef712839c1d89985c56c5847dfd4f51d0cf574e109ca44"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_protocol.replace_flag_enum (cyclomatic 17): generate_protocol.replace_flag_enum 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":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cb7fefd348222fa2465653737501c5dd477cf808279d30f825eeaddaad81c7"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentArgs::override_environment_config (cyclomatic 16): EnvironmentArgs::override_environment_config 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":"crates/pyrefly_config/src/args.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ebfc2038579531c39819471ff4d8e4cfbcf966946c6615d0d39c48099cafdd"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigFile::from_file::f (cyclomatic 16): ConfigFile::from_file::f 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":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc099be9778ae223ce0b40e376ea5d2a0a0c4e9ad3a012d38c845c61522320d"}},{"ruleId":"D1","level":"warning","message":{"text":"IgnoreMissingImports::migrate_from_mypy (cyclomatic 16): IgnoreMissingImports::migrate_from_mypy 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":"crates/pyrefly_config/src/migration/ignore_missing_imports.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0f19e4e25c7580bd6dbbb9ee6abbe14cd4d7bf7c8fc9eb16f39f49f5582d71"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_python::docstring::parse_google_params (cyclomatic 16): pyrefly_python::docstring::parse_google_params 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":"crates/pyrefly_python/src/docstring.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcbad9f54189bd90cae1326a96d128ce62b649540db879a68695e30da02a6b0"}},{"ruleId":"D1","level":"warning","message":{"text":"NarrowedFacet::join (cyclomatic 16): NarrowedFacet::join has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_info.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ff8fb0e39ae57b9d9f12b436d17f3d485a23244f5c328455488fd1ed119e57"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolvedTypeShapeDslProgram::evaluate_suite (cyclomatic 16): ResolvedTypeShapeDslProgram::evaluate_suite 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6469}}}],"partialFingerprints":{"codehealthFindingId/v1":"03418a83b43ed5b7f3b72717b1d2f2df39b18a080445d1c4f89a81431cd88151"}},{"ruleId":"D1","level":"warning","message":{"text":"DslValidator::validate_flag_slot (cyclomatic 16): DslValidator::validate_flag_slot 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2750}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd052dd90d3c293dca72b13f7dfd45282ab9e59d0be7e9b49b353f7011565cc"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly_types::einsum::parse_einsum_equation (cyclomatic 16): pyrefly_types::einsum::parse_einsum_equation 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":"crates/pyrefly_types/src/einsum.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a471b1b92570b50ad07a14e5b2905bc23ad411d942ac9bbcf29592283253668"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::completions (cyclomatic 16): AnswersSolver::completions 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":3724}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18f60f214d76fc7d094f2402cd79c4fbece044a4b366f5dc9c5ced98ac7e96b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::bases_with_metadata (cyclomatic 16): AnswersSolver::bases_with_metadata 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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"393d7d8ccace59ce0967308d2931e4ed0e163260640c38e3928093120d2d54d7"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::pydantic_unchecked_annotation (cyclomatic 16): AnswersSolver::pydantic_unchecked_annotation 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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d4cec2e3200540eb4e5fdb07e7c4a3b1b4910d493874c993a788eced8c9f97"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::extract_pydantic_field_from_annotation (cyclomatic 16): AnswersSolver::extract_pydantic_field_from_annotation 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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84651af47d9c4d6ffea92efe31b142c804211a27063c9d8e9c8a5f91649be93"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::augassign_infer (cyclomatic 16): AnswersSolver::augassign_infer 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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7b110ca16de98d23206d3798927d56c99694583017bf506b0f2b9284031cdf"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::compare_types (cyclomatic 16): AnswersSolver::compare_types has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"c516030d06f8094d9cae0bb9d48ea106e35535e54e714eb3a35114f1720122d1"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::polars_nested_dtype_from_call (cyclomatic 16): AnswersSolver::polars_nested_dtype_from_call has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: AnswersSolver::polars_method_call (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"083c9cf915e00a0e20253634eef9b587616017c096f34a6a9d318d3965dde0b3"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::infer_dataframe_dict_schema (cyclomatic 16): AnswersSolver::infer_dataframe_dict_schema 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. This is NOT this file\u0027s highest cyclomatic complexity: AnswersSolver::polars_method_call (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"1894566a1ae00fda03cc2e11de8487819f6e713cd564f982c54e5391b4990233"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::solve_annotation (cyclomatic 16): AnswersSolver::solve_annotation 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e990b93b205bcea559e5a394701cf8652d5e1459422474c4a5d6c6a1b01bce5"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswersSolver::binding_to_type_name_assign (cyclomatic 16): AnswersSolver::binding_to_type_name_assign 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4601}}}],"partialFingerprints":{"codehealthFindingId/v1":"226f9f2058e78167be788631e55620a7227fc19811a38f66abf11c3f34132bcf"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::extract_django_fields_from_class_body (cyclomatic 16): BindingsBuilder::extract_django_fields_from_class_body 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":"pyrefly/lib/binding/django.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2015a0f9ad33e53a1dab712d60ab46afe28af98d6dc95112108f49562c82451"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsBuilder::typealiastype_from_call (cyclomatic 16): BindingsBuilder::typealiastype_from_call 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":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea30de43ce81c9d61f512a1ee4243780059148ff5d1386038b9c955964149347"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::publish_for_handles (cyclomatic 16): Server::publish_for_handles 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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e49b989d9ef81aab47781858f5d65a5285f85ec1f22a11fa0b1f783b1aa710"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::prune_baselines (cyclomatic 16): Server::prune_baselines 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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4079}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e58fe78a26f736ead5487ee99bdea93934142bf2d2fe77e892f15762d21dcc"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextualTypeCollector::visit_stmt (cyclomatic 16): ContextualTypeCollector::visit_stmt 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":"pyrefly/lib/report/cinderx/collect.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed0e25ba487265f90deeec3e6c2f00385bca176e83f490c0d02075ceadf1785"}},{"ruleId":"D1","level":"warning","message":{"text":"MemberRenderer::member (cyclomatic 16): MemberRenderer::member 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":"pyrefly/lib/state/lsp/quick_fixes/implement_abstract_members.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e808a39a4ca2cdae8ffdf35fa45b3bf6b8a39241970f47f60388287a39810b"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleChanges::overlaps (cyclomatic 16): ModuleChanges::overlaps 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":"pyrefly/lib/state/state.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"79852281114443e013ce1c9eba56adf63b588a6218bd7f33abca21f1a8e0c9e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::dataframe_slot_permitted (cyclomatic 16): Transaction::dataframe_slot_permitted 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b446c6db073cb87f20a7650c2aba11619cfbe536b29bfac97db308f8c338f6"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::add_dict_key_completions (cyclomatic 16): Transaction::add_dict_key_completions 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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"469f7065eb4f7fa8f92dab6465e7ce3ed6ab48ac1980df74e1f3e71b01165a65"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::find_definition_for_attribute_in_non_python_module (cyclomatic 16): Transaction::find_definition_for_attribute_in_non_python_module 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":"pyrefly/lib/state/lsp/extra_extensions.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"379a1d363b8b1c53486595ffc77f54075627fa09ece239d6a793b59d9af14f37"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::type_from_resolution (cyclomatic 16): Transaction::type_from_resolution has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Transaction::identifier_from_covering_nodes (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"5554d44eff9ec3b90c2c696d86497306fff88597f44b15e8a467ec3f1c1fff73"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::lsp::non_wasm::document_symbols::recurse_stmt_adding_symbols (cyclomatic 16): pyrefly::lib::lsp::non_wasm::document_symbols::recurse_stmt_adding_symbols 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":"pyrefly/lib/lsp/non_wasm/document_symbols.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"951fb60dca07fd5a85faa50ec531d7d8f436ccf1729cce8d837114f82216612f"}},{"ruleId":"D1","level":"warning","message":{"text":"pyrefly::lib::state::lsp::fastapi_endpoint_support::association::reference_definition (cyclomatic 16): pyrefly::lib::state::lsp::fastapi_endpoint_support::association::reference_definition has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/fastapi_endpoint_support/association.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"69150b2d6146ec0b8402c9f311670ed800f225ad9a1d931831978b1ab5063e02"}},{"ruleId":"D1","level":"warning","message":{"text":"conformance_output.main (cyclomatic 16): conformance_output.main 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":"conformance/conformance_output.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"744186ef61e90ad501dc6df2c0cb326c0de4b8bb1d6b85c9ec14a7520db2ebce"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::stmt_impl (cognitive 393): BindingsBuilder::stmt_impl has cognitive complexity 393 (threshold 15). Drivers by points: if/else 119 (293 pts), match/switch 15 (46 pts), boolean chains 29, loops 10 (25 pts) (nesting depth added 220). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"4800390511b2c07f375a08e62568905868d408e5236468238a686fa03cbf5ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::callable_infer_params (cognitive 368): AnswersSolver::callable_infer_params has cognitive complexity 368 (threshold 15). Drivers by points: if/else 87 (233 pts), match/switch 26 (81 pts), loops 16 (36 pts), boolean chains 18 (nesting depth added 221). Of this number, 367 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2295af03dd8ef0e2ef3176db40eb96e0f9bf8a69911a949d44c4558672bf1fbe"}},{"ruleId":"D2","level":"warning","message":{"text":"StructurallyValidatedTypeShapeDslFunction::evaluate_expression (cognitive 282): StructurallyValidatedTypeShapeDslFunction::evaluate_expression has cognitive complexity 282 (threshold 15). Drivers by points: match/switch 67 (144 pts), if/else 60 (121 pts), loops 6 (12 pts), boolean chains 5 (nesting depth added 144). 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6986}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a136eb784cc9b019c535a096227ac9017d18716ba66c461db67f9442fa2af6"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::process_event (cognitive 276): Server::process_event has cognitive complexity 276 (threshold 15). Drivers by points: if/else 89 (179 pts), match/switch 22 (85 pts), boolean chains 9, loops 1 (3 pts) (nesting depth added 155). 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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36df6b5664a25868ce2cda1d42261b6fcb6aab8e3da2dbd3d08facf465495db"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeDisplayContext::fmt_helper_generic (cognitive 227): TypeDisplayContext::fmt_helper_generic has cognitive complexity 227 (threshold 15). Drivers by points: if/else 65 (158 pts), match/switch 16 (31 pts), loops 9 (24 pts), boolean chains 14 (nesting depth added 123). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"744a80103c7018016d6941209458e37f1d3dd8a1b6901d405f8de94168776ae5"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::calculate_class_field (cognitive 212): AnswersSolver::calculate_class_field has cognitive complexity 212 (threshold 15). Drivers by points: if/else 78 (143 pts), boolean chains 40, match/switch 9 (20 pts), loops 3 (9 pts) (nesting depth added 82). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4833d0e41735a7533712475d0073d5820dc8d5a0a4ed1754a1c745bd4eab7f"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::bind_pattern (cognitive 200): BindingsBuilder::bind_pattern has cognitive complexity 200 (threshold 15). Drivers by points: if/else 57 (132 pts), boolean chains 25, match/switch 7 (25 pts), loops 6 (18 pts) (nesting depth added 105). 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":"pyrefly/lib/binding/pattern.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"dada20ad98f081741de3dcfd994fff15b9ebd5ad83ec8730b8a73d7751ca8b8d"}},{"ruleId":"D2","level":"warning","message":{"text":"DefinitionsBuilder::stmt (cognitive 183): DefinitionsBuilder::stmt has cognitive complexity 183 (threshold 15). Drivers by points: if/else 39 (103 pts), match/switch 13 (37 pts), loops 14 (30 pts), boolean chains 13 (nesting depth added 104). 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":"pyrefly/lib/export/definitions.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3156f8890c97c34769986aa41f91d7fc6791fe09732f524a48c66d881322d3"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::atomic_narrow (cognitive 173): AnswersSolver::atomic_narrow has cognitive complexity 173 (threshold 15). Drivers by points: if/else 62 (131 pts), match/switch 8 (22 pts), loops 4 (12 pts), boolean chains 8 (nesting depth added 91). 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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf0e077af2c48a32d2c8fed8acd8dbdb5ea80d7283e73d8a0a9eca666be25fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Subset::is_subset_eq_no_recursive_check (cognitive 145): Subset::is_subset_eq_no_recursive_check has cognitive complexity 145 (threshold 15). Drivers by points: if/else 42 (73 pts), boolean chains 49, match/switch 10 (21 pts), loops 1 (2 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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bdb33d53f85deec6fa02d7ae2baae6e8bfcfc6afc238ccfc805763024d7291"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::error::suppress::update_suppressions_in_files (cognitive 145): pyrefly::lib::error::suppress::update_suppressions_in_files has cognitive complexity 145 (threshold 15). Drivers by points: if/else 33 (101 pts), loops 10 (25 pts), match/switch 3 (10 pts), boolean chains 9 (nesting depth added 90). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/suppress.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf4265a13dad7bdf8bac5b41fe3dab63aef39cd3880f38b2f22c779dde5fed1"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::ensure_expr (cognitive 144): BindingsBuilder::ensure_expr has cognitive complexity 144 (threshold 15). Drivers by points: if/else 33 (75 pts), loops 13 (41 pts), match/switch 8 (16 pts), boolean chains 12 (nesting depth added 78). Of this number, 142 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9a288e005365acbadbe3d698c1a41f3cb0a1fb971f82b245f557cd95b90825"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::subscript_infer_for_type_with_key_present_inner (cognitive 142): AnswersSolver::subscript_infer_for_type_with_key_present_inner has cognitive complexity 142 (threshold 15). Drivers by points: if/else 43 (94 pts), match/switch 13 (28 pts), boolean chains 13, loops 2 (7 pts) (nesting depth added 71). 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"519571b88cc8a10733aca8acba5b303e4f834f0d993b544261df6d2358dd42df"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::as_call_target_impl (cognitive 135): AnswersSolver::as_call_target_impl has cognitive complexity 135 (threshold 15). Drivers by points: if/else 34 (79 pts), match/switch 18 (40 pts), loops 5 (14 pts), boolean chains 2 (nesting depth added 76). 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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e6fff6e4d2bbea18daf60f4f6c6962fa00a3999c0261ecc73d866ad1a0201e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_consistent_override_for_field (cognitive 131): AnswersSolver::check_consistent_override_for_field has cognitive complexity 131 (threshold 15). Drivers by points: if/else 45 (86 pts), boolean chains 28, match/switch 6 (13 pts), loops 2 (4 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":4468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baf53eae650d655bf047e88a15c2f00599b8f5df4241a6eae784f701127addf"}},{"ruleId":"D2","level":"warning","message":{"text":"StructurallyValidatedTypeShapeDslFunction::evaluate_condition (cognitive 130): StructurallyValidatedTypeShapeDslFunction::evaluate_condition has cognitive complexity 130 (threshold 15). Drivers by points: if/else 41 (78 pts), match/switch 21 (48 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a698e7ccbc6d3537745bb1d2667f576af70a19aa3b760ca33c7fc4bd64e48e"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::local_quickfix_code_actions_sorted (cognitive 120): Transaction::local_quickfix_code_actions_sorted has cognitive complexity 120 (threshold 15). Drivers by points: if/else 29 (87 pts), loops 8 (17 pts), boolean chains 14, match/switch 1 (2 pts) (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":3803}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78d4a382c13d9a85a3a73667fee9fcc59ed43f7e36be8371e1d848850e41548"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::validate_type_shape_dsl_declaration (cognitive 109): AnswersSolver::validate_type_shape_dsl_declaration has cognitive complexity 109 (threshold 15). Drivers by points: match/switch 15 (49 pts), if/else 22 (42 pts), boolean chains 11, loops 4 (7 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":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64d9f168c79598adfd5b90294474ea2dabb6dd9f1a1f0c2a0dc88e814055121"}},{"ruleId":"D2","level":"warning","message":{"text":"DslValidator::validate_condition (cognitive 107): DslValidator::validate_condition has cognitive complexity 107 (threshold 15). Drivers by points: if/else 35 (58 pts), boolean chains 22, match/switch 12 (21 pts), loops 2 (6 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":4652}}}],"partialFingerprints":{"codehealthFindingId/v1":"b986bc91bb8eddc35c7307c8905a215af2ff74cc8d019f0f6d88fef2b51eec99"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::completion_sorted_opt_with_incomplete (cognitive 106): Transaction::completion_sorted_opt_with_incomplete has cognitive complexity 106 (threshold 15). Drivers by points: if/else 30 (74 pts), boolean chains 18, loops 3 (8 pts), match/switch 3 (6 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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a40e31f1f0da745d484c452a9b6e671dbd92e837542219ea953031863c0344"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::subscript_str_literal (cognitive 103): AnswersSolver::subscript_str_literal has cognitive complexity 103 (threshold 15). Drivers by points: if/else 37 (77 pts), match/switch 9 (21 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/subscript.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7fd6bc7c3b936c453249424eaa366e99b208452e5425be4db5c975c5464022"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::commands::coverage::collect::parse_functions (cognitive 101): pyrefly::lib::commands::coverage::collect::parse_functions has cognitive complexity 101 (threshold 15). Drivers by points: if/else 28 (76 pts), boolean chains 13, match/switch 2 (7 pts), loops 3 (5 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":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcfd06a124edbd6a7c00f5f1ccbad2b8780e4c5c5c6ab44955d363fd4c7065a"}},{"ruleId":"D2","level":"warning","message":{"text":"Subset::is_subset_eq_var (cognitive 98): Subset::is_subset_eq_var has cognitive complexity 98 (threshold 15). Drivers by points: if/else 31 (68 pts), match/switch 10 (25 pts), boolean chains 5 (nesting depth added 52). 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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36fcadc7d0f61b8f07ee4618e9ac24cb67647e921aa2f941140ff4edc5552c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::code_action (cognitive 97): Server::code_action has cognitive complexity 97 (threshold 15). Drivers by points: if/else 33 (77 pts), loops 4 (11 pts), match/switch 1 (6 pts), boolean chains 3 (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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5268}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceeea17a163baa6e6a4dcd21de745e1f3cc24c57e8fd952303d228d43469647a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::call_functools_partial (cognitive 95): AnswersSolver::call_functools_partial has cognitive complexity 95 (threshold 15). Drivers by points: if/else 30 (51 pts), match/switch 14 (27 pts), loops 5 (13 pts), boolean chains 4 (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":"pyrefly/lib/alt/functools.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3d95984f06684f82e97a71c80f2cf64a8db542f832f016710d005cebf71dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::inlay_hints (cognitive 95): Transaction::inlay_hints has cognitive complexity 95 (threshold 15). Drivers by points: if/else 22 (55 pts), match/switch 8 (22 pts), boolean chains 15, loops 2 (3 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":"pyrefly/lib/lsp/wasm/inlay_hints.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93855b55e9dd99ad7551a11d08b6c6d4eb66f46074790623f992ccaffec6ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::lookup_attr_static1 (cognitive 93): AnswersSolver::lookup_attr_static1 has cognitive complexity 93 (threshold 15). Drivers by points: if/else 23 (42 pts), match/switch 16 (38 pts), boolean chains 8, loops 2 (5 pts) (nesting depth added 44). 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a30328ce55f045f8eb6efe013a9fbdc56df133634cae2e70b753ad85c504745"}},{"ruleId":"D2","level":"warning","message":{"text":"DslValidator::validate_return (cognitive 92): DslValidator::validate_return has cognitive complexity 92 (threshold 15). Drivers by points: if/else 21 (67 pts), match/switch 6 (20 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 62). 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":5137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5c148f5b3b73f8ceea5c3c6f483986c4f4ef7fc435f59024b414b45f06a5d3"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckArgs::finish_cli_run (cognitive 92): CheckArgs::finish_cli_run has cognitive complexity 92 (threshold 15). Drivers by points: if/else 50 (67 pts), loops 5 (9 pts), boolean chains 8, match/switch 4 (8 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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f07d82b79aedd4533963ff644e21a04639abae40e7545062393c0b38aa9220"}},{"ruleId":"D2","level":"warning","message":{"text":"Subset::is_subset_param_list_impl (cognitive 91): Subset::is_subset_param_list_impl has cognitive complexity 91 (threshold 15). Drivers by points: if/else 27 (51 pts), loops 12 (20 pts), match/switch 6 (15 pts), boolean chains 5 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"64868e8fa9250bc4d1e0dda4af2a52eb3e39724dd6192f6dd18ce463437f26a1"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::solve_expectation (cognitive 87): AnswersSolver::solve_expectation has cognitive complexity 87 (threshold 15). Drivers by points: if/else 19 (43 pts), match/switch 8 (22 pts), boolean chains 18, loops 2 (4 pts) (nesting depth added 40). Of this number, 81 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f887c4b6ff45aeec8013c4539a507edb37df1c6a4736e7d70567d28f9dbe74"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_type_is_class_object (cognitive 83): AnswersSolver::check_type_is_class_object has cognitive complexity 83 (threshold 15). Drivers by points: if/else 18 (62 pts), loops 3 (14 pts), boolean chains 7 (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":"pyrefly/lib/alt/special_calls.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca0cc202c67eb6d7ea86882d0b08f01f5fe127207a6576f8ff369346e666c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::dict_items_infer_inner (cognitive 80): AnswersSolver::dict_items_infer_inner has cognitive complexity 80 (threshold 15). Drivers by points: if/else 23 (61 pts), boolean chains 13, loops 1 (4 pts), match/switch 1 (2 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"15039e64700a9ee10d2877795b359611c958ae70a91595578adfd54b992de70f"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::find_definition (cognitive 80): Transaction::find_definition has cognitive complexity 80 (threshold 15). Drivers by points: if/else 26 (53 pts), match/switch 10 (23 pts), boolean chains 4 (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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":3076}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f665939717398585771323490ffcd80cd41b41a311f7b99412a22cead48a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver::finish_quantified_with_captures (cognitive 76): Solver::finish_quantified_with_captures has cognitive complexity 76 (threshold 15). Drivers by points: if/else 22 (46 pts), loops 9 (14 pts), match/switch 5 (10 pts), boolean chains 6 (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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb31a5a700958d0cc07166a5d8a3b5c25f9b5c169f3f2de94b42afc59d8e815f"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::expr_infer_impl_helper (cognitive 75): AnswersSolver::expr_infer_impl_helper has cognitive complexity 75 (threshold 15). Drivers by points: if/else 24 (41 pts), match/switch 15 (31 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 34). 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8729ab31bffd9d6cd42a49d7c52cd7c0a5108b352f71b7bdaf31b3b255dcc9"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::binding::attrs::collect_attrs_decorator_methods (cognitive 75): pyrefly::lib::binding::attrs::collect_attrs_decorator_methods has cognitive complexity 75 (threshold 15). Drivers by points: if/else 18 (54 pts), loops 5 (13 pts), match/switch 2 (6 pts), boolean chains 2 (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":"pyrefly/lib/binding/attrs.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69f43c839685d23a1bbb2d39f1b125a7f60ba8dc44e46563e6f0b7f7fa75198"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::tuple_infer (cognitive 71): AnswersSolver::tuple_infer has cognitive complexity 71 (threshold 15). Drivers by points: if/else 20 (46 pts), loops 6 (17 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a732a3d4beb85088d8e6a4d74eee0da4f225a0f7bfaf0da13695a77339316e7"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_shape_flag_constructor_sources (cognitive 71): AnswersSolver::check_shape_flag_constructor_sources has cognitive complexity 71 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 6 (17 pts), match/switch 5 (17 pts), boolean chains 1 (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":"pyrefly/lib/alt/shape_flag.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9c203627cef98b4b38e61011e28c1c4b6242d5e442612d305b73db58861db2"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticTokenBuilder::process_stmt (cognitive 71): SemanticTokenBuilder::process_stmt has cognitive complexity 71 (threshold 15). Drivers by points: if/else 19 (49 pts), loops 9 (21 pts), match/switch 1 (nesting depth added 42). 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":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c520f0aabacc9ef6d607e2e98de62b370e9d97ddafed7f4cd712ecc9ada169"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::find_closest_overload (cognitive 70): AnswersSolver::find_closest_overload has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (55 pts), loops 4 (8 pts), match/switch 2 (6 pts), boolean chains 1 (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":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"dded9f5e2156a04972ea4e75724fdd04c463c2898b346175cefa5e27925c9fc6"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_build::module_resolver::find_one_part_prefix (cognitive 69): pyrefly_build::module_resolver::find_one_part_prefix has cognitive complexity 69 (threshold 15). Drivers by points: if/else 12 (49 pts), loops 4 (11 pts), match/switch 1 (6 pts), boolean chains 3 (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":"crates/pyrefly_build/src/module_resolver.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"692a441685319aba751430a6e8a6523c144619768cae6e36479c5112f73664df"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::as_attribute_base1 (cognitive 69): AnswersSolver::as_attribute_base1 has cognitive complexity 69 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 8 (25 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 41). 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b775c8d629717916442d00b0bc0541ac775b6ac036aaef2cb963045a3d9a948"}},{"ruleId":"D2","level":"warning","message":{"text":"Errors::collect_unused_ignore_errors_for_module (cognitive 66): Errors::collect_unused_ignore_errors_for_module has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 6 (15 pts), boolean chains 5, match/switch 1 (3 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":"pyrefly/lib/state/errors.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8138b6805e60e1b16f78c4458b2da532351e6ddec1ba2de6cf6703aa2e5fec"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::narrow (cognitive 65): AnswersSolver::narrow has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 10 (21 pts), boolean chains 5, loops 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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1681ca5ac29647f40983a35abfd2e81e42561f850c27d8fb7c0d491fe30c2f87"}},{"ruleId":"D2","level":"warning","message":{"text":"NarrowOps::from_expr_helper (cognitive 63): NarrowOps::from_expr_helper has cognitive complexity 63 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 5 (14 pts), match/switch 6 (13 pts), boolean chains 9 (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":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cac261d640f87a68511590cb17fa0e4398828dde7939a6608653f66d417c788"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::is_class_attribute_subset (cognitive 62): AnswersSolver::is_class_attribute_subset has cognitive complexity 62 (threshold 15). Drivers by points: if/else 27 (54 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 29). 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc4dba3206317995534a6af6bf3ae7e2476ce9974cb6a3b738660df92545fde"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::decorated_function_type (cognitive 61): AnswersSolver::decorated_function_type has cognitive complexity 61 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 21, loops 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"568d61a6f0fef0d38f373ce4b2643f5fe46ff5c59443a1e60617cc7f278f7b93"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::shape_index::lower_index_type_in_position (cognitive 59): pyrefly_types::shape_index::lower_index_type_in_position has cognitive complexity 59 (threshold 15). Drivers by points: match/switch 10 (25 pts), if/else 15 (24 pts), loops 2 (6 pts), boolean chains 4 (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":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"578150d3ffe8605749b24ed9c5904d811640439f3ea42067e42cd6cfe519bd3b"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::call_infer_with_callee_range (cognitive 59): AnswersSolver::call_infer_with_callee_range has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (30 pts), match/switch 5 (14 pts), boolean chains 9, loops 3 (6 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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9623b0bad5ac0f9e1dee8bebb3773500aa1413768a9f95eb63fae4f6232417"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::binding_to_type_unpacked_value (cognitive 58): AnswersSolver::binding_to_type_unpacked_value has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 9 (22 pts), boolean chains 3, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":5629}}}],"partialFingerprints":{"codehealthFindingId/v1":"7735045a10e44310c25cd40ceff8ce5ff6dbf0a72758f607d720eb4a29564fef"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::einops::evaluate_einops_pattern (cognitive 57): pyrefly_types::einops::evaluate_einops_pattern has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (34 pts), match/switch 6 (10 pts), boolean chains 7, loops 4 (6 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":"crates/pyrefly_types/src/einops.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"93786c8069b73244e9251c8352eef1d2d4851dadfed1637e29cd43ae9baf1498"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_consistent_multiple_inheritance (cognitive 57): AnswersSolver::check_consistent_multiple_inheritance has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (38 pts), loops 6 (16 pts), boolean chains 3 (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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":5004}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be7549372e8d5d78569115d922d04a8007efdcd3d68c205e7e1d0fe1ceef511"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::class_metadata_of (cognitive 57): AnswersSolver::class_metadata_of has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 16, loops 4 (5 pts), match/switch 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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8b8a68e7bee6b6145496f3c54201c5ac7cee78f14198d59e3e44d5391ad61a"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::demand (cognitive 57): Transaction::demand has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (42 pts), boolean chains 7, loops 2 (4 pts), match/switch 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":"pyrefly/lib/state/state.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"4304dfb1738fcf1c9ea01c0b87bf823bfc3cf0708f01f9a8630ccfcc360d4808"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::binding_to_type (cognitive 56): AnswersSolver::binding_to_type has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 12, match/switch 5 (11 pts), loops 1 (3 pts) (nesting depth added 22). 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e312de119edbba15d059105227d44eee9b82a3e5e876e389dd0cb11a2445f384"}},{"ruleId":"D2","level":"warning","message":{"text":"SideParser::parse (cognitive 55): SideParser::parse has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 4 (14 pts), boolean chains 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":"crates/pyrefly_types/src/gufunc.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"051dd05f101aca158ff6ef1aa3f5a77c643aeb2f105c9000de78ce3771f59f8e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::as_attribute_base1_of_type (cognitive 55): AnswersSolver::as_attribute_base1_of_type has cognitive complexity 55 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 7 (24 pts), match/switch 3 (5 pts) (nesting depth added 37). 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2927}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72162cd7f95d68a8b9756c27398757ff5e6e103c6894567f91523d659e71ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::call_overloads (cognitive 55): AnswersSolver::call_overloads has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (43 pts), boolean chains 6, loops 2 (5 pts), match/switch 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":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcef2619a51df029fc8b6063b3fcc178ee444fc96eba19485745bd924d44f34a"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::binding::function::function_last_expressions::f (cognitive 55): pyrefly::lib::binding::function::function_last_expressions::f has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (30 pts), match/switch 4 (12 pts), loops 4 (9 pts), boolean chains 4 (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/function.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba66c946522b8ffff31abe92fa70eaabd2c0956c9bf27ae83ac937539f1bea9"}},{"ruleId":"D2","level":"warning","message":{"text":"stub_coverage._literal_all (cognitive 55): stub_coverage._literal_all has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (46 pts), boolean chains 5, ternaries 2 (3 pts), loops 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":"tensor-shapes/stub_coverage.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"475969c2535552f631b9f31ae62e36339dc61c3efea0fc73d6bc24415a109bd3"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::stmt_match (cognitive 53): BindingsBuilder::stmt_match has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (31 pts), match/switch 6 (14 pts), boolean chains 5, 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":"pyrefly/lib/binding/pattern.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"72031aaa947f53e05668b196b67e748d470ef2ba9cb2895dabd888bf725ae369"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::get_django_instance_attribute (cognitive 51): AnswersSolver::get_django_instance_attribute has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (40 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/django.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af366e25384b5c1eccabb89d2a51046a71e873694154a8210e620195beca5d7"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::solve_function_binding (cognitive 50): AnswersSolver::solve_function_binding has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (39 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (2 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1570c887e64bebe5259a9b8fcb918ddfe3790619dbb730ddf64bea5d62e1cdf3"}},{"ruleId":"D2","level":"warning","message":{"text":"InferArgs::run_inner (cognitive 50): InferArgs::run_inner has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 6, match/switch 1 (4 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":"pyrefly/lib/commands/infer.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8c21f806fb462a13d49c2bbd44a8f2541b741f429b8cab2dc9fa9792cb83cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::notebook_document_did_change (cognitive 50): Server::notebook_document_did_change has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 6 (17 pts), match/switch 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4457}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee27244f05367e76d4cafa1f9aeebc911e45052c206738bdfcacc469b77424e"}},{"ruleId":"D2","level":"warning","message":{"text":"Subset::bind_tensor_dimensions (cognitive 50): Subset::bind_tensor_dimensions has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 7 (14 pts), boolean chains 5, match/switch 2 (nesting depth added 21). Of this number, 49 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":3125}}}],"partialFingerprints":{"codehealthFindingId/v1":"569110b549384d8276c7bc5f63dae3557e56f7974bc0cc22e46b9a5ae65eeb2f"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::construct_class_inner (cognitive 49): AnswersSolver::construct_class_inner has cognitive complexity 49 (threshold 15). Drivers by points: if/else 32 (45 pts), boolean chains 4 (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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2969d76619660d0e6ac180b061a3a2e599c25c59b7cd2bd0433fc71dc8581f"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::get_dataclass_init (cognitive 49): AnswersSolver::get_dataclass_init has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (37 pts), boolean chains 7, match/switch 1 (4 pts), loops 1 (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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ad764f9c9d460939aad653f0f16fa11998414084d5543ed087c56af1a76a67"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::parse_dimension_expr_with_context (cognitive 49): AnswersSolver::parse_dimension_expr_with_context has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 9 (23 pts), if/else 10 (19 pts), boolean chains 7 (nesting depth added 23). 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0088e49341ff001c16a99b1aea602f238fe73cc4cdda195ab5ebb19e8d2c81d0"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::infer_with_decomposed_hint (cognitive 49): AnswersSolver::infer_with_decomposed_hint has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (41 pts), match/switch 1 (5 pts), loops 1 (3 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":"pyrefly/lib/alt/unwrap.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41c793293c6e319664dd3df7680c74d910c54c1b77b041a51cc9647e05452fa"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::alt::regex::validate_pattern (cognitive 49): pyrefly::lib::alt::regex::validate_pattern has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 3 (9 pts), boolean chains 3, 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":"pyrefly/lib/alt/regex.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adcef1b1d0df2a017099f878573ec2cf03761570f8598a976e4e9f10a99b13e"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::report::cinderx::collect::collect_call_contextual_types (cognitive 49): pyrefly::lib::report::cinderx::collect::collect_call_contextual_types has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 3 (8 pts), match/switch 1 (2 pts), boolean chains 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":"pyrefly/lib/report/cinderx/collect.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e64a1869726ff894cc344f245e98618a82170900893a7a58de0e088f7d21380"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::completions (cognitive 48): AnswersSolver::completions has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (33 pts), loops 4 (10 pts), match/switch 1 (4 pts), boolean chains 1 (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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":3724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe89de7ef4ba77b138069f37256729991b04fb19aaad43e6ed6cf45bf631077"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_args_and_construct_tuple (cognitive 48): AnswersSolver::check_args_and_construct_tuple has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (43 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/specials.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed6ff8895b967a6b8d829baab684e6c3e25f5bd0b3178cfcb2738372166392e"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticTokenBuilder::process_syntax_tokens (cognitive 48): SemanticTokenBuilder::process_syntax_tokens has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (36 pts), match/switch 3 (6 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6729bdbd5fe4fece52a1aa340c8ee428cee108e2085a5c547db8ff88c700a5e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::overload_error (cognitive 47): AnswersSolver::overload_error has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (30 pts), match/switch 5 (10 pts), boolean chains 4, loops 3 (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":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e533664206c0c4c41353549e8f73d8a3e4b7493587b49ff43ab55814df041c"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::name_assign_infer (cognitive 47): AnswersSolver::name_assign_infer has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 5 (11 pts), boolean chains 5 (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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5549a62d86ded5046f664ae4d343be7e2854b5b07d15d3ce27ab55fea2d48a"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_build::module_resolver::find_one_part_in_root (cognitive 46): pyrefly_build::module_resolver::find_one_part_in_root has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (34 pts), loops 4 (6 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_build/src/module_resolver.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"208a4203734e4be140c16b472c02197d8ad843a4dd1eb431ec2095628ae19a06"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_pydantic_model_validate_input (cognitive 46): AnswersSolver::check_pydantic_model_validate_input has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 6, loops 3 (6 pts), match/switch 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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"067dc27932f0b0b101ee19004cc38ddf2118719fd99c33dc732a3ae2ab1b937b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeDisplayContext::fmt_params_hover (cognitive 45): TypeDisplayContext::fmt_params_hover has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 4 (12 pts), match/switch 3 (6 pts), boolean chains 1 (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":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"464becc4610b93c27a6e14865d6223d68703798c8674e33bdd8dc03e45f0c701"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::declared_bool_value (cognitive 45): AnswersSolver::declared_bool_value has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 9 (16 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 19). 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":2777}}}],"partialFingerprints":{"codehealthFindingId/v1":"31336192afc3f31d8e308a212e4ec0ebd65e748b287d336512e6a51db1b886c2"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::type_params_with_owner (cognitive 45): BindingsBuilder::type_params_with_owner has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 2 (6 pts), match/switch 1 (2 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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":3152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e96b1ea353d8725896edf090ed0942d0a29f6c0383090787897833e69133e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::class_def_inner (cognitive 45): BindingsBuilder::class_def_inner has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (25 pts), match/switch 5 (9 pts), boolean chains 6, loops 4 (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":"pyrefly/lib/binding/class.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4271f1648f287edc19be52a8e4d73c6efe7adecd21a6e60dc98ab4eca300697"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::merged_flow_info (cognitive 45): BindingsBuilder::merged_flow_info has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 9, match/switch 4 (6 pts), loops 2 (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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":4777}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d75f265b94689c04876028e1274d5e698de903da8c076dd89d91792305dfd7"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::extend_dict_key_suggestions (cognitive 45): Transaction::extend_dict_key_suggestions has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 3 (11 pts), boolean chains 2 (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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"b973bacbd168a6444561fae7007356fa261cc5be95d711b0f267cfc4108ac0e1"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::callable_infer_inner (cognitive 44): AnswersSolver::callable_infer_inner has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 7, loops 2 (4 pts), match/switch 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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"218e64c82dbd87555f4c3bca531841a5335d2a52ee06510f50755068a7e52e95"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::parse_base_class (cognitive 44): AnswersSolver::parse_base_class has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 10 (20 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de6dc85db53d919f695aac8d12012945ce17f669f93215f7718df6f4a7a472f"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::undecorated_function (cognitive 44): AnswersSolver::undecorated_function has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 14, match/switch 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd300ebfaecdaab0e25bd417ff0df85496b6e91af470cc32d8657b5c9a8aedab"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::get_params_and_paramspec (cognitive 44): AnswersSolver::get_params_and_paramspec has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 6, match/switch 2 (4 pts), loops 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f718ff01f2ee4fe123812c20768d083b2dfdb79695a297b2b66fe1bcfdee90"}},{"ruleId":"D2","level":"warning","message":{"text":"Binding::fmt (cognitive 44): Binding::fmt has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 10 (19 pts), loops 3 (6 pts) (nesting depth added 23). 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":"pyrefly/lib/binding/binding.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf0ff0dde69165b5e328b62eaa49a2ada0f66227be3d3708b3e606decbd0b19"}},{"ruleId":"D2","level":"warning","message":{"text":"StructurallyValidatedTypeShapeDslFunction::evaluate_generator (cognitive 43): StructurallyValidatedTypeShapeDslFunction::evaluate_generator has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 10 (18 pts), loops 3 (4 pts), boolean chains 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6726}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93873fb985d798b564670c45082e0df92e63a93c61f35bf7cbf92365f22020a"}},{"ruleId":"D2","level":"warning","message":{"text":"UpwardSearch::directory_absolute (cognitive 43): UpwardSearch::directory_absolute has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 6 (12 pts), match/switch 2 (6 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":"crates/pyrefly_util/src/upward_search.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cede477f287958d3e7a0630cf49526499a2bd8f64b3409bc29ece2db4c6a48a2"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::type_var_like_args_from_call (cognitive 43): AnswersSolver::type_var_like_args_from_call has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (34 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 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":"pyrefly/lib/alt/type_var_declaration.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6bb1141d4e84c515135f2cd8f4def27bffed237d2e9576e29a1a9e9dd89086"}},{"ruleId":"D2","level":"warning","message":{"text":"PysaModuleIndex::build (cognitive 43): PysaModuleIndex::build has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/module_index.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2b74457271b5d40c6eb56e1cdac2f29299cb15843e6a8bdba834ae864900c3"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigOverrideArgs::override_config_at (cognitive 42): ConfigOverrideArgs::override_config_at has cognitive complexity 42 (threshold 15). Drivers by points: if/else 30 (34 pts), loops 5, boolean chains 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":"crates/pyrefly_config/src/args.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"35eceecb87c03c6a2d6e4cd5d17a7a731ca45621ab85ad0b1fcc3867da34b68e"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_python::folding::folding_ranges (cognitive 42): pyrefly_python::folding::folding_ranges has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 5 (8 pts), match/switch 3, boolean chains 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":"crates/pyrefly_python/src/folding.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"681cb90469a5b792f9d66ec822531789c58ecb29d7556401e6e6aba6c1c7660b"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::einops::parse_expression (cognitive 42): pyrefly_types::einops::parse_expression has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (33 pts), match/switch 3 (5 pts), boolean chains 3, 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":"crates/pyrefly_types/src/einops.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"13741bc0dc3df4ea4ce42cd980ae88e928623fcd50379f1e66eb694aa16c409b"}},{"ruleId":"D2","level":"warning","message":{"text":"CallArg::pre_eval (cognitive 42): CallArg::pre_eval has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (10 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b653b8ad41ae329d6752a86d9bd05f8b1793e13efdc249d4d600e2dd9e5bbb9"}},{"ruleId":"D2","level":"warning","message":{"text":"Expectation::check (cognitive 42): Expectation::check has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 3 (7 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/expectation.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ca6bd353dca0ab3d8b68fafd38225b9af6f7adf431031c727a9e02b75ae657"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::add_match_class_keyword_completions (cognitive 42): Transaction::add_match_class_keyword_completions has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 7, match/switch 3 (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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee727115b8b166a47430bd10378f41cbd605234f23f214a4bbce4889756d58c"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::inferred_types (cognitive 42): Transaction::inferred_types has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 4 (14 pts), boolean chains 2, 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":"pyrefly/lib/lsp/wasm/inlay_hints.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a5ab1e167ccec6e220c5372b5b8e85574d4cb6dd87a887882988cf1d96724f"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::move_module::build_module_member_consumer_import_updates (cognitive 41): pyrefly::lib::state::lsp::quick_fixes::move_module::build_module_member_consumer_import_updates has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 3 (6 pts), boolean chains 1, match/switch 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":"pyrefly/lib/state/lsp/quick_fixes/move_module.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d35daf23d64579210846c4e937686a84d14cf02b5d5fe8409c5580a88604f9"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_protocol.convert_json_to_model (cognitive 41): generate_protocol.convert_json_to_model has cognitive complexity 41 (threshold 15). Drivers by points: loops 13 (21 pts), if/else 8 (15 pts), error handling 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74a3515e3617f4b65349c70e2ebaab8d17daa0bf74b0c925e19111a6bc0d4e1"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::as_instance_attribute (cognitive 40): AnswersSolver::as_instance_attribute has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 5 (9 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":3850}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90dbc7657ff284859dd28cdcbaa9b2f056759b518a7bf157521f9feea5e87c4"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_signature_consistency (cognitive 40): AnswersSolver::check_signature_consistency has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 7 (14 pts), loops 3 (7 pts), boolean chains 3 (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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bbfeadd480d6eeabde2c10fea337dff6564857d643540004b51fc4bbfcedd2"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::class_bases_of (cognitive 40): AnswersSolver::class_bases_of has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 5 (10 pts), boolean chains 4, loops 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":"pyrefly/lib/alt/types/class_bases.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aec502e73cd6bd30013b4702e5f79d97ac28db077a40f077716b46931290abe"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::get_dataclass_synthesized_fields (cognitive 39): AnswersSolver::get_dataclass_synthesized_fields has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 5, match/switch 3 (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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9055b7cb0635aefa752f9cb78e7fa66bbb4c6d9ca1f307bb90955e70a547433"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::solve_django_reverse_relations (cognitive 39): AnswersSolver::solve_django_reverse_relations has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 3 (4 pts), match/switch 1 (3 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":"pyrefly/lib/alt/class/django.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"32071c5849f7fe72060e5ab96720fa32a5d1cefac4170240999cee549574cc83"}},{"ruleId":"D2","level":"warning","message":{"text":"Scopes::finish_class_and_get_field_definitions (cognitive 39): Scopes::finish_class_and_get_field_definitions has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 3 (7 pts), boolean chains 3 (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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":3806}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e2739dedc3dca4440ec788d928a42728e93d2f22271ed165e36dd342816662"}},{"ruleId":"D2","level":"warning","message":{"text":"Subset::is_subset_eq_quantified (cognitive 39): Subset::is_subset_eq_quantified has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23 (33 pts), boolean chains 3, match/switch 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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3745}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f937fba54bd829c593cee740d4a47c77c5bc9c3d4fd89c5a3228aa745d5be1"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::einsum::parse_einops_einsum_equation (cognitive 38): pyrefly_types::einsum::parse_einops_einsum_equation has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 3 (4 pts), match/switch 2 (4 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":"crates/pyrefly_types/src/einsum.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbba4abf1d8d80b645ec4821b49a5db3f7c3b096f97ba387cab1f252e7ef826"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::eval_polars_expr (cognitive 38): AnswersSolver::eval_polars_expr has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 4 (10 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 23). 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":2656}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf96e7ff8eb1747b21114d057a2ea9461468e194056b903da71e08efd152885"}},{"ruleId":"D2","level":"warning","message":{"text":"SysInfo::evaluate (cognitive 37): SysInfo::evaluate has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 10 (26 pts), loops 2 (6 pts), boolean chains 5 (nesting depth added 20). 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":"crates/pyrefly_python/src/sys_info.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d3876e7485504b0c2342bef373b026db5fcc5d8e469b1270528b62d01cc97d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeShapeDslHelperCall::argument_domains (cognitive 37): TypeShapeDslHelperCall::argument_domains has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 5 (9 pts), boolean chains 3 (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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d1e5fa79c97bb37837e590c3e873186ea0f5c39ccd0662a3d606953a64e436"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_dict_items_against_typed_dict (cognitive 37): AnswersSolver::check_dict_items_against_typed_dict has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (5 pts), boolean chains 4, match/switch 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":"pyrefly/lib/alt/class/typed_dict.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad64afb3f966f8375144e2164ba5e94f5a22aa9941357a2bccf4923831434b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_fstring_format_spec_for_type (cognitive 37): AnswersSolver::check_fstring_format_spec_for_type has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 17, if/else 13 (16 pts), match/switch 2 (4 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c614c7c8cae96ebd88b58a8b54431786058d0a0c99084b84e9a59f5926b827"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::polars_join (cognitive 37): AnswersSolver::polars_join has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 5 (7 pts), loops 5, 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3528}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fa677fb69f7cb5804bd9c4fa8a76865dc53602480c32cf7bbe9cc94e4de14b"}},{"ruleId":"D2","level":"warning","message":{"text":"InitArgs::create_config (cognitive 37): InitArgs::create_config has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (32 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":"pyrefly/lib/commands/init.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d42ad8b4bae5f4313cad6b3240b1e7b096bb0f40357d1ee7555ebf3b47cfe8"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::pytest_fixture_definitions_for_parameter (cognitive 37): Transaction::pytest_fixture_definitions_for_parameter has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 8, loops 2 (5 pts), match/switch 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":"pyrefly/lib/state/lsp/pytest.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22404cda7dd5bd4032b846309b32cc45ef40c5b9fbec90720596275cd13cd61"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::expr_call_infer (cognitive 36): AnswersSolver::expr_call_infer has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 10, match/switch 4 (10 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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d06693caed55a449e5644fcd3a437c48ecb825d17f39da2aba499b87cf9c33"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::intersect_impl (cognitive 36): AnswersSolver::intersect_impl has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"700e02ca346b6d92c47376ea1165b670d89e2cf69c194a7fed26593748a11f88"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::apply_special_form (cognitive 36): AnswersSolver::apply_special_form has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 6 (12 pts), loops 1 (2 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/specials.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"3202f4bab3c353d15a43eeb152b31c1b85d0d19b29eccf28f4bf88656ab6e3fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::clean (cognitive 36): Transaction::clean has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 4, loops 2 (3 pts), 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":"pyrefly/lib/state/state.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcde3c38bf6c252e75a026e66305e5a7c3a49a2b5ea136195def43c075271a70"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::commands::coverage::collect::parse_variables (cognitive 36): pyrefly::lib::commands::coverage::collect::parse_variables has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 8 (12 pts), boolean chains 7, loops 1 (nesting depth added 12). Of this number, 24 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cf50ec047e19c316392fc73d876a1c6f732854158e9c80c6e5968549fd0f51"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::commands::coverage::collect::parse_instance_attrs (cognitive 36): pyrefly::lib::commands::coverage::collect::parse_instance_attrs has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 4, match/switch 2 (4 pts), loops 2 (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":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8d7d00659665fd943e254a28f709fff07ca58626fa359832c9bac81261c0d2"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::export::symbols::build (cognitive 36): pyrefly::lib::export::symbols::build has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (7 pts), boolean chains 3, 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":"pyrefly/lib/export/symbols.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3badd28f31ba3c0a5991cbb2351ba383cf4e7852eb13736c82ddbc1c179949e5"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::dimension::canonicalize_division (cognitive 35): pyrefly_types::dimension::canonicalize_division has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 2, loops 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":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"533e511e170ef97d45f02a7a1a36296d51d52c686cbfdcb5b3a193615c1fef60"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::shaped_array::reduce_axis_shape (cognitive 35): pyrefly_types::shaped_array::reduce_axis_shape has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 5, match/switch 3 (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":"crates/pyrefly_types/src/shaped_array.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d01e114336e40f5eab429cbac2cbb708f4f14588a1ec5d61efbd304d3bcb10"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::analyze_class_field_value (cognitive 35): AnswersSolver::analyze_class_field_value has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (26 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":3327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b868ed6943a63d002b7517f12da74cf938f665672bbf810c5ab84f176ba31f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::extract_pydantic_config_dict (cognitive 35): BindingsBuilder::extract_pydantic_config_dict has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 9, 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":"pyrefly/lib/binding/pydantic.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af18eb911006e4e7bc1818e004e4390eb29fab6b33923476cdf8513fce22bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::lsp::non_wasm::server::dispatch_lsp_events (cognitive 35): pyrefly::lib::lsp::non_wasm::server::dispatch_lsp_events has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 2 (6 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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c970b8f64f5330f33d0061d2726b8ff2fa2b780a8847623c1eca800bb9c005c"}},{"ruleId":"D2","level":"warning","message":{"text":"DslValidator::collect_integer_expression_sources (cognitive 34): DslValidator::collect_integer_expression_sources has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (11 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06513ca058cbca01c7003d7da4e2b455fc543309acf43aa1e6b3dadb35d552a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::polars_expr_output_name (cognitive 34): AnswersSolver::polars_expr_output_name has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 3 (6 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"39270d7c80a20dd4d6253dfad27eeebf6a1f1ccfcabf2645797f92f46cae6b17"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::expr_annotation_with_comment (cognitive 34): AnswersSolver::expr_annotation_with_comment has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 8, match/switch 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01a97b7564b2c208fa9b165bbcd04d95b248370ad99e3de137f693ad4ea2d16"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::extract_django_fields_from_class_body (cognitive 34): BindingsBuilder::extract_django_fields_from_class_body has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (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":"pyrefly/lib/binding/django.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace999fc279409e278acc050168cd933a7a12c78aacc6ec153348b34c97bc8ad"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::bind_module_exports (cognitive 34): BindingsBuilder::bind_module_exports has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 2 (4 pts), boolean chains 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":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":2489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a8c5fd17be54a2a47c8031e3d47d7658f2e9ee17512c323116b4663822c087"}},{"ruleId":"D2","level":"warning","message":{"text":"Subset::is_subset_tuple (cognitive 34): Subset::is_subset_tuple has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 4 (6 pts), boolean chains 3 (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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54e56a5c1dfd747f5f9657506592fe6f60d3adc5322fdacaee68a8954f5c210"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_protocol.replace_integer_enum (cognitive 34): generate_protocol.replace_integer_enum has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad0bb28f9292221f737987628280fb5ab9c71385b6f5063ae0fd85b0eff87a6"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_config::migration::mypy::pyproject::pyproject_to_ini (cognitive 33): pyrefly_config::migration::mypy::pyproject::pyproject_to_ini has cognitive complexity 33 (threshold 15). Drivers by points: if/else 28 (30 pts), loops 2 (3 pts) (nesting depth added 3). 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":"crates/pyrefly_config/src/migration/mypy/pyproject.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2834d5b4fd279c507d1b4c11533b6d407a1343b9be4e886c09439df6502e0bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::dimension::canonicalize_product (cognitive 33): pyrefly_types::dimension::canonicalize_product has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 3 (6 pts), match/switch 1 (3 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":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbb6b3741e5b9a998e200da1e85b32e19acf729f0fb59b61f70278db9f9492a"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer::document (cognitive 33): Indexer::document has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (5 pts), match/switch 2 (3 pts), boolean chains 2 (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":"pyrefly/lib/report/scip.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"884dae3048f44e5413dea6707279d786d74163a25b6ef033797c950727df8704"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::commands::coverage::collect::collect_module_reports (cognitive 33): pyrefly::lib::commands::coverage::collect::collect_module_reports has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 4 (7 pts), boolean chains 4 (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":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"372f4cc1c14e368ce6b0ca11078fdd9aeab9ab60671983c29537f611f11057e4"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::commands::infer::format_hints (cognitive 33): pyrefly::lib::commands::infer::format_hints has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 3 (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":"pyrefly/lib/commands/infer.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"425b3de317b76a3b600451657b4a99ea012adf9f2a57aa75a823e17208d136ff"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::deprecated_contextmanager::replace_return_code_action (cognitive 33): pyrefly::lib::state::lsp::quick_fixes::deprecated_contextmanager::replace_return_code_action has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 5 (6 pts), boolean chains 4 (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":"pyrefly/lib/state/lsp/quick_fixes/deprecated_contextmanager.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"509ff43317f38576d765448aeb02c185d2e2c2a5d7d7c3f099b618705f90e50c"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigFile::configure_at (cognitive 32): ConfigFile::configure_at has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20 (24 pts), match/switch 3 (4 pts), boolean chains 3, loops 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, 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":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18fb1e3eda2f038c4f4efd4f110e3cf4b390858668d04d91a0546ce6f23f651"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::simplify::collapse_literals (cognitive 32): pyrefly_types::simplify::collapse_literals has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (10 pts), boolean chains 9, loops 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":"crates/pyrefly_types/src/simplify.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d47badec0fc645b0b86c6faa6828c099e5f7f864e13c2ecfa9edbff9a044aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::call_intersection (cognitive 32): AnswersSolver::call_intersection has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 7 (10 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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5950cd47b323e7cc1023dd2f5f30f84eacd33e4b61d5e763bc33e295f1eb5970"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::intersect_guarantees (cognitive 32): AnswersSolver::intersect_guarantees has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 13, loops 2 (3 pts), match/switch 2 (nesting depth added 2). Of this number, 29 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"0218a904f344769bc5e559efd0c0ac005d40c80997ae8c271fc2905ee0ec84e5"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::polars_fill_null (cognitive 32): AnswersSolver::polars_fill_null has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 4 (11 pts), boolean chains 2, loops 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb962d85fd0dc990fcd313fdb85632aef942ed57e15631311495c460d01c6fd"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::validate_type_var_default (cognitive 32): AnswersSolver::validate_type_var_default has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 6 (12 pts), boolean chains 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":"pyrefly/lib/alt/type_var_declaration.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e75e882fbadeffb83d143b62a76f864bf67f754c5186d1bf72bf1ccec4784b"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::bind_single_name_assign (cognitive 32): BindingsBuilder::bind_single_name_assign has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 8, 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":"pyrefly/lib/binding/target.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39852701bd42d44ad6071f975558c6bf71eb97acba330f83bcd63c6bffac9e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextualTypeCollector::visit_stmt (cognitive 32): ContextualTypeCollector::visit_stmt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/cinderx/collect.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b2800548eb8d8f679550aad5863d963072e68d9d954fd0764abf20c70f30bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::find_operator_dunder (cognitive 32): Transaction::find_operator_dunder has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb115281127b6561d53d1b8644f7a1e6c81a51f4a7474c16c4906e615e5ff5b"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::detect_editable_packages (cognitive 32): Transaction::detect_editable_packages has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (29 pts), 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":4554}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd4f5b4bfa420d24a37ce19c42540a9383d6b39c87b9ef185c4f5b92ef108de"}},{"ruleId":"D2","level":"warning","message":{"text":"CancellableTransaction::override_code_lens_targets (cognitive 32): CancellableTransaction::override_code_lens_targets has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 6 (9 pts), boolean chains 1, match/switch 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":6040}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ce83564cbeac339e4b397071692d726875b4b985399c1789e2c301f20c792c"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::lsp::non_wasm::document_symbols::build_symbols_with_sections (cognitive 32): pyrefly::lib::lsp::non_wasm::document_symbols::build_symbols_with_sections has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 5 (9 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":"pyrefly/lib/lsp/non_wasm/document_symbols.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5825c9d04a595dfe7e9b4be73853bd6d5ef28db10d22128a71d8bb553e21279"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::module::finder::find_import_with_mode (cognitive 32): pyrefly::lib::module::finder::find_import_with_mode has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18, boolean chains 14. 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":"pyrefly/lib/module/finder.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0d8058627c86524203fc276822d233b4dca6176fa12fe748d1fdac5cc05b58"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::stubgen::extract::extract_stmts (cognitive 32): pyrefly::lib::stubgen::extract::extract_stmts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (5 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":"pyrefly/lib/stubgen/extract.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbfc8679423d786f400829b4e953e3d27e611bc06caba7f06ad2ae560051c38"}},{"ruleId":"D2","level":"warning","message":{"text":"StructurallyValidatedTypeShapeDslFunction::evaluate_any_generator (cognitive 31): StructurallyValidatedTypeShapeDslFunction::evaluate_any_generator has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 8 (12 pts), boolean chains 3, loops 1 (nesting depth added 13). 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":7998}}}],"partialFingerprints":{"codehealthFindingId/v1":"1865b572ef152f315c88238668c34a027b8262ef9b5cd4d58c64a9a9ea7a2ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::binary_operator_order (cognitive 31): AnswersSolver::binary_operator_order has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (26 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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"500857d5a337cb076a991fb8af6e3e89109d02021a3e4209186f0350e638d77a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::binop_types (cognitive 31): AnswersSolver::binop_types has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 5, match/switch 3 (5 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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"91858080526a49eb4233df72f6683c4535325398aa52e4cb074bcce167463882"}},{"ruleId":"D2","level":"warning","message":{"text":"Linearization::merge (cognitive 31): Linearization::merge has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (12 pts), match/switch 1 (5 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":"pyrefly/lib/alt/types/class_metadata.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"5738a1c49055dbdbd6f8639997ef7336c5d16b76254301eb78106776b1de525c"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::ensure_name_impl (cognitive 31): BindingsBuilder::ensure_name_impl has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 6, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c77f4403ffe33cd7298d0d2bd58b29515f3f6126dcca696cc9552104757a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::merge_flow (cognitive 31): BindingsBuilder::merge_flow has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (13 pts), loops 8 (10 pts), boolean chains 7, 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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":5047}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfae227b246fd389e872f0d6477196f168d3b9332c64e1b57ba288577e69d1c1"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::typealiastype_from_call (cognitive 31): BindingsBuilder::typealiastype_from_call has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"506f40faba4529b0105445504602a4cc5964e18c7128943f073a8acca76737f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::type_hierarchy_subtype_items (cognitive 31): Server::type_hierarchy_subtype_items has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (3 pts), boolean chains 2 (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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":7210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e431f422865996c9854c373f001e17ee850b17d4e27d0536a7d49b5ee318feec"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::add_kwargs_completions (cognitive 31): Transaction::add_kwargs_completions has cognitive complexity 31 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 4 (11 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 21). 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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f7b26baa1b21497c2884b897d17f3ba0690be26fb1c3a43b328d9a0332de87"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::add_autoimport_completions (cognitive 31): Transaction::add_autoimport_completions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (4 pts), boolean chains 3 (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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"8092cca2d3c9d627946c28632327d8a0a0817e9cf5d803964634fbb6ed42019b"}},{"ruleId":"D2","level":"warning","message":{"text":"conformance_output.main (cognitive 31): conformance_output.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 2 (4 pts), ternaries 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":"conformance/conformance_output.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96e8ba62ab37322f526d0d8bd22443d12553be9d22ae7ad73aeaf757a21643b"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_python::docstring::parse_google_params (cognitive 30): pyrefly_python::docstring::parse_google_params has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 3, 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":"crates/pyrefly_python/src/docstring.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e83bd32a8a69bda7ee6fea43f79192c2d3f853d69a36a1ba3ad9e8de63675d4"}},{"ruleId":"D2","level":"warning","message":{"text":"DslValidator::validate_generator_source (cognitive 30): DslValidator::validate_generator_source has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"640c5d7178a9dac1a680df0d58ff975762e4ac7e1e7b64b44691035403ac5626"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::resolve_class_attr_setter (cognitive 30): AnswersSolver::resolve_class_attr_setter has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 5 (10 pts), boolean chains 4 (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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":5897}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb68908de7228f7a789d0ba17a4f6d504cf299c2d4962a984bf3b1bab928e29"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::get_dataclass_fields (cognitive 30): AnswersSolver::get_dataclass_fields has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (6 pts), boolean chains 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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d697a8666746706de5ccb443aab5e5cc0953ad3c15ccb651f4120c14629802fc"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::call_assert_shape (cognitive 30): AnswersSolver::call_assert_shape has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 1 (4 pts), boolean chains 2, loops 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":"pyrefly/lib/alt/special_calls.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd64fe28d76a1e927772b4d1c07155443ed504ac4cf92f84848d7c7eaac2ecbd"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::stmts (cognitive 30): BindingsBuilder::stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 8, match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5c9eea75dfb35c3ba9d4abd9d47216a9ca7a3c294c498e718469967c4bae2f"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::prescan_synthesized_bases (cognitive 30): BindingsBuilder::prescan_synthesized_bases has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 2 (8 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":"pyrefly/lib/binding/class.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"38366abf101e7779c73050bba90e2c505d2426e07b2ec730039e49e4e6ba6282"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver::simplify_mut (cognitive 30): Solver::simplify_mut has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (6 pts), match/switch 3 (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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b39f30ccb5b4a9fb5bac506457aabc59ce30d35fce3fddded885631d757b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportTracker::from_ast (cognitive 30): ImportTracker::from_ast has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (7 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":"pyrefly/lib/state/import_tracker.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f109b7bb5b01e55fa842dffd1c368ebae6633923c46dabf96028b798653c4e3"}},{"ruleId":"D2","level":"warning","message":{"text":"extension.activate (cognitive 30): extension.activate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20, boolean chains 5, error handling 3, ternaries 1 (2 pts) (nesting depth added 1). Most of this is not in the body itself: 5 of the 30 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 489, 551, 409, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/extension.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d58b9d7d5517b483e218c1a779f45a098fd9efcb9046d6c07b49dcdbf66e07b"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::is_protocol_subset_at_attr (cognitive 29): AnswersSolver::is_protocol_subset_at_attr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 5, loops 1 (3 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56097e7f30ff36cb5557620a2c61cb14a2ce81a448c458cd795b06cd9806ec5"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::calculate_typed_dict_field (cognitive 29): AnswersSolver::calculate_typed_dict_field has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 4 (5 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":"pyrefly/lib/alt/class/typed_dict.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f1af03b46a66acead3f62516eb7baf1426f29793dc65a9438dd95057684e3e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::compare_types (cognitive 29): AnswersSolver::compare_types has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 4, match/switch 2 (3 pts), 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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a32c0c4c7508704854276e12cccf47511b6faaf4ec228965113ce6462d99abe"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::resolve_type_shape_dsl_intrinsic (cognitive 29): AnswersSolver::resolve_type_shape_dsl_intrinsic has cognitive complexity 29 (threshold 15). Drivers by points: if/else 26, match/switch 1 (2 pts), boolean chains 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":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"348cf79b2aa3ab66adedd9a6e72246f1628b28708631984a962890767c8d12a8"}},{"ruleId":"D2","level":"warning","message":{"text":"OverrideCodeLensProvider.provideCodeLenses (cognitive 29): OverrideCodeLensProvider.provideCodeLenses has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6, ternaries 2 (5 pts), error handling 1, loops 1 (nesting depth added 8). Of this number, 24 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/overrideCodeLens.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2f8d30c38debb372d6da22fbc7f16c5ce0f240d2696d441b006bcfa276519f"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::polars_construct_options (cognitive 28): AnswersSolver::polars_construct_options has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (7 pts), match/switch 3 (4 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":2107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6701708e005121c9583a3b096873b2f6d6a676292a894b61639ac403d927154f"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::validated_tparams (cognitive 28): AnswersSolver::validated_tparams has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (9 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c79ea5f9df571cfda816cbd4da66a12c978c55b9ab02e4d2f0302d88765429"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::validate_type_form (cognitive 28): AnswersSolver::validate_type_form has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 10, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":8108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7204aada43a9cd74245da990f322ccb2a92eda904aaf633393a87e01a573ab"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::parse_type_shape_dsl_argument_inner (cognitive 28): AnswersSolver::parse_type_shape_dsl_argument_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 13). 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":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a34a0eade0c52c1e9c5240a023aa97aa08bf48bfe038c87c50e1005ae6ce0a"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgsExpander::expand (cognitive 28): ArgsExpander::expand has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 5 (10 pts), loops 2 (5 pts) (nesting depth added 16). 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":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00af297e39165f2a92204fe4ceeb802e07f45d4fedeed922e5cd1139831e061"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::function_body (cognitive 28): BindingsBuilder::function_body has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 14, if/else 9 (10 pts), match/switch 3 (4 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":"pyrefly/lib/binding/function.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cd03f1dc9f6b27684f8b4d5c06e4659557ba4d5585e65b8bd5a43c0d297c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::shape_comment_target (cognitive 28): BindingsBuilder::shape_comment_target has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/shape_type.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b64eb154bf727c3d58587a7e1d98e44e1bd3381796d8f82999eb0353184b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::prune_baselines (cognitive 28): Server::prune_baselines has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (5 pts), loops 3 (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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4079}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac11938d6b1f65baf2b021b003e8297a51916753a49efd98b708bb874c831c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::commands::dump_config::dump_config (cognitive 28): pyrefly::lib::commands::dump_config::dump_config has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 6 (10 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/dump_config.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01cb957bedc7d157d19fc77e28bbaa09a7c49b95376f8d2e51a7c85b022eca9"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::ide::find_import_merge_edit (cognitive 28): pyrefly::lib::state::ide::find_import_merge_edit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 2 (4 pts), boolean chains 2, match/switch 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":"pyrefly/lib/state/ide.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f45f5c0862701d3928dbe5c948a93e24046954fe5264869441c7e33e46eb418"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_python::docstring::parse_numpydoc_params (cognitive 27): pyrefly_python::docstring::parse_numpydoc_params has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 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":"crates/pyrefly_python/src/docstring.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"03831cccc61115f8dc0cdc964200117b2ac092aaa6fe6080020423fdaaa0461b"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_python::ignore::parse_ignore_all (cognitive 27): pyrefly_python::ignore::parse_ignore_all has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 5, 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":"crates/pyrefly_python/src/ignore.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"5539959c48e7288a39778a66c9cfa455350a4284546ae48ea71aa5eb153e0b42"}},{"ruleId":"D2","level":"warning","message":{"text":"Tuple::fmt_with_type (cognitive 27): Tuple::fmt_with_type has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (8 pts), match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/tuple.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"174674da918fb9f1722af205ef2dda1ecb5f48ad4f6f204a3a939620d38910f4"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::type_level_dsl::lower_parameter (cognitive 27): pyrefly_types::type_level_dsl::lower_parameter has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 4 (8 pts), loops 1 (2 pts) (nesting depth added 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. 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8662}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cc216db5c5672d2dd9fb69e11648190bfeb1080004d2585324ea2740ac3472"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::constrain_forwarded_overload_return (cognitive 27): AnswersSolver::constrain_forwarded_overload_return has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 3 (4 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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6710e3adc1443773eea96e367ebeec449fbd20f7187664c99a81b0b67ceb2cea"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::determine_read_only_reason (cognitive 27): AnswersSolver::determine_read_only_reason has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (22 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":3155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fffddcca0066afe881d5a2b27c40e5f75cf00c7b7df937e03b2665d79241d2"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::pydantic_config (cognitive 27): AnswersSolver::pydantic_config has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 10, match/switch 3 (6 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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e557eed6ec668929cf118fbf9b533681908801cb77ab7ad27116c6db0ca8c05"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::try_int_binop (cognitive 27): AnswersSolver::try_int_binop has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b270fd0d4ee802333a4986e940b80958a3d1f216fbc71b37a0bf59614316b8d"}},{"ruleId":"D2","level":"warning","message":{"text":"Bindings::new (cognitive 27): Bindings::new has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 4, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5f4b793d958c28fb9585e6db486bf900517bf5dc6ecd3bbedf0eaed3596f30"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::ensure_type_impl (cognitive 27): BindingsBuilder::ensure_type_impl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 10, match/switch 4 (6 pts) (nesting depth added 6). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5427deebbf9aeb6b399a98edbf594b2ab8bd0527fa0e9990101c0641ae4014dd"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberRenderer::signature (cognitive 27): MemberRenderer::signature has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (6 pts), match/switch 3 (6 pts), boolean chains 4 (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":"pyrefly/lib/state/lsp/quick_fixes/implement_abstract_members.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce820de719f45978c7b1a2ea9489099c956d14a9fd601ee14fe44ce73231c9e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::add_inlay_hints_for_positional_function_args (cognitive 27): Transaction::add_inlay_hints_for_positional_function_args has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (7 pts), boolean chains 1 (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":"pyrefly/lib/lsp/wasm/inlay_hints.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"6983176c82a2f652cc4da94642e40536aa4ff978ad0cf0fe91ad80a183d82f4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::dict_literal_value_string_literal_at (cognitive 27): Transaction::dict_literal_value_string_literal_at has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (3 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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d795594ef0b6b1e67e6c5eefbd4d66bdf99ac8cc4e178214ead5cf6e3aaaeb69"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::find_definition_for_attribute_in_non_python_module (cognitive 27): Transaction::find_definition_for_attribute_in_non_python_module has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 6, 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":"pyrefly/lib/state/lsp/extra_extensions.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69189aac50bb7f8712b1ee64fe25e5131daff7f3923d802a0af425eb9c9590e"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::extract_function::extract_function_code_actions (cognitive 27): pyrefly::lib::state::lsp::quick_fixes::extract_function::extract_function_code_actions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, 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":"pyrefly/lib/state/lsp/quick_fixes/extract_function.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcfa69eee1ab0f0ed429471bb22cdaae86ac89fb6818e48c0984905ea6cd9a3"}},{"ruleId":"D2","level":"warning","message":{"text":"DslValidator::validate_generator (cognitive 26): DslValidator::validate_generator has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 5 (6 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"0614a504115dc253220519744629e30f1d79e45a7852759e1844f5b2059f392b"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::calculate_class_tparams (cognitive 26): AnswersSolver::calculate_class_tparams has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (5 pts), loops 3 (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":"pyrefly/lib/alt/class/tparams.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"132ee04464e9a95f499b8e326dd8f717a46b7f1ff6344fd3f39ba814c14477bb"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::infer_dataframe_dict_schema (cognitive 26): AnswersSolver::infer_dataframe_dict_schema has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 4 (9 pts), loops 1 (2 pts), boolean chains 1 (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, 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"e187bf973ad9651acd77eb412574604c76d8a18e1a7cb05cb769a2c0e62daa3f"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::call_typing_cast (cognitive 26): AnswersSolver::call_typing_cast has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3 (6 pts), boolean chains 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":"pyrefly/lib/alt/special_calls.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5664491ef740b7a0baac73294974b1061811ead39e763892897cb93e2a83cdc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Scopes::look_up_name_for_read (cognitive 26): Scopes::look_up_name_for_read has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7, match/switch 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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":4219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c711e4eb7811d8d0064dd8553df6d98973033febfad6eb3d92c20c27e86f4583"}},{"ruleId":"D2","level":"warning","message":{"text":"Exports::invalid_dunder_all_entries (cognitive 26): Exports::invalid_dunder_all_entries has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (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":"pyrefly/lib/export/exports.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d73003ae3e88b5e0c08377b1b24d89a85ea31e7eac4a4cceb69f802397f43c"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberRenderer::member (cognitive 26): MemberRenderer::member has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (25 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":"pyrefly/lib/state/lsp/quick_fixes/implement_abstract_members.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"23572a0fa32a6e46b6f488d2f94dfce241d32752a683ea677d30d1829013ddd4"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberRenderer::params (cognitive 26): MemberRenderer::params has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 2 (6 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":"pyrefly/lib/state/lsp/quick_fixes/implement_abstract_members.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"731094904c21113ef4e8c1b74d80b3a16e45de2875286b5622fcd674f1f21967"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::type_from_resolution (cognitive 26): Transaction::type_from_resolution has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c0912caf63fb6984ae5f2f101dba34d40df1631f61db3229c7b5a2fc6ef842"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::report::pysa::ast_visitor::visit_statement (cognitive 26): pyrefly::lib::report::pysa::ast_visitor::visit_statement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/ast_visitor.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"36709e74864a7d565d339e4a932812b0dfcb9010036e38bf7cbcf7c22149a301"}},{"ruleId":"D2","level":"warning","message":{"text":"stub_coverage.parse_stub (cognitive 26): stub_coverage.parse_stub has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 10, 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":"tensor-shapes/stub_coverage.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63f44e501a9a0137d12bfa16b0cafe8c977e7d950f399aa7f7062896f8071df"}},{"ruleId":"D2","level":"warning","message":{"text":"Value::compare (cognitive 25): Value::compare has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 8 (21 pts), if/else 3 (4 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_python/src/sys_info.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3e3240567f16e52baffcd1902ac18803c3cb7f0dd28ad8f51629800d06c969"}},{"ruleId":"D2","level":"warning","message":{"text":"DslValidator::validate_assignment_value (cognitive 25): DslValidator::validate_assignment_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":4103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e413226080c4d6e408a5fbf02606567d8a95664173c7cd1a5d64fa9bc8bf84d1"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::expand_type_for_lax_mode (cognitive 25): AnswersSolver::expand_type_for_lax_mode has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 6, loops 1 (2 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/pydantic_lax.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72755b1a9628bd66f6a2d19970cda0fd9b1d56f6d8312f9a47f325f0c1d9110"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::dataframe_list_element_type (cognitive 25): AnswersSolver::dataframe_list_element_type has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb16bd2cb4ef5751d64bc2edb3e6ee7c631b0a00e2837e9ef2a4b58cadca244"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::special_export_from_binding_idx (cognitive 25): BindingsBuilder::special_export_from_binding_idx has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d788db3481b010ebb4cb8215707661f474a7a41b882536aee956894cd01c2d39"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::bind_targets_with_value (cognitive 25): BindingsBuilder::bind_targets_with_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (9 pts), boolean chains 2, match/switch 1 (nesting depth added 14). 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":"pyrefly/lib/binding/target.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e93f251fe298d7d4b9dde376de6a1471f6499fd73dc431dab4b01bae8c9e12"}},{"ruleId":"D2","level":"warning","message":{"text":"Scopes::record_or_reject_return (cognitive 25): Scopes::record_or_reject_return has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 2 (6 pts), match/switch 2 (6 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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":3678}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e4ed8d9dda3c82d23eed83a729f3db5f69823bc52a7753700694cefc7ce201"}},{"ruleId":"D2","level":"warning","message":{"text":"Subset::check_targs (cognitive 25): Subset::check_targs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, match/switch 2 (5 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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3767ec8dca75ecb669bdb6c70ba4e2ab6b9669909ad07157fabb5883c695ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportTracker::resolve_annotation (cognitive 25): ImportTracker::resolve_annotation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, match/switch 1 (2 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":"pyrefly/lib/state/import_tracker.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50eb5c3b3d6162ae53310fe1e7d942b30ae92399b3683f6825566a7cdf8399e"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::find_global_references_from_definition_impl (cognitive 25): pyrefly::lib::state::lsp::find_global_references_from_definition_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (5 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":5914}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf60309e0cb499260ff067949d0242977cc38a4baba5cab53e80a65773115744"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::inline_variable::expand_statement_removal_range (cognitive 25): pyrefly::lib::state::lsp::quick_fixes::inline_variable::expand_statement_removal_range has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 9, loops 4 (5 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":"pyrefly/lib/state/lsp/quick_fixes/inline_variable.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec0890ca8808fb64b2ec50f8a68106c929caedaece636194881c8323bd22f82"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolvedTypeShapeDslProgram::evaluate_suite (cognitive 24): ResolvedTypeShapeDslProgram::evaluate_suite has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 2 (8 pts), loops 1 (nesting depth added 16). 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6469}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c4eed1be680c57fa8881717ccfcf4d14e50833b3a764d349091716a9a2cf1e"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::gufunc::parse_gufunc_signature (cognitive 24): pyrefly_types::gufunc::parse_gufunc_signature has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 8 (11 pts), if/else 7 (9 pts), boolean chains 2, loops 2 (nesting depth added 5). 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":"crates/pyrefly_types/src/gufunc.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"1169c9a01bb76519e3de49bfd40488af730429b5fd122fb58a69462d01784517"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::constructor_to_callable (cognitive 24): AnswersSolver::constructor_to_callable has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/call.rs"},"region":{"startLine":3016}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fcfcf8fe273606f534a51aab69332ff2903a0f1f2e96fd6882b34b23b43ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::fill_in_field_keywords_from_function_signature (cognitive 24): AnswersSolver::fill_in_field_keywords_from_function_signature has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (7 pts), boolean chains 2, 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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2182d4689640fa6761c0fc6523a6fe609eaf2fb9c16238e2dc93e67186b734a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::validate_self_annotation (cognitive 24): AnswersSolver::validate_self_annotation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 4, loops 1 (4 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/function.rs"},"region":{"startLine":3064}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a74253af5669371257a2e72f4890bdc8ee056e15a835b1a265bc02f6b4635f3"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::project_regular_nested_list (cognitive 24): AnswersSolver::project_regular_nested_list has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 5 (10 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/regular_nested_list.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f026737993fe95c37e498ef4b661be83ca269e2e11f938172cb80acd907e31a3"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::solve_annotation (cognitive 24): AnswersSolver::solve_annotation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 6, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aca0a46aa69c67e561cbe5c10059786f7a81ca1246ac99bb3cfda2aca2b292"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::apply_literal (cognitive 24): AnswersSolver::apply_literal has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 4 (9 pts), loops 2 (4 pts) (nesting depth added 12). Of this number, 16 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. 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":"pyrefly/lib/alt/specials.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8bc54636cf0e56fe92c7564e57d2979fc395aeabfa563501862254c8b52812"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::decompose_key_value_pairs (cognitive 24): BindingsBuilder::decompose_key_value_pairs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 3 (9 pts), 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":"pyrefly/lib/binding/class.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63358b47400ee49a6e70cdb01b25087e295784d5015d3803d74c4e8971a71d8"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::synthesize_collections_named_tuple_def (cognitive 24): BindingsBuilder::synthesize_collections_named_tuple_def has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (4 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":"pyrefly/lib/binding/class.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aaab6b15eb20dcab78623cc8f645b84a46578a8d7330118b2fc56748e931d61"}},{"ruleId":"D2","level":"warning","message":{"text":"Claims::visit_stmt (cognitive 24): Claims::visit_stmt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 13). 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":"pyrefly/lib/binding/shape_comments.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"fede788a6d7ac5f38cd42a310d18ad64ca8dd3f7746aaf920d46bb8a886c04d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::publish_for_handles (cognitive 24): Server::publish_for_handles has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 6 (9 pts), match/switch 1 (3 pts), boolean chains 1 (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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3532}}}],"partialFingerprints":{"codehealthFindingId/v1":"6604d946582354f21a453da5a4c25211b1776a78eb24314dc443a31a3be021f0"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceBindings::from_ast (cognitive 24): SourceBindings::from_ast has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (7 pts), match/switch 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":"pyrefly/lib/state/lsp/fastapi_endpoint_support/association_summary.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3fc89f512bfb968ab0ce913291b716773bbdc33f9469bff599da53a03bfd0f"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::refine_keyword_argument_definition_for_class (cognitive 24): Transaction::refine_keyword_argument_definition_for_class has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (8 pts), match/switch 1 (2 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae13b8bd697ebc327d8b34c32b715d1fcd815ebb0e193954e0f5c47af78094c"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::split_line_count (cognitive 24): Transaction::split_line_count has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (6 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":"pyrefly/lib/state/state.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be21f7a3c966f700e65ba1e832a5ed5bee66a5ada75fe0998e86940b46cad28"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::module::finder::resolve_third_party_stub (cognitive 24): pyrefly::lib::module::finder::resolve_third_party_stub has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 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":"pyrefly/lib/module/finder.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9809dbace7a11992f65424caff05ab8bbfe84b9787af23ebd141dcca0b0ea221"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::module::finder::find_extra_extension_module (cognitive 24): pyrefly::lib::module::finder::find_extra_extension_module has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 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":"pyrefly/lib/module/finder.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8eee148d774b26486d28ad02e2eeb1401ce5cbd9624e809ef0c4fc780fcfc40"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::move_module::sibling_module_targets (cognitive 24): pyrefly::lib::state::lsp::quick_fixes::move_module::sibling_module_targets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 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":"pyrefly/lib/state/lsp/quick_fixes/move_module.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb07d7173e27ebe5a1acd9976ba2d2817a07820d2d408c6c694d6aa5b3c02dc"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_protocol.replace_flag_enum (cognitive 24): generate_protocol.replace_flag_enum has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a17f0c4472c8fe477865fabab17b3b2829a56ade235aa82a32e7a1565073dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_python::docstring::parse_sphinx_params (cognitive 23): pyrefly_python::docstring::parse_sphinx_params has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_python/src/docstring.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fe13349d556abef2e499ab96aa1d6d5a6cc6ce944ecdf1522cb05f197dbeb5"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::lookup_magic_dunder_attr1 (cognitive 23): AnswersSolver::lookup_magic_dunder_attr1 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 7, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"95935516cb356cb17ca05c482ec7458ba397474b3b09a8471b670ce502489307"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::explicit_slots (cognitive 23): AnswersSolver::explicit_slots has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 8). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfd346bf1b2b7d41c5a0ece3649f686c4c18e1e23090a41fc91bab54c6ef256"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::final_protocol_metadata (cognitive 23): AnswersSolver::final_protocol_metadata has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts), match/switch 1 (2 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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aecb2352e236534e00de3d508a52cb53e2657a82885dfd0b0bde9fdd8053ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::dataclass_from_dataclass_transform (cognitive 23): AnswersSolver::dataclass_from_dataclass_transform has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (21 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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4b76335eacb4751009d8c2574adec96d7bf4b22398f6781b2225073177cc7d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::extract_pydantic_field_from_annotation (cognitive 23): AnswersSolver::extract_pydantic_field_from_annotation has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cc09487bb82f0ef033bfe4207d749fd3de251fd36942a59da0ef47bfdf3e38"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::expr_infer_without_shape_comment_impl (cognitive 23): AnswersSolver::expr_infer_without_shape_comment_impl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38f3a8938228be6f4d51f67e11d3ad52b6870fc23ef21c3819172b10e8c0b73"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::solve_super_binding (cognitive 23): AnswersSolver::solve_super_binding has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 4 (7 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ea6e721bd031e483a6d9c8d39876d128159479db605c0aade6bc50384fa514"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::binding_to_type_return_explicit (cognitive 23): AnswersSolver::binding_to_type_return_explicit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 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, 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4842}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73f3101e692130c3df65e7d23c6d662e62954947a7d610e04a3394f2b9cd681"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_except_clause_reachability (cognitive 23): AnswersSolver::check_except_clause_reachability has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 4 (5 pts), loops 2 (3 pts), boolean chains 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":5260}}}],"partialFingerprints":{"codehealthFindingId/v1":"5439df9ba2cc91b04c856a385b383512d8e418d0efedd94a111d847065754428"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::handle_special_import_call (cognitive 23): BindingsBuilder::handle_special_import_call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts), match/switch 2, 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":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7ffe56b0a8c69466911b8d087ea650916c10957cb05f072fc85af4a6be7ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorCollector::collect_sorted (cognitive 23): ErrorCollector::collect_sorted has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/collector.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ebde62296f2b7459861576c4341ac0d94bc441b0e0037b9294bf67d0ade34d"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::add_local_variable_completions (cognitive 23): Transaction::add_local_variable_completions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"746877592be77a28c61939b7be5c56b0d1b56ced12e8e7fae218922a08d7754f"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::dict_literal_string_literal_at (cognitive 23): Transaction::dict_literal_string_literal_at has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 4, 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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd6b173907cca1f7921429914d4352881edc227ce7d625e38df3988dea3eb97"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::lsp::non_wasm::will_rename_files::will_rename_files (cognitive 23): pyrefly::lib::lsp::non_wasm::will_rename_files::will_rename_files has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (6 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/will_rename_files.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bce0f0f45759e6536fca58119406cd66f56156ad4a2ec591f9a95c50b1ab5c"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::lsp::wasm::hover::get_hover_with_verbosity (cognitive 23): pyrefly::lib::lsp::wasm::hover::get_hover_with_verbosity has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 6, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/hover.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ef287d2577aaacb535b4b92f517a3c1e271db401d383502f9444146d9ca074"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::fastapi_endpoint_support::association::reference_definition (cognitive 23): pyrefly::lib::state::lsp::fastapi_endpoint_support::association::reference_definition has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 3, 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":"pyrefly/lib/state/lsp/fastapi_endpoint_support/association.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"104121d2d8f769eafd3348a9a4c825ab785a61c441fa36f17a6f4d261a203c7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigBase::fill_unset_from (cognitive 22): ConfigBase::fill_unset_from has cognitive complexity 22 (threshold 15). Drivers by points: if/else 22. 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":"crates/pyrefly_config/src/base.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfb505dff544d9870ed0efa3f5bcdd50c488a0122b1dfb9814fcf4fa5539efb"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_config::migration::mypy::util::make_error_config (cognitive 22): pyrefly_config::migration::mypy::util::make_error_config has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, loops 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":"crates/pyrefly_config/src/migration/mypy/util.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f7439599d54ad783a62b9c35852876f72cfa300e3089be526699d45d48f09b"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::fold_attribute_candidates (cognitive 22): AnswersSolver::fold_attribute_candidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c03f241e5019e600decf9f4607d8faab5d73d02d0c2affbf179e455faaa840c"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::validate_dataclass_transform_defaults (cognitive 22): AnswersSolver::validate_dataclass_transform_defaults has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (8 pts), match/switch 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f465a0e563014de17ab398ab0291be0bc09f7b50346a8c97d91f4577683bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::boolop (cognitive 22): AnswersSolver::boolop has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (5 pts), loops 2 (3 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25157e0b37de3eabda60cefe436ed532100a8532bda821bd48a70a33ce8859d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::shaped_type (cognitive 22): AnswersSolver::shaped_type has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 6 (10 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":"pyrefly/lib/alt/shaped.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d9baf2ee6683b028105914607da0f2ac9fde79ca07c390650ce2d527ec7a05"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::as_special_export_inner (cognitive 22): BindingsBuilder::as_special_export_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 pts), loops 1 (3 pts) (nesting depth added 14). 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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbacd9393532c7c2b71e00a2430c2a0ed528fff13e8739aacabbf636679c50f"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::get_diag_if_shown (cognitive 22): Server::get_diag_if_shown has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1df205cc113ad3dabb69266136c04d8ccd375964e2925a951f68a41872eed87"}},{"ruleId":"D2","level":"warning","message":{"text":"RenameUsageVisitor::visit_stmt (cognitive 22): RenameUsageVisitor::visit_stmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/will_rename_files.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cb6695596abaa583a3d5876b36153c029d5ea487bd749cb69d16676ce7cd16"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceConfigConfigurer::configure (cognitive 22): WorkspaceConfigConfigurer::configure has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 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":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a62114046e3a8fcb52fd85a9bcf6c90cfefbebe35a778f626187156e03517e"}},{"ruleId":"D2","level":"warning","message":{"text":"Query::get_attributes (cognitive 22): Query::get_attributes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/query.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f06a62b6ffee9d5ab8a5a0e7ef867265d5701c1640173a16c01e5bbce059b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Subset::is_subset_overload (cognitive 22): Subset::is_subset_overload has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). 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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bd65bf907ee9628df1e0f580cd169749b10c86c6da177f66b6c90a960e6e13"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::infer_parameter_annotations (cognitive 22): Transaction::infer_parameter_annotations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 2 function items inside it that branch (transpose, zip_types). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/inlay_hints.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"6225c7b0fd268051a0c14aa5ccadd07dd59edc478d5f840ae6dc7caacf3da827"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::add_dict_key_completions (cognitive 22): Transaction::add_dict_key_completions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (3 pts), match/switch 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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"327db25ca3c5148297a7060a9777daae760788b85042e63d9b2e0f36703a479e"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::report::cinderx::convert::type_to_structured (cognitive 22): pyrefly::lib::report::cinderx::convert::type_to_structured has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 9). 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":"pyrefly/lib/report/cinderx/convert.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b924ff132842615727ccfef544d22aa839605ae084a55b904b3943b7a9227b3"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::introduce_parameter::build_callsite_edits (cognitive 22): pyrefly::lib::state::lsp::quick_fixes::introduce_parameter::build_callsite_edits has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 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":"pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a5f0875b64bf3ffb30711689463b1318bbb7dbc9a9cfb483cd69f2cdab97c7"}},{"ruleId":"D2","level":"warning","message":{"text":"QuerySourceDatabase::update_with_target_manifest (cognitive 21): QuerySourceDatabase::update_with_target_manifest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 5 (9 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":"crates/pyrefly_build/src/source_db/query_source_db.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5bd66c9a5aa1feb0e998462bdec4e260822adb73584ea2ffa630f5ccb9144f"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigFile::from_file::f (cognitive 21): ConfigFile::from_file::f has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3 (4 pts), boolean chains 2, 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":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c526d6e3e71ef1229658e8761e305f34ce1546fdc35ea14b532fe2ceae959b"}},{"ruleId":"D2","level":"warning","message":{"text":"ParamList::fmt_with_type (cognitive 21): ParamList::fmt_with_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, 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":"crates/pyrefly_types/src/callable.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3517bba4f2af4b2a7e87602c9a4f72bc44a38b8ec8686726c062ebc1095bd548"}},{"ruleId":"D2","level":"warning","message":{"text":"PolarsScalarDType::supertype (cognitive 21): PolarsScalarDType::supertype has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, match/switch 4 (7 pts), boolean chains 4 (nesting depth added 3). 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":"crates/pyrefly_types/src/polars_dtype.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e22f4d7037dc6e8656dcdc2f969a8e28df74bea9cb405715844d64e820fdb2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Tarjan::root (cognitive 21): Tarjan::root has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (6 pts), loops 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":"crates/pyrefly_util/src/tarjan.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc31ca67a41ef928d345f48750af2c0633f9b4161dd1e8ae0c0d4ffb6f1dafde"}},{"ruleId":"D2","level":"warning","message":{"text":"Answers::solve (cognitive 21): Answers::solve has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/answers.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea96e44d9c9bdea0dbae9f444b18a633e22f40d7c381301666d1e4054ad1e13"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::calculate_and_record_answer_iterative (cognitive 21): AnswersSolver::calculate_and_record_answer_iterative has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":2993}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f35ece3f66399630a930e45c2d1d5b3997212d84ac112a774f0bf93cd8dd96d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::call_attrs_fields (cognitive 21): AnswersSolver::call_attrs_fields has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (7 pts), boolean chains 3 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/attrs.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa3409fb851ee70b4070637ab2b202d922adc247527dfd6cf8e21f2374d1b14"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::bases_with_metadata (cognitive 21): AnswersSolver::bases_with_metadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, match/switch 1 (nesting depth added 7). 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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fe71b6df4e63abe11086fb6775ae8dde08ac9cf4f6761d7970a7241cff0661"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::validate_frozen_dataclass_inheritance (cognitive 21): AnswersSolver::validate_frozen_dataclass_inheritance has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 1, 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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"8143bf4330b31def1a996ee3d6ffd0653f3ffa204fabde748a2b8684eb531234"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::iter_fields (cognitive 21): AnswersSolver::iter_fields has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, match/switch 1 (2 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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4124df2c23cbd7370c4636194a7b81953710738ce36e639363ca93c0eecb039"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::override_base_dictates_any (cognitive 21): AnswersSolver::override_base_dictates_any has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, match/switch 5 (6 pts), if/else 4, 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a22fb134a18b9af4f085a12a56089d87b4a2ed98ff827b787c31ca71bac8d53"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::narrow_issubclass (cognitive 21): AnswersSolver::narrow_issubclass has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c4a3efd416010807d650920f4ed38bef162bdb27fc9deed3e0f0256620b1f2"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::polars_nested_dtype_from_call (cognitive 21): AnswersSolver::polars_nested_dtype_from_call has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd03bd0029716cbe4e01cde54c7574311b2a1a838df78c9d9eb53e363beaf3dd"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::polars_group_by_agg (cognitive 21): AnswersSolver::polars_group_by_agg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 6 (8 pts), 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3024}}}],"partialFingerprints":{"codehealthFindingId/v1":"61aa280920234dd6f854e90e5759ca0012f94dedd0cdcad059043ae3f15e7155"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::binding_to_type_return_type (cognitive 21): AnswersSolver::binding_to_type_return_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4727}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ad5ce7c37c8e4650570b650737865e834535e28a583787ffbd5b9f6e95ff7d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCheckKind::format_error (cognitive 21): TypeCheckKind::format_error has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 6 (9 pts) (nesting depth added 7). 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":"pyrefly/lib/error/display.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc16329c378ebb79740c3be51a2b06339aab91c84a0baf45a044a588bef9de5"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::visit_stmt (cognitive 21): Builder::visit_stmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/scip/symbols.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"be92807f326888de6a92b1cb95307085787dbd5139e443e7e364f81024c9f79a"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver::erase_unsolved_variables (cognitive 21): Solver::erase_unsolved_variables has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (6 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06400ba2748f4b44c87ec7d6e40502e38e4e4b00dc44823fa8d0cb1d6c07b23"}},{"ruleId":"D2","level":"warning","message":{"text":"TspExtraConnection::run (cognitive 21): TspExtraConnection::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (9 pts), loops 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":"pyrefly/lib/tsp/server.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63fbd3ead6186a5a9c918fafc710eea82c0ace650cfdb550a56b48858b7aaeb"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::alt::functools::partial_params (cognitive 21): pyrefly::lib::alt::functools::partial_params has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), match/switch 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":"pyrefly/lib/alt/functools.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cc405ea2239d212f8860c8aba9ac2690dfec3004dbdf4fae84d671396fd0f0"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::alt::jaxtyping::parse_shape_string (cognitive 21): pyrefly::lib::alt::jaxtyping::parse_shape_string has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (3 pts), boolean chains 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":"pyrefly/lib/alt/jaxtyping.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9cedf13d919e5df994e1d27086dea1a028ba18de514e1d3d4bd0db5a4cf630"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::commands::coverage::collect::collect_class_members (cognitive 21): pyrefly::lib::commands::coverage::collect::collect_class_members has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 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":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efb8f4208c7c75bb923aaeb8cf6070e80ee7cd23c071d1fdd8d0268a6bd9f94"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::error::signature_diff::render_signature_diff (cognitive 21): pyrefly::lib::error::signature_diff::render_signature_diff has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2, 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":"pyrefly/lib/error/signature_diff.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c7ecae6df37a59fb906551abcc944df5dbc61ed61e2e052da2936edf73c03d"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_testing.check_suites (cognitive 21): shape_testing.check_suites has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), ternaries 2 (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":"tensor-shapes/shape_testing.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df439f73fb9620d6d623c36ff19affafbd394458b2b574778bd65a187178580"}},{"ruleId":"D2","level":"warning","message":{"text":"SysInfo::subscript_tuple (cognitive 20): SysInfo::subscript_tuple has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_python/src/sys_info.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e5cc0da6cde06985e72b3cb61652f671ce9e4e95a7a4554d8b89259d22dada"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeDisplayContext::fmt_shape_as_tuple_carrier (cognitive 20): TypeDisplayContext::fmt_shape_as_tuple_carrier has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfaed413174940fc6ae50ec4e32bb09a5fc9e9e153e35612385d39ddaa65c11"}},{"ruleId":"D2","level":"warning","message":{"text":"AdvancedIndexPlan::build (cognitive 20): AdvancedIndexPlan::build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (3 pts), boolean chains 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":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b8fe307c9588727edd85262f4c9dc2ea07669fe2cb2ee1755dcd23546f2ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::record_attribute_definition_index (cognitive 20): AnswersSolver::record_attribute_definition_index has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (7 pts), 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":"pyrefly/lib/alt/answers.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff2c8fd7c34344098317107dd80e7d912523b9fec421b364695bd620ef93c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::type_of_attr_get (cognitive 20): AnswersSolver::type_of_attr_get has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 3, match/switch 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed4bd0daafe56b7ab5624dfb5b3ec869f39607f097bcaef8c7ee641e4264046"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::get_django_class_field_type (cognitive 20): AnswersSolver::get_django_class_field_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, match/switch 3 (4 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, 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":"pyrefly/lib/alt/class/django.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3960a2029b82ff006076d7b0b459b428417187f758ce5cc26aa9be1ba30ddd5b"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::create_next_typevartuple_arg (cognitive 20): AnswersSolver::create_next_typevartuple_arg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (3 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":"pyrefly/lib/alt/class/targs.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d63ea28f853e157848845ca6f8e0eedda45152b739a5232ce5d2bacdefd736b"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::augassign_infer (cognitive 20): AnswersSolver::augassign_infer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, match/switch 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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f99784619d5458df30efee696c06240cbef9e12899080d30e73a3153220915"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::polars_output_count (cognitive 20): AnswersSolver::polars_output_count has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 11). 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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"9396f487ec8cc393c6e5a6700c976d05905c79bb10d668a620dd337cc2f44b88"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::populate_parent_methods_map (cognitive 20): AnswersSolver::populate_parent_methods_map has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"9878ca521f52f2d42ac7cfb91417936556fb46bc42882e6dbf4d1204927c8585"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_variance_for_class (cognitive 20): AnswersSolver::check_variance_for_class has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4060}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e4b98a960371b81d2eeda2c1f9e4553730b4d8d38db5cdd3de21fe57796607"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::solve_yield (cognitive 20): AnswersSolver::solve_yield has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7608}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2de23e0f4a8a9ec01e997c9dd2c36443d99c21378eab309fbcc2163877869e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::infer_unpacked_slice (cognitive 20): AnswersSolver::infer_unpacked_slice has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 6). 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":"pyrefly/lib/alt/subscript.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9cf32b90db1428cbe1df593e42c71d37fc373a77a4efc03f8195323ee6429e"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::insert_phi_keys (cognitive 20): BindingsBuilder::insert_phi_keys has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 2 (4 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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":5248}}}],"partialFingerprints":{"codehealthFindingId/v1":"21978cbfb8944c606e443bc5699d65cfe9bbe46ed04ea4f9ba64b875f7438c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"PytestAliases::from_stmts (cognitive 20): PytestAliases::from_stmts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/pytest.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7de7e27cb840c190c7d00999424e79ce32417cceedc235430f0fe320f627809"}},{"ruleId":"D2","level":"warning","message":{"text":"BaselineIndex::apply (cognitive 20): BaselineIndex::apply has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (6 pts), match/switch 2, boolean chains 1 (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":"pyrefly/lib/error/baseline.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a043ceb9520ddfd635a416b46653454d7e457eea60e1ebeac523a419e5f48ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"GleanState::declare_statement (cognitive 20): GleanState::declare_statement has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 3 (7 pts), match/switch 1 (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":"pyrefly/lib/report/glean/convert.rs"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"baed8a4d3251c2fa2ad4b638785a1f28c2384f729ea524571840f32c28efcdff"}},{"ruleId":"D2","level":"warning","message":{"text":"Subset::is_subset_protocol_inner (cognitive 20): Subset::is_subset_protocol_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, match/switch 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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b19c6972c53ae4e9ff543acdeb35674c1a3902b9722c08ca3f57d6a8c27405b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleChanges::overlaps (cognitive 20): ModuleChanges::overlaps has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, 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":"pyrefly/lib/state/state.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef482d277548a509059b3edf431f7503cd9b4dbe09d23b3ca0b8013ce3eada8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::resolve_named_import (cognitive 20): Transaction::resolve_named_import has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (4 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"204d995443ae116c93589e00fcc2919756ed22eec943e89cd52091bce5076602"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::commands::lsp::filter_unrecognized_lsp_args (cognitive 20): pyrefly::lib::commands::lsp::filter_unrecognized_lsp_args has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/lsp.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"127afcbda2c39dd6c7d1ecc5dc9473ab960a3e0b930f27670fc53161e739595f"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::module::finder::combine_normal_and_stub_results (cognitive 20): pyrefly::lib::module::finder::combine_normal_and_stub_results has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/module/finder.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6db482c9fb5bca549d2a8420eeb99c571f2795158a398e1a003add1cf706841"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::change_signature::build_callsite_edits (cognitive 20): pyrefly::lib::state::lsp::quick_fixes::change_signature::build_callsite_edits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 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":"pyrefly/lib/state/lsp/quick_fixes/change_signature.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf295e51c506b545b16de511890975d541c6a675632a49a00eb945fdfd2619c"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::move_module::make_local_function_top_level_code_actions (cognitive 20): pyrefly::lib::state::lsp::quick_fixes::move_module::make_local_function_top_level_code_actions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/move_module.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fb29f5cfb813fe9f6daff73a5ccc2284f92b33edf7e1a8d46171a538da3a82"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_build::module_resolver::find_module_prefixes (cognitive 19): pyrefly_build::module_resolver::find_module_prefixes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_build/src/module_resolver.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a5caf7f30994d2979407ee0ca4f5e894377b37fc5d3e27134cec1eeb19bc98"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigFile::query_source_db (cognitive 19): ConfigFile::query_source_db has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (8 pts), match/switch 1 (2 pts) (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"383fb387a6c5d74d5a8ee28b892550948bf8f2eacb75ccd4c57de87384d849bf"}},{"ruleId":"D2","level":"warning","message":{"text":"PyProject::update (cognitive 19): PyProject::update has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/pyproject.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d84b36a2be10342407e7bec4582f94a8d30212813a62a3d68dec3eec7f3b1eb"}},{"ruleId":"D2","level":"warning","message":{"text":"DslValidator::validate_dimension (cognitive 19): DslValidator::validate_dimension has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2531}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82a84ec15b71d870152145e9056a1f7b6ef2a04cc94e566c75ddfdc04199db0"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::einsum::evaluate_einops_einsum (cognitive 19): pyrefly_types::einsum::evaluate_einops_einsum has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 3 (5 pts), loops 3 (4 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":"crates/pyrefly_types/src/einsum.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd724082f21a0f654a40cc2470f648887278f1389165b1a344daaa178de5fe05"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::shape_index::index_shape_multi (cognitive 19): pyrefly_types::shape_index::index_shape_multi has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bc5b6d6a4a9ff88e6541477397dbc0af83a5e2d23b6575bb743d33a71ea147"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::simplify::collapse_quantifieds (cognitive 19): pyrefly_types::simplify::collapse_quantifieds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/simplify.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11efcb16e013999da6f626eab67569bb431f0c160ee90080c9b5c4b9d9b5f64"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskHeap::work (cognitive 19): TaskHeap::work has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, match/switch 1 (2 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":"crates/pyrefly_util/src/task_heap.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"259f980634a3e364966afd7fb0280c3cd9afb42895498349d3c8e85bf7425262"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::iterative_resolve_scc (cognitive 19): AnswersSolver::iterative_resolve_scc has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (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":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":3414}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa20a495e23964ea7f8d6eedaf5dc9ded24d5417e90baa4e5b7fdffc9ba057d2"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::dataclass_field_keywords (cognitive 19): AnswersSolver::dataclass_field_keywords has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, 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, 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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"404477aa777d465b36d1a5b31aa2811739f9a8a045f7430a76eef6dcd8e9a813"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::create_next_typevar_arg (cognitive 19): AnswersSolver::create_next_typevar_arg has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/targs.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"287794455fd3e068b04610ca5cc76bc176ca5649f63e94125edcb85de1f19833"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::parse_fstring_format_spec (cognitive 19): AnswersSolver::parse_fstring_format_spec has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, loops 2 (3 pts), match/switch 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"855a9970459e7e873a06c64bddb5e0658fa9dc12778577c6902eb870f0583b81"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::parse_type_args_for_tparams_with_fallback (cognitive 19): AnswersSolver::parse_type_args_for_tparams_with_fallback has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":4875}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bc2de8ce238a1c5107ea3ade4da4812db002fee8baed352f5ec0e7260ffbd4"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::parse_int_tuple_shape_args (cognitive 19): AnswersSolver::parse_int_tuple_shape_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":5059}}}],"partialFingerprints":{"codehealthFindingId/v1":"373ed3a5a47ab55f33e39a9e9f253acac85bf41f985f5557da2a79e39093354a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_unnecessary_comparison (cognitive 19): AnswersSolver::check_unnecessary_comparison has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), 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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c6ca7a33971201f568b8cfca7a9d71afbc984e36f71cd5b76b2c3019625fa5"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgsExpander::expand_type (cognitive 19): ArgsExpander::expand_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedcdec62b7530e5736d64d00dd3f31f284af6d3ba4c6e78eec9d8b4c9d1e8c1"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::bind_lambda (cognitive 19): BindingsBuilder::bind_lambda has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"945e0de75d1963af38e5cf7c9eaba5f370d2dbba124981585874ad5c876cbe88"}},{"ruleId":"D2","level":"warning","message":{"text":"Workspaces::apply_client_configuration (cognitive 19): Workspaces::apply_client_configuration has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09e0d00a72f681e8bb92d257f7fe8b28eb14f6059160256458359c8e1440d34"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticTokensLegends::convert_tokens_into_lsp_semantic_tokens (cognitive 19): SemanticTokensLegends::convert_tokens_into_lsp_semantic_tokens has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (5 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":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf403ff6a2ec58eaf4fc3788194c9e8faadb2afdfff4b47b6be3d244264433e"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticTokenBuilder::process_expr (cognitive 19): SemanticTokenBuilder::process_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"9867af1caa20492f47d90b97cdbcb0ea937f0155307095443b8247438ab1bcba"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::dataframe_call_source (cognitive 19): Transaction::dataframe_call_source has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, 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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7548a1afaa4112a38e68195c14e74d00653f39810a5518b62348170dcc3ac2"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::lsp::non_wasm::document_symbols::recurse_stmt_adding_symbols (cognitive 19): pyrefly::lib::lsp::non_wasm::document_symbols::recurse_stmt_adding_symbols has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts), match/switch 2 (nesting depth added 6). 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":"pyrefly/lib/lsp/non_wasm/document_symbols.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc9c363b1da88ce685c8e5f55067e8c97135e7fbe9ef98c5e7ec906cdbe5900"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::fastapi_endpoint_support::endpoint_call_context (cognitive 19): pyrefly::lib::state::lsp::fastapi_endpoint_support::endpoint_call_context has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (5 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":"pyrefly/lib/state/lsp/fastapi_endpoint_support.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1da8141d0fddbdafcf00c2acd3bcfac055d0d676d04541668ca74210b7003c9"}},{"ruleId":"D2","level":"warning","message":{"text":"view_types.inline_type (cognitive 19): view_types.inline_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (19 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":"pyrefly/lib/report/cinderx/view_types.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8b748a2155580b1ca4e141109197bc2ca929fb28758d349567f8e1b8ff6c86"}},{"ruleId":"D2","level":"warning","message":{"text":"IgnoreMissingImports::migrate_from_mypy (cognitive 18): IgnoreMissingImports::migrate_from_mypy has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3 (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":"crates/pyrefly_config/src/migration/ignore_missing_imports.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"26de98b821ce13fa15a67bbfbb179adcf90708083619f7aadfd21cc0cda77d82"}},{"ruleId":"D2","level":"warning","message":{"text":"Ignore::parse (cognitive 18): Ignore::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/pyrefly_python/src/ignore.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efeda0b9e6f3c92032bf80c59424f64eccd08c14af9fcb8b49ffa745a7579af"}},{"ruleId":"D2","level":"warning","message":{"text":"Callable::fmt_with_type (cognitive 18): Callable::fmt_with_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/callable.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0b93c38225e5d528164a409e44637ed27650ab2405f9c3ec03d345e7ea8db6"}},{"ruleId":"D2","level":"warning","message":{"text":"PolarsDType::fmt (cognitive 18): PolarsDType::fmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/polars_dtype.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"55514c958ebcb009860554ddf9ae2a25c847c1aaecd9adbd2be9e30e14c1d214"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::einsum::parse_einsum_equation (cognitive 18): pyrefly_types::einsum::parse_einsum_equation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 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":"crates/pyrefly_types/src/einsum.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0169b0098720e975095001265f88bf2f8299b5f729f1260350a50a56b090933"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::einsum::evaluate_einsum (cognitive 18): pyrefly_types::einsum::evaluate_einsum has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (5 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/einsum.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffff10281ff717680d9a69e588eee226b69426994b5d91e25787df5e67fcd4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::resolve_attr_setters (cognitive 18): AnswersSolver::resolve_attr_setters has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 3 (6 pts), loops 3, 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3129d8617519d358d30a54d706b0e8e846281ffd04c86a61ed3795480fe0375"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::call_infer_inner (cognitive 18): AnswersSolver::call_infer_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/call.rs"},"region":{"startLine":2663}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cedbd808aab808c9340758aa1dba69804ef3e3a20d587676940d3de230346e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::as_class_attribute_inner (cognitive 18): AnswersSolver::as_class_attribute_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":4029}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d09657757f729db8c4606808a230172ac4e5822611acccd47a2178cf4e89da0"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::get_enum_class_field_type (cognitive 18): AnswersSolver::get_enum_class_field_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/enums.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d5882759a51a2b2c46f77ec66e48485adb3e40b10a6b7c3e7df7dcb586e3fa"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::pydantic_unchecked_annotation (cognitive 18): AnswersSolver::pydantic_unchecked_annotation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), loops 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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb4d968cc82adcfccb584d45c9edf7d9de89640cd4dbe84d2b1231c53d895e3"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_for_deprecated_call (cognitive 18): AnswersSolver::check_for_deprecated_call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, match/switch 3, loops 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, 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe24b9e4dec0f56dd7905583540b36989707ed00157ee5dfbed1568160650d26"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::dict_infer (cognitive 18): AnswersSolver::dict_infer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 pts), boolean chains 2, 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a489d0a0d57bb1e867d26f9ab77dbe94a43f0c709bf7479f6aeddb639794b0d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::binop_infer (cognitive 18): AnswersSolver::binop_infer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94f7a121d1e9404761fffe57fdf16382bda2de589a714fb738c2991e9b3cbd5"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::binding_to_type_info_assign_to_subscript (cognitive 18): AnswersSolver::binding_to_type_info_assign_to_subscript has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":6474}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc553480420fbc3c18f8e8059c9ad23f976c8fe9a594f8427992a865a28144f"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::untype_opt_with_context (cognitive 18): AnswersSolver::untype_opt_with_context has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7881}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d82474c2e0100894a11e9c4599c9bcfb31ca448bc71f86c9b71a3f2836fb7e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::resolve_type_shape_dsl_helpers (cognitive 18): AnswersSolver::resolve_type_shape_dsl_helpers has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 10). 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":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6efb0aa1e338f99aa81229cee628893ade4305cae5a74d1bb1e6b0b55d486e"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::insert_synthesized_fields (cognitive 18): BindingsBuilder::insert_synthesized_fields has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/class.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ac70f966ceeb942e13faf6529895ae559eb7f166445b26e3223456b2c8ef85"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::synthesize_typed_dict_def (cognitive 18): BindingsBuilder::synthesize_typed_dict_def has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/class.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"c087c06b0e94bf50f6e8ba792ea0a99ffb9598b33053abc2a784c283ef8c3d53"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::assign_type_var (cognitive 18): BindingsBuilder::assign_type_var has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"185f4bf7f559c8328682df33e852b0e5e68686e774b9e6be13c1fb3fa6bc2f77"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyErrors::write_json (cognitive 18): LegacyErrors::write_json has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (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":"pyrefly/lib/error/legacy.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6fb9870ea5dc2bc0948e5cdec3976d5a9b002fc28eb5b8bf4175d7ed947378"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::async_go_to_implementations (cognitive 18): Server::async_go_to_implementations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483c41f566c1c4ba6ce8f9a275410356d115574c61f649f9031c76199f7893c"}},{"ruleId":"D2","level":"warning","message":{"text":"Query::find_imports::collect_attribute_prefixes (cognitive 18): Query::find_imports::collect_attribute_prefixes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/query.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"a829e8ec947a5419833ee9b51f57f46ee2eecd1cfc07624c92401d0495eb8237"}},{"ruleId":"D2","level":"warning","message":{"text":"CallGraphVisitor::resolve_attribute_access (cognitive 18): CallGraphVisitor::resolve_attribute_access has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 2, 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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"239696ec6e99e6e0ea8f8e670e790d746d5eeb54198f546afd810a5ec1548bbf"}},{"ruleId":"D2","level":"warning","message":{"text":"CallGraphVisitor::resolve_and_register_call (cognitive 18): CallGraphVisitor::resolve_and_register_call has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 9 (11 pts), boolean chains 7 (nesting depth added 2). 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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b28d84375cd61d391a79c4b52fed96981d5b40505c990668f1b639e621e10b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleDeps::invalidated_by (cognitive 18): ModuleDeps::invalidated_by has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 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":"pyrefly/lib/state/state.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa6f5576bce117b304cbfeb594abf0a9e3b71d6c3d740e5939b9037259563e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::dict_key_string_literal_at (cognitive 18): Transaction::dict_key_string_literal_at has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 10). 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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4b8de7c2fb95b6688ef0d021c7e9d06b00f3828002e6d3d44fa68c2f661754"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::commands::coverage::collect::compute_public_fqns (cognitive 18): pyrefly::lib::commands::coverage::collect::compute_public_fqns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 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":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"280628949ea650e47583778872e711e31ca7d3234a06bcaf0db8b9aeaaa07925"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::inline_parameter::expand_range_to_remove_item (cognitive 18): pyrefly::lib::state::lsp::quick_fixes::inline_parameter::expand_range_to_remove_item has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (8 pts), boolean chains 6, 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":"pyrefly/lib/state/lsp/quick_fixes/inline_parameter.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb4f5958214560a9034b8f64a9826f9c37b172ba9ec3ec81c4cb49710c4c97e"}},{"ruleId":"D2","level":"warning","message":{"text":"conformance_output.diff_expected_errors (cognitive 18): conformance_output.diff_expected_errors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"conformance/conformance_output.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c544303ba4d9617d264427de3128fdf149940c18fc0a43de962afe66ef813e5"}},{"ruleId":"D2","level":"warning","message":{"text":"stub_coverage.collect (cognitive 18): stub_coverage.collect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, error handling 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/stub_coverage.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"220c8cefb9f7db926ddea64657b202c346c49bd1c6fd5ee1d9981623f3993d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_build::module_resolver::find_one_part (cognitive 17): pyrefly_build::module_resolver::find_one_part has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 1, loops 1 (nesting depth added 10). 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":"crates/pyrefly_build/src/module_resolver.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"fada57721c672c6e17a3a5b59d70d6d700d5d97dbc2476744fe03d65717a806a"}},{"ruleId":"D2","level":"warning","message":{"text":"Solutions::changed_exports::check_table (cognitive 17): Solutions::changed_exports::check_table has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/answers.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2e2306ec1af262b6309fdf53300ce970a0b97915d9df37fb3f24e422e1be54"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::completions_mro (cognitive 17): AnswersSolver::completions_mro has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), boolean chains 2, 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":3403}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cb0659eb34814d651a53a9170753fc1da1d71e3fdbbb8e5b203e4780e207c0"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::get_django_field_types_from_class (cognitive 17): AnswersSolver::get_django_field_types_from_class has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3 (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":"pyrefly/lib/alt/class/django.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"921cb306726cedaa7883bb8d7b3138c172298279319f15777bdfdbee9ceba306"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::expr_infer_argument (cognitive 17): AnswersSolver::expr_infer_argument has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67ce68f52c3a6534fa3b8fe5c2624e4b8f777d7acf6e53adeb13863e0a7d6a9"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::decorate_returned_callable (cognitive 17): AnswersSolver::decorate_returned_callable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, match/switch 3 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/function.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"981938f6c0217d8f40c072c62f80158a2e6e561237c901f4087da170cc379182"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::polars_csv_options (cognitive 17): AnswersSolver::polars_csv_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5ecdaa0769f5887163705d12d65d79a2e40cf7256a18d75ecc31b620a66d70"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::quantified_from_type_parameter (cognitive 17): AnswersSolver::quantified_from_type_parameter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8cdf0ea5381b4be60c86fe5baaa6abb58f6eef9a66893650eac445e136b20e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::solve_yield_from (cognitive 17): AnswersSolver::solve_yield_from has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (nesting depth added 6). 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7686}}}],"partialFingerprints":{"codehealthFindingId/v1":"c689bf252c4fba346abc6844656d234985b4f98cf6f60ca2aa3165708cbfe73d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_sqlalchemy_keyword_call (cognitive 17): AnswersSolver::check_sqlalchemy_keyword_call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/sqlalchemy.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdb48e98cd782f4e0b47f07f5db8af156e168e9890ac346723404070911b349"}},{"ruleId":"D2","level":"warning","message":{"text":"Linearization::new (cognitive 17): Linearization::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 3 (6 pts), loops 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":"pyrefly/lib/alt/types/class_metadata.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"785ef412c0dee5a3e1e0ec34615e4d46f27f91b7647bd963d1af1588dc5a2dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::finalize_bound_name (cognitive 17): BindingsBuilder::finalize_bound_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89e7340dbe96ff1f9c5670de8c825191c813352e46c182ab1e04b10786b4742"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::decorators (cognitive 17): BindingsBuilder::decorators has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, 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":"pyrefly/lib/binding/function.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda834992acd834d728fea4370ecbfea64ae2525280018cec05e71617c1f9687"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckArgs::prepare_cli_run (cognitive 17): CheckArgs::prepare_cli_run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 2 (3 pts), boolean chains 1 (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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"f241171d4bbfbe09a3e4f46ac061cdfef486b9468ee59abe2adc6a96cb371937"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::async_find_references_helper (cognitive 17): Server::async_find_references_helper has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5717}}}],"partialFingerprints":{"codehealthFindingId/v1":"885ea92d040b2208ed57ce960a881c5ff94d8ac33b24a6fb31360bc0a906e357"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::type_from_expression_at_impl (cognitive 17): Transaction::type_from_expression_at_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5020bacdafef9e29e11611e00de90b8d663aa98d539a7833d236dea4385092a"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::local_references_from_local_definition (cognitive 17): Transaction::local_references_from_local_definition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":4779}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74c0d0a21b53bac5fe693ffbb3b6e1328a4a38d011dce90bd0a209b7a342106"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::commands::coverage::collect::build_module_report (cognitive 17): pyrefly::lib::commands::coverage::collect::build_module_report has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (6 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":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"c984e5777431b467435403ea7b75208bb2957423731da62b14422ba7d27da564"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::lsp::non_wasm::convert_module_package::convert_module_package_code_actions (cognitive 17): pyrefly::lib::lsp::non_wasm::convert_module_package::convert_module_package_code_actions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/convert_module_package.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e65fd28b1740f9b74010c410026349d8e835cad3399cf4089a5b0fbd24e3dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::convert_dict::suggest_base_name (cognitive 17): pyrefly::lib::state::lsp::quick_fixes::convert_dict::suggest_base_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/convert_dict.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f7dd4af282b12ab8ce4769ed48fe30bae86382340b25d1c0ad2503b324f750"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::inline_variable::inline_variable_code_actions (cognitive 17): pyrefly::lib::state::lsp::quick_fixes::inline_variable::inline_variable_code_actions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1, 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, 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":"pyrefly/lib/state/lsp/quick_fixes/inline_variable.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2fd3c8d8aed3568b8192e5c1607bc0b4097e51cea550d39359c660c65303fd"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::semantic_tokens::collect_disabled_ranges_from_stmt (cognitive 17): pyrefly::lib::state::semantic_tokens::collect_disabled_ranges_from_stmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), boolean chains 2, 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":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e9e435fa18523940d39acce9abe3eaea59e0b2cd68b345c0acd1ab1bf619af"}},{"ruleId":"D2","level":"warning","message":{"text":"conformance_output.get_expected_errors (cognitive 17): conformance_output.get_expected_errors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"conformance/conformance_output.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bae74376c0f15061d5a6aabadc24c4adfe3ee3e8c8b759a8eb7abf18bcf1ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"code-lens.runTestAtLocation (cognitive 17): code-lens.runTestAtLocation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/code-lens.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"946b0b57c4d841cc6beadbdf06a52b782c411c94683db2dab2820844fea21fab"}},{"ruleId":"D2","level":"warning","message":{"text":"whyPyreflyGridItem.WhyPyreflyGridItem (cognitive 17): whyPyreflyGridItem.WhyPyreflyGridItem has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, ternaries 4, if/else 3. Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 86, handleClick, handleKeyDown). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/components/landing-page/whyPyreflyGridItem.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5598a6167ef8eab42b3e73bca99826b312fe1ea6872e6b0cc716a568f23dcedb"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_bundled::extract_files_from_archive (cognitive 16): pyrefly_bundled::extract_files_from_archive 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":"crates/pyrefly_bundled/src/lib.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"928672d65bcb69c8f5fc42f8535b706fffd03bb456a1f77168215cdd57c5996c"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::finalize_type_level_dsl_at_boundary (cognitive 16): Type::finalize_type_level_dsl_at_boundary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (7 pts), loops 1 (nesting depth added 6). None of this is in the body itself: all 16 points belong to 3 function items inside it that branch (force_nested, collect_errors, force_nested::force_call). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8440283c76d8d5beaac113ba4a36193d266accdb00e960b156590a47af58bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::shape_index::lower_integer_type (cognitive 16): pyrefly_types::shape_index::lower_integer_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 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, 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":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9566cab734168d26ad9f231c4482ba980f9c99436c4362aff131b0ba154319"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly_types::shape_index::lower_integer_tuple (cognitive 16): pyrefly_types::shape_index::lower_integer_tuple has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (9 pts), loops 2 (4 pts), if/else 2 (3 pts) (nesting depth added 7). 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":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a205d5b9c3fd7a41664fde303273d469237ea1ae485047952abb4b0f59392774"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::apply_getattr_fallback (cognitive 16): AnswersSolver::apply_getattr_fallback has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 4 (6 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c536e90bb1ba8bdf09f542179d94e41aa8c4987072067de373ff9f338a0b55de"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::get_inherited_type_and_annotation (cognitive 16): AnswersSolver::get_inherited_type_and_annotation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":3246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33341f8ca094e27a517baea70089f614cd0ca8739da0aa71fcfb54c1318b920"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::get_named_tuple_elements (cognitive 16): AnswersSolver::get_named_tuple_elements has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/named_tuple.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f889da25f21ba5e771bd84da7bcfa72a30344ea650caf9b25f95b9855b9f63"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::extract_root_model_inner_type (cognitive 16): AnswersSolver::extract_root_model_inner_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 7). 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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fca1bc8eaec109ff82052fffd72bc27aff17153fe822faec0bd4008a12dcd36"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::collect_pydantic_constraint_params (cognitive 16): AnswersSolver::collect_pydantic_constraint_params has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2075c3728ca8d5aff05303dff679b9ec27b30f286ec4dbe057a47c21f553857"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::emit_pydantic_argument_constraint (cognitive 16): AnswersSolver::emit_pydantic_argument_constraint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"54803f70f3e6bce77bd9dab3f08848fe20d3d16e531d773da54f40973abe543e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::sentinel_from_call (cognitive 16): AnswersSolver::sentinel_from_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":3188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8804295be290fca8520d7cdaffe58b07f9ec76516d0f2699dd6b2b08c95d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::get_requiredness (cognitive 16): AnswersSolver::get_requiredness has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 7). 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b18cb144594795154d50033c36eafa4887bb493ce4878910f6fba9b72cdefe0"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::try_binop_calls (cognitive 16): AnswersSolver::try_binop_calls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"14562436114120d9a50ac8d1a986fec5d03c98613f3bcb19412087e20e471420"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswersSolver::check_bool_type_and_get_value (cognitive 16): AnswersSolver::check_bool_type_and_get_value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d0be1a3f102932ec33e0484d85e0fcb7f442d5a4af71b76c302028b0d210cb"}},{"ruleId":"D2","level":"warning","message":{"text":"AttrSubsetError::to_error_msg (cognitive 16): AttrSubsetError::to_error_msg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb1c03be48d52608a0f0d43448c0e2a0a0cddcf532019252aa0ae302f51fe0d"}},{"ruleId":"D2","level":"warning","message":{"text":"CallArgPreEval::post_check (cognitive 16): CallArgPreEval::post_check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c061ce3b002b1e7158e35b540a24d74ecabe7ab23fd2ecf6aebc51be5426708"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::bind_docstring_param_types (cognitive 16): BindingsBuilder::bind_docstring_param_types has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/function.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70d18f2d16e2604809b438d5b5c5545c4ac124fe1e09975f4d7c8cdd3136ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"Static::stmts (cognitive 16): Static::stmts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (5 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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"02aa1dc8fa4bc72433552c0630d1c91c1c9575c62916702c67ebe480883ab8c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeComments::new (cognitive 16): ShapeComments::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2, 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":"pyrefly/lib/binding/shape_comments.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c800199e4bafc54f5a9c25bf462f10cbd60d42267bd3d75d06c0326e42ac6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorBuilder::with_error_details (cognitive 16): ErrorBuilder::with_error_details has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), 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":"pyrefly/lib/error/collector.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3ba10c04cd5f182d767bb677ee47a1527b4869ced7e6574d616667ec38bdc7"}},{"ruleId":"D2","level":"warning","message":{"text":"Expectation::parse (cognitive 16): Expectation::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 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":"pyrefly/lib/error/expectation.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e7c7689fc63184b7d0f5ac2bc6e68a1a6174f5e2358bb2cbbc83bfdc8eca28"}},{"ruleId":"D2","level":"warning","message":{"text":"DefinitionsBuilder::resolve_module_entries (cognitive 16): DefinitionsBuilder::resolve_module_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 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":"pyrefly/lib/export/definitions.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78c875fa96d01d8b00508454082a02e628a9a10d7dbe1ab53ca0ed33d09122a"}},{"ruleId":"D2","level":"warning","message":{"text":"Exports::wildcard (cognitive 16): Exports::wildcard has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/export/exports.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efb7958d17390925ac1066a4a13feb12a446abc8c591b4967fb582b87268546"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::setup_file_watcher_if_necessary (cognitive 16): Server::setup_file_watcher_if_necessary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":6709}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff32f330d0ef80df51c2e7a2221019d9392c066a4dd20879be885977ec4908c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Workspaces::update_workspace_config (cognitive 16): Workspaces::update_workspace_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a262fe0d07e5c6b8412f50aca0c1a20ad8c13c6894a662b298ab89435dc6cd7"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver::build_overload_rows (cognitive 16): Solver::build_overload_rows 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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c920932e7a3626257cf7f5ad34dc47230c8c25405ed374d66fc7a6554aaa1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver::prune_one_argument (cognitive 16): Solver::prune_one_argument has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f56d89c947f2b202447da4e8fee0aa70bb239651edc2876484a1151053f8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::invalidate_config (cognitive 16): Transaction::invalidate_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 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":"pyrefly/lib/state/state.rs"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc507a10aa2cc688d7f4218639ecb8bcbd7f4e0bed296e9489ba82fbbad51453"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::alt::class::variance_inference::on_class (cognitive 16): pyrefly::lib::alt::class::variance_inference::on_class has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/variance_inference.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c51cae1698e6d91ff528eb0a1aa53832456334e0f83847e9b117c7b2d7c6542"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::lsp::non_wasm::server::initialize_start (cognitive 16): pyrefly::lib::lsp::non_wasm::server::initialize_start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce9f666e7bf7bbdccc2e68f8c83901e41d5b2e730ba415f20cee1743758af8f"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::lsp::wasm::completion::assign_sort_text (cognitive 16): pyrefly::lib::lsp::wasm::completion::assign_sort_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"eceb1d0446e173af65f8915b0b92ed6b4d29b70ea830da75a48239875dffcda1"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::inline_variable::find_simple_assignment::find_in_stmts (cognitive 16): pyrefly::lib::state::lsp::quick_fixes::inline_variable::find_simple_assignment::find_in_stmts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/inline_variable.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c22465a387c0979dc45160668a3957d977f93be82035bd5f9a1dab3bd29694e"}},{"ruleId":"D2","level":"warning","message":{"text":"pyrefly::lib::state::lsp::quick_fixes::introduce_parameter::build_parameter_insertion (cognitive 16): pyrefly::lib::state::lsp::quick_fixes::introduce_parameter::build_parameter_insertion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 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":"pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9960c7ddba9a2ce5fa03a123eb90933572dfa1097c8a2ac6d5580f90ff9f46"}},{"ruleId":"D2","level":"warning","message":{"text":"view_types.format_type (cognitive 16): view_types.format_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 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":"pyrefly/lib/report/cinderx/view_types.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cf96061d381c1bf37dcbf03d8c9adec2e88b171cef6bb95bcf3e08ddfedf78"}},{"ruleId":"D2","level":"warning","message":{"text":"stub_coverage.stub_exports (cognitive 16): stub_coverage.stub_exports has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 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":"tensor-shapes/stub_coverage.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"579be07110d4dd4e195a7836d54fd50fc045b70b56424dbd5af9245fa7831c69"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnswersSolver: TooManyMethods \u2014 1285 methods, declared across 53 files: alt/solve.rs (163), alt/answers_solver.rs (100), class/class_field.rs (100), alt/expr.rs (98), \u002B49 more file(s). The bar is 30 methods; this is 1255 over it, 42.83\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07602d4381f2a4a5fbb59d51492633828c6ae86e0f0e2abc661e5771b4de76f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_level_dsl.rs: FileTooLong \u2014 6205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 5705 over it, 12.41\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b03e86b74bf2d79ba61dc3ae584e8afd4f52908b582502d4c8377b44b5c890"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/solve.rs: FileTooLong \u2014 5748 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: AnswersSolver (397-8514). The bar is 500 significant lines; this is 5248 over it, 11.50\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0949b5e6eb8127746e195a46d781924ee2dba8f11f90a1a1959427878d50c2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Transaction: TooManyMethods \u2014 318 methods, declared across 14 files: state/lsp.rs (130), state/state.rs (90), lsp/dict_completions.rs (32), wasm/completion.rs (23), \u002B10 more file(s). The bar is 30 methods; this is 288 over it, 10.60\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/state.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"142f80c374bdb3d43f2a1f404dcf0413617ee89d5cfc237dc9b47f8bccaba35d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: non_wasm/server.rs: FileTooLong \u2014 5214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: Server (3 blocks, 1156-7771). The bar is 500 significant lines; this is 4714 over it, 10.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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f5bc93d29de14c91427157a13fbce1cbee2a5feaf3041c52a7130991c19efc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Server: ClassTooLong \u2014 4132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 110 methods, 3 blocks, lines 1156-7771. The bar is 400 significant lines; this is 3732 over it, 10.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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f252ecb5410a08721de8566cdbc7842b72ee38773a486ae3efbec9128a06958"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingsBuilder.stmt_impl: MethodTooLong \u2014 stmt_impl runs 1013 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 913 over it, 10.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":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfb5c228c3f2fd77413fe8047315f3873e5395a9585cdefdc61745ab6b11c5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class/class_field.rs: FileTooLong \u2014 4697 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: AnswersSolver (1588-6959). The bar is 500 significant lines; this is 4197 over it, 9.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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9eded12c2cec991d250e9c91dae1fc5653d0cc595aae27cc81a694e0654ab9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/lsp.rs: FileTooLong \u2014 4215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: Transaction (3 blocks, 853-6030). The bar is 500 significant lines; this is 3715 over it, 8.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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9ff12986f7aa37ed3d0e783194d6ff383a225cf578bea9bcd891453880878a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BindingsBuilder: TooManyMethods \u2014 243 methods, declared across 14 files: binding/bindings.rs (86), binding/class.rs (24), binding/stmt.rs (24), binding/expr.rs (21), \u002B10 more file(s). The bar is 30 methods; this is 213 over it, 8.10\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8d8ca655444a9f65783bbf82b0fd47a7499587336ae72868c666d67dc6dcf7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.callable_infer_params: MethodTooLong \u2014 callable_infer_params runs 792 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 692 over it, 7.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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f892c5162bfd6b8cda4506c8363414c078dd5f9ac9cf8fc30f1240839b44111f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/expr.rs: FileTooLong \u2014 3808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: AnswersSolver (449-5368). The bar is 500 significant lines; this is 3308 over it, 7.62\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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bec2daeec1adb90d56582a748e06918ee906c91dec0e1e94dd8a0c0efd557a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.calculate_class_field: MethodTooLong \u2014 calculate_class_field runs 755 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 655 over it, 7.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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd84de9bac344e0f2b9c7e13239e68f63a91da091a58f25b0e111fb9a193bca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Subset.is_subset_eq_no_recursive_check: MethodTooLong \u2014 is_subset_eq_no_recursive_check runs 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 612 over it, 7.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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b99536bb7effe9e698df7f15354555842bd8cdc757db31eee6f2c4366f5ce70"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StructurallyValidatedTypeShapeDslFunction.evaluate_expression: MethodTooLong \u2014 evaluate_expression runs 708 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 608 over it, 7.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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6986}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a03523e212a65418537a2e56ed6c049862e6252dd72e9e19b7024748f47b6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.process_event: MethodTooLong \u2014 process_event runs 644 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 544 over it, 6.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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e633cdd942efb9110f72fffc15a8f413f135d4599346f70b0ca0725f7e1fc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binding/scope.rs: FileTooLong \u2014 3136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2636 over it, 6.27\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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bb0fdb12f4d944b43eb13782386e7218335be9e40ac1eeeba3d149347a2ed9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeDisplayContext.fmt_helper_generic: MethodTooLong \u2014 fmt_helper_generic runs 610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 510 over it, 6.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":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"5461dde174330f617bf68ce53aae77b54f33bc1fea66ad7eb9084b05937742fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pysa/call_graph.rs: FileTooLong \u2014 3035 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: CallGraphVisitor (3 blocks, 1501-4480). The bar is 500 significant lines; this is 2535 over it, 6.07\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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7f13ef6ba59736ec9fefd0c295507427efe397c23498ebd8f4193362d4871f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/call.rs: FileTooLong \u2014 2858 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: AnswersSolver (315-3821). The bar is 500 significant lines; this is 2358 over it, 5.72\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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c8effd4d027a7a4f40bf159366699f3a4a1445dc70495f84a57f66baf2a4f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solver/solver.rs: FileTooLong \u2014 2760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2260 over it, 5.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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76aea03e3e4ce1e6bf8b43e3122edd4692cd1922143816d848f6049ede325355"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.subscript_infer_for_type_with_key_present_inner: MethodTooLong \u2014 subscript_infer_for_type_with_key_present_inner runs 537 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 437 over it, 5.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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f774cf0ca8fb7ebbb7d08cf470fc62349643b911129981bda001380861e09c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/polars_specials.rs: FileTooLong \u2014 2661 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: AnswersSolver (1157-3809), declaring 38 free functions. The bar is 500 significant lines; this is 2161 over it, 5.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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af36517378b54c4606ce2bc9cb0079def99b059db85e017c6e24b77e8ad44c36"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.validate_type_shape_dsl_declaration: MethodTooLong \u2014 validate_type_shape_dsl_declaration runs 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 432 over it, 5.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":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c906e6a18c94a141ff512cad72a930781b74e2d5ae4b900cf6082197dd2c3ff2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scopes: TooManyMethods \u2014 156 methods. The bar is 30 methods; this is 126 over it, 5.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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54df94bddd5dafe250ad7d605171647168495e06697a8d6874eb8393a79e09e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CallGraphVisitor: ClassTooLong \u2014 2044 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 48 methods, 3 blocks, lines 1501-4480. The bar is 400 significant lines; this is 1644 over it, 5.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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a002f08ceaf8b2a27ce0389c7952022448009b0d4b1d3aac4161d914929803fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/attr.rs: FileTooLong \u2014 2519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: AnswersSolver (2 blocks, 632-3817). The bar is 500 significant lines; this is 2019 over it, 5.04\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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bd30bbb2870297ec1c7926cb4c9fbc5cf10c9954f506e5fbceb2fde4e2bcf6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binding/binding.rs: FileTooLong \u2014 2447 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1947 over it, 4.89\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":"pyrefly/lib/binding/binding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c60d206aaddaadeb358f26350f45968af7fad59a592770a1c01efbaba29bc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/state.rs: FileTooLong \u2014 2444 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1944 over it, 4.89\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":"pyrefly/lib/state/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f0e10957da7988fb068e65c24a142b6d24773dd97d487709a765ccdbae87fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binding/bindings.rs: FileTooLong \u2014 2329 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1829 over it, 4.66\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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17168a3664c33202fd46171b13d84b268a2fd476eba426690c7f9566fbd5e969"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/answers_solver.rs: FileTooLong \u2014 2310 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1810 over it, 4.62\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":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa8517dcd5b1e4f3a47031859fef33712b9b751c6d6e6d8276152cc06eab679"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingsBuilder.bind_pattern: MethodTooLong \u2014 bind_pattern runs 450 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 350 over it, 4.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/pattern.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b2d798d53f53fc547a94c897a035f219866696215e5b1b5629207fc4ad910f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/function.rs: FileTooLong \u2014 2239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: AnswersSolver (304-3223). The bar is 500 significant lines; this is 1739 over it, 4.48\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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"140619240a93cbc59298246feea2def05f8d8dc3b5f388f63661928c8e0adeec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solver/subset.rs: FileTooLong \u2014 2229 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: Subset (208-3385). The bar is 500 significant lines; this is 1729 over it, 4.46\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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"418ee2dfe0e38a2ea9f480741fd9519801b4100ced1c81fc5a651d41d49291c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Type: TooManyMethods \u2014 127 methods, declared across 3 files: src/types.rs (114), src/boundary.rs (9), src/display.rs (4). The bar is 30 methods; this is 97 over it, 4.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"157b076abf7603812947bd74bc19ac54370fdb298db49a8a0ce913b740362329"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/narrow.rs: FileTooLong \u2014 2005 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: AnswersSolver (125-2998). The bar is 500 significant lines; this is 1505 over it, 4.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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39321983c025c7036a3279f223dfaf269f11ff5def692acc9db345aa154723ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.expr_infer_impl_helper: MethodTooLong \u2014 expr_infer_impl_helper runs 389 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 289 over it, 3.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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e3d8a9fc588dd380ac4b4824deb0c4d1a3645a02744de24a8a0ec276317b9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/callable.rs: FileTooLong \u2014 1942 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: AnswersSolver (1013-2797). The bar is 500 significant lines; this is 1442 over it, 3.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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1a508dbbd8e86bde411b3e5dcb8c83273e23afac1dffb32cc39f2f91b820b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.is_class_attribute_subset: MethodTooLong \u2014 is_class_attribute_subset runs 382 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 282 over it, 3.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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6209}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca680388c0c06c661c7a1fdea2a136ed3363388a9f5faec56d820b1b735feab"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Scopes: ClassTooLong \u2014 1515 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 156 methods, 2 blocks, lines 1787-4447. The bar is 400 significant lines; this is 1115 over it, 3.79\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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba6624c9689698f9ae50339bf4fa41ca188edb609ca4047fb899ef6657e7265"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.as_call_target_impl: MethodTooLong \u2014 as_call_target_impl runs 369 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 269 over it, 3.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/call.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"27af1e7863dce0204afa4276a7e4da0037cb293afdb4c7b998c93a8cbaf73bc0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StructurallyValidatedTypeShapeDslFunction: ClassTooLong \u2014 1473 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 8 blocks, lines 929-8573. The bar is 400 significant lines; this is 1073 over it, 3.68\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7ca021e79acc7557ca142e3478d9edf5881a0934eaf8daa3e82f16bdeb8669"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Server: TooManyMethods \u2014 110 methods. The bar is 30 methods; this is 80 over it, 3.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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb037a9b83aabc5c764e50f21dd3a62ebf9cc58056d36bc9ee081d2dcbaefce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/check.rs: FileTooLong \u2014 1830 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 1330 over it, 3.66\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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f9b88f6470170a29b7f2fda03dde82cb1d2a6d98a6de994f6ca8ff1da5b046"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.atomic_narrow: MethodTooLong \u2014 atomic_narrow runs 363 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 263 over it, 3.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe15db19677a62b0b98f8812a3e00897590107247b0c40f89ff55580ca622315"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DslValidator.validate_condition: MethodTooLong \u2014 validate_condition runs 357 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":4652}}}],"partialFingerprints":{"codehealthFindingId/v1":"c069db64579cdff795fc3cc41c0d7f6ec549dc1efeb527833d0889698ca61c58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.check_consistent_override_for_field: MethodTooLong \u2014 check_consistent_override_for_field runs 357 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":4468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b90cf51bd7eb2ae0916fbae10e5e9e6fb0a32071bd2ceb0100fc5369dc47336"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Solver: ClassTooLong \u2014 1394 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 80 methods, 3 blocks, lines 580-2798. The bar is 400 significant lines; this is 994 over it, 3.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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4291fd63df3b8ee1a10fb2ed653154912cb9db5ac683cbff5c0e1f255dbcf542"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BindingsBuilder: ClassTooLong \u2014 1370 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 243 methods, 5 blocks, lines 526-3879. The bar is 400 significant lines; this is 970 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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fa095fa92b23fc8f6281277d9ac02f08e701e7f69780159fea53c70e043f7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class/class_metadata.rs: FileTooLong \u2014 1707 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: AnswersSolver (149-2448). The bar is 500 significant lines; this is 1207 over it, 3.41\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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f3656b3fc9971bad846bba10e08f058c5a7d2a40338390048c46913c42fbae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binding/stmt.rs: FileTooLong \u2014 1695 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: BindingsBuilder (259-2586). The bar is 500 significant lines; this is 1195 over it, 3.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":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"763061055ed90f7a98dc60b990d151e95d0debe1f661a7252f50096e7a3af48e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.find_definition: MethodTooLong \u2014 find_definition runs 339 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 239 over it, 3.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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":3076}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fece7720c794dba67b8610d1924e6dc10eb5b7a6c60eb872d83167be0d7ede"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CheckArgs.finish_cli_run: MethodTooLong \u2014 finish_cli_run runs 332 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 232 over it, 3.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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7c1a4b2ff4483da4f9d646ddb9d19982dfb003707d8a1222eeb5759fc244d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.solve_expectation: MethodTooLong \u2014 solve_expectation runs 331 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 231 over it, 3.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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca888c720f4a1ea92914245c4847905656b43915c1edde85acbc5b743398bcb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefinitionsBuilder.stmt: MethodTooLong \u2014 stmt runs 329 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 229 over it, 3.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":"pyrefly/lib/export/definitions.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf4ad1d2d13065bd7138457fb798d993e01e9bd3cee62c5afec0a0de62b803e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StructurallyValidatedTypeShapeDslFunction.evaluate_condition: MethodTooLong \u2014 evaluate_condition runs 327 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0fdd246d7b9d998d35e44999c96ca32446309022aff6b174f7fe91814274d9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Transaction: ClassTooLong \u2014 1285 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 318 methods, 2 blocks, lines 760-2871. The bar is 400 significant lines; this is 885 over it, 3.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":"pyrefly/lib/state/state.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c9c1c030418b8296a9b61d5503edf904173dfd314f853ffdb01f3f9a621af3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Subset.is_subset_eq_var: MethodTooLong \u2014 is_subset_eq_var runs 318 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 218 over it, 3.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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"42218e8baf95ff5dd3c5991c391b1e2bc93319d2bb8423632328ed8ce490f075"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingsBuilder.ensure_expr: MethodTooLong \u2014 ensure_expr runs 311 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dfb9bb9bbb85942a90a4d2be7cc19d889b2f72ab164aa7c5314f9c884daf56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 1554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: Type (4 blocks, 862-2628). The bar is 500 significant lines; this is 1054 over it, 3.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9869f0d714e308f5c6d1e11cc7eb48f4f1cf462fa9510e1bf0d47f34af19f716"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingsBuilder.class_def_inner: MethodTooLong \u2014 class_def_inner runs 308 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 208 over it, 3.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":"pyrefly/lib/binding/class.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3f5fcf4c519a01e97a46880a2378797dfbabbc1fabcf2a18287cb0a6f5a158"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.call_infer_with_callee_range: MethodTooLong \u2014 call_infer_with_callee_range runs 304 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 204 over it, 3.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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82a782f05e36f4ac3f7b7c5d6bfd7c92d4d35e05ce99ef534e0dac2a7137ad1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.class_metadata_of: MethodTooLong \u2014 class_metadata_of runs 301 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 201 over it, 3.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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7a3dfa22138994f2390e746947e182203938d5494400b7708d53df6f0d4ed8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.completion_sorted_opt_with_incomplete: MethodTooLong \u2014 completion_sorted_opt_with_incomplete runs 301 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 201 over it, 3.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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e049d33ad07bc8b83d1a8681ba95b854db14f1e1d1d92270e518ff4f8f71f8f2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnswersSolver: ClassTooLong \u2014 1196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1285 methods, 3 blocks, lines 2166-4325. The bar is 400 significant lines; this is 796 over it, 2.99\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":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d13f2e7968bd2191c6ca87cdc72deecd7f2f37d54a646cf47048a867aa297e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 1484 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: ConfigFile (5 blocks, 611-2505). The bar is 500 significant lines; this is 984 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":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea3ec59990f62672cf4f6abd52348ac89aa8d6cce2f69da44298729d0245b39"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeDisplayContext: ClassTooLong \u2014 1169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 2 blocks, lines 166-1847. The bar is 400 significant lines; this is 769 over it, 2.92\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":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f5f4e429285d157265967be27167d0326b025e8a5cd4808eb9adfea84e469e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.expr_call_infer: MethodTooLong \u2014 expr_call_infer runs 289 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 189 over it, 2.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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66d58d343851888fcecb00564a59eb3c9197867747b325071e0007dfaf7fb0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.binding_to_type: MethodTooLong \u2014 binding_to_type runs 282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 182 over it, 2.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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ddc3a976e68ef9e3e351a54a19cda6407208020cbdfd4bca85f6e0fd107717"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binding.fmt: MethodTooLong \u2014 fmt runs 281 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 181 over it, 2.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/binding.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"395452a32ecf90beaa18c27db4f58a5ac258508ad5cfe6d3cea3257905d5f822"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/object_model.rs: FileTooLong \u2014 1397 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 897 over it, 2.79\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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bccf1758cd21d2eb002b7f30e52cede35a558dbab642674994b0b626016ebe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Stdlib: TooManyMethods \u2014 83 methods. The bar is 30 methods; this is 53 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":"crates/pyrefly_types/src/stdlib.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23b3997d42af36cd7ec92313fc4f254435ba4895c9483f639d802f8b239b164"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.call_functools_partial: MethodTooLong \u2014 call_functools_partial runs 272 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 172 over it, 2.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/functools.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7059517322c4c52c8ac93dca6f52b43af144c4c237d6e227f8e07342590b7ed1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Solver: 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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a7daf340f26f5d6c304dad55e2224df304e10eeaadb8dd648a597f339a4f08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/display.rs: FileTooLong \u2014 1332 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: TypeDisplayContext (2 blocks, 166-1847). The bar is 500 significant lines; this is 832 over it, 2.66\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":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb703ce042f1f255859eb5c66dbc773144ab59d125d445ee0975c0b22a874d40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::lsp::wasm::hover::keyword_documentation: FunctionTooLong \u2014 pyrefly::lib::lsp::wasm::hover::keyword_documentation runs 264 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 164 over it, 2.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":"pyrefly/lib/lsp/wasm/hover.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"5baeb99bed2873ab889660d33837fcfdd5a25d2276abdac682e2beb3c3c2634b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Type: ClassTooLong \u2014 1036 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 127 methods, 4 blocks, lines 862-2628. The bar is 400 significant lines; this is 636 over it, 2.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":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd2da053468eae1252b5501df4f091a78414f3d38c8fa5bf264f5d5b1380914"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Subset.is_subset_param_list_impl: MethodTooLong \u2014 is_subset_param_list_impl runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da73c3e2d591f88ee9a85941b5422c2f0ae0159c08121a02094565a4c4c4204"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wasm/hover.rs: FileTooLong \u2014 1287 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 787 over it, 2.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/hover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ed717bcc1884fd3554cca84a8a31f7a3eab370e5bd1091e1a5eea50aeb3c0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DslValidator.validate_return: MethodTooLong \u2014 validate_return runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":5137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efae1bce31b939f37226569821c4baae926470c11489067a2f2dfdd4b443d55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/query.rs: FileTooLong \u2014 1257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 757 over it, 2.51\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":"pyrefly/lib/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec192594bed00d0042082095dbf86d92b99649c333e0d282b08efa847e68efc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.lookup_attr_static1: MethodTooLong \u2014 lookup_attr_static1 runs 251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"d584697ff32752a6cd0928ecad3d111cc5af09b5f9c886e2d9b0097a20ea6716"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NarrowOps.from_expr_helper: MethodTooLong \u2014 from_expr_helper runs 245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 145 over it, 2.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":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bb381fc54e37eb3e9e6e0ec3358c34522c7062411c8635295ed61dc85333e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binding/class.rs: FileTooLong \u2014 1219 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: BindingsBuilder (124-1709). The bar is 500 significant lines; this is 719 over it, 2.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf047544be5020eb1e36ab5df78fe9849210d51eeeb7c800c841033587b52fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: extension.activate: FunctionTooLong \u2014 activate 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":"lsp/src/extension.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d428d1279bbcf34447a1a6bfed1d9b6e4ee01530def8186cf95a339625b13e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::error::suppress::update_suppressions_in_files: FunctionTooLong \u2014 pyrefly::lib::error::suppress::update_suppressions_in_files runs 239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/error/suppress.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53804fd1f17b57eec34084269bb16b6be0701137389ba751f37ad1a30d888ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.code_action: MethodTooLong \u2014 code_action runs 239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5268}}}],"partialFingerprints":{"codehealthFindingId/v1":"550691f78f1f2647a1b1ca017a6188bacb01aa683e00ef89c30613293d886cc6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConfigFile: ClassTooLong \u2014 955 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 59 methods, 5 blocks, lines 611-2505. The bar is 400 significant lines; this is 555 over it, 2.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":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4572b272333e810350cc903425466b29407b903a92de6febcc556041bd992d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/answers.rs: FileTooLong \u2014 1182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 682 over it, 2.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/answers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce6c9454210226ac2772727d7f7eefa4fa8638104aae1a3a78e6c60df7e7f67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wasm/completion.rs: FileTooLong \u2014 1157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: Transaction (213-1668). The bar is 500 significant lines; this is 657 over it, 2.31\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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fb1a747fb38206d5ecada93bf5d5f9639fe304cae9e33303d562cfa7cb2c6a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.construct_class_inner: MethodTooLong \u2014 construct_class_inner runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaaab87c65a01a8471caf3168561d3ae9d1e88b18304994adb7e16088ea8fb4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.undecorated_function: MethodTooLong \u2014 undecorated_function runs 229 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 129 over it, 2.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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2e93dcc89c83f3f177e28f2d9d723659b20393153945e4b5ee86e917e13a6b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.apply_special_form: MethodTooLong \u2014 apply_special_form runs 229 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 129 over it, 2.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":"pyrefly/lib/alt/specials.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cb17a1380f8425b669c57e7cf077e52f9b0eaa04a22527a5bda121fe496e62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binding/narrow.rs: FileTooLong \u2014 1125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 625 over it, 2.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"954e2b425762fc38cd5ca2c231f81a3e431f4ca85c173643292ea7f6cb5eb27d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.local_quickfix_code_actions_sorted: MethodTooLong \u2014 local_quickfix_code_actions_sorted runs 225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 125 over it, 2.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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":3803}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b6a77e5f92d7822082220e5fcc33169176001968876eefe7652448c45a0314"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/type_level_dsl.rs: FileTooLong \u2014 1110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: AnswersSolver (177-1422). The bar is 500 significant lines; this is 610 over it, 2.22\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":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0060f6e055201cf7f70593e7655f2fb1a6011af25c27d268aad81e4de61dffd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Stdlib: TooManyFields \u2014 66 stored fields beside 83 methods. The bar is 30 stored fields; this is 36 over it, 2.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/stdlib.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b34b08afb57e3fb5f68dcb6b317eb74da7e40dc8159391f25d9772b05b4148"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::report::cinderx::convert::type_to_structured: FunctionTooLong \u2014 pyrefly::lib::report::cinderx::convert::type_to_structured runs 217 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/report/cinderx/convert.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d63db26034e02d5d4033b2592b59c6d75a56154178bbc119659bbf868559e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class/dataclass.rs: FileTooLong \u2014 1083 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: AnswersSolver (84-1567). The bar is 500 significant lines; this is 583 over it, 2.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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"539f1064d0e4f122296d22b7f7b6ae09387bfc771e918bcf296be59810619295"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binding/expr.rs: FileTooLong \u2014 1077 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: BindingsBuilder (352-1663). The bar is 500 significant lines; this is 577 over it, 2.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":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff039add95ab7cb05c1882289acb2e3b94035d3ae8aee0f3a233bf8ea203350"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TestClient: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed34fa4a87e1195e950cc9fe8c8672d48fb5ddd4768497592811a8be9ae80ad2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeHeap: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/heap.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac64f1b7c35d6d5728b24424fba07262bfc1c1547aed4a207ffaff290c5e405"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binding/function.rs: FileTooLong \u2014 1057 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 557 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ed19d1ee4a1314f415e428988d64f24343c2a1cde40381ad13cbcf7beb16f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.decorated_function_type: MethodTooLong \u2014 decorated_function_type runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28819418f47020f3efa65b37f0dd56356b5b35b3b591acb602dd7e7f4bf7095"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.callable_infer_inner: MethodTooLong \u2014 callable_infer_inner runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dddec4d8643e8599362aa26037a38c8b488b89cba454592d6cbfdd9895af91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/operators.rs: FileTooLong \u2014 1044 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 544 over it, 2.09\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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"813b3b266be8ddd815e6e3fe759f651ab08c73e4dd7fa3e1b6bdbf422ab8d2e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.get_params_and_paramspec: MethodTooLong \u2014 get_params_and_paramspec runs 208 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c6e28f30bb57f6247665be7e920072dfbf2311c0e1bb8d0d21b2fc4f02363a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.call_overloads: MethodTooLong \u2014 call_overloads runs 206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe822403c860b4b475d49c8c60c321c45a18641dfbcef1e2e4e19c4089dc4194"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class/django.rs: FileTooLong \u2014 1026 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: AnswersSolver (134-1501). The bar is 500 significant lines; this is 526 over it, 2.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":"pyrefly/lib/alt/class/django.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5749382f9849a48be2b10c9f8fb44b94f683cba479278da14f136e93b16db15d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingsBuilder.ensure_type_impl: MethodTooLong \u2014 ensure_type_impl runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a616ccbb595e3cfd084d8a4e709eabe0cca41ebbaadf01eaf4d4033ca64f3c6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RuleOverrides: TooManyFields \u2014 61 stored fields beside 1 method. The bar is 30 stored fields; this is 31 over it, 2.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/pyright.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8c6f07d5ab39a36e3dceb033e4fabbe6efd3fcad608489efd6569df24528e6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.parse_dimension_expr_with_context: MethodTooLong \u2014 parse_dimension_expr_with_context runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"319d0dfef49b1bb8aa0e628fa0e0f84f53ab757f6e579716de9e83bc15c0164f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.as_attribute_base1: MethodTooLong \u2014 as_attribute_base1 runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d4d586b6e6b9f845903eeb234896575f2da74eeab9ff11de0726e7a79fa9da"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConfigFile: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 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":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff73135a6069af63ed4c87dd78fa88557b6ded5290f2e920395f75f622aa4f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Subset: TooManyMethods \u2014 59 methods, declared across 2 files: solver/subset.rs (42), solver/solver.rs (17). The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3458}}}],"partialFingerprints":{"codehealthFindingId/v1":"1246de86477a3598149c016bf78ac99ac67e17452e481ec620189ee934a1adc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::report::pysa::ast_visitor::visit_statement: FunctionTooLong \u2014 pyrefly::lib::report::pysa::ast_visitor::visit_statement runs 195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/report/pysa/ast_visitor.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfd7ed7abb0fcdd44ba8fc4ab1ee59ce2ff790b0579f0bf08094a180acaa503"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class/pydantic.rs: FileTooLong \u2014 938 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: AnswersSolver (121-1339). The bar is 500 significant lines; this is 438 over it, 1.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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4e79ac1c8f49172075e082a7e22896f56bcb294a61f061df2b55009c9b63f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuleOverrides.to_config: MethodTooLong \u2014 to_config runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/pyrefly_config/src/migration/pyright.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"537f67db58f9c830a892130cd8127b5a20856ab6452260007f0a76bbaaf5168b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::query::type_table::type_to_indexed_shape: FunctionTooLong \u2014 pyrefly::lib::query::type_table::type_to_indexed_shape runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/query/type_table.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8680f76adf44a3a2a9c6eec64a44825a2fe924b4f8a8a9a8426e818b42df31"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ModuleName: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_python/src/module_name.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00f458a66d2d31fff6d0a25ca77703c22ffaf6d5f9e0f68aba164911997ca6b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.narrow: MethodTooLong \u2014 narrow runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"341b9598e4b62f5dfc14a9e0f1ab2844a36178ec4621b94fcee3a0c1548b6ba1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Bindings.new: MethodTooLong \u2014 new runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7c5d543efcd9c3d19585a79379460470b604a890d98d9e2bf7306be6a3c95b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TestClient: ClassTooLong \u2014 724 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 64 methods, 2 blocks, lines 271-1330. The bar is 400 significant lines; this is 324 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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff09e5271ac41c3d65fcf4ea06c27ef86141d5ab4b910d702a2a4eaaf321ef5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dimension.rs: FileTooLong \u2014 899 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 54 free functions. The bar is 500 significant lines; this is 399 over it, 1.80\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":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4336fe7f8489392ab60ef9d7aa3def36ac7d1454c8dc2789f27f20392c72c042"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.call_intersection: MethodTooLong \u2014 call_intersection runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2200322dc3207c32865cb313e2a2c9ba336c96fe0c87e47a4d8f38459b11846e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeCheckKind.format_error: MethodTooLong \u2014 format_error runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.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":"pyrefly/lib/error/display.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0e87ee71a279d946a2353a0e969266dadcd8c3d3e5126ce6ff8e4e6f1cf669"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/overload.rs: FileTooLong \u2014 874 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: AnswersSolver (274-1231). The bar is 500 significant lines; this is 374 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":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d35653b898d99f3b096aa6b36ed3a2b76db8f4a2e24d9bc9749b95e0483d4f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/shaped_array.rs: FileTooLong \u2014 871 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 371 over it, 1.74\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":"crates/pyrefly_types/src/shaped_array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2911bd3416c7658516e32f4effa842af554f4695491f698d840506df4086ae4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingsBuilder.stmt_match: MethodTooLong \u2014 stmt_match runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/binding/pattern.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6c87abfffe681f98ca392ecd551eaf0c555766704fce500c75b36b714414d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/dict_completions.rs: FileTooLong \u2014 858 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: Transaction (106-1234). The bar is 500 significant lines; this is 358 over it, 1.72\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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef2b08ad29040201a4da243ab85501677214ed22fb51e9c9289a6b5a5645b13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DslValidator.validate_assignment_value: MethodTooLong \u2014 validate_assignment_value runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":4103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8104fd1f06dd1817dd6e447d29ee9b6f08806f493c2e7a114b27815dec89792"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DslValidator: 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2d299d5f79eb309ee166e3ff537be6c4ecb36692bc5f191650d4fbbc792ec8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallGraphVisitor.resolve_pyrefly_target: MethodTooLong \u2014 resolve_pyrefly_target runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe1549e1cee8e83af0d21501d8716dee0b4bb33a23c6ffd4e306960a8bc0df3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::lsp::wasm::hover::get_hover_with_verbosity: FunctionTooLong \u2014 pyrefly::lib::lsp::wasm::hover::get_hover_with_verbosity runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/hover.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4973a38f2e5b652cc28ce38874e11439e02acf838cb61743b32ecde03551285"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Server: TooManyFields \u2014 50 stored fields beside 110 methods. The bar is 30 stored fields; this is 20 over it, 1.67\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5d3249dd7d6181091d61ac2bee5e69e6e1c3c343d88905b2d5ce9c58d6b636"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::binding::function::function_last_expressions: FunctionTooLong \u2014 pyrefly::lib::binding::function::function_last_expressions runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/binding/function.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d758c5e9a5af64bcb81f74d495ec2d646feb8427992d259e39d11c23e9a7d61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.invert_map_int_tuples_parameter_pattern: MethodTooLong \u2014 invert_map_int_tuples_parameter_pattern runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/map_int_tuples.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf165e0d3050be7b2260097e2591193d253edccfc41709c86a7edd3684c472aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.inlay_hints: MethodTooLong \u2014 inlay_hints runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/inlay_hints.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae3b4e8b600912b9a162ba22a09eac3e35d6154bfd60302cba0738fb91dcbf3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.demand: MethodTooLong \u2014 demand runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/state.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ed0eddbd7362d5f82fe188e8458d19e599b026ee1d378cca6d92d017a40793"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binding/pattern.rs: FileTooLong \u2014 819 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: BindingsBuilder (200-1218). 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":"pyrefly/lib/binding/pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24e883c1bdea287fea19e8e276f7eb904c5dfd8f2fa9c19de2425475d71d2bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class/typed_dict.rs: FileTooLong \u2014 818 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: AnswersSolver (78-1150). The bar is 500 significant lines; this is 318 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":"pyrefly/lib/alt/class/typed_dict.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"550438ed368efda5a6aa9e900ec2fc77335e444d53afb61f5c5c28cc16456e2e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Bindings: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a99c3707479b4d44e6b06c1d0c50a50690dfc067cdc61e4826aa3af7b90416"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.find_closest_overload: MethodTooLong \u2014 find_closest_overload runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"981dd3b2c27a45a20588fecc4cdac744a50650126ecf8b045e921b370ee81fbb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallGraphVisitor.resolve_attribute_access: MethodTooLong \u2014 resolve_attribute_access runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"60692136673f42d1bc880095b9ccc7da77556383ecf9e9a887fbf46ed3212583"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BindingsBuilder: TooManyFields \u2014 48 stored fields beside 243 methods. The bar is 30 stored fields; this is 18 over it, 1.60\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc97d065788aad30a81b6c1374987a530ad127ee142eab5a4116672cb8534ee3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClassField: 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d4054d031cf3812692f0f6cb9c46075b5348aa84253e888acd561e29617f53"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CallGraphVisitor: 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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"2467b0fae1454de1375bfda8e17c7d587f1f29b0199195b7d993d912ff5a4545"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingsBuilder.merged_flow_info: MethodTooLong \u2014 merged_flow_info runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":4777}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf60e5b698ec2f95dbadada71f382e2f8c236d00b52f4484cb45897f40424f02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.solve_function_binding: MethodTooLong \u2014 solve_function_binding runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/function.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b31711d4741c5ef4f448de687572618ecb0a03d57ad5c035bf2a8d8d1d3e7e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.pydantic_config: MethodTooLong \u2014 pydantic_config runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5648ec485f90549f9442b0a8cce8580c0694c0b4927f8680204de37b88c31c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StructurallyValidatedTypeShapeDslFunction.evaluate_generator: MethodTooLong \u2014 evaluate_generator runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6726}}}],"partialFingerprints":{"codehealthFindingId/v1":"836be207698e80c8f7606a0a945d4ff61f03b7b876708f8b292c51bd0a47cb2e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.class_bases_of: MethodTooLong \u2014 class_bases_of runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/types/class_bases.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f24b0067e028eb88a76fc75e8ca50f55dd32f8c180db35007bfd3dfd98745ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scopes.finish_class_and_get_field_definitions: MethodTooLong \u2014 finish_class_and_get_field_definitions runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":3806}}}],"partialFingerprints":{"codehealthFindingId/v1":"438d6b9f262495d876498e97fb10911443adea57d59d99ae5d833dec5fd52967"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stubgen/extract.rs: FileTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 259 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/stubgen/extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5a103649edb787bf5a059ffcffe70396b9456536505c6bb8c335279cb55d9f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClassField: ClassTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 48 methods, 2 blocks, lines 465-1321. The bar is 400 significant lines; this is 206 over it, 1.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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"4353a2b6a9279feed2f14c99f9c87fbc2c7d4e1866bfa9736648e380eef4a7bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sys_info.rs: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 257 over it, 1.51\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":"crates/pyrefly_python/src/sys_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ab8f3cf922b5509b5445a37b0cd6e77d1781237e851dc9415387ec8fac98f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingExpect.fmt: MethodTooLong \u2014 fmt runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/binding/binding.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a124785f7096ea0040e40361304988ae30e2df8c7c6455ba2b191407d785b562"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.resolve_class_attr_setter: MethodTooLong \u2014 resolve_class_attr_setter runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":5897}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2bb4c09ddef9a3dbf702d01634facc32a2d0101e5ceae0b01ac0e75cdbbea5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.parse_base_class: MethodTooLong \u2014 parse_base_class runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd45571d33b1d09a5ce176b00949e27d883eb7e22875a3f40af845e6d0932cb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Subset: ClassTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 59 methods, 2 blocks, lines 3458-4373. The bar is 400 significant lines; this is 191 over it, 1.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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3458}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b2f1356294cf1a761a573d37f20bdd8b5cab5e52c3345a0b45e6f93fabcd16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Solver.finish_quantified_with_captures: MethodTooLong \u2014 finish_quantified_with_captures runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bbb081546418f517b9d7d30e53ccb8b00fd59fab72a5a112993dea58110d6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: export/definitions.rs: FileTooLong \u2014 734 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: DefinitionsBuilder (2 blocks, 360-1205). The bar is 500 significant lines; this is 234 over it, 1.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":"pyrefly/lib/export/definitions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84a4864a51e8a32e0ce172750300055917cb820f76bec130c19d6b1aa76d7df"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TelemetryTransactionStats: TooManyFields \u2014 44 stored fields. The bar is 30 stored fields; this is 14 over it, 1.47\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_util/src/telemetry.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de72a05c8f6a4be314c20b7cb1389afa0b1054c7693f71bc9086ef526287155"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CheckArgs: ClassTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 2 blocks, lines 240-2586. The bar is 400 significant lines; this is 186 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42a4b0c795928411a43248cf30a6ddc4ad535acbd9e07c0d341a2d757391aad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.get_dataclass_synthesized_fields: MethodTooLong \u2014 get_dataclass_synthesized_fields runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"196e914a8e685e862225de846c671c921d9754f351bdf830f4d1f4e8898513b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingsBuilder.function_body: MethodTooLong \u2014 function_body runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/binding/function.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"34caa9b4da9491d3ba41c41b5287587edb86c9eb6a2a08d387b33f36805fb191"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/special_calls.rs: FileTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: AnswersSolver (52-978). The bar is 500 significant lines; this is 217 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":"pyrefly/lib/alt/special_calls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a11cc265c2e7baf715f7b1be1952164d1ef905bedcb8f7a29cc554cd4709bd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Subset.bind_tensor_dimensions: MethodTooLong \u2014 bind_tensor_dimensions runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":3125}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cf11c7919c972a69903be6287e394bff940e1a361693979c092e843e4d7199"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: aiLandingPageHeader.AiLandingPageHeader: FunctionTooLong \u2014 AiLandingPageHeader 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":"website/src/components/landing-page/aiLandingPageHeader.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"765b7bafb789fb080e4f1d8d9a9d964ce3ccfe2f3b6e08796169292005e9bea5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.check_shape_flag_constructor_sources: MethodTooLong \u2014 check_shape_flag_constructor_sources runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/shape_flag.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d689b32f24abeca860eac9896f2ae573cf4ef9e612a7b0f55136cb3d0b2292"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/semantic_tokens.rs: FileTooLong \u2014 708 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 208 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb85f6951e74f96c747b10f30f116afb4a0b4403a3551b7b0c94616b61565f8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.overload_error: MethodTooLong \u2014 overload_error runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1949109cdbe88a01f1183af0a8a1eacfed5b370a3a154effc62ca2fb64ae8a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: report/scip.rs: FileTooLong \u2014 698 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 198 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":"pyrefly/lib/report/scip.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"749ed1e3188b50b632f71404d2d47d3c248fad44c9c9e3d2ca10e8c2eb11ebcc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.dict_items_infer_inner: MethodTooLong \u2014 dict_items_infer_inner runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"49667489515306d8e9232af383639fcb09d43e6d4e3496c071e07e39780a33cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.type_var_like_args_from_call: MethodTooLong \u2014 type_var_like_args_from_call runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/type_var_declaration.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7eef9c46026a0893f95ade0d367d7c6daf930acd89a03c91c4d61c9444ddccc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeConverter.convert: MethodTooLong \u2014 convert runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/tsp/type_conversion.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5364fb040e0f480df2af697f838bc3751c8c8fc1fd7eb4299b127ede0d5779a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/globs.rs: FileTooLong \u2014 689 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 189 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_util/src/globs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f66d4c359dbc655b524c9598c2e2bb31907aba6ab5c68146a60d68a06272c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/bazel_check.rs: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 185 over it, 1.37\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":"pyrefly/lib/commands/bazel_check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d6be3d4e5e744a2dc4a2aab95e1eadbb852d32ab88fdafcad0b26bd66b8467"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DslValidator.validate_generator_source: MethodTooLong \u2014 validate_generator_source runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fcc2d99c8bb212af2e3917e1b05f1fbd164a66c992520a8e3668557cfcc5da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/shape_index.rs: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 184 over it, 1.37\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":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cc91241a25ea083e356be8bdc31e8ddb05a85077a19f1fd1f2faa2109e8bf7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeDisplayContext: 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":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9f423aaf4d7fd3aeadcf97d991927edc241715e8b0ff21c64f6c6bd7129416"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly_types::einops::evaluate_einops_pattern: FunctionTooLong \u2014 pyrefly_types::einops::evaluate_einops_pattern runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/pyrefly_types/src/einops.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"817021dd5604bcaa7e7927a9f9877aaaa5fdba970b3780c4a6fcecfc530e5805"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.declared_bool_value: MethodTooLong \u2014 declared_bool_value runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":2777}}}],"partialFingerprints":{"codehealthFindingId/v1":"571476b7928722610f2bfbd7ba2bd1e8c6bb480dd69aec5d18cccc796b44c777"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: error/error.rs: FileTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 178 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"076769c0ca94629a543b3e9ade29f593418368611fc1f883f6900397d4d61389"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/class_metadata.rs: FileTooLong \u2014 676 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 176 over it, 1.35\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":"pyrefly/lib/alt/types/class_metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"297e5f30936a7a2838462ff11ff169f48f9149fef99f3d56f4311682bab94a96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.dataclass_metadata: MethodTooLong \u2014 dataclass_metadata runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c60db545c00fd1e20961e74f6800963a73e72c6652adca1d0c83ab75f43697"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pysa/capnp_writer.rs: FileTooLong \u2014 670 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 170 over it, 1.34\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":"pyrefly/lib/report/pysa/capnp_writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e5231f11fb09dd83dff8b840b934b10ab123e8869bc5d114d2a85d8037eeb3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeShapeDslHelperCall.argument_domains: MethodTooLong \u2014 argument_domains runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b7f740f6801a5f83e90859e1179ab6d24c1770f19f275b564fbb1cce58a214"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ConfigFile: TooManyFields \u2014 40 stored fields beside 59 methods. The bar is 30 stored fields; this is 10 over it, 1.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ac4141ea2f15ced661ae8cee897afcc668311532471c7c74db9b4b97e7a5c9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ast: 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":"crates/pyrefly_python/src/ast.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27f8a98bc4701c3979ff160b07df90b2153852b8d4338ea7715c7865dc007c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binding/shape_type.rs: FileTooLong \u2014 661 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: BindingsBuilder (252-996). The bar is 500 significant lines; this is 161 over it, 1.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":"pyrefly/lib/binding/shape_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"507407a86d84a9f7cdb6e846a69eee1a5dc3e366b3c7e7b4d58e2170faefed96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stdlib.new_with_bootstrapping: MethodTooLong \u2014 new_with_bootstrapping runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/stdlib.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60ef0fb68140e9dd9abae952cca2f60c4dd1f6edbd72473b64510a29ae07e7e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallGraphVisitor.resolve_and_register_expression: MethodTooLong \u2014 resolve_and_register_expression runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":3906}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a6b417c8a0a03181d0a400653eeb4e8d6063eb5c13edfe78256c2554eb7816"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/errors.rs: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: Errors (2 blocks, 301-1024). The bar is 500 significant lines; this is 154 over it, 1.31\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":"pyrefly/lib/state/errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2135394460f35498dea675d0385ecf4285f33cebe9cb4c5b77ddff5ce3f4691"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/module_resolver.rs: FileTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 151 over it, 1.30\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":"crates/pyrefly_build/src/module_resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e5d0d58d415d96d93de77f7732f6bc27758d9b59abf0f568b5c87e58a1ff37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.as_attribute_base1_of_type: MethodTooLong \u2014 as_attribute_base1_of_type runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2927}}}],"partialFingerprints":{"codehealthFindingId/v1":"878f8748989cdef9ab6837e6e7376ae129b959d60e16ff1ac8c01ccc0f8fd518"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DslValidator.validate_dimension: MethodTooLong \u2014 validate_dimension runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2531}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4c460bc5ff669ab37bd1deb6fb89c879f89d5ff341f4f2ddd3d4cb727edd90"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Indexer.document: MethodTooLong \u2014 document runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/report/scip.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e032bd505bc1bf9d83e27b568da5c536baa248e9cce8c05f7dd9e9aa9072fd1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.validate_type_form: MethodTooLong \u2014 validate_type_form runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":8108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54124b04b16ce6610483fb49cb7fd2b9f69d6cac22e4eb108c213bb857b1b62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tsp/type_conversion.rs: FileTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 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":"pyrefly/lib/tsp/type_conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"662e1bcb226dd8c0d08a993a57649725a2246717b2d696ac7eec9948c8513418"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CalleesWithLocation: ClassTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 2 blocks, lines 378-1079. The bar is 400 significant lines; this is 108 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/query.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ecd0c2bb986d001884020e02189e588d8a90ca4a4745b6ceadd1b1c8c7e1b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.expr_annotation_with_comment: MethodTooLong \u2014 expr_annotation_with_comment runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"299d9ad00647cbfc2ad0c5a530c377b2c3b2a5b3cec144b8c861f8ee3b41cf5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.subscript_str_literal: MethodTooLong \u2014 subscript_str_literal runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/subscript.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02a72ebfd4e6db936f6603c6f34a3157547433d864de49812a4753d93bd7cfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: protocol_generator/generate_protocol.py: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 133 over it, 1.27\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":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e55a9101b4477d71b37a2a7b437181b127891592ec3c195f3a771ec2ecc5327"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Query: ClassTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 2 blocks, lines 153-1779. The bar is 400 significant lines; this is 105 over it, 1.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":"pyrefly/lib/query.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cd10aa570502cf824ff1f5048506ff905c361bd7ba9c455e4465a3cc24da29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferArgs.run_inner: MethodTooLong \u2014 run_inner runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/commands/infer.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda7e147708115d1bdf0af95e8cd2ffb6a19bdbfd19a88cc52df98e5c4096f6c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.new: MethodTooLong \u2014 new runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3032}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbec8a3c2a37ac1bbb9326cebcf1e2c1d980e445adca8bbda5602d060218fc27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.add_match_class_keyword_completions: MethodTooLong \u2014 add_match_class_keyword_completions runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"992cde6c4ebfe18691e3bb8d5ba47ec8e804262f64d4389b6a35f3e86d666312"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_info.rs: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 127 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcb5ee52e591be830303a4bd33b896011ff79d3bbbee5b303a50ad5f392c618"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quick_fixes/move_module.rs: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 127 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/move_module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33acc3e27ec8ad7edbee690acc08499404de0b8bdd4eb5a8eb285558edad91b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.get_django_instance_attribute: MethodTooLong \u2014 get_django_instance_attribute runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/django.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9afadc458347f68e958083f83e910a5a3b53e695c4b005e1e4d734a260e3fd9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.async_override_code_lens: MethodTooLong \u2014 async_override_code_lens runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":6109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5527e1774aa96b6d4bdab36c083fa53ad043a8a5fb2415a0cd48c277c7820c48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::module::finder::find_import_with_mode: FunctionTooLong \u2014 pyrefly::lib::module::finder::find_import_with_mode runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/module/finder.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6f99c61c1a1abbd459ed00dd794f5a6170e976f36867b8f3ddee8efa282770"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/callable.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 119 over it, 1.24\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":"crates/pyrefly_types/src/callable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba50eeddc647a43952c340f1fa7a3ba952f5daa22f731a4f3d2cd072923021c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.check_type_is_class_object: MethodTooLong \u2014 check_type_is_class_object runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/special_calls.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"e889e76bea9a406183cc427a88a0b0fd598b93f199b261efbeaced0bff064324"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pysa/function.rs: FileTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 108 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8d9aaeee233b87abbd52db6dbd9c10c4ff5376d8dec6be479325542b51e2ef"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Bindings: ClassTooLong \u2014 486 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 49 methods, 3 blocks, lines 421-1378. The bar is 400 significant lines; this is 86 over it, 1.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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6088d98d5390f012a438de7de5f79b9a8bd3beecc281f7b937e8a544f1826d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly_python::folding::folding_ranges: FunctionTooLong \u2014 pyrefly_python::folding::folding_ranges runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/pyrefly_python/src/folding.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef430f19868e932a7173b14635dcab52943c6fd78d36f0c880ce95d9beee71e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CalcStack: 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":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"f472082479907e40999d7bb5e27a2d2bee090a7cbad8031b6ee3655538f137d6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeOrder: 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":"pyrefly/lib/solver/type_order.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"38361c15296a626a268e3ecc10415155f6dbecb1b7c9c5a10ae317a32a0898ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::lsp::non_wasm::will_rename_files::will_rename_files: FunctionTooLong \u2014 pyrefly::lib::lsp::non_wasm::will_rename_files::will_rename_files runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/will_rename_files.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c502c4561019670e153ea0e1fa1fc8eeae847c1eb85eb919ebc1356730cbf9b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.find_operator_dunder: MethodTooLong \u2014 find_operator_dunder runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"da277c64dbeb26bd10b9a87418175cda3f184282bdd7b4846613508617b921ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: non_wasm/workspace.rs: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 96 over it, 1.19\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":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33d75a701e268d40761cf005993c43c1a1398f61654cad839a0ace9e3cffa32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.add_autoimport_completions: MethodTooLong \u2014 add_autoimport_completions runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"d632a730599a2e7fc407f285bbc0ba67c1172d1b4e73e1878a55f120aca7e6bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query/type_table.rs: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 90 over it, 1.18\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":"pyrefly/lib/query/type_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42c10bfb7b1bcb7da98a4c7dc9c370ac907712c57e7bd7db3fd6553c6adad69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.analyze_class_field_value: MethodTooLong \u2014 analyze_class_field_value runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":3327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a289e3ea8fb61a204af4497f8365a5e024b9a70203fe7e2e39b65f28662f6a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingsBuilder.merge_flow: MethodTooLong \u2014 merge_flow runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":5047}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceaa077ac5af9f0b47b225c1b3f4146b9dc8dabf26d41fc30f1ff09dbb85fee7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class/variance_inference.rs: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 89 over it, 1.18\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":"pyrefly/lib/alt/class/variance_inference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a5031e51b722a0a0b8707e15b5a0c1796f4d7f72f83df1cffd52e8378ae4e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.as_instance_attribute: MethodTooLong \u2014 as_instance_attribute runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":3850}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4987e7858964d0a24a1dbd221662f5070b3a16820940b360faa1ea92f59230"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Answers: 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":"pyrefly/lib/alt/answers.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d53d42ac8a5bd779d340147cb2a82f0f2871edd1246901df61962631f6c0eb0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Query.get_types_in_file_with_optional_timing: MethodTooLong \u2014 get_types_in_file_with_optional_timing runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/query.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"70193fe04c4ace2486f8b83ef4bcf25287070fdaba7068573df23ef08fcd2427"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ignore.rs: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 77 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_python/src/ignore.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b7baf3d766d68150bf53ff03c487a026b2d91943d2dbce4ce7f5b776589217"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallArgPreEval.post_check: MethodTooLong \u2014 post_check runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c1c4df7c6950545ab359219d1a0b993e1756e71d00b6a7a7f3838b820c90c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class/targs.rs: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: AnswersSolver (65-849). The bar is 500 significant lines; this is 70 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":"pyrefly/lib/alt/class/targs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41380d240fa2941484bd96181586278a9d665a7a80074a12c2b30fb6e4b55494"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quick_fixes/introduce_parameter.rs: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc994b1f8372e71ca7ceb21d5e53b3693111dc91d048a8c1811b307b72312437"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DslValidator.validate_generator: MethodTooLong \u2014 validate_generator runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb3260299cfbd725b795262e87be0417111b4b7a3198c7f50ac30557b3d720d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.check_dict_items_against_typed_dict: MethodTooLong \u2014 check_dict_items_against_typed_dict runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/class/typed_dict.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f561aba8a1044ea03e561d9dda22e28622894788916655f7cd8aa06d2b92c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: presetLandingPageHeader.PresetLandingPageHeader: FunctionTooLong \u2014 PresetLandingPageHeader 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":"website/src/components/landing-page/presetLandingPageHeader.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"376376a920bb30542c8870f3850619c2c34024a8e41f1d50ea382a3d44915d90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alt/map_int_tuples.rs: FileTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: AnswersSolver (105-794). The bar is 500 significant lines; this is 64 over it, 1.13\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":"pyrefly/lib/alt/map_int_tuples.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc83d8489505cf3abe2d707aab306c739dc37155570b19d89ff78cd4d06fe9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.binding_to_type_unpacked_value: MethodTooLong \u2014 binding_to_type_unpacked_value runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":5629}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e133f304efe0aaa29be5f62924e72bf64b6cfd609eb5bd8ca891f0b66cbe08"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DefinitionsBuilder: ClassTooLong \u2014 447 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 2 blocks, lines 360-1205. The bar is 400 significant lines; this is 47 over it, 1.12\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":"pyrefly/lib/export/definitions.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec103a244de1577d8ed1ba5874451d3d04ca0dd200883f94d448f2ca25da0bb6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Errors: ClassTooLong \u2014 445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 301-1024. 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":"pyrefly/lib/state/errors.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fecddf36415e97c5570d7ff8bd36fbe7fa0a0c1929af7e238a75f7af877d2c7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Binding: ClassTooLong \u2014 445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 3 blocks, lines 2638-3335. 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":"pyrefly/lib/binding/binding.rs"},"region":{"startLine":2638}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedce64d70de3cf154a5bec25e4035e431ec6c30229bb89f1376e866be0f3dd9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.call_infer_inner: MethodTooLong \u2014 call_infer_inner runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/call.rs"},"region":{"startLine":2663}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac292df65459b0438602e88f2aa6eec5fd93dbf91b5aafd9d4c1a17f71f682d5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: pyrefly::lib::state::lsp::quick_fixes::extract_shared: TooManyFunctions \u2014 33 free functions. The bar is 30 free functions; 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":"pyrefly/lib/state/lsp/quick_fixes/extract_shared.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b091ea3d880abd607cd4feeec945c6871b96f93afbe642603497ac588a0e2ec8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly_types::einops::parse_expression: FunctionTooLong \u2014 pyrefly_types::einops::parse_expression runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/pyrefly_types/src/einops.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a52c9e26e7d08f24e9704a3484cfc31f6e05f2a6c17b139382832757996399"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.tuple_infer: MethodTooLong \u2014 tuple_infer runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f467bf8565db36dd076a8b8f2f377103de57e8a98fcdf107b704e1ca8fa3120"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.check_signature_consistency: MethodTooLong \u2014 check_signature_consistency runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea018ed3ca0541a5c8392a15d4c9c61456b9959e9b1a9d795605e53cb9e49b13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.name_assign_infer: MethodTooLong \u2014 name_assign_infer runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d952f443f1ef629df9b617820f2c47f2e95fd302a6f91c06d8a7e0ea39c016dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Subset.is_subset_tuple: MethodTooLong \u2014 is_subset_tuple runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b8fb1c093828f38e2c9b191955d159b77e6382bae0924034b4bbbc3aa137ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: whyPyreflyGridItem.WhyPyreflyGridItem: FunctionTooLong \u2014 WhyPyreflyGridItem 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":"website/src/components/landing-page/whyPyreflyGridItem.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e68eb385684d5e5cecc1876820c65b2122ec67f749e948bc953230f0b3ab169"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.check_consistent_multiple_inheritance: MethodTooLong \u2014 check_consistent_multiple_inheritance runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":5004}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f12a319a3086b1855b5c0732b47ad93eebdfc95b9d38c98a14a21835acd95a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LspInteraction: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 31 methods, 2 blocks, lines 1332-2082. 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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9320355be5bfef1975d663213db8592a1422872c1052f8b0222e8ee409b1a008"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.check_fstring_format_spec_for_type: MethodTooLong \u2014 check_fstring_format_spec_for_type runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aeca0741d9da0af1d957011c1669cc1bc908463ae50b9c6223c47663d2ec918"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.identifier_from_covering_nodes: MethodTooLong \u2014 identifier_from_covering_nodes runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3cd1d8826c853d48182870f3c2a505b9fa9c988d72f62a002b3e3c4d742ccc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binding/target.rs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: BindingsBuilder (54-862). The bar is 500 significant lines; this is 34 over it, 1.07\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":"pyrefly/lib/binding/target.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb540054ea8346974abf51c8062ad981088ff9ef11def3071f09d299eb8eefb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wasm/inlay_hints.rs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: Transaction (93-793). The bar is 500 significant lines; this is 34 over it, 1.07\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":"pyrefly/lib/lsp/wasm/inlay_hints.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc876a45aa96ecce84a0f67852dff0f302b6d3b75259ed6931bb42404e13f180"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Error: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/error.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca231452927a202e3c3183b2c514d1e67d13d497c22acc30ac99de4de2476718"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: OutputArgs: TooManyFields \u2014 32 stored fields beside 4 methods. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad0bae277a2f8bb4b78f3d73c2dc36cbffcf1b1bddc45557f3a5ba8c3e27123"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfigOverrideArgs.override_config_at: MethodTooLong \u2014 override_config_at runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/args.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab26a76eca42e8a75e23f6959d8dae9abd774d6502bcbd8e3ba6796c7811f3c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.shaped_type: MethodTooLong \u2014 shaped_type runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/shaped.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5d63b922ea5fa9bb544ca771f5d06d270f350156342f509212904b75e385d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingsBuilder.bind_single_name_assign: MethodTooLong \u2014 bind_single_name_assign runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/target.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e7975312cbfd26e65440362230dd59046caf2edb20b510a7dbe4b878c0e7ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: report/pysa.rs: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 28 over it, 1.06\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":"pyrefly/lib/report/pysa.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e065afdd775be9e570583dc4184267d4863d85127eb9af331f6917ff95bee99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/args.rs: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: ConfigOverrideArgs (3 blocks, 295-811). The bar is 500 significant lines; this is 27 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":"crates/pyrefly_config/src/args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6035f77b72a94eb5028c845e2198f787ef82f20815d632c522650bbf5aa3019"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: module/finder.rs: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 26 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/module/finder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd5512db3166ff2480229afda13c6fc4a69329f3f592a20f9e60dd01e0d2201"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NarrowOps: ClassTooLong \u2014 420 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods. The bar is 400 significant lines; this is 20 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdeea52f52dc2935ddfc474bcb2b87f80eabc17b1cfcc3964308ddc6c615b70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: error/suppress.rs: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/suppress.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be9eb9f7154fac3c5950288e4fb3622fdf7dd5f89f5a48c28a2dbec3d5deeab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.notebook_document_did_change: MethodTooLong \u2014 notebook_document_did_change runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4457}}}],"partialFingerprints":{"codehealthFindingId/v1":"84540e26c42ba35bfb79f50cdc3b2f64ff42a933e39ebb1d0f20daab61a4fd54"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LspInteraction: 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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"7405c1dfe6e662f44f390e91c41778618afe9af6e0e70a1122fe1bbd9c858a57"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Quantified: TooManyMethods \u2014 31 methods, declared across 2 files: src/quantified.rs (30), src/type_var.rs (1). The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/quantified.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"78eddf538d591dc52a09fe0995b1b549503e0ed3f40e8f0836d263d7ed78c1ad"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Answers: ClassTooLong \u2014 412 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods, 3 blocks, lines 267-1846. 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":"pyrefly/lib/alt/answers.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"faebecbaf8b44489a39ebb1c94c8ca23c95ea143b4cb422e791f3bf181535271"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::lsp::non_wasm::server::capabilities: FunctionTooLong \u2014 pyrefly::lib::lsp::non_wasm::server::capabilities runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"134e8926a8fa8636cbc8aaab85a0858d2f5678aca703caa91b0a81a5427e5e21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Subset.is_subset_eq_quantified: MethodTooLong \u2014 is_subset_eq_quantified runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3745}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af01099280964a184caeadc79b6d505555e545fb51d52e978ad83758f2f9d0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::state::lsp::quick_fixes::deprecated_contextmanager::replace_return_code_action: FunctionTooLong \u2014 pyrefly::lib::state::lsp::quick_fixes::deprecated_contextmanager::replace_return_code_action runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/deprecated_contextmanager.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc444c5a1cbecbc8bd845a1adbcd8a42e9b2ec33ea1dd72c3ccc4309e8c4700d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: InlayCodeBlock.InlayCodeBlock: FunctionTooLong \u2014 InlayCodeBlock 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":"website/src/components/InlayCodeBlock.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a4a2f35ebff04d1c3b6a2525d2b8a446815b62cff3243937bac404700abfe2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallGraphVisitor.resolve_name: MethodTooLong \u2014 resolve_name runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":2410}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a528db5521ac9a7bd8c8d6350211b359f9eaf2a6773baab959a9c8d96657631"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/docstring.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 5 over it, 1.01\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":"crates/pyrefly_python/src/docstring.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cba2161381e1b44d6cf12232d718a59b9a893a4c8b4c7435c58e491fdbb1eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DslValidator.collect_integer_expression_sources: MethodTooLong \u2014 collect_integer_expression_sources runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b931f86a9e4c41ccc4b2e9b23f2df294e725672b9c21f06b619bc96e0337e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.get_dataclass_init: MethodTooLong \u2014 get_dataclass_init runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"007c88a04d1f5d0351de0f54efe7428f8bb87cf8afc0e30557b3f8ae4e88a6da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::alt::regex::validate_pattern: FunctionTooLong \u2014 pyrefly::lib::alt::regex::validate_pattern runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/regex.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6357228bb6be772ee5343f36cde3f0c07bc18bfbb365c60eecb44be2216f7dab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnswersSolver.check_args_and_construct_tuple: MethodTooLong \u2014 check_args_and_construct_tuple runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/specials.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddafacab38e26b4bf1ae956323b904625d4f02fdcd594cf8be538179a4ff301"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::state::lsp::quick_fixes::change_signature::change_signature_code_actions: FunctionTooLong \u2014 pyrefly::lib::state::lsp::quick_fixes::change_signature::change_signature_code_actions runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/change_signature.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5006002600e6120271b6358057a1f02ba6adc00edf77cddfd514b1e46c552da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pyrefly::lib::state::lsp::quick_fixes::extract_function::extract_function_code_actions: FunctionTooLong \u2014 pyrefly::lib::state::lsp::quick_fixes::extract_function::extract_function_code_actions runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/extract_function.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd34f0c68d74b8c5df826960668a5e4da5db3c6da3ecc7cceccb9875c74bac6c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CalcStack: ClassTooLong \u2014 401 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 36 methods, 2 blocks, lines 539-1411. The bar is 400 significant lines; this is 1 over it, 1.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":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e829abc637d8fd1798eed1fc3ea5978a70d608d0b7588b6e8891f70292cb72"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (26 shared lines): crates/pyrefly_types/src/type_level_dsl.rs:3642-3702 | crates/pyrefly_types/src/type_level_dsl.rs:3777-3820 \u2014 These two members are variants of one another: 26 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3642}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f48e3ae2824aa06426b99339708e364df4840eba27309439348b608c64d61dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tensor-shapes/jax-pyrefly-stubs/run_pyrefly.py:30-83 | tensor-shapes/microtorch/run_pyrefly.py:24-50 | tensor-shapes/pyrefly-einops-stubs/run_pyrefly.py:29-79 | tensor-shapes/pyrefly-numpy-stubs/run_pyrefly.py:29-79 | tensor-shapes/pyrefly-torch-stubs/run_pyrefly.py:29-85 \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":"tensor-shapes/jax-pyrefly-stubs/run_pyrefly.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e225602d1c223cdb714d98d864d0f8e725296bf603df5ef3f27ff2fe9dad6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/pyrefly_lsp_test/src/object_model.rs:1008-1031 | crates/pyrefly_lsp_test/src/object_model.rs:1038-1063 | crates/pyrefly_lsp_test/src/object_model.rs:1070-1103 | crates/pyrefly_lsp_test/src/object_model.rs:1111-1144 \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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d3aaedc6a3970298f393be6d699b7d20223442e73a133ac91740841b41c9b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): crates/pyrefly_types/src/types.rs:1030-1089 | crates/pyrefly_types/src/types.rs:1093-1152 \u2014 These two members are one piece of code written twice and then edited apart: 60 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":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"166acd3315821ae36fc0fd7b08a8f1e7470fb3d6663d125b2b773b34f3a117bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/pyrefly_types/src/types.rs:1507-1554 | crates/pyrefly_types/src/types.rs:1561-1608 \u2014 These two members are one piece of code written twice and then edited apart: 48 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":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6fcda0bfd8016abd3eb135cd25471fc3cc7d774929acf05cffa0b1b9ba037e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:363-434 | pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs:489-571 \u2014 These two members are one piece of code written twice and then edited apart: 72 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":"pyrefly/lib/state/lsp/quick_fixes/change_signature.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a08930bee537e6002c1c74c1bfbe720651e1de411448a5e00b45f39ef474c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): pyrefly/lib/report/pysa/capnp_writer.rs:772-810 | pyrefly/lib/report/pysa/capnp_writer.rs:816-851 \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":"pyrefly/lib/report/pysa/capnp_writer.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"caad7ff4b9fd227bd3fe4c921cf572ef5184286f8188a78efccc03703e107f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/pyrefly_types/src/types.rs:565-618 | pyrefly/lib/alt/function.rs:2907-2981 \u2014 These two members are one piece of code written twice and then edited apart: 54 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":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2df7ba048094f1a216c5bfe57f0cb0078b0007348c79c0f3d6587773e1e71fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): pyrefly/lib/alt/solve.rs:6407-6469 | pyrefly/lib/alt/solve.rs:6479-6530 \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":6407}}}],"partialFingerprints":{"codehealthFindingId/v1":"de295f48e49d2f418c41a2c374d33b698499478e6e03f8e2f2cfe1c5fab2e3bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/pyrefly_types/src/type_level_dsl.rs:3521-3565 | crates/pyrefly_types/src/type_level_dsl.rs:3571-3605 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3521}}}],"partialFingerprints":{"codehealthFindingId/v1":"715e855fb07cbb7b5f8978f6e97baddfaf570e2a190cc982e411259cb7f17dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): pyrefly/lib/lsp/non_wasm/server.rs:7124-7165 | pyrefly/lib/lsp/non_wasm/server.rs:7281-7316 \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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":7124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3316334bf3a0d75c13c32536601b75ac37ead19946ee6df83e14d0d703139cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): crates/pyrefly_config/src/args.rs:492-556 | pyrefly/lib/commands/check.rs:530-611 \u2014 These two members are one piece of code written twice and then edited apart: 65 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":"crates/pyrefly_config/src/args.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ede2a7369822382c76406bdcfcafc0cc24e7d9d6d06fdb03d7d578cad7367ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): pyrefly/lib/alt/expr.rs:2674-2701 | pyrefly/lib/alt/expr.rs:2711-2737 \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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ccba5c28ae7be67964a3d3c158f148ed63d4958d824d80ae53fd8bc6f78889"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): pyrefly/lib/report/pysa/capnp_writer.rs:386-420 | pyrefly/lib/report/pysa/capnp_writer.rs:488-518 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/capnp_writer.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf13d985126ea9b9303d129ccdacc0b498cc8a2a146e53cfa48bf56865da2ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): conformance/conformance_output.py:206-241 | conformance/conformance_output.py:247-285 \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":"conformance/conformance_output.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3e21f9aa586255675257c98b06182de95d17393d15393e32fb6faa62526166"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): pyrefly/lib/alt/function.rs:2690-2729 | pyrefly/lib/alt/function.rs:2737-2792 \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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be997990f33635964998f7ceb24d372397dcbc2dc40b8da4e7bbb52e033212f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): pyrefly/lib/report/cinderx.rs:154-180 | pyrefly/lib/report/cinderx.rs:182-212 \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":"pyrefly/lib/report/cinderx.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5329461f68f8767156769d3cbe99c71b76914490eacbc78ae26878dd003464"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): pyrefly/lib/state/lsp/quick_fixes/convert_dict.rs:301-325 | pyrefly/lib/state/lsp/quick_fixes/convert_dict.rs:335-359 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/convert_dict.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b7bcf9f65e74c06390348530a733e7a7cda808c6624663c451a8b13c945625"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): pyrefly/lib/lsp/non_wasm/server.rs:5080-5101 | pyrefly/lib/lsp/non_wasm/server.rs:5107-5130 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5080}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ebf5ee351193c65ca71e743859950a872db68859aebb94786e3fff9fdb56dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): pyrefly/lib/state/state.rs:3230-3263 | pyrefly/lib/state/state.rs:3286-3326 \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":"pyrefly/lib/state/state.rs"},"region":{"startLine":3230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d84b683d6a0a47f8228a2f41808383aa7c6dc77807410a1861923cdcf2733bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/pyrefly_derive/src/type_eq.rs:30-53 | crates/pyrefly_derive/src/visit.rs:62-85 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_derive/src/type_eq.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fb98c9055f311685fb9936bf8fd95f32a596d4e64fc2db3b4abbd220ee3f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): pyrefly/lib/alt/polars_specials.rs:3285-3311 | pyrefly/lib/alt/polars_specials.rs:3350-3372 \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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25352ae3d2e8dbda2efdd02d1f28d98e12a154fcad214ed9324c4f7f4529554"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): pyrefly/lib/binding/narrow.rs:946-973 | pyrefly/lib/binding/narrow.rs:980-1006 \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":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"534e9258554b9c2325bf71d0f6d9dada70a67478ae912d2902a93380053bcc8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): pyrefly/lib/state/state.rs:281-311 | pyrefly/lib/state/state.rs:414-439 \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":"pyrefly/lib/state/state.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaeae7ae36ca156ce3c36a27a6012420c9e91064e5080f284980acc79d4d21d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): pyrefly/lib/state/lsp/quick_fixes/move_module.rs:641-673 | pyrefly/lib/state/lsp/quick_fixes/move_module.rs:679-711 \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":"pyrefly/lib/state/lsp/quick_fixes/move_module.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"173107bde0f4c40e317dc3776fd94463bb0ed4f6b27206199417eff7691f5cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/pyrefly_util/src/small_map1.rs:37-61 | crates/pyrefly_util/src/small_set1.rs:37-61 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_util/src/small_map1.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a8a4d223fff950640407dd412abca63accd92a09d437b1e790c7e7e447ffb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/pyrefly_types/src/types.rs:1915-1930 | crates/pyrefly_types/src/types.rs:1933-1948 \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":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46cfe980c7bfe019afe5f685cf49d263b77bf30c28820cdc8d07807ad4f29a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): pyrefly/lib/alt/type_level_dsl.rs:1334-1355 | pyrefly/lib/alt/type_level_dsl.rs:1357-1375 \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":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"59efc918c9809d10824dcd7249a20fe684e332465e292b65276196773b6284b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): pyrefly/lib/state/lsp/quick_fixes/extract_field.rs:172-197 | pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs:296-320 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/extract_field.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"608c6a045ef3206379dbf340ee01e1914b1ee5c64df06c95bcb5544bb8d0838c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): pyrefly/lib/lsp/non_wasm/server.rs:5833-5866 | pyrefly/lib/lsp/non_wasm/server.rs:5874-5910 \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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5833}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81e77379fd569a9cd7dcffc7cb27b758ed498c1011db9cebcbcf7077bd4892f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): pyrefly/lib/state/lsp.rs:2034-2055 | pyrefly/lib/state/lsp.rs:5768-5792 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"993609b2d0a5a5c23ef9e59153339a9a2af197f3170d4ddb5f40db8643da1d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): pyrefly/lib/alt/class/dataclass.rs:1525-1547 | pyrefly/lib/alt/class/dataclass.rs:1549-1566 \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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa2211a8512c4a64cecc01229b8c6591275e541f86293f11ee350f2ce9a38a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): pyrefly/lib/state/lsp.rs:4170-4194 | pyrefly/lib/state/lsp.rs:4203-4221 \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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":4170}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cc0ffb45aa2bd09af7b7e628d77fe2bb64f8b6a83c204f08053d8d9c9e9e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): pyrefly/lib/alt/unwrap.rs:444-466 | pyrefly/lib/alt/unwrap.rs:468-486 \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":"pyrefly/lib/alt/unwrap.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e73c4a05702f73d3041eaeacef1fcafc355a5e3802fbca2985907e68a7245c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): pyrefly/lib/binding/narrow.rs:1008-1024 | pyrefly/lib/binding/narrow.rs:1030-1044 \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":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff56976483852e32168e7fd2723c9b6772008edc30ab0d9680551900787807f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pyrefly/lib/alt/class/class_field.rs:1080-1096 | pyrefly/lib/alt/class/class_field.rs:1098-1114 \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2960c4114af8e8790febbb33796adb170c03f5d534d7a1a6dd12cde69167df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/pyrefly_build/src/query.rs:52-68 | crates/pyrefly_build/src/source_db/buck_check.rs:121-137 \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":"crates/pyrefly_build/src/query.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c89545d1320f5396cb1e6d6aba43f870ffe2d6ae244db4a1bf0a43e6faa8cf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): pyrefly/lib/error/error.rs:300-323 | pyrefly/lib/error/error.rs:366-388 \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":"pyrefly/lib/error/error.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76b65f99a37213d9cf04c82e887b417e4aef78f178be58dd76b708d4caa4c66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/pyrefly_types/src/type_level_dsl.rs:1082-1092 | crates/pyrefly_types/src/type_level_dsl.rs:1094-1104 \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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2ae0b4abe1e86b6f2df9233402e1ab3ea9991e48402fd02af14cd28c845090"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): pyrefly/lib/alt/class/targs.rs:315-339 | pyrefly/lib/alt/class/targs.rs:341-363 \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":"pyrefly/lib/alt/class/targs.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf91042eb84381ba53ea63b9bb6252175a4da86b03ac0320cf12f9662b7e242"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pyrefly/lib/export/definitions.rs:394-410 | pyrefly/lib/export/deprecation.rs:17-29 \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":"pyrefly/lib/export/definitions.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e01ddb78021141992cc1b3c881a93741c724b21eabe62b0376a6ec66ba0b6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): pyrefly/lib/state/lsp.rs:2284-2308 | pyrefly/lib/state/lsp.rs:2315-2339 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d88fd2fb8b4475d0a61bee3b971719856fadf6d6486b2709ec5b3cad694c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): pyrefly/lib/alt/callable.rs:1030-1057 | pyrefly/lib/alt/class/class_field.rs:2829-2859 \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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd278685f52a12c85e1be879116886001e7c0aed577e34d81a7bbd78d8bdf6a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): pyrefly/lib/alt/solve.rs:2676-2699 | pyrefly/lib/alt/solve.rs:6850-6876 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":2676}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f7182f81820ab3e9cfe46a03bc83ad0fe4a6347a4b3ccf1ed94c29aad4aeda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): pyrefly/lib/alt/polars_specials.rs:3262-3283 | pyrefly/lib/alt/polars_specials.rs:3380-3399 \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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4396f1b91b1d5b178f59d7943714868e34b2bb55d75ab2b164ea3e9dccb1be3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): pyrefly/lib/alt/expr.rs:1837-1866 | pyrefly/lib/alt/expr.rs:1875-1901 \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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffabbd1f5be5a8c0c2e61042803dbdd70e0ea7bcab128b2c4a4a8c64842183b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pyrefly/lib/binding/expr.rs:756-767 | pyrefly/lib/binding/expr.rs:769-783 \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":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea6f156b77e9b09565807f880ee1dd2f6e3c3fb1a0c1b936126386dbb542a2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/pyrefly_lsp_test/src/object_model.rs:2038-2058 | crates/pyrefly_lsp_test/src/object_model.rs:2061-2081 \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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4181bc726e2bfa588f44005663e247913ec48e9ede97d3edf22631d05e0c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): pyrefly/lib/alt/class/typed_dict.rs:876-889 | pyrefly/lib/alt/class/typed_dict.rs:896-909 \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":"pyrefly/lib/alt/class/typed_dict.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ccab18b46db2824580d551dff48618d243de2f2df6b5d9fd2f99c0c4da86bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pyrefly/lib/state/lsp/quick_fixes/move_members.rs:133-149 | pyrefly/lib/state/lsp/quick_fixes/move_module.rs:132-149 \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":"pyrefly/lib/state/lsp/quick_fixes/move_members.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6735961ef35a02dd5fcd499a9716a5401607bd0f8266adb851b94f175b8d1168"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/pyrefly_types/src/shape_index.rs:185-207 | crates/pyrefly_types/src/shape_index.rs:337-360 \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":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a55941e8ab63e69c823a893fd0f07d40a12ec55c9e7f8bc85a3ae454ed0e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/pyrefly_types/src/simplify.rs:612-633 | pyrefly/lib/alt/class/variance_inference.rs:321-342 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/simplify.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"51eeae09d3c95d2920162278b086b4172a7e6cafe665de63ed1ccd06df2c64a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): pyrefly/lib/report/pysa/call_graph.rs:3712-3733 | pyrefly/lib/report/pysa/call_graph.rs:4158-4185 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":3712}}}],"partialFingerprints":{"codehealthFindingId/v1":"624145131c11546c863c28b8ecbaf5b0e1e3a128d93b17fbe6f6c6ce80b3da38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): pyrefly/lib/lsp/non_wasm/workspace.rs:730-750 | pyrefly/lib/lsp/non_wasm/workspace.rs:757-777 | pyrefly/lib/lsp/non_wasm/workspace.rs:784-804 | pyrefly/lib/lsp/non_wasm/workspace.rs:886-909 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"0211a5adc09db9f040e8a6db11583f5453096891e8974038a61385d74bc208fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pyrefly/lib/error/error.rs:491-507 | pyrefly/lib/error/error.rs:612-629 \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":"pyrefly/lib/error/error.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"223f17b3f18e22f4499874083162082f0534ff9df40f2519ceee11d639e31324"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:196-213 | pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs:192-212 \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":"pyrefly/lib/state/lsp/quick_fixes/change_signature.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"66edda4d137ae59a85dafccee8c2ec2116935d1f49fb871b28179f335647d8e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): pyrefly/lib/lsp/non_wasm/connection.rs:109-126 | pyrefly/lib/lsp/non_wasm/connection.rs:131-148 \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":"pyrefly/lib/lsp/non_wasm/connection.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8d4ee3055a522d983be433b71395d6ed9ca0415f206f6b5bd98cfa7870ea94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/pyrefly_lsp_test/src/object_model.rs:861-878 | crates/pyrefly_lsp_test/src/object_model.rs:884-897 \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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"c046b0fa32d060620e8a95db9623a23f977d615c227b0cd0f35ef5937397f953"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/pyrefly_types/src/dimension.rs:767-777 | crates/pyrefly_types/src/dimension.rs:960-970 \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":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea911582eb8df97949c515ca5595329acc928096af66fe6b467354f40edf341"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pyrefly/lib/error/collector.rs:198-207 | pyrefly/lib/error/collector.rs:296-304 \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":"pyrefly/lib/error/collector.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdaaa47f64cfbb53b9e8c57bf245774b19ac3ec3d64018cc08a1350dfec9736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/pyrefly_config/src/module_wildcard.rs:90-109 | crates/pyrefly_python/src/sys_info.rs:136-152 \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":"crates/pyrefly_config/src/module_wildcard.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"400331969f3e4bf5d81ea128365c42654f588eb8d78268b5ce456f7ad89ca113"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/pyrefly_types/src/types.rs:1440-1464 | crates/pyrefly_types/src/types.rs:1467-1480 \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":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0be3408457065404d893c2826530641837926f668ef5920ca2b63d41bb946ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pyrefly/lib/state/state.rs:1331-1339 | pyrefly/lib/state/state.rs:1369-1382 \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":"pyrefly/lib/state/state.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06eb1b218c2192921b508edeaf870335e8367a9a2145579f3ba97a58cc3cc52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/pyrefly_lsp_test/src/object_model.rs:802-832 | crates/pyrefly_lsp_test/src/object_model.rs:1215-1234 \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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1a37ddd00a66d57c83b53ca82d8d2d93231bbebf7129d82446dcf908194bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/pyrefly_types/src/map_int_tuples.rs:178-193 | crates/pyrefly_types/src/map_int_tuples.rs:200-211 \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":"crates/pyrefly_types/src/map_int_tuples.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1256925af93f9b58999fb5179592b8effd5cb17869cb64663725855f314b74f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): pyrefly/lib/state/lsp.rs:2895-2916 | pyrefly/lib/state/lsp/extra_extensions.rs:80-101 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"4661ccde4560cfb3fd727fe9c9507d7f85cf37a5a49dcdde6b2c6e2c1515a4fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): pyrefly/lib/report/pysa/call_graph.rs:3419-3438 | pyrefly/lib/report/pysa/call_graph.rs:4218-4235 \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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":3419}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a5801f910023f05aa766fc5275bc92c39660efa05d77ac1ecb685290b3b95e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): pyrefly/lib/alt/narrow.rs:1424-1438 | pyrefly/lib/alt/narrow.rs:1447-1464 \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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"12047108056c4666ec0b37a9e5a4304178a6199c1ff7781d0743a205f724ad38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): pyrefly/lib/alt/narrow.rs:973-989 | pyrefly/lib/alt/narrow.rs:1021-1034 \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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0cd21f2024ff83f34e543cf776c71729dabdc1b801190b104818a5f15d82fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): pyrefly/lib/lsp/non_wasm/workspace.rs:811-827 | pyrefly/lib/lsp/non_wasm/workspace.rs:831-848 | pyrefly/lib/lsp/non_wasm/workspace.rs:856-872 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce42b207d40bdd19fb7e1abb77b5f661d7161141b74929d51fe00331fdadf47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pyrefly/lib/alt/class/class_field.rs:646-656 | pyrefly/lib/alt/class/class_field.rs:882-892 \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bca771c323cf96cc590765b5102c67a8318ac7d8332a1bb40fe0dd43031821"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pyrefly/lib/stubgen/extract.rs:610-622 | pyrefly/lib/stubgen/extract.rs:628-640 \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":"pyrefly/lib/stubgen/extract.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"b835cea18067b2aed3576fd91e835cba6a0c8a3fd64a82eec8fa308fb20a3523"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): pyrefly/lib/lsp/non_wasm/server.rs:7667-7698 | pyrefly/lib/lsp/non_wasm/server.rs:7707-7725 \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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":7667}}}],"partialFingerprints":{"codehealthFindingId/v1":"232ef8cf8169b4a4b80f93fd66c8cdeacfe762be49a4a699f6ec8f43aa66a73e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/pyrefly_types/src/type_info.rs:228-244 | crates/pyrefly_types/src/type_info.rs:249-267 \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":"crates/pyrefly_types/src/type_info.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab40cd2a4bc22cf3b48dd8ce3db4ed3c6dc06623c4feec204131804b649aafb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/pyrefly_util/src/telemetry.rs:478-508 | crates/pyrefly_util/src/telemetry.rs:516-541 \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":"crates/pyrefly_util/src/telemetry.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a38409833e54e28d5f03c35ce7c1513e89d9e003d4c5d00bdc8f22c3a0793b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): crates/pyrefly_types/src/dimension.rs:584-596 | crates/pyrefly_types/src/dimension.rs:1449-1463 | crates/pyrefly_types/src/dimension.rs:1467-1481 | crates/pyrefly_types/src/dimension.rs:1622-1635 | crates/pyrefly_types/src/shaped_array.rs:765-776 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dadeaa88941725138eddd9f7daad4aa6ea527cfbfc78114246e96db41986d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): pyrefly/lib/alt/call.rs:2974-2989 | pyrefly/lib/alt/call.rs:2999-3014 \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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":2974}}}],"partialFingerprints":{"codehealthFindingId/v1":"977e1699dac66fb28a2ec95a15a7844df790c2a596e4f04d94955b82ff824d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/tsp_types/protocol_generator/generate_protocol.py:681-699 | crates/tsp_types/protocol_generator/generate_protocol.py:705-723 \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":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"156a6b32acf8fc5e74c200964e7a1fa2184356213a11b8925499e079166fda2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): pyrefly/lib/export/exports.rs:447-467 | pyrefly/lib/export/exports.rs:470-490 \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":"pyrefly/lib/export/exports.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"385f0b1b0eff6ddfb078a21741212351e349e391f9f3c1043850b31efe63654a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): pyrefly/lib/alt/solve.rs:5029-5044 | pyrefly/lib/alt/solve.rs:5058-5074 \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":5029}}}],"partialFingerprints":{"codehealthFindingId/v1":"62db6df57d630eb22735a853c3ef7fe047bb5eeabf0ca2b453ff1250985f516c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): pyrefly/lib/binding/bindings.rs:1020-1034 | pyrefly/lib/binding/bindings.rs:1044-1058 \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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"499b1129aa4ddd217b0f716c7b576619bbd52a35758d0450329155d6e2fd247c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): pyrefly/lib/lsp/wasm/completion.rs:915-931 | pyrefly/lib/state/lsp.rs:473-488 \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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bf9b3597ee94a3c1dc04fbde144b0c8953984d244a67a0cd70edce3c687fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pyrefly/lib/report/pysa/types.rs:529-543 | pyrefly/lib/report/pysa/types.rs:545-557 \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":"pyrefly/lib/report/pysa/types.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f28a528b1fce8359fda343c5e66bbe327867a099043e9f81f88788b286ff947"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pyrefly/lib/alt/answers_solver.rs:452-463 | pyrefly/lib/alt/answers_solver.rs:465-476 \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":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efe5d2c62d85c69c385e7c1e7d6bf6b8297963cffe725533d109328e6d99488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pyrefly/lib/commands/lsp.rs:168-177 | pyrefly/lib/commands/tsp.rs:171-190 \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":"pyrefly/lib/commands/lsp.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fbde69911285ffe584845c8cf3cb951646c8a383481f3a6ea286ad9d918864"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pyrefly/lib/query.rs:1303-1312 | pyrefly/lib/query.rs:1327-1340 \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":"pyrefly/lib/query.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41c9246942d817fb550d4c8ff5055db50c4c5feb0d240725679d9229e02e896"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): pyrefly/lib/alt/class/class_field.rs:6839-6865 | pyrefly/lib/alt/class/class_field.rs:6875-6894 \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6839}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfae62c0901da2d7f4c0f8fab56a96037f2565d6b881ae00f249d70c327378b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): pyrefly/lib/binding/scope.rs:3070-3084 | pyrefly/lib/binding/scope.rs:3091-3106 \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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8779a7c3922f8daed5d106d23e66e696ea30651f882c7f36735fa5c9b7e9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pyrefly/lib/commands/check.rs:892-910 | pyrefly/lib/commands/check.rs:916-932 \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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f1870cda24118509a58f29ddadc20e7c89a96e704fe62cb537320eef11ed7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pyrefly/lib/commands/check.rs:958-965 | pyrefly/lib/commands/check.rs:1260-1267 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4d441c3c8055ad16027aedf4b30a57e5915596c3eb5be786e9bf76fbb9392f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pyrefly/lib/alt/answers_solver.rs:345-356 | pyrefly/lib/alt/answers_solver.rs:362-374 \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":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ed47efb69188d9674f3b68e2aee9172be0ee61fbeebdae9b20624b29a80bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pyrefly/lib/report/pysa/capnp_writer.rs:372-381 | pyrefly/lib/report/pysa/capnp_writer.rs:543-556 \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":"pyrefly/lib/report/pysa/capnp_writer.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe5b15100f096af8fca6d448a7ba24522a01112e992ed440df6d664e302cb2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): pyrefly/lib/lsp/wasm/signature_help.rs:354-371 | pyrefly/lib/lsp/wasm/signature_help.rs:378-393 \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":"pyrefly/lib/lsp/wasm/signature_help.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"061ee91e1cc8f2e998274183313d80879764bdca67f5cb1f63a19279b788a0cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): pyrefly/lib/tsp/type_conversion.rs:623-639 | pyrefly/lib/tsp/type_conversion.rs:695-710 \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":"pyrefly/lib/tsp/type_conversion.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be1db91e8a012ac2aaa7629f586f0e35385ac75a72450a38dcaff8b4049c139"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pyrefly/lib/report/cinderx/convert.rs:126-135 | pyrefly/lib/report/cinderx/convert.rs:163-171 \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":"pyrefly/lib/report/cinderx/convert.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"34819ae8b634c2d8d915a6ab51eb0c675d3671bbc7afdc0e367e4b1aa5e2ea97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pyrefly/lib/state/lsp/quick_fixes/convert_star_import.rs:169-176 | pyrefly/lib/state/lsp/quick_fixes/extract_shared.rs:531-538 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/convert_star_import.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f664f311ebb0b44e48bafb4ed31d1f401ce47f6c50e21d2101ea06e1d3caa5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pyrefly/lib/alt/class/class_field.rs:923-933 | pyrefly/lib/alt/class/class_field.rs:1027-1039 \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"980ed210f7ba6a5d6ba17bcbc56688ec166a735c74b65aa9e445d166462750fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pyrefly/lib/binding/scope.rs:694-704 | pyrefly/lib/binding/scope.rs:2881-2891 \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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63e85d8653a68d3f4235d8e43920872374d5428fd85649e7f4a17a3b549adbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): pyrefly/lib/lsp/non_wasm/workspace.rs:645-657 | pyrefly/lib/lsp/non_wasm/workspace.rs:664-678 | pyrefly/lib/lsp/non_wasm/workspace.rs:680-692 | pyrefly/lib/lsp/non_wasm/workspace.rs:695-707 | pyrefly/lib/lsp/non_wasm/workspace.rs:710-722 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9e4f8149563e716831a47a2550a7190cd82b4cdcd05eb5b9367119f7571e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/pyrefly_lsp_test/src/object_model.rs:1626-1635 | crates/pyrefly_lsp_test/src/object_model.rs:1639-1652 \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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed11185471811db1f07f5f8c838d63c56729598bc6a3bebca922236b9c49a43e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/pyrefly_types/src/literal.rs:162-169 | crates/pyrefly_types/src/literal.rs:172-179 | crates/pyrefly_types/src/literal.rs:182-192 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/literal.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f780869d69a84c001abadc58d44f3a065ba76bf974de6d720e268e8629d60feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): pyrefly/lib/alt/class/class_field.rs:1013-1025 | pyrefly/lib/alt/class/class_field.rs:1057-1078 | pyrefly/lib/alt/class/class_field.rs:1212-1222 | pyrefly/lib/alt/class/class_field.rs:1245-1258 | pyrefly/lib/alt/class/class_field.rs:1308-1320 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf86e8660fcef020486f8a4c2f5f731b710c39e60f8b17ec213e3fe2735575b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): pyrefly/lib/alt/int_list_literal.rs:26-39 | pyrefly/lib/alt/regular_nested_list.rs:40-54 \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":"pyrefly/lib/alt/int_list_literal.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdb4b8b8c5003803277d8d17d08ff5868d2ce9486f613bb5b1174150a59bfe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pyrefly/lib/tsp/type_conversion.rs:1039-1051 | pyrefly/lib/tsp/type_conversion.rs:1054-1066 \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":"pyrefly/lib/tsp/type_conversion.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e49f2bcaf5b1188a664f8a2749d31e7094fdb8db718cbeb9bc54e169554b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pyrefly/lib/alt/class/attrs.rs:69-81 | pyrefly/lib/alt/class/attrs.rs:86-98 \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":"pyrefly/lib/alt/class/attrs.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e7fda58a5abc931a767dbdf484229a1076d69ae71f626cdeef412f4d8205b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pyrefly/lib/report/pysa/types.rs:175-185 | pyrefly/lib/report/pysa/types.rs:187-197 \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":"pyrefly/lib/report/pysa/types.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9534db85b2984c430fc48c399caa92a95b87a6b70f8e69e307a314dde78c8851"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/pyrefly_python/src/qname.rs:133-141 | crates/pyrefly_python/src/qname.rs:153-161 \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":"crates/pyrefly_python/src/qname.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"618e49a6bcdbc2c5ddb05dd46e8dfa3d826988c127aa61b5011b890408435c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/pyrefly_python/src/qname.rs:143-149 | crates/pyrefly_python/src/qname.rs:163-174 \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":"crates/pyrefly_python/src/qname.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a129462a63ad3a3ec2b84c2d4a1d2660059528f6a2209a75b51091c32cbe5f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/pyrefly_types/src/dimension.rs:235-249 | crates/pyrefly_types/src/dimension.rs:290-304 | crates/pyrefly_types/src/dimension.rs:322-336 \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":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a98241b6c41e51e9f1757d6e15e5a1c36b6acbca4bf947031094376da340f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/pyrefly_util/src/ruff_visitors.rs:44-56 | crates/pyrefly_util/src/ruff_visitors.rs:61-73 \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":"crates/pyrefly_util/src/ruff_visitors.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3c35c0fe03ce31d5fd265ae746a0213967c48827dec0a607e25d270326c0b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): pyrefly/lib/query/type_table.rs:210-226 | pyrefly/lib/query/type_table.rs:232-240 | pyrefly/lib/query/type_table.rs:247-261 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/query/type_table.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25c675769efa57b9de864bc2e5f1693fafcf10fc33e64c294ddedc0b04ef12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/pyrefly_lsp_test/src/object_model.rs:620-631 | crates/pyrefly_lsp_test/src/object_model.rs:639-653 | crates/pyrefly_lsp_test/src/object_model.rs:669-686 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f0dbe65375e11e4c40ddacfe85f65f45548010d4dd28adf53524892e283534"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pyrefly/lib/report/cinderx/types.rs:241-252 | pyrefly/lib/report/cinderx/types.rs:294-303 \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":"pyrefly/lib/report/cinderx/types.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff52fb35ada290d122fe93147a1e8cfe88a6dbaa0c1d37bce4abf1992e59d555"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pyrefly/lib/solver/solver.rs:433-440 | pyrefly/lib/solver/solver.rs:442-449 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c5a0092a2b817463a37ab6bc9bdbabbcf17444ec354ca0859981d42d9920ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pyrefly/lib/state/lsp.rs:3558-3575 | pyrefly/lib/state/lsp.rs:3621-3637 \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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":3558}}}],"partialFingerprints":{"codehealthFindingId/v1":"328dac04d7bb10da1cce7e33f4d283a9e6bbe0978ec70f5590ddcc2cd0013e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pyrefly/lib/state/lsp/quick_fixes/inline_variable.rs:154-165 | pyrefly/lib/state/lsp/quick_fixes/inline_variable.rs:167-179 \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":"pyrefly/lib/state/lsp/quick_fixes/inline_variable.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c85f5ed0f8fc83817e158b7517e2aa7b31fe9ffed8922d26c1d30ccbcc839da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): pyrefly/lib/alt/unwrap.rs:190-205 | pyrefly/lib/alt/unwrap.rs:298-308 | pyrefly/lib/alt/unwrap.rs:311-321 | pyrefly/lib/alt/unwrap.rs:346-356 | pyrefly/lib/alt/unwrap.rs:358-368 | pyrefly/lib/alt/unwrap.rs:370-380 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/unwrap.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c71bfa524e416166e65f3e9568c0fdc8dec2ba7d26a7627c7bf4b4151cabf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pyrefly/lib/error/baseline.rs:206-216 | pyrefly/lib/state/errors.rs:372-384 \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":"pyrefly/lib/error/baseline.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5ed59100390b22ff21a865eca6854175f3712878280cfda1b328a38f3e3590"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pyrefly/lib/query/type_table.rs:603-611 | crates/pyrefly_types/src/callable.rs:910-918 \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":"pyrefly/lib/query/type_table.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd9a005c2a983d6f9cb756db07b6aacfba7b98c447e027749d39058234e3702"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/pyrefly_build/src/source_db/map_db.rs:77-83 | crates/pyrefly_build/src/source_db/map_db.rs:91-97 \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":"crates/pyrefly_build/src/source_db/map_db.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65e9bbc773b06d83fe8e0ececee57ecaf8347efcf5b9e7afd16d13616d9e538"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): crates/pyrefly_lsp_test/src/object_model.rs:484-494 | crates/pyrefly_lsp_test/src/object_model.rs:524-536 | crates/pyrefly_lsp_test/src/object_model.rs:710-718 | crates/pyrefly_lsp_test/src/object_model.rs:721-729 | crates/pyrefly_lsp_test/src/object_model.rs:732-740 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"99575bb89564decab61862e6cbfadf3938077e7a24c97d87fc664aab67199367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): pyrefly/lib/alt/expr.rs:4631-4649 | pyrefly/lib/alt/expr.rs:5223-5230 | pyrefly/lib/alt/type_level_dsl.rs:1214-1227 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":4631}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7897f9f0e9a1f326a2b3c3ca20a742a8b48575562c77649e3af3f3f7a0da6cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/pyrefly_util/src/suggest.rs:147-153 | pyrefly/lib/binding/scope.rs:449-454 \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":"crates/pyrefly_util/src/suggest.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ddaa40cced62fe22d44d1822f159aec9c9fdbeda681ce89548080fdc8e09fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pyrefly/lib/state/state.rs:3265-3275 | pyrefly/lib/state/state.rs:3328-3339 \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":"pyrefly/lib/state/state.rs"},"region":{"startLine":3265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2b68d2ac1c7212920d4ff0fd57702ed27e81a9e0044af13b2cd012fd39bbc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pyrefly/lib/alt/answers_solver.rs:1136-1148 | pyrefly/lib/alt/answers_solver.rs:1400-1410 \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":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"63484de99b66edd7349944c51b27d741f45109f74e941955d54daf09a7b4606a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/pyrefly_types/src/shaped_array.rs:887-902 | pyrefly/lib/solver/subset.rs:989-1004 \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":"crates/pyrefly_types/src/shaped_array.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"6899b603c42ef597bb8a8ea3ba1e949c5dd0218f4873079ddcb79aa931bb764e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/pyrefly_types/src/types.rs:2120-2130 | crates/pyrefly_types/src/types.rs:2132-2142 | pyrefly/lib/alt/class/class_field.rs:6897-6907 \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":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5a6ee2eec1e3ce98867fb67c7f7e76ef51c97a5a9a9a5df3f82a4d1658012e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/pyrefly_types/src/types.rs:2188-2195 | crates/pyrefly_types/src/types.rs:2275-2281 \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":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb8c322886e3de259851396e5afdb77c034f7afdcbca99b6c6b23a7c6cc3dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pyrefly/lib/state/lsp/quick_fixes/enum_member.rs:45-54 | pyrefly/lib/state/lsp/quick_fixes/redundant_cast.rs:20-29 \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":"pyrefly/lib/state/lsp/quick_fixes/enum_member.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9f9894530ffd3ab9d447395b5e2041d0a8a6367bdcee9974e04ca119ab8b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/pyrefly_config/src/migration/mypy/pyproject.rs:310-335 | crates/pyrefly_config/src/migration/pyright.rs:106-134 \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":"crates/pyrefly_config/src/migration/mypy/pyproject.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"210625cde6d775ce6df9c7e906971aa9e2549125a5b46a197f2989637d49abb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/pyrefly_derive/src/type_eq.rs:20-26 | crates/pyrefly_derive/src/visit.rs:47-53 \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":"crates/pyrefly_derive/src/type_eq.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"810cd1e49e6ba5d7cb52b5fa56b1fd2dc63baf3e155e57ad5c891c728bf9361b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/pyrefly_types/src/callable.rs:958-962 | crates/pyrefly_types/src/type_alias.rs:128-132 \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":"crates/pyrefly_types/src/callable.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f43c3fff113aaa795d7983d37b70d22028bb571b4e848d75809045c611ca82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pyrefly/lib/lsp/non_wasm/server.rs:3520-3529 | pyrefly/lib/lsp/wasm/completion.rs:176-184 \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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd32dfcaa8359ad58ff47646ddff13f2c41f2c095c4f5c17e65d9de1e231c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/pyrefly_types/src/types.rs:551-557 | crates/pyrefly_types/src/types.rs:705-712 \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":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"074f22a9bc7148fb9de74503d6a75eac5c737465f33d32c290ca12d4ae70d2c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/pyrefly_python/src/ast.rs:226-236 | pyrefly/lib/binding/stmt.rs:204-215 \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":"crates/pyrefly_python/src/ast.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d4cdcf397bcdbff2e5754989c1aa18aaf74a8fa9a5921c5d4a93e858770d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pyrefly/lib/state/errors.rs:171-182 | crates/pyrefly_python/src/ignore.rs:756-762 \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":"pyrefly/lib/state/errors.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b074e25f006676f50d804702b25f904172f68f9841aaf38dd754e3baa502f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/pyrefly_python/src/module_name.rs:583-589 | pyrefly/lib/lsp/wasm/hover.rs:483-490 \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":"crates/pyrefly_python/src/module_name.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a60641757718605983678c2ad2a1578fffc128a04100df0bafce3ec8fe62ff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): pyrefly/lib/state/lsp/quick_fixes/extract_field.rs:106-116 | pyrefly/lib/state/lsp/quick_fixes/extract_function.rs:312-321 | pyrefly/lib/state/lsp/quick_fixes/move_members.rs:155-165 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/extract_field.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a769b7353b854e99d5cef4ac8b50555ffa27bbe8e1af26a584265f2452e4573"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/pyrefly_python/src/ast.rs:130-139 | pyrefly/lib/binding/function.rs:159-167 | pyrefly/lib/state/lsp/quick_fixes/extract_shared.rs:255-265 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_python/src/ast.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af25dbdeff94ee821de27720e282ebafa5c205f30a39f5d5c40d721992f7194"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pyrefly/lib/report/scip/symbols.rs:399-405 | pyrefly/lib/state/lsp/fastapi_endpoint_support/association_summary.rs:273-279 \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":"pyrefly/lib/report/scip/symbols.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf06c3707c05d9c6759676b32678111c6d463f54f4c94566ae3a40cd85a44b3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): pyrefly/lib/alt/class/class_field.rs:1484-1489 | pyrefly/lib/alt/narrow.rs:1390-1398 \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5459390c4d322fa0194ecf3c138599e89019584e5a9877ebb04e6346d2ff4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/pyrefly_util/src/small_map1.rs:63-68 | crates/pyrefly_util/src/small_set1.rs:63-68 \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":"crates/pyrefly_util/src/small_map1.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4da9f6f8ae7d29efa7c2c62608cd8e9292b8f4a730e2ffc334c5e834404167"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pyrefly/lib/lsp/non_wasm/type_hierarchy.rs:49-56 | pyrefly/lib/state/lsp/quick_fixes/move_members.rs:240-247 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/type_hierarchy.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c957e9c985de84d2458133c73dc6b02a8134f6e738a9382bb7427eab71b0aaef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pyrefly/lib/commands/buck_check.rs:311-320 | pyrefly/lib/commands/check.rs:678-687 \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":"pyrefly/lib/commands/buck_check.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"726688cb10dae4c68658afe01c77f176fa13f75af346b99eda09a95d1e9792bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/pyrefly_types/src/type_var.rs:233-242 | crates/pyrefly_types/src/type_var_tuple.rs:85-92 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_var.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7fef6f0c4d24357c4542c3aeeca1d0e6082dcc406b88a0a5f4424f143fd061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201340 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/document_symbols.rs:89-128 | pyrefly/lib/lsp/non_wasm/document_symbols.rs:143-179 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/non_wasm/document_symbols.rs:89\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":"pyrefly/lib/lsp/non_wasm/document_symbols.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd33847a5f65a10d738954a13bfe930aabc6286d4b5bc314607a8e8e01a6a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:364-399 | pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs:490-525 \u2014 before extracting anything, compare \u0060pyrefly/lib/state/lsp/quick_fixes/change_signature.rs\u0060 and \u0060pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 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 \u0060pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:364\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":"pyrefly/lib/state/lsp/quick_fixes/change_signature.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96d63b387efa69d0c342c1a32948382e5183e2333fa8ce9de1d6bd0fb57e2d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201333 lines \u00D7 2): pyrefly/lib/alt/narrow.rs:1776-1806 | pyrefly/lib/alt/narrow.rs:1857-1889 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/narrow.rs:1776\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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2f78f329b4feac3ab7abf3f350edace7292e4a0de8dd8f6d0be502a99492f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201333 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/server.rs:7125-7157 | pyrefly/lib/lsp/non_wasm/server.rs:7282-7308 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/non_wasm/server.rs:7125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060lsp_types::CallHierarchyPrepareParams\u0060 in one and \u0060lsp_types::TypeHierarchyPrepareParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":7125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e744097954a4803ee87b5859b97b4aa57a750db1ff5e354a7bfbb39cc27ca7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/pyrefly_config/src/args.rs:493-521 | pyrefly/lib/commands/check.rs:531-559 \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 \u0060crates/pyrefly_config/src/args.rs:493\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":"crates/pyrefly_config/src/args.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3b14dde83907b18823329a6ac1db7ea0c221dfafeea3e2df7fac3f6a24d3e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): pyrefly/lib/report/pysa/call_graph.rs:2331-2358 | pyrefly/lib/report/pysa/call_graph.rs:2362-2389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"3585e2a2fa3d394fe117efdf7e8f00ce44b7353e87141098086f46dfe0c07000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): pyrefly/lib/alt/solve.rs:4871-4892 | pyrefly/lib/alt/solve.rs:4910-4932 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/solve.rs:4910\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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4871}}}],"partialFingerprints":{"codehealthFindingId/v1":"e707cf8902256816e2ddaab3608ebbad26a945bfb0a7c9485a94e74dcb2cc42a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/move_module.rs:643-665 | pyrefly/lib/state/lsp/quick_fixes/move_module.rs:681-703 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/state/lsp/quick_fixes/move_module.rs:643\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":"pyrefly/lib/state/lsp/quick_fixes/move_module.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6949b8484a7ec9e31caab280eeea4c8a5df3ccdcd8340c4e354f92242cdfb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): pyrefly/lib/alt/solve.rs:7295-7316 | pyrefly/lib/alt/solve.rs:7328-7349 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/solve.rs:7295\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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7295}}}],"partialFingerprints":{"codehealthFindingId/v1":"331f3d22f16c15add81607edbd5ce3556b3081532c503bd1bb83ecb338eb2e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): pyrefly/lib/report/cinderx/convert.rs:91-112 | pyrefly/lib/report/cinderx/convert.rs:390-411 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/report/cinderx/convert.rs:91\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":"pyrefly/lib/report/cinderx/convert.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d716cdede800fc065c60bf2598246593d1b140432ebf55a1fcd24836e873f6fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/pyrefly_util/src/telemetry.rs:485-504 | crates/pyrefly_util/src/telemetry.rs:520-540 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_util/src/telemetry.rs:520\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":"crates/pyrefly_util/src/telemetry.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bda230a9b0afa7123c93625fd2d8e3f5294c1b33295a75419976bf8c22b1d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): pyrefly/lib/alt/class/class_field.rs:965-985 | pyrefly/lib/alt/class/class_field.rs:987-1007 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/class/class_field.rs:965\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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dfc2ea82221de5de1f39154ba696c5b57635cda6c2a75a83de57e8843db430"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 3): pyrefly/lib/alt/solve.rs:7297-7316 | pyrefly/lib/alt/solve.rs:7330-7349 | pyrefly/lib/alt/solve.rs:7548-7565 \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 \u0060pyrefly/lib/alt/solve.rs:7297\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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7297}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d9558d94a21d076fc640f6906fa6763232ab7f2a931febf20431f61edd034f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:4170-4189 | crates/pyrefly_types/src/type_level_dsl.rs:4210-4229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":4170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d02592091cab5598ff00da6a0ba86f2045b4a0f1f4f2496d395ce11741c5e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): pyrefly/lib/commands/check.rs:1488-1507 | pyrefly/lib/lsp/non_wasm/type_error_display_status.rs:275-294 \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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cf89176e083c16f7717276af23be050dc566af115ff059cb4958079963a8d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/pyrefly_derive/src/type_eq.rs:31-49 | crates/pyrefly_derive/src/visit.rs:63-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note 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":"crates/pyrefly_derive/src/type_eq.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"941fdbb44f05c823e011e43b5839bbddcec6e25b56b613b20314ae35061b00ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): pyrefly/lib/alt/solve.rs:6451-6469 | pyrefly/lib/alt/solve.rs:6512-6530 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/solve.rs:6451\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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":6451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca913fccad6811d84cbce8e906476ce61f9c0d73bfae73b14179f8117ef27b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): pyrefly/lib/alt/narrow.rs:1999-2015 | pyrefly/lib/alt/narrow.rs:2026-2042 | pyrefly/lib/alt/narrow.rs:2058-2074 \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 \u0060pyrefly/lib/alt/narrow.rs:1999\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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09d361d238195a29fee87320330074cc9b5e5c89d124cef99fdd329aa00a391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/pyrefly_lsp_test/src/object_model.rs:1853-1869 | crates/pyrefly_lsp_test/src/object_model.rs:1895-1911 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5848df10293a41b6a34045a9f825cc7ff39927795d0102e7718efee4a98a30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): pyrefly/lib/alt/attr.rs:3424-3438 | pyrefly/lib/alt/attr.rs:3441-3456 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/attr.rs:3424\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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dd8655762a9573655540aee88da88aebd98c97a6efa898f8a819022bed983f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pyrefly/lib/alt/function.rs:1598-1613 | pyrefly/lib/alt/function.rs:1632-1647 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/function.rs:1598\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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed2bfac9f5d630528cb29cb87045df30e9d1fa0cf060195844b35f9b069841d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pyrefly/lib/binding/narrow.rs:954-969 | pyrefly/lib/binding/narrow.rs:987-1002 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/binding/narrow.rs:954\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":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"2846b94ebe1bcffa02c301f9a300a1e7cd106b5aae11629a8e61976b8eb58dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pyrefly/lib/state/lsp.rs:2286-2301 | pyrefly/lib/state/lsp.rs:2317-2332 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/state/lsp.rs:2286\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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7856b44308f4e81133f6cb97253f55ac94be97a7b178a6c7ed70fedc2959ed86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/pyrefly_types/src/display.rs:994-1008 | crates/pyrefly_types/src/display.rs:1010-1024 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ded8c8dfea54120e3a8ad410858e070bf63fb42eeed45b4e45fdbd70d69a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pyrefly/lib/alt/attr.rs:2197-2211 | pyrefly/lib/alt/attr.rs:2319-2333 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/attr.rs:2197\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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"297f53954001a3c8329c78b539cefba1cbd7bca09e6c972c8a5ae7e85210b1bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pyrefly/lib/alt/class/pydantic.rs:771-785 | pyrefly/lib/alt/class/pydantic.rs:1314-1328 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/class/pydantic.rs:771\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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60c8c7f6be720aab40a7fedb0fdbd3774b61f43c25792d2b76c2a7c13d6dd09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): pyrefly/lib/alt/polars_specials.rs:3263-3276 | pyrefly/lib/alt/polars_specials.rs:3381-3395 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/polars_specials.rs:3263\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, \u0060pyrefly/lib/alt/polars_specials.rs:3277\u0060 calls \u0060Some\u0060, \u0060resolve_column\u0060 and \u0060pyrefly/lib/alt/polars_specials.rs:3396\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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4350dad7da9237223204d4f547a0d1a2f70097be1de93a61872d2aa1a967909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pyrefly/lib/binding/class.rs:849-863 | pyrefly/lib/binding/class.rs:896-910 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/binding/class.rs:849\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":"pyrefly/lib/binding/class.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c2038936135eb88d653517cce1abc37739d54a413e870f19c21579c4d9d200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/server.rs:7348-7362 | pyrefly/lib/lsp/non_wasm/server.rs:7401-7415 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/non_wasm/server.rs:7348\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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":7348}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b38ab94aff5c032f92960322c3602f7f4bb9d1e812adb2e4fa7ac16be00855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pyrefly/lib/report/pysa/ast_visitor.rs:345-359 | pyrefly/lib/report/pysa/ast_visitor.rs:453-467 \u2014 both copies are in the same file, so extract the block 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, \u0060pyrefly/lib/report/pysa/ast_visitor.rs:362\u0060 calls \u0060Some\u0060 and \u0060pyrefly/lib/report/pysa/ast_visitor.rs:469\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":"pyrefly/lib/report/pysa/ast_visitor.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0529e8c20db519234a066b9527796f8730cbab240d3410fa624c67e08e2c8ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pyrefly/lib/solver/solver.rs:1184-1198 | pyrefly/lib/solver/solver.rs:1249-1263 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e734170417e4679db6cc4578194a5745c194b5a9691e4088148361350953b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:401-415 | pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs:527-541 \u2014 before extracting anything, compare \u0060pyrefly/lib/state/lsp/quick_fixes/change_signature.rs\u0060 and \u0060pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 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 \u0060pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:401\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":"pyrefly/lib/state/lsp/quick_fixes/change_signature.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46527e56a74dafa8d85960e7406573bb0a19b30bb834372a237bd433da402ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:8323-8336 | crates/pyrefly_types/src/type_level_dsl.rs:8431-8444 \u2014 both copies are in the same file, so extract the block 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0146c960982f458349f17098c26cfbf5c05f7c874d714d973796a1152fc2b20f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pyrefly/lib/alt/attr.rs:2963-2976 | pyrefly/lib/alt/attr.rs:2987-3000 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2963}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb65aaada8efc48643bd503ba30faf575adcf578f65907135e98030b062d37d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): pyrefly/lib/alt/call.rs:867-880 | pyrefly/lib/alt/call.rs:886-897 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/call.rs:867\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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"429f9944c47c3b17f38d8df98244c490c8590b192113fae2c59da8a19a7b40b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pyrefly/lib/alt/call.rs:2697-2710 | pyrefly/lib/alt/call.rs:2720-2733 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/call.rs:2697\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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfef2577ba5b987089c057e6c5715aedfec79d4504a2a117e04df3131b5aba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): pyrefly/lib/alt/class/class_field.rs:6256-6269 | pyrefly/lib/alt/class/class_field.rs:6634-6646 \u2014 both copies are in the same file, so extract the block 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, \u0060pyrefly/lib/alt/class/class_field.rs:6647\u0060 calls \u0060Some\u0060 and \u0060pyrefly/lib/alt/class/class_field.rs:6270\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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6256}}}],"partialFingerprints":{"codehealthFindingId/v1":"81799e4a9e99320c67233480297c4ff94b07f7e8e2833d23f6d56a838c0f3a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pyrefly/lib/alt/class/class_metadata.rs:1457-1470 | pyrefly/lib/alt/class/class_metadata.rs:1490-1503 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"383214a6deb0cbb1d46fbf161e819acdd4cc38c89726f8e8fc6812b5761fe4b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): pyrefly/lib/alt/expr.rs:2680-2693 | pyrefly/lib/alt/expr.rs:2717-2729 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/expr.rs:2680\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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"db928a8cd2269e47eaf94e1c7d653c61032be6f72ff821dcfb24aa5021e62232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pyrefly/lib/alt/polars_specials.rs:3298-3311 | pyrefly/lib/alt/polars_specials.rs:3330-3343 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/polars_specials.rs:3298\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, \u0060pyrefly/lib/alt/polars_specials.rs:3295\u0060 calls \u0060chain\u0060, \u0060get\u0060, \u0060unwrap_or\u0060 and \u0060pyrefly/lib/alt/polars_specials.rs:3327\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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ec1674e826177711b7c39118c84a937bbaf0df8edfb50baa2e89f631f08089"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pyrefly/lib/alt/solve.rs:6007-6020 | pyrefly/lib/alt/solve.rs:7326-7339 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/solve.rs:6007\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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":6007}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02c104512f6a6f91f73901e0807009fc5e371b1e44a2735d64a562fa355c072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pyrefly/lib/lsp/wasm/completion.rs:787-800 | pyrefly/lib/lsp/wasm/completion.rs:819-832 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/wasm/completion.rs:787\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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"18733a45152c0e82e4c174f2903b059d71c8895f23bfc39ecb4e92b9d8e2abb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): pyrefly/lib/lsp/wasm/completion.rs:917-928 | pyrefly/lib/state/lsp.rs:474-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 \u0060pyrefly/lib/lsp/wasm/completion.rs:917\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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca0c72583b6300c60f4cb8165869dd21222b9156e8c6944da323af05e5e47b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pyrefly/lib/playground.rs:379-392 | pyrefly/lib/playground.rs:407-420 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/playground.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f317a311b0606590f015472674bb79a523790d2dfc53425e5bb7c1986f5b6ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 3): pyrefly/lib/alt/function.rs:3084-3092 | pyrefly/lib/alt/function.rs:3136-3144 | pyrefly/lib/alt/function.rs:3181-3193 \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 \u0060pyrefly/lib/alt/function.rs:3084\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, \u0060pyrefly/lib/alt/function.rs:3147\u0060 calls \u0060for_display\u0060, \u0060clone\u0060 and \u0060pyrefly/lib/alt/function.rs:3095\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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d640f79f5abc24a21fe82871b8b1b93ea66fa4d052ea3dfe1c77547270c5366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): pyrefly/lib/alt/class/class_field.rs:6385-6397 | pyrefly/lib/alt/class/class_field.rs:6590-6601 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/class/class_field.rs:6385\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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6385}}}],"partialFingerprints":{"codehealthFindingId/v1":"244411b309299a1e9fa36a73498915fe77f31014daefd210c141f3ba5d51ef9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): pyrefly/lib/alt/class/variance_inference.rs:664-676 | pyrefly/lib/alt/class/variance_inference.rs:686-695 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/alt/class/variance_inference.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ec478e2d32a2a727967f027af7a41e9f2f240bd1910fa4e5ff3cf1bc06304d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): pyrefly/lib/alt/narrow.rs:671-682 | pyrefly/lib/alt/narrow.rs:2152-2164 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/narrow.rs:671\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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7e4540f17f29c7ce520eacb2a5b0c19dd8da3e3c087204482b3b1da852b2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): pyrefly/lib/alt/operators.rs:831-839 | pyrefly/lib/alt/operators.rs:1056-1068 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/operators.rs:831\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb8a958049b24e8d47f0449e0c99caa093c7ae792868f9641ab2b703434e644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pyrefly/lib/alt/polars_specials.rs:3319-3331 | pyrefly/lib/alt/polars_specials.rs:3351-3363 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/polars_specials.rs:3319\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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3319}}}],"partialFingerprints":{"codehealthFindingId/v1":"103f202d11c13226e2e8370c0a109bd8d595734ac10a32ed680552048f489f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pyrefly/lib/alt/unwrap.rs:263-275 | pyrefly/lib/alt/unwrap.rs:283-295 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/unwrap.rs:263\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":"pyrefly/lib/alt/unwrap.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98e18f7fc9e047ba8bf7175a864f4734fd4115d243c4a89107238f3793d6a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): pyrefly/lib/commands/infer.rs:345-354 | pyrefly/lib/commands/stubgen.rs:62-74 \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":"pyrefly/lib/commands/infer.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c79032bd8609bf5fbb325766247cd13335e8460ae58b39adbf38dd572a74af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/server.rs:5777-5789 | pyrefly/lib/lsp/non_wasm/server.rs:7034-7045 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/non_wasm/server.rs:5777\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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5777}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccec0729e37ebaa7c48756647e7cd25736d5ec5b599d7d51c9d67d1dede91e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): pyrefly/lib/lsp/wasm/signature_help.rs:355-367 | pyrefly/lib/lsp/wasm/signature_help.rs:379-390 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/lsp/wasm/signature_help.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd35f2acd6340109273b1c08f1360b2ef1e7c22d15256bc83b131e0ac387370c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pyrefly/lib/query/type_table.rs:290-302 | pyrefly/lib/query/type_table.rs:451-463 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/query/type_table.rs:290\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/query/type_table.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dc71c99ed6ec06d43f148101f5c0a75431cfaeece27bbf133d6045a38df18b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pyrefly/lib/report/cinderx.rs:168-180 | pyrefly/lib/report/cinderx.rs:200-212 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/report/cinderx.rs:168\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":"pyrefly/lib/report/cinderx.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc545abcd7d57b0a61e410d4c373f3cfcbbb7fe7f59ee883aaa1ec230e35268"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/pyrefly_types/src/type_level_dsl.rs:8328-8339 | crates/pyrefly_types/src/type_level_dsl.rs:8357-8368 | crates/pyrefly_types/src/type_level_dsl.rs:8436-8447 \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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:8328\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b60f8b01d980c274c65319aba8fb0e83472d743c3745ec81f41bda498934c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/pyrefly_types/src/display.rs:1340-1351 | crates/pyrefly_types/src/display.rs:1559-1570 \u2014 both copies are in the same file, so extract the block 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":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d765ac54aedd4b4b21b6fe219683408c5ad66d8e9cda0e6a94f222eff93b48de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/pyrefly_types/src/einsum.rs:201-212 | crates/pyrefly_types/src/einsum.rs:233-244 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/einsum.rs:201\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":"crates/pyrefly_types/src/einsum.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"949c6cc037d20ad90e886cd652e03fb3d4d4278b413a2a1fa91a9299c942724f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:2646-2657 | crates/pyrefly_types/src/type_level_dsl.rs:3938-3947 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:2646\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"74998eec770b16d40bcff96b1c7977372728b8736f209b22aad1be72d72b6328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:6758-6769 | crates/pyrefly_types/src/type_level_dsl.rs:6781-6792 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:6758\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2866d30879079003aa29e75b7eba149d75d50edb49bbe81a2e907fd154ee6de0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:7372-7383 | crates/pyrefly_types/src/type_level_dsl.rs:7449-7460 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:7372\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":7372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9ca4c780f63af041b64919e18a0ba77003df6b094f6519e4132baab73a76fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): pyrefly/lib/alt/class/class_field.rs:1264-1275 | pyrefly/lib/alt/class/class_field.rs:1280-1290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3c312afd73e5e0ad1b0083e18280fb8a7470c4bbbe94cfda46a63661fb7947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): pyrefly/lib/alt/operators.rs:821-830 | pyrefly/lib/alt/operators.rs:930-941 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/operators.rs:821\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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df373d1449cf55f1b36c2d54ab651da61d387bc5cf9946a747bccadda461b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/server.rs:5185-5195 | pyrefly/lib/lsp/non_wasm/server.rs:5794-5805 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/non_wasm/server.rs:5185\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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80653d6709bbeb0be25289d191d40ba37bdf90ef8b2d2937f141d9d9614aa3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pyrefly/lib/lsp/wasm/inlay_hints.rs:568-580 | pyrefly/lib/state/lsp.rs:1291-1303 \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":"pyrefly/lib/lsp/wasm/inlay_hints.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2684e0c1a247a6aa59210748013b26ecc6f5d8c36e68cccbb808d1eefe8a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pyrefly/lib/solver/subset.rs:912-923 | pyrefly/lib/solver/subset.rs:926-937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pyrefly/lib/solver/subset.rs:912\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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cb795934d3b697cbcf25125f7c8b3d7968542fa5973c1a3f697c4ac557ba76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pyrefly/lib/state/lsp.rs:1133-1144 | pyrefly/lib/state/lsp.rs:1167-1178 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/state/lsp.rs:1133\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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a698f61c5b15e7e19bc36017e213691e5bf7bbcca2660826370d5c398d9240c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): pyrefly/lib/state/lsp.rs:2671-2682 | pyrefly/lib/state/lsp.rs:2688-2698 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/state/lsp.rs:2671\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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f814470d08d8c479a6dabe553822d11ba163e5d56fefb820fef1b3e238fbb0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): pyrefly/lib/state/lsp.rs:3887-3897 | pyrefly/lib/state/lsp.rs:3899-3910 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/state/lsp.rs:3887\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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":3887}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e2f3ff56e32de6ff344fa71af73d6d7877e1c1c39de9649a3a6303e86104a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pyrefly/lib/state/lsp.rs:4181-4192 | pyrefly/lib/state/lsp.rs:4208-4219 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":4181}}}],"partialFingerprints":{"codehealthFindingId/v1":"315c4fcbc49523b7da3b963daddba75e5dd41b1b8d759a9e28b3780345992ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/pyrefly_lsp_test/src/object_model.rs:436-446 | crates/pyrefly_lsp_test/src/object_model.rs:454-464 | crates/pyrefly_lsp_test/src/object_model.rs:472-482 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bcfa04af787174d8569f49ba479af30c47dff73a011da769811b5d310adab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): pyrefly/lib/query/type_table.rs:289-299 | pyrefly/lib/query/type_table.rs:450-460 | pyrefly/lib/query/type_table.rs:508-518 \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 \u0060pyrefly/lib/query/type_table.rs:289\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":"pyrefly/lib/query/type_table.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00c2a5bc4ea88f5360cbe22036f5867a9aced687b154c2682a7ac2522dce236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pyrefly_lsp_test/src/object_model.rs:562-572 | crates/pyrefly_lsp_test/src/object_model.rs:603-613 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9c9dc24075c022e63e44e38c06d22f54bab977cf3214544bf6bf2a89510914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pyrefly_types/src/shape_index.rs:99-109 | crates/pyrefly_types/src/shape_index.rs:288-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 \u0060crates/pyrefly_types/src/shape_index.rs:99\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":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0e2beec0f785a595af1252bfa768efaebec32ae65a3d705834f007fd531e01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pyrefly/lib/alt/shape_extension.rs:112-122 | pyrefly/lib/alt/shape_flag.rs:186-196 \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 \u0060pyrefly/lib/alt/shape_extension.rs:112\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":"pyrefly/lib/alt/shape_extension.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1af29a0d0f5e5942fa2bc87056965904dd63b8961948bc66d6baf0e983294e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): pyrefly/lib/alt/solve.rs:6435-6445 | pyrefly/lib/alt/solve.rs:6499-6506 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":6435}}}],"partialFingerprints":{"codehealthFindingId/v1":"db977dcadb7a997fe43d1b7b13560c589d06affc016ddad58889789091b01f7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pyrefly/lib/binding/stmt.rs:1086-1096 | pyrefly/lib/binding/stmt.rs:1110-1120 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/binding/stmt.rs:1086\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":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1553c8bbe10e6da31e5b68bc9a36527ce6cc6be5b7ffa0457f790f30202aeb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pyrefly/lib/export/exports.rs:454-464 | pyrefly/lib/export/exports.rs:477-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/export/exports.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19d5d0289b35eb1f00a7ace10db53a087bcd51848d49eb2b9acf95f3f937d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/server.rs:3928-3934 | pyrefly/lib/lsp/non_wasm/server.rs:3969-3979 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/non_wasm/server.rs:3969\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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3928}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aae73c63a4e855e498b2495f65e0af461ebcf8216a94f5d158b3949038d8948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pyrefly/lib/report/cinderx/display.rs:26-36 | pyrefly/lib/report/cinderx/display.rs:61-71 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/report/cinderx/display.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01f8aed2f029d339c7d5cab6d9cca798b533aafe8bc2b63da62e21eb5e5962a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/pyrefly_types/src/type_level_dsl.rs:7129-7138 | crates/pyrefly_types/src/type_level_dsl.rs:7190-7199 | crates/pyrefly_types/src/type_level_dsl.rs:7326-7335 \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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:7129\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":7129}}}],"partialFingerprints":{"codehealthFindingId/v1":"65512ee61460a1a982d9cc0b06c02f049e25c771744ad178c37235a472ecba9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): pyrefly/lib/alt/polars_specials.rs:3296-3306 | pyrefly/lib/alt/polars_specials.rs:3328-3338 | pyrefly/lib/alt/polars_specials.rs:3360-3370 \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 \u0060pyrefly/lib/alt/polars_specials.rs:3296\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, \u0060pyrefly/lib/alt/polars_specials.rs:3295\u0060 calls \u0060chain\u0060, \u0060get\u0060, \u0060unwrap_or\u0060 and \u0060pyrefly/lib/alt/polars_specials.rs:3327\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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3296}}}],"partialFingerprints":{"codehealthFindingId/v1":"51360ed07ae76373cc8c36d112f5fd29837c156b4aeb9cf54a84e6f8ba57d8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/pyrefly_types/src/display.rs:883-892 | pyrefly/lib/annotation.rs:138-146 \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 \u0060crates/pyrefly_types/src/display.rs:883\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":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"1903427053cc3168b1fa857b2023e8290c3cbe28419875094c1bd5c6863ea180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pyrefly_types/src/display.rs:1562-1571 | crates/pyrefly_types/src/display.rs:1587-1596 \u2014 both copies are in the same file, so extract the block 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":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"279e16c39fbd9aca5b2ccadd1d10e3af35c2ee520758edfa08d1736057d8ccf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:2613-2622 | crates/pyrefly_types/src/type_level_dsl.rs:2904-2913 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:2613\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2613}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fe0a3364f7f29e8fbab909932bef758097da006d50a8034889fed768d0de01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:3654-3663 | crates/pyrefly_types/src/type_level_dsl.rs:3780-3789 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:3654\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3654}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f196b0b177f50e88c52407163bd8d388b2bd4dec9513390c92fe2468157febd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/binding/attrs.rs:140-149 | pyrefly/lib/binding/attrs.rs:162-171 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/binding/attrs.rs:140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060pyrefly/lib/binding/attrs.rs:160\u0060 calls \u0060entry\u0060, \u0060clone\u0060, \u0060or_insert\u0060 and \u0060pyrefly/lib/binding/attrs.rs:139\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":"pyrefly/lib/binding/attrs.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"79983140f101619f2de08450aef80c509a7180bcc53e71a532f81a7346d98056"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): pyrefly/lib/binding/class.rs:1458-1467 | pyrefly/lib/binding/class.rs:1519-1524 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/binding/class.rs:1458\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":"pyrefly/lib/binding/class.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"613c7ab29de2494cf2d27b4602f3739f5c3997cb461ee4126642f9ac2f533ef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/commands/check.rs:2322-2331 | pyrefly/lib/state/errors.rs:373-382 \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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dd8ff01ac96450c678a381016695b0ee4266d4a229ccbb8521f2a741354734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): pyrefly/lib/commands/infer.rs:357-365 | pyrefly/lib/commands/stubgen.rs:74-83 \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 \u0060pyrefly/lib/commands/stubgen.rs:74\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 before the matched lines, \u0060pyrefly/lib/commands/infer.rs:356\u0060 calls \u0060as_ref\u0060, \u0060cancellable_transaction\u0060, \u0060as_mut\u0060 and \u0060pyrefly/lib/commands/stubgen.rs:74\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":"pyrefly/lib/commands/infer.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0a0592eeb2886b2349d3d9f0fc3ca757e17fd03478be42919b9779db07ae2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/server.rs:5065-5074 | pyrefly/lib/lsp/non_wasm/server.rs:5092-5101 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/non_wasm/server.rs:5065\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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5065}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78b42f0e9175d029e8a40a340b17883da4245a7da124fe1c2f1581613d77188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/solver/solver.rs:3834-3843 | pyrefly/lib/solver/solver.rs:3845-3854 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/solver/solver.rs:3834\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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3834}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d47af39f1e45112a8f3f41eaa643411f390caf496cbf312e9782724e38dd11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/convert_dict.rs:308-317 | pyrefly/lib/state/lsp/quick_fixes/convert_dict.rs:342-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pyrefly/lib/state/lsp/quick_fixes/convert_dict.rs:308\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":"pyrefly/lib/state/lsp/quick_fixes/convert_dict.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f6ddd48fa4927eefa17ced01c32f27983d17d20aae39084339dca74febcbc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/stubgen/extract.rs:290-300 | pyrefly/lib/stubgen/extract.rs:804-813 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/stubgen/extract.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"42736e05fe50148465ffad6b75213551785aa19856dfa58b3e32ac54cdf14e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/stubgen/extract.rs:611-620 | pyrefly/lib/stubgen/extract.rs:629-638 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/stubgen/extract.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc8113219e06daa988e8004dbc2233b5c9ac5945369c013e3253fcd06d911ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): pyrefly/lib/lsp/non_wasm/server.rs:2515-2523 | pyrefly/lib/lsp/non_wasm/server.rs:2590-2598 | pyrefly/lib/lsp/non_wasm/server.rs:2907-2915 | pyrefly/lib/lsp/non_wasm/server.rs:2922-2930 | pyrefly/lib/lsp/non_wasm/server.rs:2952-2960 \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 \u0060pyrefly/lib/lsp/non_wasm/server.rs:2515\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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ea2842137d189735b3a881d13ba089cd8ed41b7e10e4dfa0849ee06f718bde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): crates/pyrefly_lsp_test/src/object_model.rs:1012-1019 | crates/pyrefly_lsp_test/src/object_model.rs:1042-1050 | crates/pyrefly_lsp_test/src/object_model.rs:1074-1081 | crates/pyrefly_lsp_test/src/object_model.rs:1115-1122 \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 \u0060crates/pyrefly_lsp_test/src/object_model.rs:1012\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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abdf35592982aa5db688d361cfb07a3fa83b8f1ae8cc293e60175c6bd22c97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): pyrefly/lib/lsp/non_wasm/convert_module_package.rs:37-45 | pyrefly/lib/lsp/non_wasm/move_symbol_new_file.rs:54-62 | pyrefly/lib/lsp/non_wasm/safe_delete_file.rs:62-70 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/convert_module_package.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f566ca7a112ff6f0d755656ddb6efdea6e8e45d6bacd28093b0ff2496416696c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): pyrefly/lib/stubgen/extract.rs:345-353 | pyrefly/lib/stubgen/extract.rs:364-372 | pyrefly/lib/stubgen/extract.rs:393-401 \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 \u0060pyrefly/lib/stubgen/extract.rs:345\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":"pyrefly/lib/stubgen/extract.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d670be08b47013f660e68ce303c235430d629346b2aef68c0360424df13fdfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pyrefly_lsp_test/src/object_model.rs:886-894 | crates/pyrefly_lsp_test/src/object_model.rs:904-912 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/pyrefly_lsp_test/src/object_model.rs:885\u0060 calls \u0060from_value\u0060, \u0060unwrap\u0060 and \u0060crates/pyrefly_lsp_test/src/object_model.rs:903\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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0514f409e10a633e83c5a4bb66f51b682abca0c00da20291e890a3cc37fe1e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:3673-3681 | crates/pyrefly_types/src/type_level_dsl.rs:3799-3807 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:3673\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"3240dd165363b197cc54e1e14de40deff8e4afd05cfb9a0e434a8b1842c65a7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:6601-6609 | crates/pyrefly_types/src/type_level_dsl.rs:6613-6620 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:6601\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6601}}}],"partialFingerprints":{"codehealthFindingId/v1":"f811f8d5a6372a989ec6ca7be00438ae802eafd60eaa3983c78ec1f4ddd9d003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:7846-7854 | crates/pyrefly_types/src/type_level_dsl.rs:7884-7892 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:7846\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":7846}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dd37df299f22f0fadb9d53d68d906f15fcc14b311687581d3a9bf04cf75424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/alt/call.rs:683-691 | pyrefly/lib/alt/call.rs:706-714 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/call.rs:683\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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"8938ec29304f4fb76c89e84e98b511d55c845554fdbe09f357be8c4b82b38b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/alt/class/class_field.rs:6519-6527 | pyrefly/lib/alt/class/class_field.rs:6551-6559 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/class/class_field.rs:6519\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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6519}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69745007c91b0b338ae4296d419b724e2ec8e9f518d989b6292ca519e686097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/alt/class/class_field.rs:6603-6611 | pyrefly/lib/alt/class/class_field.rs:6648-6656 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/class/class_field.rs:6603\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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6603}}}],"partialFingerprints":{"codehealthFindingId/v1":"f979886f2f4e5aeff4d2ab8e273e74d4f981d3d0cd0cd0dddde4a35fab82a4fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/alt/class/enums.rs:270-279 | pyrefly/lib/alt/class/enums.rs:478-486 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/class/enums.rs:270\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060pyrefly/lib/alt/class/enums.rs:280\u0060 calls \u0060Some\u0060, \u0060type_of_enum_value\u0060 and \u0060pyrefly/lib/alt/class/enums.rs:487\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":"pyrefly/lib/alt/class/enums.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"95993c78978ae8e1f1f8ddc1e2e361104de94af3147bfbc5accf771e93ff0b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): pyrefly/lib/alt/function.rs:2919-2927 | pyrefly/lib/alt/function.rs:3000-3006 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/function.rs:2919\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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":2919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad050d0a90587a039e9f8d44d8d3d6375a4c71e06d0a48bd52d2a37263c916ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/alt/narrow.rs:1653-1661 | pyrefly/lib/alt/narrow.rs:1675-1683 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/narrow.rs:1653\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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f14991cdf846a53e6221d1fa9361d828f024ed163c0b0c0f5d42dabd6bc063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/alt/operators.rs:858-866 | pyrefly/lib/alt/operators.rs:967-975 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/operators.rs:858\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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"898d1ce65737e96d22fb7c710bfc6624a2baa458613893b5f6357a6804986eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/lsp.rs:23-31 | pyrefly/lib/lsp/non_wasm/lsp.rs:38-46 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/lsp.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cb30eece6b69cf1fc88c744e41789ba003430bcdd42695fd492a2a28a3ce5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/report/pysa.rs:642-650 | pyrefly/lib/report/pysa.rs:670-678 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/report/pysa.rs:642\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":"pyrefly/lib/report/pysa.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba98b96ded560f9870f31cc01c2b195d95f6afa9e67483dfb0cfe1629871d308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/report/pysa.rs:652-660 | pyrefly/lib/report/pysa.rs:664-672 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/report/pysa.rs:652\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":"pyrefly/lib/report/pysa.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"09abe93d2bc78ee54de5fe46c69d6681a413a56564b1ae5b78079f768d20e364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20139 lines \u00D7 2): pyrefly/lib/solver/subset.rs:2740-2748 | pyrefly/lib/solver/subset.rs:2753-2757 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/solver/subset.rs:2740\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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"856e799ec6c053af5c05cdb4144fc4d82b56086d7dad2a52a3186dd9b0353d53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/state/lsp.rs:5972-5980 | pyrefly/lib/state/lsp.rs:5994-6002 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/state/lsp.rs:5994\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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":5972}}}],"partialFingerprints":{"codehealthFindingId/v1":"822a332f8e399b679afe4d4028c11d44b185b552cb6188cfb1200d708b03326d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/pyrefly_ignore.rs:33-41 | pyrefly/lib/state/lsp/quick_fixes/pyrefly_ignore.rs:47-55 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/state/lsp/quick_fixes/pyrefly_ignore.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af6f70eef4085e06dc8f3bbc01ab46fd8be0dc10f6e7cba5d4cf80fafd4f21f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): pyrefly/lib/state/state.rs:1647-1655 | pyrefly/lib/state/state.rs:2723-2729 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/state/state.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1055ef4614a4c0e0820576be75833e28c4f7986c63900d128eba3d995ac67a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10): pyrefly/lib/lsp/non_wasm/server.rs:2501-2508 | pyrefly/lib/lsp/non_wasm/server.rs:2576-2583 | pyrefly/lib/lsp/non_wasm/server.rs:2661-2668 | pyrefly/lib/lsp/non_wasm/server.rs:2696-2703 | pyrefly/lib/lsp/non_wasm/server.rs:2744-2751 | pyrefly/lib/lsp/non_wasm/server.rs:2759-2766 | pyrefly/lib/lsp/non_wasm/server.rs:2774-2781 | pyrefly/lib/lsp/non_wasm/server.rs:2878-2885 | pyrefly/lib/lsp/non_wasm/server.rs:2893-2900 | pyrefly/lib/lsp/non_wasm/server.rs:2938-2945 \u2014 all 10 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 \u0060pyrefly/lib/lsp/non_wasm/server.rs:2501\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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ace26b1baeb49cda73beae7a4db43e40e3dee543481c2de90d09b6079d462ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): pyrefly/lib/alt/narrow.rs:1649-1656 | pyrefly/lib/alt/narrow.rs:1671-1678 | pyrefly/lib/alt/narrow.rs:1693-1700 | pyrefly/lib/alt/narrow.rs:1706-1713 | pyrefly/lib/alt/narrow.rs:1722-1729 | pyrefly/lib/alt/narrow.rs:1738-1745 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pyrefly/lib/alt/narrow.rs:1649\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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"25688507ce0567620eb79e170745c87bbe3773fe99bf48b8478a4c536aaf2c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/pyrefly_lsp_test/src/object_model.rs:711-718 | crates/pyrefly_lsp_test/src/object_model.rs:722-729 | crates/pyrefly_lsp_test/src/object_model.rs:733-740 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ab773990dec822a3296355c3b1b20b60c7355ea0f62d039e5d7b7d66a56e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pyrefly/lib/alt/class/class_field.rs:3272-3279 | pyrefly/lib/alt/class/class_field.rs:3303-3310 | pyrefly/lib/alt/class/class_field.rs:3312-3319 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0464b74e0a6dec0d68ae17b03b31896abdd03066a040368a85e45b54d74438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pyrefly_types/src/callable.rs:712-719 | crates/pyrefly_types/src/callable.rs:726-733 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/callable.rs:712\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":"crates/pyrefly_types/src/callable.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b81c40534a6656e87295b3c2f77c22b5a7891345453dd36f7e802ed9921272"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pyrefly_types/src/dimension.rs:1063-1070 | crates/pyrefly_types/src/dimension.rs:1074-1083 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/dimension.rs:1063\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":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ea38498dd2b59fb4901ef0896c3846a04ad742784d894e3fd6846a7b04958b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/alt/attr.rs:2213-2220 | pyrefly/lib/alt/attr.rs:2335-2342 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/attr.rs:2213\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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3627bd4620b8909f12b5c8749226f66e64ad42efc02a2d4e839382c8e885fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/alt/class/class_field.rs:926-933 | pyrefly/lib/alt/class/class_field.rs:1248-1258 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/class/class_field.rs:926\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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"682e1415b1b9e967b6ce9af967f69b1cba28cb643c003975bc4e72c0a3f117c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/alt/expr.rs:1344-1351 | pyrefly/lib/alt/expr.rs:1358-1365 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/expr.rs:1344\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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeacc3d9e7cf20c9825c251b50283d91b703a0668e3512a9cc22d928991f374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/alt/operators.rs:441-448 | pyrefly/lib/alt/operators.rs:455-462 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/operators.rs:441\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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4fa440d25d8f09cae937044472dafc7900aa1d149c7dcc6129aad265848de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): pyrefly/lib/alt/shape_extension.rs:221-227 | pyrefly/lib/alt/shape_flag.rs:109-116 \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 \u0060pyrefly/lib/alt/shape_extension.rs:221\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":"pyrefly/lib/alt/shape_extension.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1456a48b4164e46c78a230ac3546ba395ec139a9cde6c3edfdd9be7d737accf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/alt/unwrap.rs:209-216 | pyrefly/lib/alt/unwrap.rs:259-266 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/alt/unwrap.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba78751e2777787ec8b7aba4a3c391dbadc4e585bf9b1ce97884c5387d3eed2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/alt/unwrap.rs:279-286 | pyrefly/lib/alt/unwrap.rs:445-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/unwrap.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c26a918f523ad1ceaeb5f37ae2e343e440cbb3391c5e63529270ee6d839015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pyrefly/lib/binding/narrow.rs:1011-1021 | pyrefly/lib/binding/narrow.rs:1032-1042 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f6dadb306a9c36e9c0c32ff31f0b07b659df74c539d37039f07497c71a06a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/commands/init.rs:313-320 | pyrefly/lib/commands/init.rs:365-372 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/commands/init.rs:313\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060pyrefly/lib/commands/init.rs:321\u0060 calls \u0060to_string_pretty\u0060 and \u0060pyrefly/lib/commands/init.rs:373\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":"pyrefly/lib/commands/init.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6698285a4cd44d6b3845dc23b14741582ef06d27dbe8b5c345c97f61dbfb7d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/server.rs:2486-2493 | pyrefly/lib/lsp/non_wasm/server.rs:2608-2615 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/non_wasm/server.rs:2486\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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5335bb51f43b788468939896faba1f90372f9711d9527e57c8b3a7cde2df1fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/server/event_loop.rs:44-50 | pyrefly/lib/tsp/server.rs:698-705 \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 \u0060pyrefly/lib/lsp/non_wasm/server/event_loop.rs:44\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":"pyrefly/lib/lsp/non_wasm/server/event_loop.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1cc11f2dce67bb0867392fc1a96beaf12b711720202d34d664257488c27960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/state/lsp/dict_completions.rs:690-698 | pyrefly/lib/state/lsp/dict_completions.rs:722-730 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/state/lsp/dict_completions.rs:690\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, \u0060pyrefly/lib/state/lsp/dict_completions.rs:721\u0060 calls \u0060string_literal_priority\u0060 and \u0060pyrefly/lib/state/lsp/dict_completions.rs:689\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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b01b343828b40f036af917dc208362128bb3bca60c6a5b10efee1e8755a9c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/state/state.rs:1633-1640 | pyrefly/lib/state/state.rs:2709-2716 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/state/state.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"f210a15afe3a3d5b1165c125a8646d8be9372832fdac52764bbad9251e7312cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): pyrefly/lib/alt/map_int_tuples.rs:764-770 | pyrefly/lib/alt/shape_extension.rs:324-330 | pyrefly/lib/alt/shape_extension.rs:347-353 \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":"pyrefly/lib/alt/map_int_tuples.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"df138650d9c2576282ee2628d50ad8052b040185f3fceb8f1de4bd2def026355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): pyrefly/lib/report/cinderx/display.rs:25-32 | pyrefly/lib/report/cinderx/display.rs:61-67 | pyrefly/lib/report/cinderx/display.rs:85-91 \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 \u0060pyrefly/lib/report/cinderx/display.rs:25\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":"pyrefly/lib/report/cinderx/display.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8154005b1e655f0945d4b82aaf14a37c81f64d9e241f085dde5947dd815e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): pyrefly/lib/state/lsp/quick_fixes/extract_field.rs:42-48 | pyrefly/lib/state/lsp/quick_fixes/extract_variable.rs:37-43 | pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs:98-104 \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. 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 before the matched lines, \u0060pyrefly/lib/state/lsp/quick_fixes/extract_field.rs:41\u0060 calls \u0060contents\u0060 and \u0060pyrefly/lib/state/lsp/quick_fixes/extract_variable.rs:36\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":"pyrefly/lib/state/lsp/quick_fixes/extract_field.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f20a1752d00e9d3227124a26241585eba4e31f25a85abd346337e91929db2c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pyrefly_config/src/migration/run.rs:471-477 | pyrefly/lib/commands/init.rs:333-339 \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":"crates/pyrefly_config/src/migration/run.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15c20da2ad7fa132de08f0e37ffb6a5e9e4149e572ec66e43ce8f10ca72bdca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pyrefly_types/src/dimension.rs:768-774 | crates/pyrefly_types/src/dimension.rs:961-967 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/dimension.rs:768\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":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ea1b2022121526d417dda31549e6f0e3083b18eaf3ea048aa78fcbe87ed301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pyrefly_types/src/display.rs:1441-1447 | crates/pyrefly_types/src/display.rs:1457-1463 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/display.rs:1441\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":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4208cb3ce78b45c85d4506be7c06897e78400d7f9ce56b708161b6e87f53e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:3665-3671 | crates/pyrefly_types/src/type_level_dsl.rs:3791-3797 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:3665\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3665}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc95f7c45c4d2222ca28a5c49e3803235b20d6421df85b15fbcd529d294a972"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:7776-7788 | crates/pyrefly_types/src/type_level_dsl.rs:7807-7819 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:7776\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":7776}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecff6873621dc850eb23859fc39e6962b0117166e8ad954ce7e74ca8509e408a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/alt/class/class_field.rs:1014-1020 | pyrefly/lib/alt/class/class_field.rs:1309-1315 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/class/class_field.rs:1014\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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d2c01fe8a2b83a5659a458ebbce28f488a5c7092aa0555e64da4febcbdba20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/alt/class/class_field.rs:1741-1747 | pyrefly/lib/alt/class/class_field.rs:2076-2082 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed25d6ff14957725b42965572efd739a6dcb82e5f46f28cbfdbd951b254bf696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/alt/narrow.rs:1425-1431 | pyrefly/lib/alt/narrow.rs:1448-1454 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/narrow.rs:1425\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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"9774212a8e6fdb6ef955df5210e3af01e5874a3246beb9781ee8815db2fadc60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/alt/narrow.rs:2746-2753 | pyrefly/lib/alt/narrow.rs:2816-2822 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/narrow.rs:2746\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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5b3cd7bb2a3b46c55e3a36302d7469f4c8c27c8610a1c69690c2a5aeafd6bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/alt/type_var_declaration.rs:322-328 | pyrefly/lib/alt/type_var_declaration.rs:330-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/type_var_declaration.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1baa07deb4c113351dfd5445e51b2da85763201ef29af44d99f793ae8dd1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/binding/expr.rs:1031-1038 | pyrefly/lib/binding/expr.rs:1051-1058 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/binding/expr.rs:1031\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":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3de9f5851acb1a1bb6e9a93f1c079604a75a0ee9db107449e4f9cdd2454a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/server.rs:5088-5094 | pyrefly/lib/lsp/non_wasm/server.rs:5117-5123 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/non_wasm/server.rs:5088\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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5088}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e05ff59160045504a1bf7ad96ed525c56025073d8984f729e629f1f679d59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/lsp/wasm/signature_help.rs:115-123 | pyrefly/lib/lsp/wasm/signature_help.rs:178-184 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/wasm/signature_help.rs:115\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":"pyrefly/lib/lsp/wasm/signature_help.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8629fe6cc8d48337316ef592a7624b617c25cb95ca4eb7bb2f75f7f4d199c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/report/pysa/capnp_writer.rs:466-472 | pyrefly/lib/report/pysa/capnp_writer.rs:510-516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/capnp_writer.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"edefa8f27e8b9d0d2cf18d686c49e48af7df7ad0fbac75461cbcbbf0358d90af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/report/pysa/capnp_writer.rs:545-551 | pyrefly/lib/report/pysa/capnp_writer.rs:563-569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/capnp_writer.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0044507542b1f31d0afd361db3556812d0fb7d027172f268a7daaf22411de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/solver/subset.rs:849-855 | pyrefly/lib/solver/subset.rs:882-888 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/solver/subset.rs:849\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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0da956451ec0477516b83fc99b0636c63cb89d0d545f965c3943665a9c89592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): pyrefly/lib/solver/subset.rs:2130-2136 | pyrefly/lib/solver/subset.rs:2156-2163 \u2014 both copies are in the same file, so extract the block 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060pyrefly/lib/solver/subset.rs:2137\u0060 calls \u0060canonicalize\u0060 and \u0060pyrefly/lib/solver/subset.rs:2163\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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"279a0ee05834d97151ffad52e277a28e074f7a3514fab960a27a571df434a198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): pyrefly/lib/state/lsp/dict_completions.rs:515-520 | pyrefly/lib/state/lsp/dict_completions.rs:719-724 | pyrefly/lib/state/lsp/dict_completions.rs:741-746 | pyrefly/lib/state/lsp/dict_completions.rs:773-781 \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 \u0060pyrefly/lib/state/lsp/dict_completions.rs:515\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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"87026760cbff17978f7441b53b69bdb5233918573ff7648afe07d8714d222dde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/pyrefly_config/src/args.rs:582-587 | crates/pyrefly_config/src/args.rs:589-594 | crates/pyrefly_config/src/args.rs:596-601 \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 \u0060crates/pyrefly_config/src/args.rs:582\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":"crates/pyrefly_config/src/args.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9d09363bbdb8eaf28f25fed1940cd1e39beea8b260fe339df6b7e9f13d10cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/pyrefly_types/src/type_level_dsl.rs:2850-2855 | crates/pyrefly_types/src/type_level_dsl.rs:3624-3629 | crates/pyrefly_types/src/type_level_dsl.rs:4795-4800 \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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:2850\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2850}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a4e588c9bdfe82b244a43ebb7193a75fd20e3b732e0b36fc1e6d0b9b6695c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/pyrefly_types/src/type_level_dsl.rs:7106-7111 | crates/pyrefly_types/src/type_level_dsl.rs:7781-7786 | crates/pyrefly_types/src/type_level_dsl.rs:7812-7817 \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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:7106\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":7106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4080da15472f46b90c24fd2c20220c74bc66edaa1a90a72243d5c5dc173d6036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): pyrefly/lib/alt/attr.rs:2213-2219 | pyrefly/lib/alt/attr.rs:2248-2253 | pyrefly/lib/alt/attr.rs:2335-2341 \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 \u0060pyrefly/lib/alt/attr.rs:2213\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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6607389f218ec218ff2fb58cf261d772827f76e425a2873ceefcfa14ca0beee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): pyrefly/lib/state/semantic_tokens.rs:683-688 | pyrefly/lib/state/semantic_tokens.rs:690-695 | pyrefly/lib/state/semantic_tokens.rs:697-702 | pyrefly/lib/state/semantic_tokens.rs:703-709 \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":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e67c057318c6f56c91cac05f88b44389a7d651f5067ad51ca584a89188f0b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:7794-7800 | crates/pyrefly_types/src/type_level_dsl.rs:7833-7839 \u2014 both copies are in the same file, so extract the block 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":7794}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ca67ddce97a5928873b5b6cb6672e2f217154a973d249b34bae3f0e98ad26f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:8319-8324 | crates/pyrefly_types/src/type_level_dsl.rs:8346-8352 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:8319\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8319}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b7091325bd62ee941d9d2d227fbca25638e21a4d802ca887d9c73d3eabe354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/alt/attr.rs:2799-2804 | pyrefly/lib/alt/attr.rs:2960-2965 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/attr.rs:2799\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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2799}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fb4b1f82dde8f35797c550598a5fda738d21df39a7b23e1586ba8c7a2b7556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/alt/class/class_metadata.rs:750-756 | pyrefly/lib/alt/class/class_metadata.rs:1305-1311 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/class/class_metadata.rs:750\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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d31a5eb3304b402f4268dbc99da6b51f1b42f6259f3ccac91d8a7629e23e958"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/alt/class/dataclass.rs:423-428 | pyrefly/lib/alt/class/dataclass.rs:470-475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pyrefly/lib/alt/class/dataclass.rs:423\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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"3980c0f933d85de8bb2d863090db8b11921a0dabc7b02e6791eb9b463f439174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/alt/expr.rs:2364-2369 | pyrefly/lib/alt/expr.rs:2376-2381 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/expr.rs:2364\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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2364}}}],"partialFingerprints":{"codehealthFindingId/v1":"58573e8f03285242b25220c917179dd321b227be2f9a327e648cea033a105ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/alt/function.rs:3073-3078 | pyrefly/lib/alt/function.rs:3170-3175 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/function.rs:3073\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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":3073}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3d86d56ea998285111f0caf1c42f2a2fc5b7d10ea3ece0ab38ae4c6e6037d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/alt/polars_specials.rs:1356-1362 | pyrefly/lib/alt/polars_specials.rs:1766-1772 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/polars_specials.rs:1356\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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a310afaf5556105988fc55009afd4ecdd5249a799e9e2f4f22ec66d1e0535a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/binding/expr.rs:1210-1215 | pyrefly/lib/binding/expr.rs:1217-1222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e3ceacef7541f727c748ad5740b40fa4d0118141680ea7e467eef03ae16ace"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/binding/stmt.rs:548-553 | pyrefly/lib/binding/stmt.rs:588-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 \u0060pyrefly/lib/binding/stmt.rs:548\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":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4b7a6b122d982b62e72c71f8885154006ece278bf42c9127d596cbf38e5b9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/commands/buck_check.rs:216-221 | pyrefly/lib/playground.rs:441-446 \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":"pyrefly/lib/commands/buck_check.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc50f16a34908499a5b34bf31b274fbe1df0bf542d3327195a8445e476a961a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/error/suppress.rs:140-145 | pyrefly/lib/state/lsp/quick_fixes/unused_ignore.rs:26-31 \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 \u0060pyrefly/lib/error/suppress.rs:140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/suppress.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fffafcc691bd1a0d69337e900e808bf04328dbc12fc633708b103da1efc068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/export/definitions.rs:399-406 | pyrefly/lib/export/deprecation.rs:18-25 \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 \u0060pyrefly/lib/export/definitions.rs:399\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":"pyrefly/lib/export/definitions.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed8248b1518167529322048d351a0e2035cdad9e29263295a00403dc73e3d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/report/pysa/capnp_writer.rs:374-379 | pyrefly/lib/report/pysa/capnp_writer.rs:388-393 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/report/pysa/capnp_writer.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c50bc5b26f1c02ac0452e982767f37a9eaabe5bafc0f6879786865d4fed5717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/report/pysa/capnp_writer.rs:652-660 | pyrefly/lib/report/pysa/capnp_writer.rs:719-727 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/report/pysa/capnp_writer.rs:652\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":"pyrefly/lib/report/pysa/capnp_writer.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbb323996136d60040d6dbf8b63ca19619e92ca70d5ccebb3c6b4221354ff4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/solver/subset.rs:497-502 | pyrefly/lib/solver/subset.rs:508-513 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/solver/subset.rs:497\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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e2fd79cfe8f3c927c7d6ddc766427ffe24fc6e1ab54849463d1cc61d50d07e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/convert_star_import.rs:170-176 | pyrefly/lib/state/lsp/quick_fixes/extract_shared.rs:532-538 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/convert_star_import.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04ce9de2d8392c41eb145aa6f86c352b818a734e560043b98d1d38b355f94bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/pyrefly_python/src/ignore.rs:780-784 | crates/pyrefly_python/src/ignore.rs:933-937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pyrefly_python/src/ignore.rs:780\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":"crates/pyrefly_python/src/ignore.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6868dbaa320b6cacb320cfb32e430519062b70101fb1e840a96dd7856d932f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:6995-7001 | crates/pyrefly_types/src/type_level_dsl.rs:7021-7027 \u2014 both copies are in the same file, so extract the block 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6995}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d74b03fcc9c31a2bef159bf8abce24f215afdfeba886ae4548e831c406d8f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:8301-8305 | crates/pyrefly_types/src/type_level_dsl.rs:8390-8394 \u2014 both copies are in the same file, so extract the block 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daf32f6ad4140c25da2c6389634256e0f01ffa0186b168c12be4e773704cadc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/alt/call.rs:2975-2979 | pyrefly/lib/alt/call.rs:3000-3004 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/call.rs:2975\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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d93d31a703c024c5a0ae4913f09e17c273bb4a7ac9142b866b734adebe92a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/alt/expr.rs:3552-3556 | pyrefly/lib/alt/types/class_bases.rs:128-134 \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 \u0060pyrefly/lib/alt/expr.rs:3552\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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":3552}}}],"partialFingerprints":{"codehealthFindingId/v1":"e593d7025c16f8d8341042a075c045adb4d005033fade06b9fbf5ddd4b152194"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/alt/overload.rs:934-938 | pyrefly/lib/alt/overload.rs:947-951 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/overload.rs:934\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":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d19a90faab7e6a7ca070ba01a6f743b0c296c39e8ebe70fb03d1f5c9f3f21b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/binding/class.rs:781-785 | pyrefly/lib/binding/class.rs:1285-1292 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/binding/class.rs:781\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":"pyrefly/lib/binding/class.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"2972c8edc7abc73f391fb2c3bfe3faa2fe3a41845b94013f8f0c0d9b3dbc5299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/binding/stmt.rs:498-502 | pyrefly/lib/binding/stmt.rs:617-622 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"660291faf5ca5985305727fefb7112784bbb1547e428c84e2b7cfefa785eba54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/state/lsp/dict_completions.rs:688-692 | pyrefly/lib/state/lsp/dict_completions.rs:789-793 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/state/lsp/dict_completions.rs:688\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":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"3320e9882a3a9e57b93e357b2b9ac7134a8c486d49f6b0146758d71c60b82c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/convert_dict.rs:302-306 | pyrefly/lib/state/lsp/quick_fixes/convert_dict.rs:336-340 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/state/lsp/quick_fixes/convert_dict.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb6c16bcb6a59f964a7e2c8d8f519f8ed236a5fa11bd699826e1a7f555d360c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/extract_field.rs:177-182 | pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs:302-307 \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 \u0060pyrefly/lib/state/lsp/quick_fixes/extract_field.rs:177\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":"pyrefly/lib/state/lsp/quick_fixes/extract_field.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"294ec49b800a696578a7111152dfc6509bf635e12d2285a9e792ab496f77a88b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/stubgen/extract.rs:225-229 | pyrefly/lib/stubgen/extract.rs:239-243 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/stubgen/extract.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07dd71d51af41a430781f49bd8a33de305c41d9b80f398eebc8529e70575bf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pyrefly_build/src/query.rs:43-50 | crates/pyrefly_build/src/source_db/buck_check.rs:50-57 \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":"crates/pyrefly_build/src/query.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd08ff834248c263bb1369ec3b39c793b2368b73f9d72d9c3563ebe36a3d84fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pyrefly_types/src/type_output.rs:118-124 | pyrefly/lib/state/lsp/quick_fixes/implement_abstract_members.rs:212-218 \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":"crates/pyrefly_types/src/type_output.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc6f675c6fdd1d6f14f58462c782ee2df495863a5e6117dba5f5dad3411cf3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/alt/int_list_literal.rs:42-46 | pyrefly/lib/alt/regular_nested_list.rs:57-61 \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":"pyrefly/lib/alt/int_list_literal.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5699804a7c685d77a7f737deb55c4cf080768a71205202546cd575896c7beb00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pyrefly/lib/lsp/non_wasm/convert_module_package.rs:24-31 | pyrefly/lib/lsp/non_wasm/move_symbol_new_file.rs:41-48 | pyrefly/lib/lsp/non_wasm/safe_delete_file.rs:49-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/convert_module_package.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abf90a29e7b05183777d2c05aa67eaafff7a6f8cd1946ccffec166be815c8bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/module/third_party.rs:82-88 | pyrefly/lib/module/typeshed_third_party.rs:88-94 \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":"pyrefly/lib/module/third_party.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8594690b4b95a35427a47da1acb2a5ed3a3edeeaff9bc0eed7dee315b983c686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:218-228 | pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs:217-227 \u2014 before extracting anything, compare \u0060pyrefly/lib/state/lsp/quick_fixes/change_signature.rs\u0060 and \u0060pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 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 \u0060pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:218\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":"pyrefly/lib/state/lsp/quick_fixes/change_signature.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b3693a0097b07b84a63f10d1e9975345a3eaee989da721f822a866016a34fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/alt/polars_specials.rs:579-585 | pyrefly/lib/binding/attrs.rs:359-365 \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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eba2a7c48a9407a0c12cc0d496539fe14b480285234658ae67a95853ded2b58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/binding/bindings.rs:883-889 | pyrefly/lib/binding/shape_type.rs:185-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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a91e5b4c0e9ac2a73975997a77ef5a914b97c1778ae76a446f120f213a0e5d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/call_hierarchy.rs:64-75 | pyrefly/lib/lsp/non_wasm/type_hierarchy.rs:20-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pyrefly/lib/lsp/non_wasm/call_hierarchy.rs:64\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":"pyrefly/lib/lsp/non_wasm/call_hierarchy.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e521b9a704b5ad19f48e0973fffa2719bc36964c01d2bf687d716daa7ff5b4dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): pyrefly/lib/module/third_party.rs:105-110 | pyrefly/lib/module/typeshed.rs:353-358 | pyrefly/lib/module/typeshed_third_party.rs:106-111 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/module/third_party.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79931eaf123e6ed80928b90e14279a6d9a5720e009e7094a8f551f4e8a81e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/pyrefly_lsp_test/src/object_model.rs:1085-1103 | crates/pyrefly_lsp_test/src/object_model.rs:1126-1144 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_lsp_test/src/object_model.rs:1085\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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"412bf3243c7ac999732cec5d7643bdee3233342b9f0aa65ac89ec09c21613f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pyrefly/lib/binding/class.rs:1340-1355 | pyrefly/lib/binding/class.rs:1614-1630 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/binding/class.rs:1340\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":"pyrefly/lib/binding/class.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac191bea9973685cd0ab3978f2d07429825d1a92cf14d6e244d4dba804b6831e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pyrefly/lib/alt/special_calls.rs:117-132 | pyrefly/lib/alt/special_calls.rs:280-295 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/special_calls.rs:117\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":"pyrefly/lib/alt/special_calls.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0242066341dc67f7b8184192dfd94e3e9134b36af83cc0f39665cfaa0cdc5ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:155-170 | pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:176-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:155\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":"pyrefly/lib/state/lsp/quick_fixes/change_signature.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"678fa2d15cc466a856a6c8352f5bd2b641fd9e52ee6dd1ce6fbb82b922a7a7e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:134-149 | pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:155-170 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/state/lsp/quick_fixes/change_signature.rs:134\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":"pyrefly/lib/state/lsp/quick_fixes/change_signature.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1334b03c26a4651af4d6ad96c522a17d538abe42fd30bc2ec2a0a6d807ec6b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): pyrefly/lib/alt/special_calls.rs:120-134 | pyrefly/lib/alt/special_calls.rs:283-297 | pyrefly/lib/alt/special_calls.rs:405-419 \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 \u0060pyrefly/lib/alt/special_calls.rs:120\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":"pyrefly/lib/alt/special_calls.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"718f74d417ffba4400c2ee11ad1c4a8320b3ba76383a9de96ab120b16a9f6e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/pyrefly_lsp_test/src/object_model.rs:2044-2058 | crates/pyrefly_lsp_test/src/object_model.rs:2067-2081 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_lsp_test/src/object_model.rs:2044\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":"crates/pyrefly_lsp_test/src/object_model.rs"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2c98cffde331bf668a2ea0860b0246313f7a8bd92bd272875a90deb9568724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pyrefly/lib/alt/operators.rs:584-596 | pyrefly/lib/alt/operators.rs:948-960 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb898db446df424664648d61d7525641feff731b6ff1a9f54c5ed3e65a7f104"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/alt/expr.rs:1839-1850 | pyrefly/lib/alt/expr.rs:1877-1886 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/expr.rs:1839\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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01b12d0fb2549e93aada5dd79baa51e8af0f567d64824b2e4402bf6a6a30fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): pyrefly/lib/lsp/module_helpers.rs:41-49 | pyrefly/lib/lsp/module_helpers.rs:53-61 | pyrefly/lib/lsp/module_helpers.rs:65-76 \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 \u0060pyrefly/lib/lsp/module_helpers.rs:41\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":"pyrefly/lib/lsp/module_helpers.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84be5d34ee46d46b2b624b5729929bdacb7ddb754bee518a05998025d88b917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pyrefly/lib/commands/init.rs:322-333 | pyrefly/lib/commands/init.rs:373-384 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/commands/init.rs:322\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":"pyrefly/lib/commands/init.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"352f77472385417217bf4b389df33e9a8ad7d592572a96f9cb290978840eb5b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/binding/scope.rs:3075-3084 | pyrefly/lib/binding/scope.rs:3096-3106 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/binding/scope.rs:3075\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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ca829e8eb27d7911a7b978bfb8d08cf4df105f99f5a6d1093868a45a0c763a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/error/signature_diff.rs:160-170 | pyrefly/lib/error/signature_diff.rs:181-190 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/error/signature_diff.rs:160\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":"pyrefly/lib/error/signature_diff.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f14199c770567ec9941183f0b62f0ef86764b418964341cde7bd20e726c887"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pyrefly/lib/alt/class/attrs.rs:71-81 | pyrefly/lib/alt/class/attrs.rs:88-98 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/class/attrs.rs:71\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":"pyrefly/lib/alt/class/attrs.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cb4a807514852edc1bb63d2427dc21c0ea92030753137f8d039832deee25c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pyrefly/lib/binding/bindings.rs:3035-3045 | pyrefly/lib/binding/bindings.rs:3046-3056 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"647d2e23c9befdb9ede2dad69ed8c193e3beeea831e866d7eabc48fc79662500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:3782-3792 | crates/pyrefly_types/src/type_level_dsl.rs:5324-5334 \u2014 both copies are in the same file, so extract the block 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0e559bd8b3093bb3710c5f54658eba2cfe4cdb1801eedf26018c62e5d4c337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:2517-2527 | crates/pyrefly_types/src/type_level_dsl.rs:5163-5173 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:2517\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"294eab63bf4d5ee2742e47bbfbb44d1d042ebeeed6c30a323b22e8c0b3c27e86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/binding/stmt.rs:2421-2430 | pyrefly/lib/binding/stmt.rs:2435-2444 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5d4b94d6fa74676144afb4509e86b8925a3d9d37304c73063f339b62948e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/state/errors.rs:875-884 | pyrefly/lib/state/errors.rs:895-904 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/state/errors.rs:875\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":"pyrefly/lib/state/errors.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6061b332e3ce6d2f46b395b81f217b0c47545aba867f8e97815fcf1865c619"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/tsp/type_conversion.rs:1042-1051 | pyrefly/lib/tsp/type_conversion.rs:1057-1066 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/tsp/type_conversion.rs:1042\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":"pyrefly/lib/tsp/type_conversion.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f32abc3f7a3b52e0143c48358b4013f2facbb3e50253fbb29427e8adbc670e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pyrefly/lib/binding/narrow.rs:548-557 | pyrefly/lib/binding/narrow.rs:559-568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ab850fd986afd480dde96c88958c322fd68ebbe9c4eab6e275869f2a0acfe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:3538-3546 | crates/pyrefly_types/src/type_level_dsl.rs:3588-3596 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:3538\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3538}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc649329df52438ba8c04b103db5bbd200f036bf789ea473d5843fb6c6c77d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): pyrefly/lib/report/pysa/call_graph.rs:3278-3286 | pyrefly/lib/report/pysa/call_graph.rs:3291-3299 | pyrefly/lib/report/pysa/call_graph.rs:3304-3312 | pyrefly/lib/report/pysa/call_graph.rs:3317-3325 \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 \u0060pyrefly/lib/report/pysa/call_graph.rs:3278\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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":3278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1098e47e23421a47d1ea2f8eb36b863d35ab8791aa83c1f89721da6a79be3e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/convert_module_package.rs:116-123 | pyrefly/lib/lsp/non_wasm/convert_module_package.rs:146-154 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/lsp/non_wasm/convert_module_package.rs:116\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":"pyrefly/lib/lsp/non_wasm/convert_module_package.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb86ae3e08af8bc700de8df15b70dbd0996e6afa959d1115ec99ff5ee5161a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pyrefly/lib/alt/polars_specials.rs:3287-3294 | pyrefly/lib/alt/polars_specials.rs:3320-3327 | pyrefly/lib/alt/polars_specials.rs:3352-3359 \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 \u0060pyrefly/lib/alt/polars_specials.rs:3287\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 after the matched lines, \u0060pyrefly/lib/alt/polars_specials.rs:3295\u0060 calls \u0060chain\u0060, \u0060get\u0060, \u0060unwrap_or\u0060 and \u0060pyrefly/lib/alt/polars_specials.rs:3328\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":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3287}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f7c5bdcf77f6004af644e1eb55231568e81db24962c224b6748ff05e428b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/state/lsp.rs:2351-2358 | pyrefly/lib/state/lsp.rs:2824-2831 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7d7088651e8576def3f1fa10ee7c9acd2cff0f3d12aa13e4701fb6596b2293"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pyrefly/lib/alt/regex.rs:82-89 | pyrefly/lib/alt/regex.rs:95-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/regex.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcd81838e0424dfa90adddfa6c723f86a25590470711cc44c8ec941f79b8675"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:3523-3529 | crates/pyrefly_types/src/type_level_dsl.rs:3573-3579 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:3523\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":3523}}}],"partialFingerprints":{"codehealthFindingId/v1":"f198366efd862263b6324e0bc0ec1e6de21ae1fbe90cd6ce86b4b11805967538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/pyrefly_types/src/type_level_dsl.rs:8318-8323 | crates/pyrefly_types/src/type_level_dsl.rs:8345-8351 | crates/pyrefly_types/src/type_level_dsl.rs:8374-8379 | crates/pyrefly_types/src/type_level_dsl.rs:8404-8409 \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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:8318\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8318}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e665ed1c9818baad38dce34872caba6c772ddb6a7af4fad59e325dbfba41e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/alt/class/variance_inference.rs:778-784 | pyrefly/lib/alt/class/variance_inference.rs:790-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 \u0060pyrefly/lib/alt/class/variance_inference.rs:778\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":"pyrefly/lib/alt/class/variance_inference.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"667d057610d19c5105372cb8321f983981608cad3de5ce7697f23cc914dfa237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pyrefly_config/src/args.rs:568-574 | crates/pyrefly_config/src/args.rs:575-581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pyrefly_config/src/args.rs:568\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":"crates/pyrefly_config/src/args.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0f31f55d9d8a5d85582d31429bbe5ae3f781d18d8691560f69aabaa339d6ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/binding/binding.rs:1547-1553 | pyrefly/lib/binding/binding.rs:2949-2955 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/binding/binding.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c5ad7d84235410cc857c2c7d4c98d2e84cb614cf72c3d9288fd298a44ca65c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/alt/expr.rs:1820-1826 | pyrefly/lib/alt/solve.rs:6147-6153 \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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"7236b7a8f9dbceb2f2c45146b813f9d6f555902625a2ea6bce02c9a92fcb0387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/inline_parameter.rs:91-97 | pyrefly/lib/state/lsp/quick_fixes/inline_variable.rs:96-102 \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 \u0060pyrefly/lib/state/lsp/quick_fixes/inline_parameter.rs:91\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":"pyrefly/lib/state/lsp/quick_fixes/inline_parameter.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"916c0f19a6c9844344e91effca407e7ed7abfaee18459dc3e7cc5656c2f553eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/pyrefly_types/src/type_level_dsl.rs:7144-7149 | crates/pyrefly_types/src/type_level_dsl.rs:7353-7358 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/pyrefly_types/src/type_level_dsl.rs:7144\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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":7144}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a07870a6900f6e56c9117f2ebd6b76aace7a5346f632938ab13ecbd0b75508"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs:715-719 | pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs:727-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 \u0060pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs: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":"pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac283de96be79b13f2a88efd10603628781ec48b169061fb18c8b291e2a6fb05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/pyrefly_types/src/shape_index.rs:649-654 | crates/pyrefly_types/src/shape_index.rs:662-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfccc4ae6066667ec619959155bfc76a6d3aa982d4c4e63f6e7b0147566574f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/alt/expr.rs:1211-1215 | pyrefly/lib/alt/expr.rs:1221-1225 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/expr.rs:1211\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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"205d7f43f521e3d7aa03a30ffcb2c63b122e9ec12563c1a34e5fd1b689ebf652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pyrefly/lib/alt/narrow.rs:2389-2396 | pyrefly/lib/alt/narrow.rs:2417-2424 | pyrefly/lib/alt/narrow.rs:2449-2456 \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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":2389}}}],"partialFingerprints":{"codehealthFindingId/v1":"153948a8f301c306bdff4ceee8b20908d3fcc039dcea482801ca17382159df3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/alt/solve.rs:7613-7617 | pyrefly/lib/alt/solve.rs:7738-7742 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/alt/solve.rs:7613\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060\u0026BindingYield\u0060 in one and \u0060\u0026BindingYieldFrom\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7613}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7d5a42a098eaebddc8992b2ece6ae3e9a5645426a7774e5f01ef44ed53dc5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pyrefly/lib/error/collector.rs:199-204 | pyrefly/lib/error/collector.rs:297-302 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/error/collector.rs:199\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, \u0060pyrefly/lib/error/collector.rs:205\u0060 calls \u0060concat\u0060 and \u0060pyrefly/lib/error/collector.rs:303\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":"pyrefly/lib/error/collector.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"13dfa0a4344105a74d5ffc4165898cfd0fc293e7eebd445b76683c6b1ca9c6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/lsp/non_wasm/code_lens.rs:96-100 | pyrefly/lib/lsp/non_wasm/code_lens.rs:104-108 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/lsp/non_wasm/code_lens.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d32e9d312a35219cc8aa4f84a169f4d81de58ef4f8d559de31243fd805bcbc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pyrefly/lib/solver/subset.rs:1156-1160 | pyrefly/lib/solver/subset.rs:1169-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pyrefly/lib/solver/subset.rs:1156\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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81bee7eaa16efeb5886274714088eea80b38b1ea2917bd6ea862abcd2e2f6fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45\u201346 lines \u00D7 4): tensor-shapes/jax-pyrefly-stubs/run_pyrefly.py:30-75 | tensor-shapes/pyrefly-einops-stubs/run_pyrefly.py:29-73 | tensor-shapes/pyrefly-numpy-stubs/run_pyrefly.py:29-74 | tensor-shapes/pyrefly-torch-stubs/run_pyrefly.py:29-74 \u2014 \u0060tensor-shapes/jax-pyrefly-stubs/run_pyrefly.py\u0060 and \u0060tensor-shapes/pyrefly-einops-stubs/run_pyrefly.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 61 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tensor-shapes/jax-pyrefly-stubs/run_pyrefly.py:30\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"tensor-shapes/jax-pyrefly-stubs/run_pyrefly.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e929e727ad9939b73043180bb31be49852b3a7d719f46d8ce6521b95580e2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): tensor-shapes/jax-pyrefly-stubs/suites.py:19-46 | tensor-shapes/pyrefly-numpy-stubs/suites.py:19-45 \u2014 \u0060tensor-shapes/jax-pyrefly-stubs/suites.py\u0060 and \u0060tensor-shapes/pyrefly-numpy-stubs/suites.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 28 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"tensor-shapes/jax-pyrefly-stubs/suites.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a815e7fc683ddec4b4021d12a9f502a2816d7008deeffec9bf1d8a33d26b673c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/tsp_types/protocol_generator/generate_protocol.py:613-632 | crates/tsp_types/protocol_generator/generate_protocol.py:768-787 \u2014 both copies are in the same file, so extract the block 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":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3dd26d263475102850600627f6b00082f154eac2e225d969d0b2e1a387ded1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/tsp_types/protocol_generator/generate_protocol.py:116-132 | crates/tsp_types/protocol_generator/generate_protocol.py:142-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":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"88310a5287895aa40996f028cbfe0ffc5fa45a98dd1cf1cab20225fbaa9cc862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): crates/tsp_types/protocol_generator/generate_protocol.py:571-584 | crates/tsp_types/protocol_generator/generate_protocol.py:585-598 | crates/tsp_types/protocol_generator/generate_protocol.py:737-752 \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":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0ae429128ee83885f18b0966823e2b3412e889d0702e766ab6f59b08e41868"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 5): tensor-shapes/jax-pyrefly-stubs/run_pyrefly.py:64-78 | tensor-shapes/microtorch/run_pyrefly.py:35-48 | tensor-shapes/pyrefly-einops-stubs/run_pyrefly.py:63-76 | tensor-shapes/pyrefly-numpy-stubs/run_pyrefly.py:63-77 | tensor-shapes/pyrefly-torch-stubs/run_pyrefly.py:63-77 \u2014 \u0060tensor-shapes/jax-pyrefly-stubs/run_pyrefly.py\u0060 and \u0060tensor-shapes/pyrefly-einops-stubs/run_pyrefly.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 61 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tensor-shapes/jax-pyrefly-stubs/run_pyrefly.py:64\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, \u0060tensor-shapes/pyrefly-torch-stubs/run_pyrefly.py:78\u0060 calls \u0060venv_site_packages\u0060, \u0060venv_python\u0060 and \u0060tensor-shapes/microtorch/run_pyrefly.py:49\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/jax-pyrefly-stubs/run_pyrefly.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7d194288f6b69137446a6c9cfe99fd0eedef4d2b1ae7be8e1c255a4769b6c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): conformance/conformance_output.py:226-236 | conformance/conformance_output.py:266-277 \u2014 both copies are in the same file, so extract the block 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 \u0060conformance/conformance_output.py:226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"conformance/conformance_output.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8855e8efbd7bae3e1c935464c5b06588a3f9e3c5f472a058787f7080b66ad601"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tsp_types/protocol_generator/generate_protocol.py:334-345 | crates/tsp_types/protocol_generator/generate_protocol.py:349-360 \u2014 both copies are in the same file, so extract the block 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":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"63501a00f77570caa929040d4ab1ee8453978dac89720e4223e982678f7433ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tsp_types/protocol_generator/generate_protocol.py:474-485 | crates/tsp_types/protocol_generator/generate_protocol.py:523-534 \u2014 both copies are in the same file, so extract the block 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/tsp_types/protocol_generator/generate_protocol.py:472\u0060 calls \u0060rfind\u0060 and \u0060crates/tsp_types/protocol_generator/generate_protocol.py:522\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":"crates/tsp_types/protocol_generator/generate_protocol.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"29476d9d28c2084ed9cd8e29bcb14c625b2a47423aa64e97c4cb4c1d5178b48c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 23 shared lines): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:276-315 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:276-315 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:233-267 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:256-295 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:209-243 \u2014 These 5 members are variants of one another: a block of 23 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 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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e908e25988c1bdc2ae4d5cc3e7be279460b06515183ac0e05c53fa349c75f6df"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (80 shared lines): tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:56-270 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:323-444 \u2014 These two members are variants of one another: 80 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":"tensor-shapes/pyrefly-torch-stubs/examples/openpose.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"af499e61b5187358e8cdfe8d315f3a4f622b75979b89d06d78ba5ee99c5576b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:96-102 | tensor-shapes/pyrefly-torch-stubs/examples/mixtral_moe.py:182-188 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:99-105 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:103-109 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:117-123 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:107-113 \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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e117293d1851b578eaa27f130f7ec013471f1316cac6dae865328127be8841cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:106-123 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:109-126 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:113-130 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:127-144 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:117-134 \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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"468a6425e94a9256253a2adc6d3ed49d824d91bf66e35906a7e51f4196076f14"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:229-249 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:232-252 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:236-256 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:250-270 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:240-260 \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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f074e0479b904391e0815bd48c75fa623dd2c6ec33bf63f190e2e942cd71b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:280-297 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:283-300 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:282-296 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:301-318 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:286-300 \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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"912d39decf1fe2796d3f42baefb83fbeb8c1e49ba88cd1f952396a32a984c35e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:494-524 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:497-527 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:463-493 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:506-536 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:458-488 \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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ae5938ac44792532dbc3861174b4f95c3e6de301742d9623dc95fd929f9600"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:75-101 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:75-101 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:75-98 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:76-102 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:72-95 \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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5aaf62650f4f07b52a196d078be2bce5d60871558ea49e7e26006543b4fb11"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:334-339 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:334-339 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:286-291 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:315-320 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:263-268 \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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87c49750892bc19a0f720c029f407ba72a65ef76f365fe2d1305adc986e6c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:395-402 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:395-402 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:335-342 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:376-383 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:312-319 \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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28a44de561b917e423e78a2f58b210a8403ae7d2aa2335b32518cc486878b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:406-463 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:406-463 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:346-403 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:387-444 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:323-380 \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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aa4bcd908879c481a94c9a94ca90d0765db16c4860798465909883b86c7e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:467-497 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:467-497 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:407-437 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:448-478 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:384-414 \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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0495c2a05e4274731176d769e4d9f551d83b0287b2d65313724f17b49637858"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:500-513 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:500-513 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:440-453 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:481-494 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:417-430 \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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbf893798826ba3800457092637ac6c08b9744afad97758908644174ace813f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:470-491 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:473-494 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c974741398bbf987f340f1d6279a057266c4ad5c2872ce884dd109184c4c2a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/drq.py:166-181 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:434-450 \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":"tensor-shapes/pyrefly-torch-stubs/examples/drq.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2ec09e65b7059ea2e95400415e8cacf34afaf03928d8e322bbb2013d668304"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py:428-445 | tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py:449-462 \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":"tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb695f48e1c47d2e722e14b31eace3fb299ba8d504a2637d01479827f10b2c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py:109-119 | tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py:163-176 \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":"tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df4d06e77b5d1c2a7988bb9c29e1e755afea1c3a947bff4013908cd005c6f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py:422-441 | tensor-shapes/pyrefly-torch-stubs/examples/stargan.py:169-186 \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":"tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c82e0d30fdfaa36ff6b7083761b77be4489ebd8d5f5585e754d6953afa26900"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): tensor-shapes/pyrefly-numpy-stubs/examples/stats.py:130-144 | tensor-shapes/pyrefly-numpy-stubs/examples/stats.py:148-164 \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":"tensor-shapes/pyrefly-numpy-stubs/examples/stats.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff822b58595dcd5a4b46dd76bb1e1f9b9eaea0d317668a9816eb2dbe55d2ed5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py:169-181 | tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py:207-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":"tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"72864b832ae9bd85b31ea836acb0b032818ac72a37c8ad61262a3bf78ca8afec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): tensor-shapes/jax-pyrefly-stubs/examples/bert.py:475-484 | tensor-shapes/jax-pyrefly-stubs/examples/bert.py:488-497 | tensor-shapes/jax-pyrefly-stubs/examples/bert.py:501-512 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/jax-pyrefly-stubs/examples/bert.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b90086a5bc3e0defbee0581a775c5259771737f11b687e563ccd84e26551587"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py:542-550 | tensor-shapes/pyrefly-torch-stubs/examples/sam.py:1390-1398 | tensor-shapes/pyrefly-torch-stubs/examples/sam.py:1402-1409 | tensor-shapes/pyrefly-torch-stubs/examples/speech_transformer.py:460-467 | tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py:612-620 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb5d420476cc1efb345dfb6b0380d97956bc3f69700f13d34f15ec4242b60d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/unet.py:196-209 | tensor-shapes/pyrefly-torch-stubs/examples/unet.py:256-269 \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":"tensor-shapes/pyrefly-torch-stubs/examples/unet.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4eb6fa464795848afd12b887b8c19d37a87d5dfd1cfe7a8289dbef0dbfb0c22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:398-408 | tensor-shapes/pyrefly-torch-stubs/examples/super_slomo.py:216-223 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aae66f59e981f70fa3df88296f0faffc96ff7f414f97cdaca0cb07d4e7f7f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/drq.py:132-139 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:389-394 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:424-431 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/drq.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a4d6fa692f0913bdb2129118934b74557e60f61d4335ab4adccd4b25b3076c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/tts_angular.py:227-245 | tensor-shapes/pyrefly-torch-stubs/examples/tts_angular.py:265-282 \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":"tensor-shapes/pyrefly-torch-stubs/examples/tts_angular.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"856a44ef4e0f49d32cda447beebd21bd0dd86c28a6b678f30c773bc8f2c0d0ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/llama.py:450-463 | tensor-shapes/pyrefly-torch-stubs/examples/llama.py:467-480 | tensor-shapes/pyrefly-torch-stubs/examples/llama.py:484-497 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/llama.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38717a4c621b75c63a61f295e83f54c1a117580d656b5199d54c7dccef7d70a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/resnet.py:37-45 | tensor-shapes/pyrefly-torch-stubs/examples/resnet.py:66-75 \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":"tensor-shapes/pyrefly-torch-stubs/examples/resnet.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5c7b57bada61dc4e3bd264480bf5b02a2343c1580f6e010d3d6b2ee5965de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/resnet.py:80-86 | tensor-shapes/pyrefly-torch-stubs/examples/unet.py:83-87 \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":"tensor-shapes/pyrefly-torch-stubs/examples/resnet.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5820f0e666dfd16aef9cddbc3bd128553e13d6573186f468ed68b18c15ac3e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 6\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/speech_transformer.py:535-540 | tensor-shapes/pyrefly-torch-stubs/examples/super_slomo.py:362-367 | tensor-shapes/pyrefly-torch-stubs/examples/super_slomo.py:371-376 | tensor-shapes/pyrefly-torch-stubs/examples/super_slomo.py:396-406 | tensor-shapes/pyrefly-torch-stubs/examples/unet.py:330-335 | tensor-shapes/pyrefly-torch-stubs/examples/unet.py:339-344 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/speech_transformer.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"763d3adf98d1448903c10c0d9717e61fa116a8847d6018966a6bac251b388007"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:498-510 | tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:514-522 \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":"tensor-shapes/pyrefly-torch-stubs/examples/demucs.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12d5f509894985a7f4c82c6d618903e0f8fd24b7dddcaf615d89c3429cef393"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/mixtral_moe.py:494-499 | tensor-shapes/pyrefly-torch-stubs/examples/mixtral_moe.py:503-508 | tensor-shapes/pyrefly-torch-stubs/examples/sam.py:1380-1386 | tensor-shapes/pyrefly-torch-stubs/examples/speech_transformer.py:479-484 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/mixtral_moe.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec85efc86336dca05832892e240ee9e447904109716162c526a8b57397da250"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:192-199 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:223-230 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:249-255 \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":"tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2001b358ced68a226461057600af4c65b04aae4cfc413a99d2f39ee0803e3a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py:533-538 | tensor-shapes/pyrefly-torch-stubs/examples/dcgan.py:291-300 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:477-481 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8b07fc861140d242e5aeb8e9cde9a861dd81ca8972fcdedb53b18ed97c599e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/sam.py:1319-1326 | tensor-shapes/pyrefly-torch-stubs/examples/sam.py:1354-1358 | tensor-shapes/pyrefly-torch-stubs/examples/sam.py:1362-1376 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"tensor-shapes/pyrefly-torch-stubs/examples/sam.py"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9e53c3458434a3aa2ecd647d126b4c282df3b4812c886669ebaa8f94cd83c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py:133-142 | tensor-shapes/pyrefly-torch-stubs/examples/unet.py:48-57 \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":"tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf9f9317c6d2e7b6c3d6b49d892e1e3e42117e59bf9e078c1df0e85a2ce849b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:467-472 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:476-481 \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":"tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9d1357966072ee599518fa1cfbddd7900ca9da0a4de98ef04151d7486c8196"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py:82-86 | tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py:109-113 \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":"tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec1277ad9401c49a5d5fbabcad284a0b80c3a07be88120bc58a82b57d6daa5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/resnet.py:246-250 | tensor-shapes/pyrefly-torch-stubs/examples/resnet.py:254-258 \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":"tensor-shapes/pyrefly-torch-stubs/examples/resnet.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee7bfcc454eed89aa44354439a675f845dca20d2d790a5492251cb67efc3f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:539-547 | tensor-shapes/pyrefly-torch-stubs/examples/mixtral_moe.py:479-483 | tensor-shapes/pyrefly-torch-stubs/examples/speech_transformer.py:504-509 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"tensor-shapes/pyrefly-torch-stubs/examples/demucs.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf2883462736620d96081f02cd9ebe83db9be603fc3becf3aa53c3e9f7a09da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/sam.py:132-149 | tensor-shapes/pyrefly-torch-stubs/examples/sam.py:165-176 \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":"tensor-shapes/pyrefly-torch-stubs/examples/sam.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef713cd6afd72fc59a91831100ee82a64c699b2ae318275e75b6b6252910831"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/sam.py:1338-1342 | tensor-shapes/pyrefly-torch-stubs/examples/sam.py:1424-1429 | tensor-shapes/pyrefly-torch-stubs/examples/unet.py:314-318 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"tensor-shapes/pyrefly-torch-stubs/examples/sam.py"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc2318bff86ce395ff0d736b5d1281e7b335ff38617c2f31cf01e9aef541e4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/dcgan.py:161-165 | tensor-shapes/pyrefly-torch-stubs/examples/dcgan.py:248-252 | tensor-shapes/pyrefly-torch-stubs/examples/resnet.py:231-237 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"tensor-shapes/pyrefly-torch-stubs/examples/dcgan.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fbd2eb9119ca012ca1c4246a9165d583cefbb009f238a438d80950708cffaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): tensor-shapes/jax-pyrefly-stubs/examples/nanogpt.py:87-92 | tensor-shapes/jax-pyrefly-stubs/examples/bert.py:83-85 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"tensor-shapes/jax-pyrefly-stubs/examples/nanogpt.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b63c8edf371f3464749299e559e8f535748774d70c291effaefe0d54873354"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:317-320 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:320-323 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:316-319 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:333-336 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:315-318 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d83c73a865b04285ffb679a1fcecb0939a3004f8702c163f379da9a0492b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py:554-558 | tensor-shapes/pyrefly-torch-stubs/examples/dcgan.py:284-287 \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":"tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5694a88833aa9aa345b65b7ed076fdd9904b2ff564ec7d10012b7d53dad75a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/speech_transformer.py:527-531 | tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py:640-644 | tensor-shapes/pyrefly-torch-stubs/examples/tts_angular.py:384-388 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"tensor-shapes/pyrefly-torch-stubs/examples/speech_transformer.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea28f27cdce9023c67a34ac468ca3c26e1f3777fab9cd93c34efda47556f1bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tensor-shapes/pyrefly-numpy-stubs/examples/physical_science.py:112-118 | tensor-shapes/pyrefly-numpy-stubs/examples/stats.py:74-79 \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":"tensor-shapes/pyrefly-numpy-stubs/examples/physical_science.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14c53f5679055ded1b27badc00900ed076f461a4e7076461a71a801e88d7d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:463-467 | tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py:604-608 \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":"tensor-shapes/pyrefly-torch-stubs/examples/demucs.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2aa8ff6b69b133f618b47c8907900183529c95204b5faefc123fb8feafc9e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/apg.py:414-423 | tensor-shapes/pyrefly-torch-stubs/examples/tts_angular.py:408-414 \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":"tensor-shapes/pyrefly-torch-stubs/examples/apg.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"b671da9435b07bab1bfa043b3b5dc5138621934d1269ac250401ca1dd33a7ff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:278-284 | tensor-shapes/pyrefly-torch-stubs/examples/sam.py:1028-1032 \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":"tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a1439c4c895edfb57edcc2500ef8006266af8e20c7c2687c9e1ca3e5d2345a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py:401-405 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:459-463 | tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py:648-652 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75c1dd4741d5ac9e8e43818567a2b4aaa3aafc0a69a4690f447350de0aa0fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py:409-413 | tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py:580-584 \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":"tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d3561ad1bb92a8758f85be04e2d5b8c9bab8697c528a38c186ddf6c9526390"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py:103-106 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:329-333 \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":"tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2931a94eb06577a8baa7af999802fc5706a0f0b1266e8f617ab7ab359b9d6bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:362-365 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:365-368 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:378-381 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ac94329b840a50f1cf0f8d4c3ee0b01378ab24ad5761fde2661fd5a2609c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:478-482 | tensor-shapes/pyrefly-torch-stubs/examples/llama.py:442-446 | tensor-shapes/pyrefly-torch-stubs/examples/mixtral_moe.py:472-475 | tensor-shapes/pyrefly-torch-stubs/examples/speech_transformer.py:513-523 | tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py:588-592 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/demucs.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"952bd5a91c52ab765215b00ab9ef78e49e939e3c30aafc6c2b5d9462949e7374"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 3\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:582-584 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:585-587 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:543-545 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:589-591 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:533-535 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5cfc86a25f2481fc3b31a2160e42f11414aa13a1eb3a485c47c6c016fbf832"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:40-42 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:47-49 | tensor-shapes/pyrefly-torch-stubs/examples/sam.py:85-88 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a1c157f502c5637afa408c2c11b962bcff362fec843e6aa55abea0b5ec2cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tensor-shapes/jax-pyrefly-stubs/examples/bert.py:55-59 | tensor-shapes/jax-pyrefly-stubs/examples/nanogpt.py:52-56 \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":"tensor-shapes/jax-pyrefly-stubs/examples/bert.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdff8714dbec6c32256f980cbd2f3e0bc2877396b36f5fcc2a564d2e57798b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 3\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:226-228 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:226-228 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:183-185 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:221-223 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:174-176 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6e416065cdb09c9b938042f046383e5dd2808d06a759603ea20351e1e8f742"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py:76-79 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:160-163 | tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py:67-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 3 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":"tensor-shapes/pyrefly-torch-stubs/examples/dlrm.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab99171aaca1cecd3b73aae18482d901807303e935927656edd1be9878c76f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/pytest_fixture.rs:329-342 | pyrefly/lib/state/lsp/quick_fixes/pytest_fixture.rs:427-440 \u2014 both copies are in the same file, so extract the block 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 \u0060pyrefly/lib/state/lsp/quick_fixes/pytest_fixture.rs:329\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":"pyrefly/lib/state/lsp/quick_fixes/pytest_fixture.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dc006ce6545dc78c79f0ad00c0dbfafcbe11947165353f243079425a0845e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pyrefly/lib/state/lsp/quick_fixes/pytest_fixture.rs:394-406 | pyrefly/lib/state/lsp/quick_fixes/pytest_fixture.rs:455-467 \u2014 both copies are in the same file, so extract the block 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":"pyrefly/lib/state/lsp/quick_fixes/pytest_fixture.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a837efa5d173ae882388e92024cc9b1a6c7d4bc6dce083430b68124af89dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:406-463 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:406-463 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:346-403 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:387-444 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:323-380 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fcd6a2b52297c1799eb5920840dd6e7d17b079e786eb9c4c72e6e1e47d95da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:103-147 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:98-142 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 288 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcfeb2898d7347dbdb3eb8cbabe03fdf64c3cf98dad481544a9d6442b6b5ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:346-389 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:346-389 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:327-370 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a3fbec6fb94fb7ad162c3759321125bddbfeb98016bdc29847379ef087e227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (75 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:106-180 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:106-180 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:105-179 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py: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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"790d3973b2cbbc4e9dcbaf9a28d363c397b7b4ad0fbfcb06f2a7cf9be20dc23b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:298-329 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:275-306 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 288 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b62be49b220ded47c508378b6b3d612f14489c981d77b58e6b49d362dfbd967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:494-524 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:497-527 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:463-493 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:506-536 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:458-488 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"218163db7d64607318d1aceee7ee3a7cc5093407ea65f1858cd5e89c3251f26d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:467-497 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:467-497 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:407-437 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:448-478 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:384-414 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d392d4e1a66b52df863f6dcb2a23642a9a9b2f29ab14230c7e17a54807e36c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:523-558 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:523-558 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:504-539 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f592d0977e23b8dda521b7087149fae99130da3e79d85ec2fbb4c428b231d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:229-249 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:232-252 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:236-256 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:250-270 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:240-260 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd9c9d29ac37ddafd25f23bcb6f57ff86b3fc053c09c828433fb317a5ce6eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:401-428 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:401-428 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 202 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32bd64223de148769dcd112a4578b6703af5b45c363c0fc341e56429f83bf8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:463-491 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:440-468 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 288 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9d30803e032f7fed1134acced014e51b94e25d4c6963a2dd9f5ae6f6d75405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:106-123 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:109-126 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:113-130 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:127-144 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:117-134 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2108aba64ee3dba77511f555c7d41f40e32750c584a4d0d4b638184016e9d172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:84-100 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:84-100 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:82-98 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:85-101 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:79-95 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:101\u0060 calls \u0060assert_type\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:100\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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd3278d3277a69bfae8d5a04f6b219d17c261ac7bf45e6600db05d1f538880e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:287-303 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:287-303 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:267-283 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:287\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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec3521e15d8192da5df6113b49fcac4913c3a1027cd5585285d91eff3df94ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:276-290 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:276-290 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:233-247 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:256-270 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:209-223 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"796a3dbfa576f0ba1d2ec468eaca74bb04c75f611a2d000c8991040257f39cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:280-297 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:283-300 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:301-318 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:280\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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b693748626fca674aea242b93089574198a85e7b5c5f00e8d50d2b1053e4d424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): scripts/github_utils.py:725-739 | scripts/github_utils.py:834-846 \u2014 both copies are in the same file, so extract the block 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 \u0060scripts/github_utils.py:725\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":"scripts/github_utils.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d19ae3242acff5f8a0085cf1529a097c94ad2fc2f32062d06f8dad05c148e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:446-460 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:441-455 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 202 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:446\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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d8bd9d49e33a40faa1eb9b109afb09453e12369f4cdc8ebe45c9ed654de432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/unet.py:215-237 | tensor-shapes/pyrefly-torch-stubs/examples/unet.py:275-297 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/pyrefly-torch-stubs/examples/unet.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"688ba1fb9395c81b2ca35388edea092ea57c60c8790e22f901df80eeecd142d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:500-513 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:500-513 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:440-453 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:481-494 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:417-430 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"c210e251c56b98965091611ef45242a2e23b7000b32022818871903b5a236463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:470-487 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:473-494 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:482-503 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:470\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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b5ea177ce0a0d6506d87938a440c0af18c96d88449d5bf80c9b9e88b594e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/llama.py:501-514 | tensor-shapes/pyrefly-torch-stubs/examples/llama.py:518-531 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/pyrefly-torch-stubs/examples/llama.py"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bfdceafc76469b944d45d7a795bc014e19a5a5df9403e3da2e7fd0b82cfc78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:282-296 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:286-300 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 202 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ceba841111aaa4140275d06249966067f470e54751228d506ca7a5b709a67f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/drq.py:400-407 | tensor-shapes/pyrefly-torch-stubs/examples/drq.py:409-421 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/pyrefly-torch-stubs/examples/drq.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a7835a17101655870dd4e4c23b8bb002b28caa5246b665d5b314badfb6eb2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:301-312 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:301-312 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:253-264 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e09e89e136c448cee94fdf73510a3f69b3fca8fe7fa782d03d7ce6e53b369b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:82-93 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:355-366 \u2014 both copies are in the same file, so extract the block 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:82\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, \u0060tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:370\u0060 calls \u0060Sequential\u0060, \u0060Conv2d\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:94\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":"tensor-shapes/pyrefly-torch-stubs/examples/openpose.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"495967a3cd2551ee52a0ff02b2bb2dabb57112f7e800e4cea1aec5f0a6233978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:498-509 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:493-504 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 202 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db5596f61bbc79ba4bb2bd200267631e65df69f710498f7f6080254ad50ad00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:281-292 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:229-240 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 179 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f37202e4e9002aa2be129f58f71786ba8540ba44931f07efdbde807381e0d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:377-394 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:380-397 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:393-410 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:377\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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f168608fa5e8f8e080edae4372343b9c71d861ba6055a49ad2dfe4e3fc780c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:529-544 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:532-547 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:541-556 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:529\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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4cf87821b74b59d8837166ce0b92859ae8785b75a131fc1bd70a7a78cee98b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/github_utils.py:452-462 | scripts/github_utils.py:473-483 \u2014 both copies are in the same file, so extract the block 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 \u0060scripts/github_utils.py:452\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":"scripts/github_utils.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b72678dfcbc67f9094e3c6e2f60007d04d08c01b916957baa905ac248c78df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:266-276 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:270-280 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 202 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:266\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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"556aa8f5ee60257d46794c6879b9db9f274a59ee579dc96802327699fec4c180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): scripts/github_utils.py:444-453 | scripts/github_utils.py:465-474 | scripts/github_utils.py:486-494 \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":"scripts/github_utils.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f17d1d514719c2628480d314e2a2b85c87ebc6e3d12bae2d774489a727de8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:259-274 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:262-277 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:280-295 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:259\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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"198f35967a939a4c918f4cf0185215d5d853ec8c0a2c37405bdb686aaee8a799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:411-452 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:414-455 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:428-469 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:411\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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a431f8d5759a4d4ce5271e2328c42e7a4f55e289f47a316272fb7cdfa110f5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/unet.py:196-204 | tensor-shapes/pyrefly-torch-stubs/examples/unet.py:256-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/unet.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"082043777f3170598079e16a24138fe791768effb74af8785474981082a4bc2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:308-315 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:308-315 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:260-267 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:288-295 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:236-243 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec782eaaf015a0ac6f445f12a07587bcf98ebd2385e10b00d7427f1b441fafb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:395-402 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:395-402 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:335-342 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:376-383 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:312-319 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5071c038edd4bfd8f397a45cfe8890e8d2784759a3ebac228b6dbaeb5109bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:565-573 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:568-576 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:572-580 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e25c755792474482a221ee254cfe1f0bf07bc88b366c45d0402fe95e2ce281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:213-221 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:213-221 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:210-218 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ec9adde4d52bdf32d3c3ce5096942a6ba2f167c260152f1df93dbee196cd1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:498-509 | tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:514-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/demucs.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea2a0e0615c9cf562ca5a7b347d3ec15178eeb8ca9ca01d0282b202d0781d25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:96-102 | tensor-shapes/pyrefly-torch-stubs/examples/mixtral_moe.py:182-188 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:99-105 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:103-109 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:117-123 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:107-113 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"011596e07386b75f147f00ed2c9037ddb8ed8a906cb23f5853886780202d7b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:285-291 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:288-294 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:285-291 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:306-312 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:289-295 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:292\u0060 calls \u0060assert_type\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:293\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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a59fe9d7de6a1f73b89f34ea6833e3fea57b6477f8251a583ccc53eaf0f1af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:198-206 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:198-206 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:195-203 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"185467feab33028676ab7f2800f20d125149dd90ecfef3f5f905555f47b80fde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:372-384 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:371-383 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 202 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:372\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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0794d9d996cd78c5822598733ab1061d18704444982c201bd36bd6c554a720a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:82-87 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:265-270 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:355-360 \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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:82\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":"tensor-shapes/pyrefly-torch-stubs/examples/openpose.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf842c037ba02b4f88472397cc09d757cb0fddf4ffe679f3fc441afeefea936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 25): tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:60-63 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:64-67 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:71-75 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:80-84 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:92-96 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:105-109 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:118-122 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:133-137 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:148-152 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:163-167 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:178-182 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:195-199 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:210-214 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:225-229 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:240-244 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:257-261 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:327-330 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:331-334 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:338-342 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:347-351 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:372-376 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:387-391 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:402-406 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:417-421 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:432-436 \u2014 all 25 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:64\u0060 calls \u0060MaxPool2d\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:85\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":"tensor-shapes/pyrefly-torch-stubs/examples/openpose.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a921b5340a06edb39de5c15fecfdfa0baf312fc9b701fbd911bd7c68a6286f30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 16): tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:96-100 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:109-113 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:126-130 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:141-145 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:156-160 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:171-175 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:186-190 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:203-207 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:218-222 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:233-237 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:248-252 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:380-384 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:395-399 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:410-414 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:425-429 | tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:440-444 \u2014 all 16 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 \u0060tensor-shapes/pyrefly-torch-stubs/examples/openpose.py:96\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":"tensor-shapes/pyrefly-torch-stubs/examples/openpose.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc63fd7b27f0bd9772b6da398483acd99b8c6370e0efa0c3480558369701af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:334-339 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:334-339 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:286-291 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:315-320 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:263-268 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"73162bebd8f5e9131da0d301ba39806afba0a1fa7c66180760ad3f92d173346f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:75-85 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:75-85 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:76-86 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aacc005e6b4e4f39244b84d5fba3b6225b18403f74bd60b9e041f048335321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tensor-shapes/pyrefly-numpy-stubs/examples/physical_science.py:88-93 | tensor-shapes/pyrefly-numpy-stubs/examples/physical_science.py:145-150 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/pyrefly-numpy-stubs/examples/physical_science.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"833b4a955ab018fc90f8dee5edd7117c497b27ed357a9bbba6c98d142cb9f14b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:224-228 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:287-291 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e30ab86c93eabfd721b2b0502e72620e4c825be5c8950c83923ba903699a8b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:403-407 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:441-445 \u2014 both copies are in the same file, so extract the block 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, \u0060tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:439\u0060 calls \u0060assert_type\u0060, \u0060relu\u0060, \u0060conv4\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:402\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":"tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0d934b2ffd236b254dfac3b83d424632fb998843572996c904c6641be478ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py:301-305 | tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py:307-311 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/pyrefly-torch-stubs/examples/tacotron2.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a312ab1dc3f0175afdc6953aaab1a638b8ed5834c2917693da20db2e878c2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:332-340 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:335-343 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:331-339 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:348-356 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:330-338 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7f678cbbfb2f158a02880a00122d1bf4f1f7c64239d32a47c1598c7e6de21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:398-402 | tensor-shapes/pyrefly-torch-stubs/examples/mixtral_moe.py:267-271 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:401-405 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:388-392 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:415-419 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:388-392 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cf5d547a283ae5c9739cb0d11533d566ae0016b5e116be22414977586b3c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:322-331 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:322-331 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:274-283 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:302-311 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:250-259 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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. 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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2c779ab06fcddda5c84699d03e6ba8c920f5a59db69e901ff10ceb8e6b532b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:530-534 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:520-524 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 202 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cf1b7191907ae6c61d94652e463869c81a009a07abdac60ad0c017059c182f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:163-167 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:156-160 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 288 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dfffd67ff083a8c5e67e92cbc9fe00095bc6ef3076ca0a6396c843ffa8d5f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:174-178 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:167-171 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 288 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"576f7aaf14100ef64f49a8dd40f5e04e0f464db35995671690560b028bc9e72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/super_slomo.py:380-384 | tensor-shapes/pyrefly-torch-stubs/examples/super_slomo.py:388-392 | tensor-shapes/pyrefly-torch-stubs/examples/unet.py:356-360 \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":"tensor-shapes/pyrefly-torch-stubs/examples/super_slomo.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"d284b674084c77cbe7c51b25a491d7063605e1c9bd0e3b53e7458a7ddd501063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py:509-513 | tensor-shapes/pyrefly-torch-stubs/examples/stargan.py:205-209 \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":"tensor-shapes/pyrefly-torch-stubs/examples/background_matting.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8d7e6a649f48fb3f226ba1afd14ec6e1d79f35a80a8a7c0e95b196e1cd94b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:397-404 | tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:408-415 | tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:419-426 | tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:430-437 | tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:441-448 | tensor-shapes/pyrefly-torch-stubs/examples/demucs.py:452-459 | tensor-shapes/pyrefly-torch-stubs/examples/sam.py:1311-1315 \u2014 there are 7 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 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/demucs.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1664d6816a69f0f137eaa108f386663d69fe1d47dc88c5bc885c7bd84f49a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): tensor-shapes/pyrefly-torch-stubs/examples/drq.py:524-528 | tensor-shapes/pyrefly-torch-stubs/examples/drq.py:532-536 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:525-529 | tensor-shapes/pyrefly-torch-stubs/examples/soft_actor_critic.py:533-537 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/drq.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a665a3affdcae88e82a8a3974560b94cf70d1d72ea8532cfb8f908a1400d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tensor-shapes/jax-pyrefly-stubs/examples/bert.py:477-484 | tensor-shapes/jax-pyrefly-stubs/examples/bert.py:490-497 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/jax-pyrefly-stubs/examples/bert.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0b9eefc4cb2fbd96302340cc7f3fea2be723cee041b215560e44b5ad9989f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/densenet.py:287-291 | tensor-shapes/pyrefly-torch-stubs/examples/densenet.py:295-299 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/pyrefly-torch-stubs/examples/densenet.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"300873a1bbb54a984b510c845e9cafa136b8758b6082a69b78a2c198fb469b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/densenet.py:311-315 | tensor-shapes/pyrefly-torch-stubs/examples/densenet.py:319-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/densenet.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd7c44a4c877984971cf98a989f5ed651c7ff9554671f07eda0d2096ac93b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/drq.py:548-554 | tensor-shapes/pyrefly-torch-stubs/examples/drq.py:558-564 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/pyrefly-torch-stubs/examples/drq.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b5055dda312fcd9d0aee5d12a00486d11f47702421cb24b29c8507949a826f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py:347-354 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py:350-357 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var.py:363-370 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 247 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/gptfast.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a8b525f248c1e7ca49932e078e3abfa2e0d422418c82247dd7d4efc55ae9a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:38-42 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:38-42 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:49-53 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37931256fc6a68358c717faa37aecbe98e0586e12b4465a5d4bd13ad0b8e087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py:187-193 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py:187-193 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py:186-192 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 392 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e14b72b5313d11c2cd0dd9da3039e9b6f6ca85a1aa7178ea956861a85f4e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py:346-350 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py:345-349 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 202 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/gptfast_future_annotations_runnable.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f475df1f859756edb185fab791a97b5f8b528576e7821ab609a990f5f6dd03ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py:154-158 | tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py:149-153 \u2014 before extracting anything, compare \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py\u0060 and \u0060tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 288 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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f147ecc811d83fc7c222254702b270df6666eef193c7fb3a601b09bb6052670a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/stargan.py:213-218 | tensor-shapes/pyrefly-torch-stubs/examples/stargan.py:222-227 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/pyrefly-torch-stubs/examples/stargan.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f11a42749863f1acdfe74c64643ffe338edd374bf9831ffbb0e6ce7ccb99ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/stargan.py:231-236 | tensor-shapes/pyrefly-torch-stubs/examples/stargan.py:240-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tensor-shapes/pyrefly-torch-stubs/examples/stargan.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c87fb13bceb7af581f39703d02b97842d662988b6eea6d27febcac10bdd51f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/super_slomo.py:346-350 | tensor-shapes/pyrefly-torch-stubs/examples/super_slomo.py:354-358 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/pyrefly-torch-stubs/examples/super_slomo.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e1f9e311dc663268d006177b3b7729ba6aa5c490892bcdcdff3884d66f228a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tensor-shapes/pyrefly-torch-stubs/examples/unet.py:115-119 | tensor-shapes/pyrefly-torch-stubs/examples/unet.py:145-149 \u2014 both copies are in the same file, so extract the block 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":"tensor-shapes/pyrefly-torch-stubs/examples/unet.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f7e27ce1198afc1f62c326641495160d3a0eacabbf0715cf700fbda312f4ca"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NestingContext (LCOM4 5): NestingContext\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":"crates/pyrefly_python/src/nesting_context.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bc35885e4c576e55d555649b75267c1dc60af18fcfac51a587233bdad5fb89"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Solver (LCOM4 4): Solver\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba75728542f7fb2a32b63671e559c5262f34d0265dc31dacaef59ff372929c7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: startup requests and diagnostics use the interpreter from the Python extension: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/test/startup-settings/instant/instant.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a97e739683f8d874acb32e93d5d7b8f465599a13ddfb4313aa88a6bb725e4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_types/src/type_level_dsl.rs: crates/pyrefly_types/src/type_level_dsl.rs changed 87 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 278 in StructurallyValidatedTypeShapeDslFunction::evaluate_expression at line 6986. 3 of those changes were fix/bug commits, and the other 84 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_types/src/type_level_dsl.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6986}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6e7770413d45cf3f8e76aaa00d384617a787d81d0da5b20b1751d4e3afcfad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/solver/subset.rs: pyrefly/lib/solver/subset.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 251 in Subset::is_subset_eq_no_recursive_check at line 1922. 9 of those changes were fix/bug commits, and the other 56 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/solver/subset.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3663348591fec924795283dc8e6dc310d11c07ad5713848e0f2feb717c85bcf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/class/class_field.rs: pyrefly/lib/alt/class/class_field.rs changed 116 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 132 in AnswersSolver::calculate_class_field at line 1689. 24 of those changes were fix/bug commits, and the other 92 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/class/class_field.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"591c4a85794526e142af185a5d8b163c79bbfb0a7b74ece35598453fbbe92159"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/solve.rs: pyrefly/lib/alt/solve.rs changed 183 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in AnswersSolver::binding_to_type at line 7166. 15 of those changes were fix/bug commits, and the other 168 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/solve.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd186018a8c5263d7bdf0641401f6482364f6a3dadeca55e3ccb728b31d724c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/stmt.rs: pyrefly/lib/binding/stmt.rs changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 188 in BindingsBuilder::stmt_impl at line 929. 10 of those changes were fix/bug commits, and the other 52 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/stmt.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d0d8effc49010e341b658222cd5e7987abcde07dad11542ee2daf29ba64ff0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/expr.rs: pyrefly/lib/alt/expr.rs changed 121 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in AnswersSolver::subscript_infer_for_type_with_key_present_inner at line 3515. 13 of those changes were fix/bug commits, and the other 108 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/expr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"72276db1689db1c086d38aa2ec8b76d7ce49400a1ce2a31342da664669221661"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/lsp/non_wasm/server.rs: pyrefly/lib/lsp/non_wasm/server.rs changed 81 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 136 in Server::process_event at line 2099. 9 of those changes were fix/bug commits, and the other 72 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/lsp/non_wasm/server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a12c950571ab7a071eb0e7b7e1f38ba40440667fc1ff9bed3f074dfa03b6b51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/callable.rs: pyrefly/lib/alt/callable.rs changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 147 in AnswersSolver::callable_infer_params at line 1143. 8 of those changes were fix/bug commits, and the other 48 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/callable.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f839da764979dba181a6a8e088d9da7f3dfdaebd24579642012d77bb363aa2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_types/src/display.rs: crates/pyrefly_types/src/display.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 160 in TypeDisplayContext::fmt_helper_generic at line 954. 5 of those changes were fix/bug commits, and the other 41 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_types/src/display.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7fc47afa24c376f467a92ab38cb8b31c1d6f3b7d366066649b716fd9e7d24b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/narrow.rs: pyrefly/lib/alt/narrow.rs changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 127 in AnswersSolver::atomic_narrow at line 1621. 15 of those changes were fix/bug commits, and the other 41 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/narrow.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40467b0f7ffe95683dfb4d80d468ae89cee62d098ec8d2b46e84c91018ba1ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/call.rs: pyrefly/lib/alt/call.rs changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in AnswersSolver::as_call_target_impl at line 412. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/call.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4a8471b0759a3d56bc7bbfb26e9b438b88419cc00e02564b7167849c193b7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/binding.rs: pyrefly/lib/binding/binding.rs changed 85 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in Binding::fmt at line 2876. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/binding.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/binding.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"13980894aa5b0aef35507220e39027feb7d8c6caba173a247c0cea092ffa31ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/type_level_dsl.rs: pyrefly/lib/alt/type_level_dsl.rs changed 82 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in AnswersSolver::validate_type_shape_dsl_declaration at line 291. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/type_level_dsl.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/type_level_dsl.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"639c36861fb1ab5679097542b973a139ffd8a203263546b425d5ade71c17474b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/attr.rs: pyrefly/lib/alt/attr.rs changed 74 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in AnswersSolver::as_attribute_base1 at line 2640. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/attr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"99da448684159686006a6d55753ab393e530e701eb82e9a14a1a470e7399d855"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/state/lsp.rs: pyrefly/lib/state/lsp.rs changed 87 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in Transaction::local_quickfix_code_actions_sorted at line 3803. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/state/lsp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":3803}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d68a09776663c07c668cf1293748aa0df75999e0cb25bcc12b9df40cb046dcf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/solver/solver.rs: pyrefly/lib/solver/solver.rs changed 83 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in Subset::is_subset_eq_var at line 3909. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/solver/solver.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0ec482182551614877f4a81cadc63334788d9fffe8d38a802af998f97d774c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/commands/check.rs: pyrefly/lib/commands/check.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in CheckArgs::finish_cli_run at line 2122. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/commands/check.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb565fe8331f168a61a76f8131eaf11b0499c17e5aaa34b0f101be325635b963"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/expr.rs: pyrefly/lib/binding/expr.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in BindingsBuilder::ensure_expr at line 796. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/expr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e72806503440705335d4d86a0d145356e5c36d52bac4e4a7c28cb76143e8e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/state/state.rs: pyrefly/lib/state/state.rs changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in Transaction::demand at line 1559. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/state/state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/state.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc573498932c17276d70c00e7a6f6bcdbe435c7ca8f6092c8d2e97cae45f71e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/function.rs: pyrefly/lib/alt/function.rs changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in AnswersSolver::decorated_function_type at line 861. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/function.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"038d178072b7d33166c42ed6783de6c02ab6c1053fb3541308a448f36810ec2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/scope.rs: pyrefly/lib/binding/scope.rs changed 93 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in BindingsBuilder::merged_flow_info at line 4777. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/scope.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":4777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9f8ff6154759477a5126ac03e501f94fe03fd752208556cc0534ac5e4ecaae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/bindings.rs: pyrefly/lib/binding/bindings.rs changed 107 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in BindingsBuilder::stmts at line 1929. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/bindings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efa5207d61775f55f9cfcad18f65635aaed80040ddcdbc9b3558ebf67ce361a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_config/src/config.rs: crates/pyrefly_config/src/config.rs changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ConfigFile::configure_at at line 1808. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_config/src/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8ba96a1e6ebdc8154aef4a1d43b056078ed917038f4f2241b29f45f9353cba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/export/definitions.rs: pyrefly/lib/export/definitions.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in DefinitionsBuilder::stmt at line 667. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/export/definitions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/export/definitions.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8718d77686a037e6cfbe7435e83b887e236444d29fb1cac3d6c5ea47fa189ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/class/class_metadata.rs: pyrefly/lib/alt/class/class_metadata.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in AnswersSolver::class_metadata_of at line 186. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/class/class_metadata.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2ed0b919724248ba7a78c730666fc1b3ba62529acfd3d6b7ea0972248ef770"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/tsp/type_conversion.rs: pyrefly/lib/tsp/type_conversion.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in TypeConverter::convert at line 314. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/tsp/type_conversion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/tsp/type_conversion.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e2312d7c44de92977b8c7378a7a5546b738efc1869d7ac097b411dede905e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/class.rs: pyrefly/lib/binding/class.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in BindingsBuilder::class_def_inner at line 253. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/class.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/class.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44bf0d2deda5cbfb85823175255195b7141320f65e80911122c28fd08f2685d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/module/finder.rs: pyrefly/lib/module/finder.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in pyrefly::lib::module::finder::find_import_with_mode at line 667. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/module/finder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/module/finder.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bbc1dd2c5a8b35c55e4f0c493beef66555df24db6a6e885226109472b07cdc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/pattern.rs: pyrefly/lib/binding/pattern.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in BindingsBuilder::bind_pattern at line 314. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/pattern.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/pattern.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8436fcad2dc1e90cda68def60fdf75dd37a67eb15533b1d40140e1da4ce37005"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/commands/coverage/collect.rs: pyrefly/lib/commands/coverage/collect.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in pyrefly::lib::commands::coverage::collect::parse_functions at line 952. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/commands/coverage/collect.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/coverage/collect.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46da5f040d8455df466e6914f7dcf07cb7b246ff237e1229f0f30c082603677"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/function.rs: pyrefly/lib/binding/function.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in pyrefly::lib::binding::function::function_last_expressions at line 1257. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/function.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c80301e0aa65c52e40a241193e25f8f216d20de6dc5dbf01e0b868efb2b870"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/state/errors.rs: pyrefly/lib/state/errors.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Errors::collect_unused_ignore_errors_for_module at line 769. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/state/errors.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/errors.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd4726fc7a01eb1ab4c91f68a4e2dd89478f504271ff60d56083231f88030a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/lsp/wasm/completion.rs: pyrefly/lib/lsp/wasm/completion.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in Transaction::completion_sorted_opt_with_incomplete at line 1250. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/lsp/wasm/completion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3630038ac7ff96250278d252b536dd9fc9e4bf8832d37d90f4fd96c78d98d2a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/operators.rs: pyrefly/lib/alt/operators.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in AnswersSolver::try_int_binop at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/operators.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/operators.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9169a50f7a7020cbf846d1b75f5374c12ce2dd00ed271d433c8bfcdbdbb1acc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/narrow.rs: pyrefly/lib/binding/narrow.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in NarrowOps::from_expr_helper at line 1050. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/narrow.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"0754c67c741b3907c63a9d821632293c2fcccc8eef1e0116b21e59212cde2824"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_config/src/args.rs: crates/pyrefly_config/src/args.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in ConfigOverrideArgs::override_config_at at line 622. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_config/src/args.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/args.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a699c3388c104555324d76c45bf874aeac15828a1b48cb18d2ff2cb8e7441ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/special_calls.rs: pyrefly/lib/alt/special_calls.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in AnswersSolver::check_type_is_class_object at line 613. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/special_calls.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/special_calls.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9c3f16b7560fc1c2ba85af1e1fa88138d2c3a9cbfdf7364a0f07ec50940958"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: website/src/sandbox/Sandbox.tsx: website/src/sandbox/Sandbox.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 132 in Sandbox.Sandbox at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- website/src/sandbox/Sandbox.tsx\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":"website/src/sandbox/Sandbox.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9018bdde8f752ac90621123bb0b309d41db71d9efee8cedc229a5f21f59842"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/polars_specials.rs: pyrefly/lib/alt/polars_specials.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in AnswersSolver::polars_join at line 3528. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/polars_specials.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/polars_specials.rs"},"region":{"startLine":3528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79efedf6c8951aa22ea4fcdb606f7362763435c2481ed8523673474f6fb6c5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/error/suppress.rs: pyrefly/lib/error/suppress.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in pyrefly::lib::error::suppress::update_suppressions_in_files at line 402. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/error/suppress.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/suppress.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af0870ee45cae31095e4390d562c9814a3db7567a7747cf3973764f350b9e60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/class/dataclass.rs: pyrefly/lib/alt/class/dataclass.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in AnswersSolver::get_dataclass_synthesized_fields at line 136. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/class/dataclass.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0eddb69e770156a5f1a5f70be658105fc843eac3303866883ce7c6cbfc498f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/lsp/wasm/inlay_hints.rs: pyrefly/lib/lsp/wasm/inlay_hints.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in Transaction::inlay_hints at line 116. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/lsp/wasm/inlay_hints.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/inlay_hints.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33dce5df98a66e366451263124cd1d9c7088a9d5a508dc7c3fc9fe31871c503"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/overload.rs: pyrefly/lib/alt/overload.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in AnswersSolver::call_overloads at line 318. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/overload.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/overload.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0c704889e5d4c7df5072dcb0483e2b0b104f4eece88c789f1ddfb57cd5a85e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/report/cinderx/convert.rs: pyrefly/lib/report/cinderx/convert.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in pyrefly::lib::report::cinderx::convert::type_to_structured at line 178. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/report/cinderx/convert.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/cinderx/convert.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed314ef63d0fa699f38877d10f8dd7c023c0e0b4832abfbfd1e6d9cda971f362"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_config/src/base.rs: crates/pyrefly_config/src/base.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ConfigBase::fill_unset_from at line 451. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_config/src/base.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/base.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd696e4d359e51dd82e2cf262a1b5ecd89b6d3bb7bd3a35980101b11633dd597"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/class/django.rs: pyrefly/lib/alt/class/django.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in AnswersSolver::get_django_instance_attribute at line 758. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/class/django.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/django.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d684aa987bc5a53f404e6432e290d86abb7f29daabc570c91f399f4e6ebbac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/functools.rs: pyrefly/lib/alt/functools.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in AnswersSolver::call_functools_partial 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/functools.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/functools.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c06546e1bf6f87b58baab818bc262ab1895ee413141e1640b70a4c01eed03e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/types/class_bases.rs: pyrefly/lib/alt/types/class_bases.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in AnswersSolver::class_bases_of at line 445. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/types/class_bases.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/types/class_bases.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee1a320f734e05faed1bb6c2d18b1b097943af43dab0da3e812d30629737935"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/lsp/wasm/hover.rs: pyrefly/lib/lsp/wasm/hover.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in pyrefly::lib::lsp::wasm::hover::get_hover_with_verbosity at line 1572. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/lsp/wasm/hover.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/hover.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cfd8797907e3b6fb411261fd06ed0695496132e1982cf4e4d16bf937612bf2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/class/pydantic.rs: pyrefly/lib/alt/class/pydantic.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in AnswersSolver::check_pydantic_model_validate_input at line 1089. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/class/pydantic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb8ee0e5b01a828707034ead5cc62315bce8de6f7cb62db328cc50b526cf8e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/target.rs: pyrefly/lib/binding/target.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in BindingsBuilder::bind_single_name_assign at line 676. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/target.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/target.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"22549a84d09e8f7ee335046152328cdf987d57508469d4b72d2f8dde3912a477"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/shape_type.rs: pyrefly/lib/binding/shape_type.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BindingsBuilder::shape_comment_target at line 314. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/shape_type.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/shape_type.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4a540ccea13ce7bdd8a6fce9e916d9cfc44da16c3217b377a8ac1661c07b00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_types/src/shape_index.rs: crates/pyrefly_types/src/shape_index.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in pyrefly_types::shape_index::lower_index_type_in_position at line 401. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_types/src/shape_index.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/shape_index.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5577123da21df8d95eaab504dde77a7e80c8e8e73c7f4907f9e9973ed99281"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/state/lsp/dict_completions.rs: pyrefly/lib/state/lsp/dict_completions.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Transaction::extend_dict_key_suggestions at line 1017. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/state/lsp/dict_completions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/dict_completions.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f22fb5a3b80d1dabb89c39ff0ca87f2bf2556b507f4531899047eafdffd01a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lsp/src/extension.ts: lsp/src/extension.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in extension.activate 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- lsp/src/extension.ts\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":"lsp/src/extension.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b434326ba32184f3b3663783017208e2deca9f4b1bfeae1860d76ec4880f22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_types/src/dimension.rs: crates/pyrefly_types/src/dimension.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in pyrefly_types::dimension::canonicalize_division at line 973. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_types/src/dimension.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/dimension.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55f0aa33b80072fadec950789b1e0dfa04f1a69ef168614c177e7b6f05c8be5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/query.rs: pyrefly/lib/query.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in CalleesWithLocation::callee_from_type at line 975. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/query.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/query.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebeb998e62229a3c95f71b936512a07d94b2a4437cded8a6600e55f05d014c95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_build/src/module_resolver.rs: crates/pyrefly_build/src/module_resolver.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in pyrefly_build::module_resolver::find_one_part_in_root at line 411. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_build/src/module_resolver.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_build/src/module_resolver.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"939d0756684c4e3fdd83e411f1a37649877bbbe34217e333a88accfcf1b85d29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/class/pydantic_lax.rs: pyrefly/lib/alt/class/pydantic_lax.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in AnswersSolver::expand_type_for_lax_mode at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/class/pydantic_lax.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/pydantic_lax.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a30afcda7a04a1d7a6146d6c38bf9691319bc605d975cccbe4467e426bb26a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/specials.rs: pyrefly/lib/alt/specials.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in AnswersSolver::apply_special_form at line 349. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/specials.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/specials.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e00a3e16dc8a08dff0abcd06a1f2a1d99fda26d97889e0936d3c7b6434f6ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/shape_flag.rs: pyrefly/lib/alt/shape_flag.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in AnswersSolver::check_shape_flag_constructor_sources 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/shape_flag.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/shape_flag.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"498897de531908f84b5c3c2e24870d7ae3deff2d02fa99c7ae886b3ac60869b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/class/typed_dict.rs: pyrefly/lib/alt/class/typed_dict.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in AnswersSolver::check_dict_items_against_typed_dict 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/class/typed_dict.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/typed_dict.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c776fb41c126616abc2d7caed869189f878ca8582be10c8dd6f7a1b7f9d823ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/export/symbols.rs: pyrefly/lib/export/symbols.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in pyrefly::lib::export::symbols::build at line 187. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/export/symbols.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/export/symbols.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bc1e48db485680c50f585f2fa1961a626bfdb19ad4e8e32deac2dbc669c883"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_python/src/docstring.rs: crates/pyrefly_python/src/docstring.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in pyrefly_python::docstring::parse_numpydoc_params at line 711. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_python/src/docstring.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_python/src/docstring.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"b099c3fa67a86271b86bdc9af2a213458419f825de6e4621dbfa54243abebfa3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/state/semantic_tokens.rs: pyrefly/lib/state/semantic_tokens.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in SemanticTokenBuilder::process_stmt at line 716. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/state/semantic_tokens.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/semantic_tokens.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"7361a1b35af678b0b7f4e1e0661459cb583a97d28651b23fdbfcc54233e9363c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/commands/infer.rs: pyrefly/lib/commands/infer.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in pyrefly::lib::commands::infer::format_hints at line 193. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/commands/infer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/infer.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"102aa47c371a48a448f7b3f04e745a5a6608fde7ba12927cb13f5d004f2e6b9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/state/lsp/quick_fixes/pytest_fixture.rs: pyrefly/lib/state/lsp/quick_fixes/pytest_fixture.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in pyrefly::lib::state::lsp::quick_fixes::pytest_fixture::pytest_fixture_type_annotation_code_actions at line 269. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/state/lsp/quick_fixes/pytest_fixture.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/pytest_fixture.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84dfcd0de46a0128ad7e62941e3bf86f79352e1a6d9f9a2741f2521da3597b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/alt/shaped.rs: pyrefly/lib/alt/shaped.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AnswersSolver::shaped_type at line 208. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/alt/shaped.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/shaped.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fdf312a10477fb034065fe871479fb3fce593363fb15a767ad58f852b2272e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_python/src/ignore.rs: crates/pyrefly_python/src/ignore.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in pyrefly_python::ignore::parse_ignore_all at line 774. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_python/src/ignore.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_python/src/ignore.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2432b5b6804a781bc7eb31083fcb32bac2b8d63abda5677e1cf1d2bfa88e27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/binding/pydantic.rs: pyrefly/lib/binding/pydantic.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in BindingsBuilder::extract_pydantic_config_dict at line 305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/binding/pydantic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/pydantic.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"975bf0462b78e190645547993709da168e3a7ff3e6583e80843b78990fcec9b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/state/lsp/quick_fixes/implement_abstract_members.rs: pyrefly/lib/state/lsp/quick_fixes/implement_abstract_members.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MemberRenderer::member at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/state/lsp/quick_fixes/implement_abstract_members.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/implement_abstract_members.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"35994cc042330d7187364cdcc924ada8f0401b5f99774d2daaec7174e4ded938"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/report/pysa/types.rs: pyrefly/lib/report/pysa/types.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in pyrefly::lib::report::pysa::types::get_classes_of_type at line 263. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/report/pysa/types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/types.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce2f2a35a3d1c297febb6f8e7d4c6d46b85c27f1238af69705f0f520b1c6608"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_types/src/einops.rs: crates/pyrefly_types/src/einops.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in pyrefly_types::einops::evaluate_einops_pattern at line 398. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_types/src/einops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/einops.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f659d443ec77b338fa9517d346dca414a8e63898f479edaa972bbb508787646c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/error/display.rs: pyrefly/lib/error/display.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in TypeCheckKind::format_error 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/error/display.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/display.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1509ae1ebd98a71b1d200dbeb8ab7c2ddf64d9d9fd34780dd9588650fdde67a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_types/src/literal.rs: crates/pyrefly_types/src/literal.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in pyrefly_types::literal::write_escaped_string at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_types/src/literal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/literal.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc74c0849535889bcbd94a6ea57cb5f732df54d7e0218403fe1310c1e893d0f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_types/src/einsum.rs: crates/pyrefly_types/src/einsum.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pyrefly_types::einsum::parse_einsum_equation at line 380. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_types/src/einsum.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/einsum.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3593d1d681a3ac3e64b431a8f377851dd852dc5c0cf9d9d13a8c1cb463eeb444"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pyrefly_config/src/migration/ignore_missing_imports.rs: crates/pyrefly_config/src/migration/ignore_missing_imports.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in IgnoreMissingImports::migrate_from_mypy 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- crates/pyrefly_config/src/migration/ignore_missing_imports.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/ignore_missing_imports.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2705226656e6492b88a3acf06f1326bcd12dc1bc9f72ccda6673a18664242a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/state/lsp/quick_fixes/deprecated_contextmanager.rs: pyrefly/lib/state/lsp/quick_fixes/deprecated_contextmanager.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in pyrefly::lib::state::lsp::quick_fixes::deprecated_contextmanager::replace_return_code_action 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/state/lsp/quick_fixes/deprecated_contextmanager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/deprecated_contextmanager.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5440974967504016005068b012f700733b4f7965973aea5dc8572097cc35b655"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/lsp/non_wasm/document_symbols.rs: pyrefly/lib/lsp/non_wasm/document_symbols.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pyrefly::lib::lsp::non_wasm::document_symbols::recurse_stmt_adding_symbols at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/lsp/non_wasm/document_symbols.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/document_symbols.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c76532b9e8aa89cd57aa240adae94329cf98ddcfa6076747ce12ce2ee8cf58e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pyrefly/lib/report/pysa/module_index.rs: pyrefly/lib/report/pysa/module_index.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PysaModuleIndex::build at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/report/pysa/module_index.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/module_index.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c99bf4e610edfe11b27e7a7f4c4d6a34691259f592b01699e58969c413cc266"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pyrefly/lib/lsp/wasm/signature_help.rs: pyrefly/lib/lsp/wasm/signature_help.rs 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 9 (its worst body is Transaction::filter_compatible_overloads at line 282), 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 bug: generic ABC is mistakenly allowed to be instantiated by providing a type argument to the constructor #4263 (#4283)\u201D; \u201CFix issue 2500 (#5466)\u201D; \u201CFix Go to Definition for standard library symbols (#5040)\u201D; \u201Cfix [Inlay hints] Wrong call argument name for loguru.Logger #4936 (#4938)\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 12:12:22 -08:00\u0027 --until=\u00272026-11-13 12:12:22 -08:00\u0027 --full-history --no-merges -- pyrefly/lib/lsp/wasm/signature_help.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/signature_help.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfeca44303b1784ed1b27ea7a7891c772ed6835b863d506ce8c57625f5fd2790"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 15 significant file(s) lose their only recent owner: crates/pyrefly_types/src/type_level_dsl.rs, pyrefly/lib/alt/type_level_dsl.rs, crates/pyrefly_types/src/einops.rs, crates/pyrefly_types/src/einsum.rs, tensor-shapes/pyrefly-shape-extensions/shape_extensions/__init__.py, tensor-shapes/stub_coverage.py, pyrefly/lib/alt/shape_flag.rs, pyrefly/lib/report/cinderx.rs (\u002B7 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2604fed8301f63291065e29f9b523de715e562ff13100ba9400abd0dbef8528c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 9 significant file(s) lose their only recent owner: pyrefly/lib/lsp/non_wasm/connection.rs, pyrefly/lib/export/symbols.rs, pyrefly/lib/lsp/non_wasm/initial_configuration.rs, crates/pyrefly_config/src/environment/interpreter_query.rs, crates/pyrefly_bench_harness/src/lib.rs, lsp/src/python-environment.ts, pyrefly/lib/memory_project.rs, crates/pyrefly_util/src/timer.rs (\u002B1 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"678a29a0e4ac5ff84e87245ee7ce194661aa4452801be3ea654795f0a18af1b3"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 5 significant file(s) lose their only recent owner: crates/pyrefly_util/src/visit.rs, crates/pyrefly_util/src/watcher.rs, crates/pyrefly_derive/src/visit.rs, crates/pyrefly_derive/src/type_eq.rs, crates/pyrefly_graph/src/index.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"35085e96d1e0971fbbc53cd8ee981b4929c5f81ea317067e176a6df181d55345"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 8 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 (42 single-owned of 418 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; 418 of the 577 production source files in this repository met that bar). They are anonymized user #4 (2 file(s)), anonymized user #5 (2 file(s)), anonymized user #6 (2 file(s)), anonymized user #7 (2 file(s)), anonymized user #8 (2 file(s)), anonymized user #9 (1 file(s)) (\u002B2 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: pyrefly/lib/report/pysa/capnp_writer.rs, pyrefly/lib/report/pysa/module.rs, crates/pyrefly_types/src/polars_dtype.rs, pyrefly/lib/binding/polars.rs, pyrefly/lib/lsp/non_wasm/protocol.rs, pyrefly/lib/state/step_slot.rs, pyrefly/lib/state/lsp/extra_extensions.rs, lsp/src/lsp-path.ts (\u002B5 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (T217247871): expose full error message from Pyrefly binary and use it directly here instead of duplicating the logic \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":"website/src/sandbox/SandboxResults.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1602eb23f88816f875f8f5d7589d71b6ba29b2962d5b0270c4f4f8b539a958"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (T222948083) Re-enable internal sandbox after we fix issues with sandbox on static docs \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":"website/src/pages/sandbox.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"91335879a48bc28f892fef2a78721c28043f6d9364144d0c6ce8f7e842421940"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (T222936871): Add data for pandas and pytorch after we publish Pyrefly and get it to a stable state \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":"website/src/components/landing-page/PerformanceComparisonChart.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ca8aa27a3dc0ac6d1c5d6bbd2ef0f59083a4114b3f59774fa6f2536b4a055c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(stroxler): Check the Torch stubs too. The package predates stub \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":"tensor-shapes/pyrefly-torch-stubs/run_pyrefly.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"682c1944020988fa7bd101a46ad388127a6252df3980e8d79d0de0d811d44ae0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Preserve the broadcast shape of tensor indices. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_advanced_indexing.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff12040d452e2faf9b4f03c4ea00147546c244b810f872099897a653a1a5e5d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: A known reduction should produce a scalar for unknown rank. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_classification_losses.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e350d55257e4094b927cf0f4850b319c379357d070ec1b560e2b7f0d129ec5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Track per-axis convolution kernel sizes. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_convolution.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ca48bd876de65394c24b5037020afe3bcc8123f535e467a6e613bf98e799db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Track per-axis convolution controls instead of using scalar defaults. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_convolution.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5347334777bf3e4c370e515837790ea35430dd7dacae5c42f2e1d8058fb0f8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Model string padding instead of using the scalar default. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_convolution.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb52cc9a1766b9dee3b1e6aae9ad16753d4044111bb5fb447627ef60b49a7ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Accept singleton convolution control tuples. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_convolution.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e35d05c5ec7499d306e178dfd0f9d0112a577bc479174b0c522c59419a6f15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject negative literal dimensions statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_creation.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"26622904062de14957042065f8440ab8e23034fdc59f43098cec1f0a6ee4237d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject out-of-range cumulative dimensions statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_cumulative.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfb6dd6eb4c4e21fbf2a3efb1f3015f35a8c470c5a6512007df6b54524d2058"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject out-of-range cumulative dimensions statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_cumulative.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd7a0175a443c7bd37a3a945c1b638c5d59c34c177bf94a340db82dce17cd0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject nonpositive complex FFT lengths statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_fft.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ada0baa95f5a785adb484fd114e47840265d513a9e2dbb0dc04ed9c673628b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject nonpositive real FFT lengths statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_fft.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af7018e906ce6308d45d78b0475eccd46532b760bce97831ac3fe7ac588b997"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Preserve known axes for optional transform lengths. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_fft.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e639408fe334eae11676bc5315054ef36766f78ef16bff8a1694f597805c7d17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Preserve literal transform sizes rather than returning gradual. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_fft.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d572d51abf9414f88085dad364f9981f26d52ab9e6e280277041caf67f57c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Preserve literal transform sizes rather than returning gradual. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_fft.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2248663b741f0461937175013aad76b62e3899544d1a538138baa0ddff054ef1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Validate multidimensional FFT axes and lengths statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_fft.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eaa5150f124aebafe84df080849dbd651b603ae732685f3f95c3e5fae4da626"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Preserve literal real multidimensional FFT sizes statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_fft.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"873da2791b31e95ff184a70e73b5b34dad6739e2dc24ad244155c12b4e9fd738"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Validate FFT shift dimensions statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_fft.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e337cfef7ce847fd48c2f1fd742ae7de318fb74704d922537a37a7ae155a8d4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject more index tensors than input dimensions statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_index_put.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd50059b079bcb929abce04238c4a0dd661fa3c1dd6851cfb70052ce56e6ac8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Index tensor shapes must broadcast together. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_index_put.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e7343ffa19d9ee73cf39cd98fe23c0aa74741d3c1e860d32a109c19b29de56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Values must broadcast to the indexed result shape. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_index_put.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8cc0dc29a4ed9c1fde58aec9213c2340bd87412b79f7d8473117d63d3cb05c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject out-of-bounds literal indices statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_indexing.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31b9b7224aa57a393f17756941002c8fb34d72620e821acba4a94c7e5d477d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Preserve shape for tuple-valued scale factors. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_interpolate.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f17e67248431c72931a867a1f40686152848209c0d8541c741806fb0495e11f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Preserve output sizes through \u0060nn.Upsample\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":"tensor-shapes/pyrefly-torch-stubs/test/test_interpolate.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"869da75810f879a0cbe7c79ef219f93425d209e3945cb408164131579f4a1fc6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: In-place masked_fill cannot expand the input shape. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_masked_fill.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6deaec98b0fee7d5243b15acacf875e97d250182ac3a63703ad980eed46066"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: In-place masked_scatter cannot expand the input shape. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_masked_scatter.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b54f1106ea048305ed75e6c568a532dd363f3200b57539fba607288d4c67a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject masks that cannot broadcast to the input. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_masked_select.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0276fb1bc4279dd6b14c94f534902e5416e6898615a0dabdf88f2dc0c6ba6f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject incompatible \u0060dist\u0060 input shapes statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_norms.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"528db219cce6b2104cb2d819d9a88012a118b6ce61d11955725216c55ceee5ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject out-of-range sort dimensions statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_ordering.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ca6a228976b336e9691588f25b071397f39d02079fd5f8fc5076c7d7dfa224"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject non-positive kthvalue indices statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_ordering.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04b347910b080c4b1999d497d3832d3062acb99908e4e79ca17da0bd073972d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject kthvalue indices larger than the dimension statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_ordering.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3a727e3d47a07e264306c6a171b2e6a1743d525af148f55bacd055e042fc19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject \u0060value\u0060 for non-constant padding modes statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_padding.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"619078d0f65c7223cb23acce5f8cfc99d3af7dc6fac28358bff13ea81cd848f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Runtime requires \u0060dims\u0060, even for a scalar tensor. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_permute.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83f6b50c534bc73cde06d144be65f79f970cb488fa13577e2389fd7b269025a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Accept singleton pooling tuples as repeated per-axis controls. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_pooling.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44fe0039d022358132e799f19ce3fa275d2f5d848f1ec09c5b77448d9c5ba56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Add a shape-aware overlay for \u0060torch.special\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":"tensor-shapes/pyrefly-torch-stubs/test/test_public_submodules.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f44b9febb9aeb79a10e5d1325f57bf5fb83f7de765b051c3b895efcfffbec4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject an empty variadic argument list statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_repeat_expand.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b0496c47f15dc056f54059f926e20ad7ada394c8e30f674cd9351e84549491"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Torch rejects explicit dimensions for scalar inputs at runtime. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_repeat_expand.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44af949768167dec3a1b3113484c65acddcceb450a61563392ed052d9b831a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Reject an empty repeat argument list statically. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_repeat_expand.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8919b66fcaae3a854f0508431b4a6a5fcc935e2dcbc95166412a224bad1212c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Preserve partially known shapes through tuple unpacking. \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":"tensor-shapes/pyrefly-torch-stubs/test/test_repeat_expand.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45c38b9a5f23882f27b9b3de2a4b3a37a1228f1b720cfc82066e9cafdd77226"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # not 100% sure what this is, so far seems to be harmless. TODO investigate \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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c44c605a4899986b59199bd2ebe4db8f99112a0432d54f08d417133b716323"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # not 100% sure what this is, so far seems to be harmless. TODO investigate \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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d88d6c310563563fc36802793de8d640d8c1309630e097d6b9c541fe53c6aed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # not 100% sure what this is, so far seems to be harmless. TODO investigate \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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d0bbc37762e5d832cce5c74e07f9c7106dbf9aadc078b22bc758d187ec6ecc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # not 100% sure what this is, so far seems to be harmless. TODO investigate \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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a73bc605bf1952f4b18968dd4e83a0298e0e6416bbae3d9110b3256c5ccb99a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # not 100% sure what this is, so far seems to be harmless. TODO investigate \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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8816657b5c618ca786edef10d0dd7c7da10a0e8e160674e7c481caa4636fbfcd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rechen): the type of \u0060n_params\u0060 used to be inferred as \u0060Unknown\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":"tensor-shapes/pyrefly-torch-stubs/examples/nanogpt.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ad99f09b3b67fc3810146d6b7ad9fb4f59e0cea80a5114c73d2bbdde3f7735"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rechen): the type of \u0060n_params\u0060 used to be inferred as \u0060Unknown\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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"a080f6f5794d7fc39f389868de1a3470a868dace680498d0bf86ce0eb0847655"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rechen): the type of \u0060n_params\u0060 used to be inferred as \u0060Unknown\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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_future_annotations_runnable.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4874db09f60b94d606ff9b6bd6c16d1ef986c5d19c6c8447a936a5a59c182ef7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rechen): the type of \u0060n_params\u0060 used to be inferred as \u0060Unknown\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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9da70181e9745aefb50da343134215b40abde95fef76dffa31d2d5f7544964c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rechen): the type of \u0060n_params\u0060 used to be inferred as \u0060Unknown\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":"tensor-shapes/pyrefly-torch-stubs/examples/runtime/nanogpt_sym_int_var_runnable.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c39624aace856d55e8645c7aa2301aade67ade3abe02e03c740119d470be71"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(stroxler): Unquote \u0060typing.TypeIs\u0060 when Python 3.13\u002B is the minimum version. \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":"tensor-shapes/pyrefly-shape-extensions/shape_extensions/dsl.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d507b4a43d8431f52957d4c761131b8333e4ef92d13c2d37f8933ec550042b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: MAYBE BUG: Since \u0060IntTuple\u0060 is itself gradual, the solver could \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":"tensor-shapes/pyrefly-numpy-stubs/test/test_creation_basics.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b797c8e78be72d4010bd6f613be2b8a3322a67c8daa071ebb26d6ced2c568c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(stroxler): Preserve a list literal\u0027s length without storing syntax in Index. \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":"tensor-shapes/pyrefly-numpy-stubs/test/test_indexing.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91df98ad54519e2f6edc7b991f67bffffc7c7de3c4593a12aadf9f81feb2c6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(stroxler): Preserve more precision when broadcasting against unknown shapes. \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":"tensor-shapes/pyrefly-numpy-stubs/test/test_math_ufuncs.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa3615ae03be1a13a8852bd94c3e7cdc605b734c6698abdae711f1940de57a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this annotation once literal arithmetic preserves its result \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":"tensor-shapes/pyrefly-numpy-stubs/examples/physical_science.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c122a624e70cca96d55b038a5302dde060ebaf343e3abff45d7cf0d06bc7d36c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(stroxler): Preserve the length of list-literal indices in annotations. \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":"tensor-shapes/jax-pyrefly-stubs/test/test_indexing.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c5b9d969a58824b7f1e1b6550e3877de7bff873413da7cd547877939b293c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Infer the result length for statically sized edits. \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":"tensor-shapes/jax-pyrefly-stubs/test/test_indexing.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8b334f1f9d2b5963689da05f046038c32bc73496a09de1def338bafab363f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Infer concatenated shapes from statically shaped operands. \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":"tensor-shapes/jax-pyrefly-stubs/test/test_indexing.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"248eeb743060f0ba35a3cedc3ba6f449579f45a1bd57916cfa47af20b699340a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Infer the result from literal contraction dimensions. \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":"tensor-shapes/jax-pyrefly-stubs/test/test_lax.py"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e58bc97d45d29fbb4d0bb116fceeecb02202e6a435114fc38724eab7e5ce75"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Preserve shapes inferred through map and scan callbacks. \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":"tensor-shapes/jax-pyrefly-stubs/test/test_lax.py"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"25691e87f58671ae88ec8b9c55bcb835529964fd29c08d3e721c449047a9b8ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Preserve the common branch return shape when operands are supplied. \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":"tensor-shapes/jax-pyrefly-stubs/test/test_lax.py"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4e01dc94e01268ea48c1b868e72605a05204f8b1ed7dc539f0bee761973f13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Preserve callable shape information through \u0060composite\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":"tensor-shapes/jax-pyrefly-stubs/test/test_lax.py"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a31bd745db62a6c1ca2e322a0511625d9398692ce5c61425c8b706792a6ae5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(stroxler): A tuple-valued Flag permutation also erases a known target shape. \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":"tensor-shapes/jax-pyrefly-stubs/test/test_lax_reshape.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a2ffa95deb1c4911b5456095da7fa82818807d1f317d12499ca9fada4a2bfd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: BUG: Infer the result shape from the statically shaped blocks. \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":"tensor-shapes/jax-pyrefly-stubs/test/test_structural.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a00015d6cba5cf7c9b193d94f8ce9048757574528973177e7c1e1d346c0499"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: the plugin here is a little involved and might only work on linux \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":"scripts/projects.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c395293a6e7464201ef98be7a839ce95f0ca270efafdece1b7fef556659a8db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use type of receiver \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":"pyrefly/lib/query.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"127720edb86962ba12dcf5cc012e589e15cf03e2baa09ab6158c6472b611c4b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: wrap in \u0027type\u0027 \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":"pyrefly/lib/query.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ceb3a97d78d66950a99ab70569ebbf711ec80c4be40832e42724e0a8c6e15b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: decide what do to with multiple definitions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/query.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6172c99e4bda1866402dfd991aac61983d71acbae9fb049f2a61dc7030e4cd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): make this work with build systems \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":"pyrefly/lib/query.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23a6b1e31288482eb6c8944e9c262cf5ddefca9b96f9efd690c3d2b66516d5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we implement simple control-flow heuristics so \u0060C.x\u0060 is recognized 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":"pyrefly/lib/test/attributes.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca524fe552374e62f21dd82d166f43edb14327b20921b52db019bfa9744f9d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Consider whether we could implement a false-positive-resistant approach \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":"pyrefly/lib/test/descriptors.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71feac15a3712394c29b9fd289c1ec402d5a2788a5150c9a22e5ceb6a7d9540"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler) We probably should at least allow the uses that Pyright allows. \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":"pyrefly/lib/test/type_alias.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"82091fcbfc3c173c06558b23282fe0eed94eb3d065af667a40ea7fd2f32145dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should be TypeKind::Union (the element type). For now we \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":"pyrefly/lib/test/tsp/tsp_interaction/get_type_queries.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"154d61d64b0544e1befda7ba83ca4cf6667f5f6d7207a8afb0734eaba1384ab1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Missing return 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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a30aeb1c6fd15a06b1c2e07b8c388973838afa740f12e9645f4e7b39e49893"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T105570363): Resolve calls with mixed function and constructors \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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"770324842b5d0a3e774ab77d679a6e62d000b8c436f9055c2fc579f8b45932ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T244609756): Add the implicit calls to \u0060__getattr__\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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":3143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a4db1d44f4ee6b086b80ffc7d9ced2a1d2a9cef0ed78eefaaacb8ba4f9ed8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T137969662): We should see a call to \u0060Test.__setattr__\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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":3328}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7decf7caa48f45f7c432a20f7379d635ea0f0625f69e1cbc4d68944b4722f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T146836847): Missing the stringify callee. \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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":4443}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0d83f1214d8b108fbba07d742d7e16efc179a2f0037e5fd3561f19e9759b33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T112761296): Probably wrong call resolution \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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":4505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9386d1025dc40a2461f6776c14b01df37eb76bd27a083d17a0f566e300e9fd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T112761296): Probably wrong call resolution \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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":4740}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c7b3b1820aa9799bc3671e1acb0a36fe89a9b56562bb3422bf391e8f4adc91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T112761296): Wrong call resolution \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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":4615}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e9dd6fb6f22317b6ff49e7ec416c39d5da816a7ae115329fa31ce69dbb453d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle \u0060object.__class__\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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":4673}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b63342e84f5012dff81f8b0acf681bdfa3b03785702dfc0c5e9e341daf38ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle union types in the receiver class \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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":4896}}}],"partialFingerprints":{"codehealthFindingId/v1":"95584424d7b8277074317a160fb407c094cb8b92b235f5b2531052ac72115ffe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T225700656): Handle \u0060super\u0060 calls to stub class \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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":5148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e71437396c6697adf7bcab2bc16bcbe7a065ae5758761000e8c936dcba4f46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T118125320): Return type is None, which is incorrect \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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":5348}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5e7c2ef02c3644bce7d5600d92bf72b5657ecc931b85e1e10db2804199764a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Receiver class should be \u0060test.D\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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":5984}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe42c0a562505f98de6db4a16129b39fcbf59c8d0286b233b0eac23aa04c378"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T252248020): Resolve \u0060__setitem__\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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":7269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9d79699f9324d5732161a9b538b77fee2beb812c50c9ee347ccc98a48a3156"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T253219415): Resolve \u0060__init__\u0060 call. \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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":7543}}}],"partialFingerprints":{"codehealthFindingId/v1":"c460a69d26aa298d934a8ac2fc4088bfa3d98ad1d1bb7bd06c27c0169d57fd14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should be Overrides with receiver_class test.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":"pyrefly/lib/test/pysa/call_graph.rs"},"region":{"startLine":8270}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0275f635e2acb0f527cd5d361f556c383eaa4113b442c67c4ae7b00809f1b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T225700656): This should refer to the property getter, not the setter. \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":"pyrefly/lib/test/pysa/functions.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd8caa6b947d57d4a9ac4103edb66164d48d4c323dded0a68218df3d3cbf8c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kylei): ruff\u0027s ast gives us names = [\u0022imp\u0022] for \u0060from foo imp\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":"pyrefly/lib/test/lsp/completion.rs"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fec20381979ab36ce100728701f33bd642170e7d4b5c148a9a63ea1ca762b39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kylei): ruff\u0027s ast gives us names = [] for \u0060from foo import \u003C\u003E\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":"pyrefly/lib/test/lsp/completion.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3f035bbdd4be52c9bb84e3404742ab1aff77455a19bde57770524ba2179118"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: property go-to-definition is unsupported \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":"pyrefly/lib/test/lsp/definition.rs"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d0768f2b867af55a060434ac916ff31c65c17839ad4ea3c145202b1f181d8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: x = 7 should be highlighted as 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":"pyrefly/lib/test/lsp/diagnostic.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"023b07201367e3f71e49ab6ecc21048b300e44ddeb9b8e9df8f5fae2a7843297"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kylei): list comprehension document symbol \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":"pyrefly/lib/test/lsp/document_symbols.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a74e5b51b4ca46036cf862c8cbdf1c012540d142a2d889d57c1904d89880a39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// todo(jvansch): Update test once parameter hints have locations. \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":"pyrefly/lib/test/lsp/inlay_hint.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf04e64f640e2a738eda717c355db810d60460baf46c28101fe3eebe5d2baccd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(kylei): reference on parent method should find child method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/test/lsp/local_find_refs.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cec91cd44749526b1dca753a1b79858925436694692adbf761da2489f7003e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(kylei): reference on child method should find parent method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/test/lsp/local_find_refs.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"a026e6d58dc776aedf58e98840530e04e051170b7989affba4cea611b0fe4571"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(kylei): reference on child method should find parent \u002B other child methods \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":"pyrefly/lib/test/lsp/local_find_refs.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a576c6b16bd292dbfe33b8ceec813d546113e893a54149eef158e8b13dade6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(kylei): references on renames should find lhs of assignment \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":"pyrefly/lib/test/lsp/local_find_refs.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"d082c09dcb3358bb266366465bec6ab062510baba24f2232be5600dc8efd54d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out why this test fails on Windows. \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":"pyrefly/lib/test/lsp/lsp_interaction/completion.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cd1c4ffade5d260b450f72a387297e94e98fa85fbd1c140cabdf6e5e3f2811"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - flaky on GitHub CI \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":"pyrefly/lib/test/lsp/lsp_interaction/diagnostic.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2024dc113bf6f742dcfc0df90c7284556ea8a5ab11290d8e64916548050fa3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Flaky on GitHub CI \u2014 disabled until stabilized. \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":"pyrefly/lib/test/lsp/lsp_interaction/diagnostic.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31c4c52730c66523415ffb6ee5e06ca14ccbb4a15c25c46c8420488038fd857"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(kylei): better solution for this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/test/lsp/lsp_interaction/notebook_definition.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76f5f4f04e0de9d7aab728d4b99643f2e2b4aab58313b327599ae5ddad39a13"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX(..., id=..., ...) \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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31db1a8409c6d7aec60a084041b29b91af97895d187c696605886c6e0614278"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle relative import (via ModuleName::new_maybe_relative) \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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"e605b3d366f47f59ccb49627b45081e87e96b7f3fcddfa88faebd02a0342e53c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle relative import (via ModuleName::new_maybe_relative) \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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2896}}}],"partialFingerprints":{"codehealthFindingId/v1":"06036e2096344f91c10b8edb0d8282311bf965ebcaf2366d609120c34fd0e61f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If completions contain an AttrInfo matching \u0060name\u0060 but \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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e407bc6f7469b27a7f0cccc79788417ebb39388df1b760ff9cfea05867fe7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(kylei): better solution \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":2903}}}],"partialFingerprints":{"codehealthFindingId/v1":"de384fde099c8681b0c5e410bfa267a3722ed2a79eed2f03284a52cce4f5d2ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grievejia): Should we filter out unrefinable ranges 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":"pyrefly/lib/state/lsp.rs"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f26408c6708853750756f055157028dcf649844dc1780d10c676ae316d0af3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It would be much nicer to identify when a module is a 3rd party dependency directly \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":"pyrefly/lib/state/state.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"abab354a796364eb12ba19f11fc81e5d66bb2e0b6a99586853a75b9f16e072ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/facebook/pyrefly/issues/105): use \u0060SmallSet\u003CType\u003E\u0060; bounds should"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6e03549d7a046d5c66713f57c9adfd2ea55dd95617e4c0f81ed3a112b88cfa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/facebook/pyrefly/issues/105): there are a few fishy things:"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2067eaf02e59a2904a556c05e691c3f8c34e15bc74d2d22c8c131a8bc833ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/facebook/pyrefly/issues/105): don\u0027t throw away the bound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74cbc88b378ff0cdca1d86ec8dcdaebe1fe56aa8d36fa6a82380fed41a68efb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(https://github.com/facebook/pyrefly/issues/105): the current solver design requires us"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"25df897bec098ed9b42b39a7cbd258871773ed596718aca0f261cdb5458e295f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/facebook/pyrefly/issues/105): consider using polarity to"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"320c73b5afe62cf1918ff1076cbebb4b2ee3e7908666399e9b0816aa95449203"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rechen): replace this with specific reasons \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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3039}}}],"partialFingerprints":{"codehealthFindingId/v1":"5079e8730196528ab07d40d1ba9e74c44e8f395d6b45a8deda48dcd5b197ffc1"}},{"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":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3065}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ad647a822452aceb4c061a65fabcee79d692deba478e8cadd50e6b31e0b61f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/facebook/pyrefly/issues/105): unifying vars in this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":3920}}}],"partialFingerprints":{"codehealthFindingId/v1":"497c406ab7e6569120aec469e7e5873ffeb2f2661bacd15340bb8885a257fc5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/facebook/pyrefly/issues/105): figure out what to"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":4090}}}],"partialFingerprints":{"codehealthFindingId/v1":"51feeb005d7a707c09606a858d204b6569a84ce534ae30452f180600f0489133"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/facebook/pyrefly/issues/105): figure out"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/solver.rs"},"region":{"startLine":4295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31559bcc64b68d100c871fe8a22df0aea10b780d6bac3b7487fb9e324392193"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this once pandas 2.x is no longer supported. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e809b4ad10854a8699a636eeae10ce3201d58f4d05b563b47b08f5fe3988e28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider required-ness in prepended params \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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0d2080a3373686ac45eee44c09c70f8678cbb41f90c3f450598fdb5d3f516f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/facebook/pyrefly/issues/105): whether to add a lower"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20d0fe8e2e558142ddea3096f0e53065d14bbd2797111429c66d18961e1616d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/facebook/pyrefly/issues/105): whether to add a lower"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf711cd6c11e587e9f4a42e5cb70eff5cc31c017e9937d7cc4fcfb42c37e0e73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Find a way to write a test that crashes if we try to assert 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":"pyrefly/lib/solver/subset.rs"},"region":{"startLine":3033}}}],"partialFingerprints":{"codehealthFindingId/v1":"0478936ca7831ca9b045366414049a4b56b5392ce477c3c8c0b8254416a8adbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support multiple definitions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/trace.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abd9a5b2eba94f202daa8bf927408a1eced3af7688da0cfe479b00aa89dfb00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: ListComprehensions with if \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":"pyrefly/lib/report/scip/snapshots/input/comprehensions/comp.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b652849f412f824246800a6d1459583fb31ba82a2286349b5060ebc2337d694"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Dictionary comprehensions \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":"pyrefly/lib/report/scip/snapshots/input/comprehensions/comp.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b4007ae9edfc9334e47e46faffab235825c46ccaede5d6b475f19d6b92393a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We assume the first parameter of \u0060__new__\u0060 is the class but this may not always be the case. \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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ad8cffa58dc69025bc59e3b53d01fe51a9b14a129dc88dba8c678eba2b7716"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: However this is not true for example in \u0060@classmethod def make(cls): cls()\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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15555522ed461802eab5ebf62eeebb596cbbea04b58d510d7fb79d8fd920d47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T243217129): Remove this to treat the callees as obscure when unresolved \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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf2b5de304d91e30c6e6e73a0a653b4598130b6ccec30c88b74201ab690d1a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T243217129): Remove this to treat the callees as obscure when unresolved \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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdba88475b677bc8fe7c1d652f7501e176119adec14e13756d2a52a6d7c5a25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T252263933): Need more precise return types for \u0060__getitem__\u0060 in \u0060typed_dict.py\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":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"934320297573a7442f5c109eed6645802bce854745a3cf30866aa71eab0563c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we handled NestedClass this way for backward \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":"pyrefly/lib/report/pysa/class.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fac46a92fc36a97a76c7bab09a8ac225bee88814966e443004edf47ada4cc6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T225700656): Handle special case \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":"pyrefly/lib/report/pysa/function.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e76456476fff58b38bd4d63d22382a6b0e38fe04a9121a97427300a9a69a37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): These uncommon / internal types silently collapse to \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":"pyrefly/lib/report/cinderx/convert.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a00abbd125ec6eb590fce1e373e2e95e71a30079d1066250a1a8037c6b51f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(stroxler): Deduplication is by hash only, not structural equality. \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":"pyrefly/lib/report/cinderx/types.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bca0d717f8bd6e74c9534aa86e4a67e20fc725ec250bf021a34070eef4badb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): change things so that we return all entries that match for a given \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":"pyrefly/lib/module/finder.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d2a776c829c559f93a034f50dbbf8c52c6c7cc12c2688e4b9180c51468fdaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Pass the flag correctly for whether literal string is single quoted or double quoted \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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca692c9c56b3ffe7dcc416ffa062ee50ae01dca9ccc7d25def2a14e885cbc630"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // results for now. TODO: re-enable it once we no longer have perf issues. \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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c26c1407d2a633b22c174f7ef98fbc3127337ba738e5d081c0c5b78a130082"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(kylei): optimization, avoid duplicate ast walkss \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":"pyrefly/lib/lsp/wasm/completion.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7410ea950f2c943353b80a1607340032327daa8f52971de8d348a4993cc9279"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Per LSP spec, the server must not send progress notifications using \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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"303a25fa464d948944f26fd89f287489083af476265c4f54cd72eb9990448751"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// called when config changes (currently this is a 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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3902}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f85534df665f4d86e46bf11dc9230f334aa668ce5b661f5b94a97bd1ef0d0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle more than 1 definition \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":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5653}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fc63467dd9cbe509e197fcccc7ef24be5db681f281b8172f198d83ce98eb87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is not a pylance setting. it should be in pyrefly settings \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":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dff53a0f3e6f67015560d645aea412a39e4c1f820a411d59f184cab5901ad74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is not a pylance setting. it should be in pyrefly settings \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":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"96777ac2b87b6e9744ed4d704930370a9806aa6dd77608a6464cf940be927330"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider refactoring to a named struct to improve readability of the 5 fields. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/context.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1905723c7fe034fb99ce1b32f54ad25baf5887f8739a220b65fdf1b5f726e991"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider refactoring to a named struct to improve readability of the 5 fields. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/context.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac993a57bf50311cb61623138ee7e8728535866726744a34e1b122c5d7f3682"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): In an unpacked assignment to a name we would ideally provide the name in \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":"pyrefly/lib/error/display.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9503a2e76cec8b7ac9098f70b777be9b3e93ffbafe376f4b5611c738c48b55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Map secondary_annotations to DiagnosticRelatedInformation for LSP clients. \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":"pyrefly/lib/error/error.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ca20db580b1a34b26f47bd45e2d66365b016b1251b561afaefe3922580f8d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this dummy value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/legacy.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad200b8ce17d6e0f37b2c1f20c10854025bfa29d69f22d959c5338b2fa90531"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider output formatting. \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":"pyrefly/lib/error/summarize.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bebde7ca1b510bc03ba902ea70ef042bf24f227ae495c565b6c7a46cecf810"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This matches buck-check behavior, but still collapses the rare \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":"pyrefly/lib/commands/bazel_check.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d301e5bd731227152c09c08906fc5be09f7cfe7a304d5e8ac6f9893567c845"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): wire in force logic \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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66e7a96bb4a2abbb683e83c255078575336cd294361d111a65d0957d5719149"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We currently make 1 unrealistic assumptions, which should be fixed in the future: \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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cbd51fdf299a9b3c653fec59cb3d92790ca042e3e338c2cb86e43a9b0a0b56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Deprecate this in favor of \u0060pyrefly suppress\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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d11ef564c2dce7b01d1b1c909d33c6fb36a4d199f95079430d8281270e51e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Deprecate this in favor of \u0060pyrefly suppress\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":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbeec96e8bd07553d50211d09566497ed179cecd5fab8fe325aa8f40a8d7fbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Put these behind a flag \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":"pyrefly/lib/commands/infer.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff3370681574420bd914aadb79b220f8189866e7757bda2a10d88f0dfbe0f69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe we can resolve it to see its symbol kind \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":"pyrefly/lib/binding/binding.rs"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ff34747c96522e9745ab06bf4e0fbb9f4b79800d7dbe84d4d9976ec2bff909"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the following errors aren\u0027t being emitted even when enabled \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":"pyrefly/lib/binding/bindings.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb39036e77c8a20daf841928fc06bae6c67ef2f96903d182a354b69ed5efc76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060global x\u0060 reads bypass this (they use Flow, not Anywhere). \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":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30cdaa819abf5e2e488352c1e7c95c0e7125282762038576c7ab3eddc1600b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): We eventually want to drop all narrows but merge values. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cf80aa8d40f1f879790c388dcfda68977059c51ae498a9b8c5951892c0a6da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): We eventually want to drop all narrows but merge values. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/expr.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52a6ab7afcd9a225c6c287169bc98675a790f9064b628c64d5e03de673e4ee5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grievejia): traverse the function body and calculate the \u0060is_generator\u0060 flag, then \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":"pyrefly/lib/binding/function.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"edda8266905a0ec303b763b313aad0623d2bdf80cfce535839bfadf20fe10ed9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: narrow class type vars based on pattern arguments \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/pattern.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c44e547389bd98ab6f30c70300157af99d2415e125503738110a3b73ce4f6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider propagating the entire expression instead of the value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/pydantic.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b0f9eda3ca47246c869c021f5bdfbe863f957f12f75e40d61676a4b08b2cec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(stroxler): At the moment, if any actual assignments occur we will \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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4333b32c0f401c988cb08de871f3307ce3c57c1104cf12343d75819d00848d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): this error isn\u0027t quite right but preserves existing behavior \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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5dda60d67502da708c27634d1eed29a6ee5e6efc4004a81b63fcd881bbf163"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: semantics of import * and global var with same name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b35236ffb52e2e02aef48956bff0fefe38a3eaa8d4da88d595741ba582961e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): At the moment these are the same, but once we start eliminating \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":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":5529}}}],"partialFingerprints":{"codehealthFindingId/v1":"1003b412742809c32d1ce041a9f57374a7418b73e6588acadb38a23c1e469bfb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(stroxler): while I\u0027m fairly confident that it\u0027s not a correctness bug \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":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e1ddbd65a429b2bc3dc7664b6c31bdeacd2c4ad8557926074412cd0422cc8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Consider panicking here once we\u0027re confident this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/answers_solver.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2642dbc79f1d2d8abf3af9c78a0305f96bc6f715cfc5a92332bd8d18d95b7625"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(stroxler) The uses of this eventually need to be audited, but we \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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdee6facebea31e021c4c8cea06998812cc1f957e5dd43819e2eaf421e9b0e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(samzhou19815): Support module attribute go-to-definition \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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"438a72ea572504691644f63d1a77a2ed618894c555b4bf230b40f2d050bc0932"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): it is probably possible to synthesize a forall type 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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a71565d44e8681ada1f32ef7e5c82fe7a5de9243d486b535bc000fd93a0fcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(samzhou19815): Support go-to-definition for @property applied symbols \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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3565474a07517fdc03f22e9fd09a2982e6c8290abcd6da49b25bad7f59f6f278"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check to see which ones should have class representations \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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e86ffc7456f0beef4b3af35a57ccf21b5a0cec9e6d41101efb839f0f23e2d03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rechen): implement attribute access on \u0060type[A \u0026 B]\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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":3123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2359f5cb1546e1b30f93de6966658abb2d496f1eeecc18ed8cf91fe48906a6ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(samzhou19815): Support autocomplete for properties \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":"pyrefly/lib/alt/attr.rs"},"region":{"startLine":3703}}}],"partialFingerprints":{"codehealthFindingId/v1":"6640b9a13f2d62740112b78b991ef1e300cd5b7388fc9a39f92c8d3638b57094"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use upper bound to determine input parameters \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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfa294c2a4d2a2e8722522387ade52493a6bb3b667dba95bab2ae99715789cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: flag incompatible \u0060__new__\u0060 return annotations at the method definition. \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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"85aac1e87ad2a7c8830863078b528b2c0a7ce0cf09f0d944b46e8559b74412c7"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack \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":"pyrefly/lib/alt/call.rs"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b32fb6dc1eaca4affb18bcd10781e7316d42f084a70740e06436bdff0c14e2a"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: keep mutable builtin containers as expressions, since they often need to be \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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fb003bd93c9bd10a0811d5830ae922d07a1910c40eff3c5e67c8d72c16b077"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle second component of Type::Concatenate \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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7934b9d9b60e26db962a41b60ccecf9218d2a70a4ce084a0f15ecd147508c42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/facebook/pyrefly/issues/105): handle nested vars"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":2613}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d9cb8a0b79ac02732ab694597ba06fbcc672e7ae6b127899fbbf2b4334b423"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack: we inserted a class type into the args list, but we need to substitute it \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":"pyrefly/lib/alt/callable.rs"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce23002c7c9835959b8901c3e7b056268432d1c067d36412da760820f0b88fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We don\u0027t deal properly with hint here, we should. \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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cd6736894ebfe795a89f7973e52186767414d08300452696ed5a1c360aed87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): should we really be producing a \u0060tuple[Any]\u0060 here? We do at least know *something* about the 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9c20ab31b3b781a7dc751d0af7285b652d52b2b0477eaf88cb78aa86e43261"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should also contextually type based on the middle and suffix \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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"739e111bd1ff75bad1b91e1a25c0190f4c320a899269c001ce86177c5c4dfc02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pyre_extensions.PyreReadOnly is a non-standard type system extension that marks read-only \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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":3738}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79f53a482961ff5624dd6a908f1ab926b73fad9216321e1989a4b8be925ef6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Add a new API, similar to \u0060type_of_attr_get\u0060 but returning 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":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":4801}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dc7629f9060e2fa93cc97f416451516ca12983eae4e5640134c3853b8eb78c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could consider checking structural subtyping 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":3082}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7da2c60504301b0b305e31bdccc389034150938937d921e28f85884e6888bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could consider checking structural subtyping 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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":3178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a428a11e966d9e6a925c9e8f0bf7476f60cf50f717bd37e5150a8aa94cbdd837"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We\u0027re suppressing invalid type variables errors for all \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":"pyrefly/lib/alt/function.rs"},"region":{"startLine":3108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeacaa7d225d0d311bcc32340e5c065896f4a6f6b7f73ebe36f67c230e05cef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: falling back to Never when the lhs is a union is a hack to get \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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25fee235270f46b49997dad5432caac68e46fcae2b9a9aeffac66f3e4f6e5c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: falling back to Never when the lhs is a union is a hack to get \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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7fcb62e81425f3f489403688de457f9f4c9d6e08cae38281820c7460707a52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: simplify some tuple forms \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":"pyrefly/lib/alt/narrow.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa069ec51908394ede180b87fa0fd2ac006e30bcc573d894b10a4400da3ef5d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Distinguish quoted canonical bounds from aliases so quoted syntax gets \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":"pyrefly/lib/alt/shape_extension.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"46539b75bba619fa217e0ecc94c07a10c6d8b140000889e30a4a91378da309a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060exit_type\u0060 may also affect exceptional control flow, which is yet to be supported: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea09e0972abb40dec8b30dc8978134ddfe7d611cce2c433a8ce10df748eeba80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ideally this would point to where the TypeVar \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4113}}}],"partialFingerprints":{"codehealthFindingId/v1":"857896507d04baa621b3275c833078eafd8ca2929eebabc1e7c56c4c13f0c298"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check that value matches class \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4358}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f6237d4ec9d6c15955e3e83ea683169e27e12f615c119ad6cd70f74f6bf066"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check that value matches class \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7269}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8ba8f623de1c106c6b4bc212dd534bee13b61d38f27b1e3ec8f8a99e30a9d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check against duplicate keys (optional) \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b86104ed6d2b15816b8355370631a7375d4219fa066e333e362c0f7d5e12f66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check against duplicate keys (optional) \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1231693e83158197e3c0e2e91ebd8830242a4bbb4b91e3a59d0f192dc9a96e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check against duplicate keys (optional) \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3468ce6d35031fa0936de0d7c053b5602059562a310d63cb337a85be9cffc88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: A return type annotation like \u0060Final\u0060 is invalid in this context. \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4734}}}],"partialFingerprints":{"codehealthFindingId/v1":"10575af497390bf89699b1405cde2b0951e97c0fcbb005cfae281ad9942a8d12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It should always be a no-op to include a \u0060Type::Never\u0060 in unions, but \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":4754}}}],"partialFingerprints":{"codehealthFindingId/v1":"02953cc56050160808d5c4895fd6b5a566f3500f1830f3d7c8d1a3ccc357ec89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): propagate attribute narrows 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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":5814}}}],"partialFingerprints":{"codehealthFindingId/v1":"59730efc0de6200ba907bfad9f51abfeef476b1a1c25b9f2adfe8c60e0be36fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle TypeVarTuple and ParamSpec \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":6995}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7f816aefb23c03b4eaf0e4d7887c0083dc7e867a38581356daefa95d62f9eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler, rechen): Do we want to include Type::ClassDef(_) \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7092}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76c48a41fb235f4b72f3f41c8c4ed09778c639e7f3937cb3cdcd06dea2f606e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check that value is a mapping \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4053012108d0936a16becf97a4fed71e58310c357b2b6f8a4e7cb65573754f29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: analyze the class decorators beyond the unknown-type check above. We don\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7428}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5de9251dd597790b724a7752a2ce2a7d8f6b559ea003cdee929aef5ed492eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Keep track of whether the function is async in the binding, decompose hint \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":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7611}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fafd4f4aad25e661ac9ce1b2548d677189041f0b5e3fef7484d32df9c9f3f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This might cause confusing type errors. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":7710}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6f7f353772d33021153b2e832d41653be996e00483aa4c70bd04cb49a5f9d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(samgoldman) I\u0027m not sure this really makes sense. These bindings should never \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":"pyrefly/lib/alt/traits.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"56de7211d804dfae92a46b602b4bd124f6231ef8cd9e612148fe881de58bc553"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler) Revisit the recursive handling, which needs changes in the plumbing \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":"pyrefly/lib/alt/traits.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9036fec1fffce34cb2ebf33e01f4eaabfb9d1e9202c1d0519c3450c16a9558a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// - TODO: if \u0060ty\u0060 is bottom (\u0060Never\u0060 or \u0060NoReturn\u0060), the subtype check \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":"pyrefly/lib/alt/unwrap.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd039dd1240081b7020447640c51b848adde3c08d4c400ef7bbae2251573d9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// - TODO: all edge cases probably need to also be handled when they are \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":"pyrefly/lib/alt/unwrap.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f744211153da607e95827d790f586ba3d040622c3fd9988c4cc62fa27069a705"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK HACK HACK - TypedDict instances behave very differently from instances of other \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":"pyrefly/lib/alt/types/class_bases.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef9ebb8d798cb505895d56c7e1a7c13551f84b78e69e4e3fd0ba27b942427d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: We currently omit some classes that are in the runtime MRO: \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":"pyrefly/lib/alt/types/class_metadata.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a0a7b45425bff0119e189e393790ae571966741fafa9b3a5cb4ca28b6571b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Extend this error message to say where in the class bases the mismatch comes from \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":"pyrefly/lib/alt/types/class_metadata.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"c388d76a4bfd247531b15a892fe026bfb3bbe77a26f4c9f3879a7cba634d616a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rechen): a descriptor in a TypedDict should be an error at class creation time. \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":"pyrefly/lib/alt/types/instance.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"532656af8e74ea2fa4a57d2f28b7dd2e64e2a90f4c31898e5ae947aed2a94515"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): ReadWrite attributes are not actually methods but limiting access to \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b587a7c8fb172b941b51571aa23bfa89c71e2292944fcf973fa4718ce77c72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Clean this up, as we convert more of the class field logic to using enums. \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f9ccebf50c5ded87811b54d94f4787cb450ce9b0077edee4ca603b25132aba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //    won\u0027t match - see TODO below) \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"3912aa3d66aa925785630d02d354017ea16ce5ddd67e9f2aec37647c75d91a91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): If the child annotation is a strict subtype of the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"687a39e11407f9860645724b4aee9346c5b01e22db396414125559aeccfeae47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Ideally we would implement some simple heuristics, similar to \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":2471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f317f87e70f63a7ca36126fe9b270415031f8e10ae2996e65a702549ee91435"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should only be ignored when \u0060cls\u0060 is a dataclass \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":4359}}}],"partialFingerprints":{"codehealthFindingId/v1":"983a3a6feb3db01b2a07a793c03ef04d1f3de8ae4a5c1b6d816cad327f6f229b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should only be ignored when \u0060_ignore_\u0060 is defined on enums \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":4364}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dbfb96228642711defa8937032025e053ce5ff04b31db52398bcc26e6cad6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: skipping slots for now to unblock typeshed upgrade \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":4369}}}],"partialFingerprints":{"codehealthFindingId/v1":"33001b52e9bb83546427b53bdb671f157ebeeaabfc3ee85fff4749851cd1abaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): We probably should rethink this, for many reasons: \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":5818}}}],"partialFingerprints":{"codehealthFindingId/v1":"1653bb9ab6127611fa57b8159e3da238e98d41b6883960f5d483010453eaec22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mfish33) we allow uninitialized descriptors in this case. This \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6063}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cef7c2ec930b289b717aaebb943c6e38bb6af4d2ba20987542b7c76b87bd4c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mfish33) we allow uninitialized descriptors in this case. This \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6741}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d501fdf3713ecc7e15af66502773b182393b8686b0e9f30af4da6b74671fea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Investigate this case more: methods should be ReadOnly, but \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6325}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f25677e187e3a32431c2e3ba9562e47717b56b671e139a1ac40b772318a032a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Once we have more complex error traces, it would be good to pass \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":"pyrefly/lib/alt/class/class_field.rs"},"region":{"startLine":6739}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e7683f1f1e49d726a7ad6536147091917b15f5169e1f98e583ab5afdcff419"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Zeina: This pattern is repeated a lot in this file. See if we can refactor it (BE). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d3f2ee32b3de5902ebe2b7eef0b419566ac4293ffae613e1b39bf8fac7d5f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: a transform-derived spec silently drops the explicit \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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cda9f29c0a965b55f88038be4bff25bfe667f18ce96d5b9689d547aa976dd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: raise an error for generic classes and other forbidden types such as hashable \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":"pyrefly/lib/alt/class/class_metadata.rs"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63d0bbdd7e16f5cc9bf6d5739c6e10cb132e1dc094cc1d77672abbcfa6d34c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: sigs could contain unbound type parameters, because \u0060toplevel_callable_signatures\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":"pyrefly/lib/alt/class/dataclass.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b901e56ee80517d5e8860895fc2576a5a5f342637131b554e1b4b4c1bb2ab08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(stroxler): We don\u0027t currently enforce in this function that it is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/enums.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cef27f40139214a9bf745843fd587a3e4260fccd644dfc6d2c000226a8ee45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check tuple values against constructor signature \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":"pyrefly/lib/alt/class/enums.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b74a4b3373f9ed38ddc54e130ac55467840ce5c55c0d750310ffa08d947387"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should think about whether this is the best design. Specifically: \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":"pyrefly/lib/alt/class/pydantic.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"12645b7d80a7a1d92e2e1f7b45b9dd6aed46844d642dcff14a86b690067ed22e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grievejia): This is actually not a 100% accurate way of detecting graudal fallbacks: \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":"pyrefly/lib/alt/class/targs.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"9241d61e50046a68a7033827a6a96a6fc172533d19be0a57f3face99a1c8380c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): There are a lot of checks, such as that \u0060Generic\u0060 only appears once \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":"pyrefly/lib/alt/class/tparams.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df2ba4d1628e855fdacce7b78c6ec1fd49dba3925d3e72352647df3443a24b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Look into whether we can re-wire the code so that it is not possible to \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":"pyrefly/lib/alt/class/typed_dict.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bbc82833e32bf5653114100518e16634cccd252998df67bc131006f6f629b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Should this be an error? An qualifier-only annotation on a typed dict field \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/typed_dict.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22cf3e07e18893150165db15e94491d4c5b5513bddd320336c84a629f4947d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // There are a couple of TODO that I [zeina] would like to revisit as I figure them out. There are several types that I\u0027m not visiting (and did not visit similar ones in pyre1), \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":"pyrefly/lib/alt/class/variance_inference.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7de568ffed1e1ddad31d67ab0ab91e0aab81819305702e0fd72c77e87bc72b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// genuinely bivariant. TODO(stroxler): adopting that model requires changing \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":"pyrefly/lib/alt/class/variance_inference.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd3a6c96fb556c541b002ba07b8b648b9bcd2fbb05437f018d8b57ba91aed72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo zeina: check if we need to check for things like __init_subclass__ \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":"pyrefly/lib/alt/class/variance_inference.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"441d505f79747fb193957e685b6da42bad9a02adc6b1393ebe9bd70f22bf18e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kylei): remove this hack once ms-python has this behavior \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":"lsp/src/extension.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"903c0b752c9e8d3b7c072748470c3740cb90d091e2f781da458b3e36cdc37020"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kylei): remove this hack once ms-python has this behavior \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":"lsp/src/extension.ts"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9f863f5262f08d18113e951e53deb601133b52067d840fc7fad454022a811d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: properly take parent from caller of new() \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":"crates/pyrefly_types/src/param_spec.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"531f9a688a653702584926db5918ac3c872d21cdfe53fc442b657450cfbdf6e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: properly take parent from caller of new() \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":"crates/pyrefly_types/src/type_var.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64e7cf130cee56fd3e47284b3b97b623d577fbda44adeecd14217c9d2c106e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: properly take parent from caller of new() \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":"crates/pyrefly_types/src/type_var_tuple.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8593d1f22ef36b3912a6795f624da49be2ced9c143f399610eb9b42cb0e8aff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Flatten these instead of giving up. \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":"crates/pyrefly_types/src/simplify.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0d8ee2c510af51261e92159f0decbfad956dc845ab64938fcb456cded02120"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Isolate deferred integer union-find state and AST revalidation behind 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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77c1493f0e26c433ec7882ff83ebdc77a21d14ad3dc925a31e30e1cc7484ec4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Compile validated expressions into a small IR so evaluation does not need \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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"084f7898d4509d77983e3db7589f279775e63bdee45774f2d8c82d37ac7d7e12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stroxler): Compile validated conditions into the same IR rather than traversing their \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":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":8127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08efd0de39b23b7daf308fd594eb56b5f445c4b2e291406b50453c079c40fad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should mostly be forcing these before printing \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":"crates/pyrefly_types/src/types.rs"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"137959e51fdcef2d3cf97b6a46cd4ab5afc18a526e8074d8da51dec7b70fc84b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is wrong. The relative level 4 should be invalid \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":"crates/pyrefly_python/src/module_name.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59a5a38c24b2c8ddf0c7ee27a9b5f08f082078169ece2e29cbf057eda9c5503"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(samzhou19815): modifier for async \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":"crates/pyrefly_python/src/symbol_kind.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c499bec32a6694ea39c4b5245f952013a56bb711a7e7bc8517f799db72823adb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): DON\u0027T COPY THIS TO NEW FIELDS. This is a temporary \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":"crates/pyrefly_config/src/base.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"08469cfed7f4abe90c15ccf87ea2d0b5ffaceeeb77798daa7cb7f314e9785eb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): DON\u0027T COPY THIS TO NEW FIELDS. This is a temporary \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":"crates/pyrefly_config/src/base.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0de46c4f0135e06a731a88031e1cf6c8fc53bd4f13c4514602227f5c93afe77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): DON\u0027T COPY THIS TO NEW FIELDS. This is a temporary \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":"crates/pyrefly_config/src/base.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"59489c9f47cc46f24a2648827d9e73e2b236c797ac3b5ef67ab6ac19432391f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): DON\u0027T COPY THIS TO NEW FIELDS. This is a temporary \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":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b21a02cd1e795592bf2f8e84ab8838c889e0bcb2ece528c7d7e6e72747d47fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): DON\u0027T COPY THIS TO NEW FIELDS. This is a temporary \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":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4dfd2fe9ee3d7401dc2b3a304925f5a6e951a5440eaff5c6baff3bebf31d12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): DON\u0027T COPY THIS TO NEW FIELDS. This is a temporary \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":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a846bb7539759a9bace665becb4ec7412282442d7c2736725bc4c17ed23318"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): DON\u0027T COPY THIS TO NEW FIELDS. This is a temporary \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":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2ee1e0495afc9ed4fd18bf9abce3639dd42c4b7118e13d2b2eba0fb6800e34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): DON\u0027T COPY THIS TO NEW FIELDS. This is a temporary \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":"crates/pyrefly_config/src/environment/environment.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"543e7c869b605978389f3a1afc9679d96c359a7b59a6672beed633b1fcec8a11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): DON\u0027T COPY THIS TO NEW FIELDS. This is a temporary \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":"crates/pyrefly_config/src/environment/environment.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4e3a0df6f8fd75e2868bf84dd9cdfff6e8364c0799606c96ab61718230fc14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): DON\u0027T COPY THIS TO NEW FIELDS. This is a temporary \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":"crates/pyrefly_config/src/environment/environment.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ab5b991d77f12bca1fedef1580fa71b1736567ef59d9ed7714750cf5f5794a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): DON\u0027T COPY THIS TO NEW FIELDS. This is a temporary \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":"crates/pyrefly_config/src/environment/interpreters.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"034f733fa4f7943777b645851b224c0989d3aa60d2128102c09feb750e31e061"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This code is written in a fairly weird style. Give it a nicer interface \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":"crates/pyrefly_config/src/migration/run.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"724de01d371a6580c5aee4a32184544c343d2dc5e6aff9e95cbebbf54ac3c95f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0022recommended\u0022 in basedpyright does enable all rules, but sets the severity to warning \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":"crates/pyrefly_config/src/migration/type_checking_mode.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c4fc77f154b089d978a174a7787cf70dfe15e223cf38bc9aff37b6d09e8687"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(grievejia): Only docify stdlib for now \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_bundled/update.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa54f3877bf7373c880196f1e283d201a28045ea66dc688767ae072e40d98ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): remove once internal stubs are deprecated \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":"crates/pyrefly_build/src/lib.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cc68e27c1a3c7a2c9f5cdcf4389d64165d2957993e7c17f6ca78b2cf7d0e0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(connernilsen): pull this out into per-config lookup, so build system can be shared with \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":"crates/pyrefly_build/src/lib.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0735da68443fbdba641c39ad1a4b70cfe4545107d2a9259ce6c5469458d11908"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060lsp\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060lsp/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":"lsp/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a85fd57a293c4ed084699c12438d1c70a7020114f97c161ee8c739b0d4737fa"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060pyrefly/Cargo.toml\u0060 makes this repository a deployable product (line 15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/Cargo.toml"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb7457af31110586536715e60df9e12d0b686d345ffe077202724d67d8bb9ef"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Initialize sandbox files with main.py\u0022 repeats the code it sits on: 4 of its 5 words (sandbox, files, main, py) are already in \u0060pyreService.updateSandboxFiles(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/__tests__/pyrefly_wasm.test.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88f17e23a35a05f87a0be95ddc29d66fd542b0b54c403bce1fe151a14b7b69d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find the reveal_type error\u0022 repeats the code it sits on: 4 of its 4 words (find, reveal, type, error) are already in \u0060const revealTypeError = findError(errors, \u0027revealed type:\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/__tests__/pyrefly_wasm.test.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1a07ed0ad9cf5857187fd9e0b3800e6bc185682ce06de815088917d8b97e2b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set active file to main.py\u0022 repeats the code it sits on: 5 of its 5 words (set, active, file, main, py) are already in \u0060pyreService.setActiveFile(\u0027main.py\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/__tests__/pyrefly_wasm.test.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b91fdd679963e38ccd4dd80a48b1b720ebeea7eb69055f435d6c1d3c7c2bc25"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get the baseUrl from Docusaurus\u0022 repeats the code it sits on: 4 of its 4 words (get, base, url, docusaurus) are already in \u0060const baseUrl =\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/static/js/dark-mode-favicon.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bebc537f20dd2062c656e2de2fe352d77ee32b47aab44ed300ab3ac8b6b01bc"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 3 of 11 project(s) overshoot their size bounds, lowering Project Cohesion to 4.5/10. The most over is \u0060pyrefly\u0060 (225107 LoC, 933 module-visible types across 48 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b28447cd5a91173bbe07837b625060f2b685d51669621f3c09a586f24c85ff4e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfc78aeb85eccbb734ee9d0bad01aa335761300893992476ed9a15f09ec85e01"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63addc469c5a2e875dce67685ce695cae0cab95e4e88fa00491d7718b36c99ef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76629e20e27d8bf0428b6f5f1393e99278e7617dadbc62351bdbf50d87965270"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e50413eb76ad9af405bf44f1ea49cd0bcb73b8dfb933530b7113a61de318c41"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0ca7dc3a01d8fa62350a9cb22b97b9dddf1f71ab062f1924a04d82871e8a1c0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9abcee13ff85841168468cc720b616dbec5a86bc5a25fd060a28d0d8a14a281c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc5ab130cb080df4250eed11740ba702f129540dcc6f4fe09f46d8b6f0b55204"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3222e649472ae7dc418fde4db7b2275338f79fbf3a6ef5dea21f4616e92a2134"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04f5f766d5853baa4070222fdf5ae91a3fa3c7891394a344b5f896fd81112922"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73d2630b84d40731bf5d7c7e70830f0042c24c853de353c97ea15da78f0681ae"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2ebbc3dedf9522a6ac7b31f57d9f5fdd2de41c03248e9a0466b73d7c10a8b0c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c2249e67fba1eb1b4409d5249bc672b2577dc61c9e3dea3ca8e61b48979cb50"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e407898ee4de85d71810257ff8da51425f0a6417cab5b368e1bf2d961d51df3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2953a903d6b574256530e68cdb73956adfb7df36e1613745b42392950b458d5a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"765aabe601016576df657f830abc4f67539aab75a1b6781a11e27498212dc277"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86c8807fa4e303302495067560a732eaec9744624584c1417a6be3a2ef91079d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83328e7f4fa893833fa2b8f229c8cd63e1af83d6aa69d362c5644864ee785dce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"771c46d663c374d2d2f0d85c621c13d88637cb6c1b36bb09dbf8a22d89b4d24c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb539c780435f477167ff0dc2a2823dbdf1f4e40376b6bac9b390f10aa1ef8bf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f9e0b45dee9eaec6d87be4b6e74fd3f7fcea262f0a69cceea26141578989cf0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"add3f5c379c9c46390c5012faae494f60ee0f58936de90c4ab589e7a770e7ccd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1aed88857829086d721f412f7c824b47635c9a1e206e40c6325b3679f968a5d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7adf615c7e67106a484dc19201f947b2bf410f66d731d5063a92b372a3679922"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9cf0b2a1834fd7ae60d1ec84e8c5a5ee9730c64cbbeeee1d51f68ec67ed1c790"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0dea9225bb87ba7176812d0f77d9ede51d7769431178be21fc77087dd5f773c5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ee6cb930dc923897ce9e8c75297cfb8ec4e5fba3ece7986c4c9b9a18d3121ce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8351a662fe9d46901bf57ae4105fdc828a56fd0a85c994243e4810ee3fe85a10"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3ec9e9a39d0519d2d0c4b720b16b530e04b5d7fc4d7750122db744580156a64"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"517bc9f18f96e78a3abf1cf9f30831415b6c873bcb19edf0285a2d7c7dc92665"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73682de7aa5785c7e971f8c59aec8719de33539febc798df7337a0fde05e0e2f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a605d3a7cd59424792b31ff65045c2e091db3bf139505b03a7fe47f4b23805cb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ac82d0a5a310e67e34085606444c032254f60525cbbeee77516ace8d18fce0f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f993fe9fac2e7e8e92cfb2b7b12e18d070895afa6dbd85ffce44030561e54ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aea6adf7d3e3c45846e844ad60ca992142bc61166f7c99c6bdbbbfbce3a40b38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb33682233729de19eabc78dd38938908571564b597956700090a18cf94c4cf5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe16a39a180b142600554555869894a56007e4abddc1d76c4e5b4de0ca578724"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd44e81b9864c80910ebf0bbef69f02b169d73952d3efcb461d82bee894f05f9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef3d566c2d272614b11d11daec715ac519bc98d6752de272e5da039c53454ce4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53daf4a66b8debfb3284534f616a97ee9794d4a48388e1db3909e6f01ee35a5b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2316e28c94f93ce75ed5f1f5f61789d9f7668e87c97f4711c56b91b99ffefe7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"524b733754e776b8eee72b4d009fea5b33a876b1a3470057b6394006545f78c3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ea96dfdb0c0c054d2c106d5c432fb664f4a862c5981ad63163e2aff930f2278"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a94281926db01879dcabd5609cbae07bec9dad7bebb7476ce42e948ab52d212"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2b667f737924a9e27b6d96745eeb8c693f6d8603d4060cb4c806078922db082"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2088a5b524d0b70594f8a57e79e4a130487d9ce3b8a24a15aeac556fa22c9ed0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"4deadaa733d0f1b1f1649e8059038a27b03f5fefc124ca764c48d6e6ba416875"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"fd7ef1be3ad9df93f2d27ee099df8072b11636e535265fd41edee98cf5b4bbc9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0ca8f5eb091ec4b2eeb3337b99e02f1e3191d1f5d9afd0afeabb63e8d0e441b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4436338f1927f5216c4c0e6563868389015b0e60824f915df25cf99e36f0f76d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"972194a8fbe38aa7a8ed9208fe7806b57b6cdc063d5034ece34f9a31947c3d58"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3393ceb58a0db56896c9469505ffeb50ae1d33af96b3eabb2ac54886bb3471c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53809cd179e9e97739b8348361009b02184b70059ea3c5bfc9f28982f340cb42"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0935c09099648c6072aa75c59f34ddd1926587ee5d8e307f0631cb9c6f0ccf6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27ba50556121c1f480d1b022635b87e7384747d34626fe2e1e86d60cee572f92"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed97a6335de66f794a92b3dac47ff1d5a08573861f04398c34e7b69e4688fc11"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d2c56e20b5192fd5ff167cf8ff3e7a1811e441a04b38c98cd9ae9070b8ac01d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6685a03c3b88c13c8f1264e046834ed319d799e78a9d76e97b8035897d5bd53"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aeba6f4cf69424dc8de36a60f5e44d15faf61c05c6c0ed04d1dca7f42dad62e6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06efa0fadf8a320ce342b6e60ca531f5e7a7e3a8f112fefc913a540708da37e2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"c9efcc96badae4cd2c5ca8963f39f6c5567a751779cbc8cca61fb601c9bf4580"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09d2a78478c019c6fbb22ec7188f8af7497fa2387f10c2c33417bd26b6506d5e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c07bac018b87eb0f0ef52a5da5e062a419262c0ba537f9be414d069cb0493b80"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"2bea6e6eb9c1ce17a15cc1e6e9b300255e44d59887a08cd70c5e14c5ee8ea7fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"192f6eeb62b3f16bdb6d14f7c76973b3ce857c3595a8b0bdafd4a474a85faf26"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4ebc9249612c1fe333143d7c0aaff75205b8914e546052414756ffc7e2711e8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a20e7241510fefe11b51ce323ea1247f78e22a7d05a4c999a98722aa22fb795e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"586a8033165be41b411cb3c90b28132c833c76e395ef21fe9c8d39aa9556e45d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45910abb372d2f43d6597bcb5c47cace96e6c36217d6856478bc4cf5845541db"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c45461c9d3bfc60808377d07fbd904eac5f088ee264b4f0f642d83f3f43d724"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85e6ae7a7b6570571192184e77779ec03ddcb840b544c9cea03db7a089fc5f72"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63e33268b23ee4f88b97786ac7b819fa11b24dc693e24c44219d32338b073fb0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06e56d3b0ca450df54eb3744c6139473e83895766ca3f11eea82cf2a01786b93"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ecead711d7373417a45df9c0d2ec015c4e9edb77423017dc6cae58092cc61d8e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bdc6b83c9b6d8d51c9b93bd41a4011317236972ea5f13d8a6ac0b99bdffcb92e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94311e616097d6dfda691a126789a0c426764a1b8be03c375b72cfa70d0e3b06"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a1ce83d3c0f74f0afa1ff928b8337e6c1b15b78f2bd31f57d14136b20ca223a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f80affd6b5592f6249ff7e4ef7d15e84bb9d88c052636a43cf863020cb00351a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b539d73dd64923a82cf7b3c3d63f3103b1824c645d48834df703f76baa71deb0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ef532049e48acc4c146823c822f266aab27ac07e1ee8b318fc1e1d2e868d6b9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"93e5e91cf39b269d2fdf95448fa5a97a0913228cc421a457bb75a27296172645"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9db486ca298e0ab831dc02560ef85eae0a8c8e294f062a5fed0d8e72324be81a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"693adf7fbb51d1f4cac55477c043acb7e178e1ed4dc425568159b35a5aa74739"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e6a7a79c8c19ae05b344f674ddfc53d4010cac35d06f8e6fac641577d0fe5ec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"633d18b7e24e0b0e9b573373399b20cce0c9f48ca3aef5ad26dbbb818cab4710"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66078277cd4bef52f11a9a1bae69e53761c9428419456fb3bd8d7565ebefbcf8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"038a67a3d61285bec8f26666f48fe9ea51fc0c900111f8c546d4dbec00291a4b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e99e537ac2b1f7849afa3be30f5741c3f9f6e974fca45364a3ca96d1dd20f2d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03025f8cf93dfe1bfea1052412fe216d2185fe6c767faa6c33ce0f72d963f138"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b2ec6bf6fbbdb0f80f8460e514fa309f976cb4aac78785a5a1f49735ce586b0"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66bc42517ddde09707cbc655811ee0a857259946d9a094413deec82d6c0a2c58"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0869a8abff4069c9d3a978b8c5c4e2a526237169952940b2a797a5aefe20f3e5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e5a970251937436d8271f81f24e4b04fa8b0587450f3296280d5c19503644a3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ea42d519568f96ff5a575b071f4ad8c4254662adb0c4d1a57afe2287571e3a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0b522f8e14a4dbfb35b631730fd9a38213ee32c5863c867347f8dcea8936747"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2951b50a708cf9326a75c18d4ad959d6563148f3d46662d213bbdcb034bc32c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6924e2e931a3bb4e7489376aebfc003c9a34362cfc33dbbbceb4eb873dace084"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a53053a493cce0c24a43a694068c1df90e334a38a32bdc7e075cbfb04f278fa3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8b0f4c5eaa09913e3dc805f1f92960e35de351ff714f3b3a5d64d3aca485ce6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3d91fe33d58e6a4d8329c6c221f83211810516dde9c3e4f841bd02603fabd09"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a43b06a4487c8e38ac75a25b594d0cd1b90b0eff721c78c1a33a66e248190cda"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ada5fb2c74fae6550b8a04be7b86d54d488027c36c17cabf240608db561ece4"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"716206954d8dfb492161ed98054758d3587ef6413ebdd0fd06d7e6da35bf7389"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81e83782acbe36e0417d673a9452338024417e3d5cd518fdcd741a86b6fd4547"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f7c63500427b4a176f7fc8acfba03a4bffdbb3f1a55275fb9b2aa5a7b9a5792"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"670d11c98d13a561bb34199f954026f987ea728d3ff9a77950b483d1227e087e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5cdee565a313e5ede14edf8f9750091a3d2c17771649f7e312adeb425e5e374"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"076797694b99453299fba5f07708bb50f36f25cb78e5f09ed86a4f500147c145"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f971814aa20c98719d73e934bfa632f81554d7b3e5740a265175301503d5485"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d549c9aa4395c2a2996e79ad0522a05b8c708ae667d72e39132beeae3c324a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"058351a723731355207563167a13da2fcee9eb6fd55bba7dd664e8382808d980"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec3b19261ef0fd1acaa78f598c580c3c1164fd712e3810a4496e1ec211e0f75"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"331d6a677ebb4a689e3585822b67daf879ab28a48f63006f725c65142b83521a"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5125c4c72dc8ee215a64670f4064d1ae65ae4867e905194bfb15797eb95cc341"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68374395fdc8b0bd898c9f493e904c1a03505341519a13159f3ef66fbffb82b1"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26c2ea83ac20da75b6b6ee25beec4f08787dd82eb3fa4dabd1267127217e83ee"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ee2f8441413bdec88618cb7e7211f223d0a1c30c321e1da266e00e763f6ba53"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a101f0c56b6c5d3bb2de65e390e55fc496dbab95a67029e836517d295efe69a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51e1bcfd386cc75a2b05081862051a9e06071715e64e4aae3411593f6e00b8ec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb868fcbab1d3e668feeab5ecccbe4979af6fd489e25542e1fa46f2ab45a0a02"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75aa3a509de6100bf9feaa11279ea995a2b6d2d0cebe88b09ccc51b97ce1325a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34df706a0b5148efa7129614b947eb1111850af693b6b0403a688f87df5f50a5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4ee139ebc5cb3c46440f61e0a654a1a6fb7f3243f4ac1d67ad0cca8e87087d9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf90765272d3decdab087f0a8fb769840bb001ac5400a0f971357e14f2d74004"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9bf98ef7de1b0da15c41898367d2af24af7278f1523c5d9be3103fcea74cac5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"557d72acd00418ae2e6deba43c5ab445d5640ddf0562113ba7df567e401cac43"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0fa0269e10b830b688dd28c27b2c3986c5de5c5506db7d96acda243c19876b0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c9fe151053c19bba9425f4f4b5403c855323ecf5b78f1b2e8826ce9cac608bb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27c8ff01416ac0bce0cb14488b1b6ef854314145b291e007c89f318fa0545b2d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5492d0dcfcde9c80441b3cd7ba1d22fd692b3111145c27703a5d88a8b914b50"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d2bf3d2d7b39c2a046189f80ddef234edbf81ff261cf0db3c2130fce66f569c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"6470bcfea231eb23af82807ac62ec69c0c2501940391f07ccb6937ddcf7cf5fd"},"taxa":[{"id":"CWE-494","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":"16ed28b5f1b61ba0fd219c2ca643b86876930a0dd61ee99e1e87218364bbeff5"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"52f53c85f681c4f989181ded5ef8207cdee7cbf9667158b7e41baee913531e09"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f10fd0fe3948fa2363f35840146a08d672126894c33b81fb3e24097876efe993"},"properties":{"dependency":{"package":"shell-quote","version":"1.8.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4b6b56548d162d07e9d24e550e00a1f9e77137510243e41873656001608e75b"},"properties":{"dependency":{"package":"@azure/msal-node","version":"5.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a4a49d80fd6a05a6ce11222d52e21202933afa340a9aa52bd568a33704041fc"},"properties":{"dependency":{"package":"glob","version":"10.4.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2721f7dd8ad9e882a2053aaa39881f2dd7d84b2dc88ad1d7b4389aec41ff0919"},"properties":{"dependency":{"package":"linkify-it","version":"3.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb52ba4b8a815d665b9d94a34b885865f24ae9aee781b164f94e061911e0939e"},"properties":{"dependency":{"package":"markdown-it","version":"12.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1580b59eede2d578582be166bb338943113e9509e19680729037c87d6df870c2"},"properties":{"dependency":{"package":"serialize-javascript","version":"6.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa275dcc581e31816223ff250817b0083925776ca9db8bc9a83879cc85b97f8d"},"properties":{"dependency":{"package":"derivative","version":"2.2.0","advisory":"RUSTSEC-2024-0388","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a42ca7416279f52063a649dbc505340ffc7c7a5727193e601ae1de8d6db75e3d"},"properties":{"dependency":{"package":"fxhash","version":"0.2.1","advisory":"RUSTSEC-2025-0057","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f9b2cfeaa13e43ba977bd5894aa9b9b9476e37d10f91b259bc938674328760c"},"properties":{"dependency":{"package":"minimatch","version":"9.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab2a6b7f62651ed5b73349938cd8178cc3087f7c0a3ac900898f147bc1294d98"},"properties":{"dependency":{"package":"qs","version":"6.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74b26f3916bd6a30538bed51a3fb054f099a975c096b99544990c7204a646761"},"properties":{"dependency":{"package":"xml2js","version":"0.4.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"296b660fedda3524078aa456dcaee7444fd0408d7963a1b08565794ccb87bc0d"},"properties":{"dependency":{"package":"diff","version":"5.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 418 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; 418 of the 577 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: crates/pyrefly_config/src/migration/mypy/regex_converter.rs, crates/pyrefly_python/src/comment_section.rs. 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":"crates/pyrefly_config/src/migration/mypy/regex_converter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3b61fb8fabd86cca60aa2c0b97918c99da5b812da6373f59c9408b4c737bec"}},{"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":"crates/pyrefly_python/src/comment_section.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"616eb8a8f46275c7dcc80d801a298d279644cdfbc6ac97713bb8079fbd8523fd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: binding_memory.rs \u2192 class_metadata.rs, solve.rs, class_metadata.rs: \u0060pyrefly/lib/report/binding_memory.rs\u0060 changes together with 3 other files \u2014 \u0060pyrefly/lib/alt/class/class_metadata.rs\u0060, \u0060pyrefly/lib/alt/solve.rs\u0060, \u0060pyrefly/lib/alt/types/class_metadata.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/binding_memory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a055f62ceaabb153f25889196a3f106121b9617a4df678130aabf21596b5430"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: map_db.rs \u2194 query_source_db.rs: \u0060crates/pyrefly_build/src/source_db/map_db.rs\u0060 and \u0060crates/pyrefly_build/src/source_db/query_source_db.rs\u0060 change together 79% of the time (11 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060b5aaf8c2\u0060 Split module enumeration from source DBs; \u00607ecb606d\u0060 Split live/incremental source DB methods; \u0060d5331bb3\u0060 Avoid per-origin \u0060shape_extensions\u0060 misses \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_build/src/source_db/map_db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f29ef21977c0eaef0262b703fbe502cbeda4e611834e3e77e941e5a4c162198"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: buck_check.rs \u2194 map_db.rs: \u0060crates/pyrefly_build/src/source_db/buck_check.rs\u0060 and \u0060crates/pyrefly_build/src/source_db/map_db.rs\u0060 change together 79% of the time (11 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060b5aaf8c2\u0060 Split module enumeration from source DBs; \u00607ecb606d\u0060 Split live/incremental source DB methods; \u0060d5331bb3\u0060 Avoid per-origin \u0060shape_extensions\u0060 misses \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_build/src/source_db/buck_check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4252e3959402facafdd62105bd02f8263f2e2f8a67ba8142965f2bb41e2f04"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: call_graph.rs \u2194 override_graph.rs: \u0060pyrefly/lib/report/pysa/call_graph.rs\u0060 and \u0060pyrefly/lib/report/pysa/override_graph.rs\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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060d3abc3d9\u0060 Borrow read-only solver helper inputs; \u00602ef9d847\u0060 Remove override graph building in pyrefly; \u00604f7937c3\u0060 Back out \u0022Revert D93807796: [pyrefly] add opt-in telemetry to ad_hoc_\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/call_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4184fb0307c8dbad1043f70343fc58cb63fa7543d59999455c863db92c70b1ed"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: type_table.rs \u2194 convert.rs: \u0060pyrefly/lib/query/type_table.rs\u0060 and \u0060pyrefly/lib/report/cinderx/convert.rs\u0060 change together 64% of the time (18 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 18 shared commits counted here, the most recent 3 are \u0060419b9e66\u0060 Remove duplicates of TypeVarLike methods; \u006013e8d458\u0060 Delete the disconnected ShapedArray type representation; \u006047026780\u0060 Delete the unused legacy NNModule carrier \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/query/type_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1066099f14401daa6ff8a8788acc80e46e84afb80cd7d714227c6d995aa62da0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: type_table.rs \u2194 type_conversion.rs: \u0060pyrefly/lib/query/type_table.rs\u0060 and \u0060pyrefly/lib/tsp/type_conversion.rs\u0060 change together 54% of the time (15 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u0060419b9e66\u0060 Remove duplicates of TypeVarLike methods; \u006013e8d458\u0060 Delete the disconnected ShapedArray type representation; \u006047026780\u0060 Delete the unused legacy NNModule carrier \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/query/type_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a34a9ad697f6feadb0674f1b51baa5aa28bdd43660b97ebfb2097b32ce09c98"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: solve.rs \u2194 ide.rs: \u0060pyrefly/lib/alt/solve.rs\u0060 and \u0060pyrefly/lib/state/ide.rs\u0060 change together 52% of the time (21 of the 40 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 21 shared commits counted here, the most recent 3 are \u006010fba794\u0060 fix False negative: Pyrefly does not emit an unpacking error in for k\u2026; \u0060c0ac8823\u0060 Compact binding storage; \u0060d461a1ce\u0060 Detect illegal legacy type parameter shadowing \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/solve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea754fc1274484d3c58f1b4c703971158f73938d60f75f0f0e67958093ef0989"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: hover.rs \u2194 provide_type.rs: \u0060pyrefly/lib/lsp/wasm/hover.rs\u0060 and \u0060pyrefly/lib/lsp/wasm/provide_type.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060bb937314\u0060 Delete the now-equivalent display read accessors; \u0060e37d1c3a\u0060 preserve residuals in user-facing type display; \u0060787e442c\u0060 provide type: fixes and features (#2971) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/hover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d46fed8fd64a2a39507c8e47918e4fb721f655519bf423b8244c1951adbaa81"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37285fb0b00c9415c1f3204aabdb8d016b87f801e08061e07e57029a4cc5de3b"},"taxa":[{"id":"CICD-SEC-6","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":"19861164aa237923d6643508198db2bcc1cde56515f94d541042e5a94c36e5b0"},"taxa":[{"id":"CICD-SEC-6","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":"54b5de2f47ad657781e03870548000da9b53f247216775e6977c4fdf5e3327eb"},"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":"f58a823f6b1fbef067bbb9b0397e16c8981c9127c1c797e15507d299aa988d13"},"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":"80cd04f5d1523c47aae914324b029e010a608eb8970de0b5f6cf3f910f681351"},"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":"e0fbc1958a8188bb71699baba557047f95a1b012d02f49463cea360dcde20592"},"taxa":[{"id":"CICD-SEC-5","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":"22f705937b5ca95a0dde9947250be498e60e79b2639c48ac457d8c35cdad5dd1"},"taxa":[{"id":"CICD-SEC-5","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":"216ca5428c7b3eb1f3b8e7943feffb28e4758b96c9650d276287adb84042446f"},"taxa":[{"id":"CICD-SEC-5","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":"f40943426ec6766240409daa5cff5c7a57fa2215c1552162cd36799f35d08ca4"},"taxa":[{"id":"CICD-SEC-5","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":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: ConfigFile.get_paths_to_watch: \u0060ConfigFile.get_paths_to_watch\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e13c845b77f71c5c370d819a086816afde545dc389e849d2b12d90dbe5dc00"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: ConfigFile.query_source_db: \u0060ConfigFile.query_source_db\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2df8d44f8793012eff02c64eb0c12674e9d94f95c9c0995cbacd86adb12fc40"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 5/11 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060pyrefly\u0060, \u0060tensor-shapes/jax-pyrefly-stubs\u0060, \u0060tensor-shapes/pyrefly-einops-stubs\u0060, \u0060tensor-shapes/pyrefly-numpy-stubs\u0060, \u0060tensor-shapes/pyrefly-shape-extensions\u0060 and 1 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060lsp/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/package.json"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"924f64314112fc264272508dff90fa66e37cbfba90ca49a098a792c4c8839d85"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060size\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/benches/tsp/record/runner/index.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"566e43ce8198dcb56a87f7893ea689a659eb861d2516e2d557f10f751fb84e16"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/benches/tsp/record/runner/index.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0102f4a4c0d0002d039554584a99496e7419b8c8ebc485aeb3748a0fe3c886b2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/benches/tsp/record/runner/index.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2214046b1fa66fcd403365a0a783cf53c3a93112580bf9109453d9b827f7bf3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): lsp/src/extension.ts:148 \u00B7 lsp/src/extension.ts:443 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/extension.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ae5abc48c30a6e07e521de9c8f2b920055d7fc929eeeb8c43d7c84957685b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): lsp/src/code-lens.ts:219 \u00B7 lsp/src/code-lens.ts:246 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/code-lens.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8168084793911d8f4dbe5b56f0390db9ad705fa9aa534d7e4fccbdda9d6cb567"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lsp/src/code-lens.ts:53 \u00B7 lsp/src/code-lens.ts:64 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/code-lens.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"be46d4d48adec5349bc5279e9547d4be26834e36e6fac08a9202d9407fc87b89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provideCodeLenses (cyclomatic 22, cognitive 26): provideCodeLenses has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/overrideCodeLens.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"940d3185bf36ebed5deb5cb412bca606b9da26bb9c74d9c69191a2044f3ed376"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTestAtLocation (cyclomatic 14, cognitive 17): runTestAtLocation has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/code-lens.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1469a66f4efc8416c0db091be89569a942317f736a68c7a16f94eca3e9b40f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateStatusBar (cyclomatic 13, cognitive 13): updateStatusBar has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/status-bar.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2407adbd70064ed29dbada8814e1adb416fc2c045ab41bf5e733c43726c348f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectBinary (cyclomatic 11, cognitive 11): selectBinary has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/lsp-path.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d915ad054faa442153e18488ebd4f26522629f6e8b5e4facf2d41f8132fc0fe4"}},{"ruleId":"R3","level":"warning","message":{"text":"lsp/src/extension.ts: 631 lines of code: lsp/src/extension.ts has 631 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"137920306c788c43eb01e38ecb5f49b1c801315c355174db3f86a0549862a11a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly_wasm/pyrefly_wasm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c237cce92222cbfaf7b9bc5407ea5589049d79c421e1caadcf5b55f9e466ed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/esbuild.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8766bf1e701f50893347f90a8b7c936ebcce87fc58a794c4da2a8c102a3dfe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/build-pyrefly.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1028055841a35b507c0bf523f71220ffd7a255c5e73ce1c765245296dddcbb81"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027requireSetting\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lsp/src/lsp-path.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ebf1dc094ebecc53475cf43a4c6a722edd7187074de91d171afc9498cb860a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@vscode/test-electron\u0027: Declared in lsp/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4a15d50c22f15a825eb0b3a3f453eb30e52b32d979c7cc56d65d625d4b1c686d"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027serialize-javascript\u0027: Declared in lsp/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6b48feb39322dac7ef17db8bcf065101f08c1cd1a76c05d8310682beb48ace3a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027underscore\u0027: Declared in lsp/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"87b0daff323858a079935a193bc18812feb15ff12bc52db2d9ac26429be17a80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060axis \u003C 0 - len(shape) or axis \u003E= len(shape)\u0060 appears character-identically in 2 files \u2014 tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi, tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi. 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":"tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"892597b108178504f24d06c4ddb354f3da338277202172e9b50d71142a4feae6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060axis1 \u003C 0 - rank or axis1 \u003E= rank or axis2 \u003C 0 - rank or axis2 \u003E= rank\u0060 appears character-identically in 2 files \u2014 tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi, tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi. 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":"tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8bac7b9e352443dca511580e44764dab68cb5d9237bee6e6fe7f3ccbfabf4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060destination \u003C 0 - rank or destination \u003E= rank\u0060 appears character-identically in 2 files \u2014 tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi, tensor-shapes/pyrefly-torch-stubs/torch-stubs/_shapes.pyi. 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":"tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba5e115577198fd3cd0ff949b4c6bf5efc973ca385881801fe84e530e8f0256"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dsl.is_concrete_int(a) and dsl.is_concrete_int(b)\u0060 appears character-identically in 2 files \u2014 tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi, tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi. 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":"tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b8cf07763cf494d2773a4b21ea0715c6a8fd1bde3baeadd16379ff59b714d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dsl.is_concrete_int(dimension) and dimension \u003C -1\u0060 appears character-identically in 2 files \u2014 tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi, tensor-shapes/pyrefly-torch-stubs/torch-stubs/_shapes.pyi. 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":"tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a4b71c95c562d48abb6dcaac07d147b8b9b9c10a3c93d2f650df37199357a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dsl.is_concrete_int(dimension) and dimension == -1\u0060 appears character-identically in 2 files \u2014 tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi, tensor-shapes/pyrefly-torch-stubs/torch-stubs/_shapes.pyi. 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":"tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"6659ee10a586545b67f61989610b98689a5e186c69eba2ed53624b6afa7f9ba2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dsl.is_concrete_int(extent) and extent % 2 != 0\u0060 appears character-identically in 2 files \u2014 tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi, tensor-shapes/pyrefly-torch-stubs/torch-stubs/_shapes.pyi. 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":"tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a2d73d8bb0e9f9596a0748f17450268e4c2ae041ab344a685e2ee381203123"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dsl.is_concrete_int(repeats) and repeats \u003C 0\u0060 appears character-identically in 2 files \u2014 tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi, tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi. 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":"tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e27aa27d10f2d07f72d405c327076c3b46a8b19e08b5c51229742bc02233fac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dsl.is_concrete_int(total) and dsl.is_concrete_int(known) and total != known\u0060 appears character-identically in 3 files \u2014 tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi, tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi, tensor-shapes/pyrefly-torch-stubs/torch-stubs/_shapes.pyi. 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":"tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e91735f0caa620172d0bce4febd1744594fe06b39c4be73402595bf8f406ab0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dsl.is_concrete_int(total) and total % known != 0\u0060 appears character-identically in 3 files \u2014 tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi, tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi, tensor-shapes/pyrefly-torch-stubs/torch-stubs/_shapes.pyi. 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":"tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec80e504222c74e0ed117503b8afddf339cf658474507aa195fdfa10133a487"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dsl.is_concrete_int(value) and value \u003C 0\u0060 appears character-identically in 2 files \u2014 tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi, tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi. 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":"tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de99e32122df57f4fa1a237e42a1b5eed523844e1b6fea08e5e3181b109bd73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item \u003C 0 - len(shape) or item \u003E= len(shape)\u0060 appears character-identically in 3 files \u2014 tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi, tensor-shapes/pyrefly-numpy-stubs/numpy-stubs/_shapes.pyi, tensor-shapes/pyrefly-torch-stubs/torch-stubs/_shapes.pyi. 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":"tensor-shapes/jax-pyrefly-stubs/jax-stubs/_shapes.pyi"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3fa2958ff9370d0e203c8b8991afd134146c7370543af47fd0691940ea9a7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!function_def.parameters.posonlyargs.is_empty() || !function_def.parameters.kwonlyargs.is_empty() || function_def.parameters.vararg.is_some(\u2026\u0060 appears character-identically in 2 files \u2014 pyrefly/lib/state/lsp/quick_fixes/inline_method.rs, pyrefly/lib/state/lsp/quick_fixes/inline_parameter.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/inline_method.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"307a36c1117e44caa910c791d3d64958b7a566b52093ad5db475fc2fdf82b0cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!prefix.is_empty() || !suffix.is_empty()\u0060 appears character-identically in 2 files \u2014 pyrefly/lib/alt/map_int_tuples.rs, pyrefly/lib/solver/subset.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/map_int_tuples.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0893985c45850d7fe994ec437c2e56c0c0f151837afbee7fd61d4c73039b3fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.is_directive() \u0026\u0026 !self.is_unused_ignore()\u0060 appears character-identically in 2 files \u2014 crates/pyrefly_config/src/error_kind.rs, pyrefly/lib/error/suppress.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/error_kind.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36b904257a0ca0a8a13a2d39dce9b2a8093bd20c78c3dd375914d7dd98a1c6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.is_subclassable(cls) \u0026\u0026 self.class_instances_always_truthy(cls)\u0060 appears character-identically in 2 files \u2014 pyrefly/lib/alt/expr.rs, pyrefly/lib/alt/solve.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/expr.rs"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"4168dceb9a558b219a1a4c8551f4f64542a376afc466b9ce39222def31644a59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060base.is(KnownClass::TorchModule) || base.is(KnownClass::TorchModulesModule)\u0060 appears character-identically in 2 files \u2014 pyrefly/lib/alt/nn_module_specials.rs, pyrefly/lib/state/lsp.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/nn_module_specials.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f1391fe19ef7fa3c8827f09c4eb1116121f7f036e6f04a90ce34f966d82a10"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060call.arguments.args.len() != 1 || !call.arguments.keywords.is_empty() || matches!(call.arguments.args.first(), Some(Expr::Starred(_)))\u0060 appears character-identically in 2 files \u2014 crates/pyrefly_types/src/type_level_dsl.rs, pyrefly/lib/alt/expr.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/type_level_dsl.rs"},"region":{"startLine":2850}}}],"partialFingerprints":{"codehealthFindingId/v1":"7391c4157c2b7a26bd228e608e1e01391b97540ee29f82b88bb32ade72165f6c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cls.is(KnownClass::NotImplementedType) || cls.is(KnownClass::TypesNotImplementedType)\u0060 appears character-identically in 3 files \u2014 pyrefly/lib/alt/call.rs, pyrefly/lib/alt/operators.rs, pyrefly/lib/alt/solve.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/call.rs"},"region":{"startLine":3246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d48a101187b9d7ce70a4f360cfe920339507c04a591168282481fadcbb6efb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060def.module.path() == module_info.path() \u0026\u0026 def .definition_range .contains_range(function_ctx.function_def.name.range)\u0060 appears character-identically in 2 files \u2014 pyrefly/lib/state/lsp/quick_fixes/change_signature.rs, pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/change_signature.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4322d9bcca184cfb0d0b950b702b39915873416838296216cd313d1d9208aab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expr \u0026\u0026 matches!(name.ctx, ExprContext::Load)\u0060 appears character-identically in 2 files \u2014 pyrefly/lib/state/lsp/quick_fixes/extract_field.rs, pyrefly/lib/state/lsp/quick_fixes/introduce_parameter.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/lsp/quick_fixes/extract_field.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad8b8b877f3b9c09fc3cc2f9f2b56530e578469da9610a76264d9357d3d0ae5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060id.qname.module_name() == ModuleName::attr() || id.qname.module_name() == ModuleName::attrs()\u0060 appears character-identically in 2 files \u2014 pyrefly/lib/alt/class/attrs.rs, pyrefly/lib/alt/class/class_field.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/alt/class/attrs.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"370c13ada062369299433adf6389a6b8f9ac81e910b88ffb8658862f93c4287a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060method.recognized_attribute_defining_method \u0026\u0026 matches!(method.instance_or_class, MethodSelfKind::Instance)\u0060 appears character-identically in 2 files \u2014 pyrefly/lib/binding/scope.rs, pyrefly/lib/binding/target.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/scope.rs"},"region":{"startLine":3835}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c2b702d14f8d2559938666a6a3931630a7d4a37f8f281889f3de9fd945b495"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prefix.is_empty() \u0026\u0026 suffix.is_empty() \u0026\u0026 is_tuple_carrier_shape_middle(middle)\u0060 appears character-identically in 3 files \u2014 crates/pyrefly_types/src/display.rs, crates/pyrefly_types/src/shaped_array.rs, pyrefly/lib/solver/subset.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_types/src/display.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"997ae79a50886547fb42eae4b64e4fae94a7a9e3e97780137e03ef0b251b58e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u0026\u0026 call.func.range().contains_inclusive(find)\u0060 appears character-identically in 2 files \u2014 pyrefly/lib/lsp/wasm/inlay_hints.rs, pyrefly/lib/state/lsp.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/wasm/inlay_hints.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e689afb0159643d6ff9760b51ab0746faeb22b3914100124a66c6fd455d157b"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/1 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: compile: \u0060compile\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly_wasm/pyrefly_wasm.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18e135a35a921b6cb1e7926d7eaeccc3949d6b98fd7d7aca589fffe6056dffa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 57 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_bundled/update.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07aa3ab09cf4ccdc10def7b48f9170b9f06309890c273d9bfc4508e819b8b68"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 90 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_bundled/update.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca31986017c9ebf7898e705f7fab84cc75ed8a5c21420ac8e24830a9b16358ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 318 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"conformance/conformance_output.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb725a22003c01dea4ccd5781f18060c500060e78cca436c1c3ba1c316d67e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 333 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"conformance/conformance_output.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0e2ba49cf984b5d754afa9abe775716494a3cf04a25ca13e1002c00145170e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 193 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/tsp/server.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"af66382d63a6435da642468b82e3fe7148722f6137f52d9d31631f2a41a3a371"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 226 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/tsp/server.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4d1b41fb22e72a63952c67321e4b652223efde71dd407e4bf328cf8d1a90b9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 734 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/tsp/server.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"083628fc2224163e33fccc05b2ea68f442778b144a3796a338b5760e20a1bd73"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1729 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/state.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4e45e3ae3f2c4885439b7c63ec2a17233c3e4ee48f49189fc2887bdb4886a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2326 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/state.rs"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07a46b1845cf68e1aebe24d709d9f0f8f92263ce75b01da77eb29d17eeb17e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2769 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/state.rs"},"region":{"startLine":2769}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b825243661d06c726abb37381c06ea2dad8dd25c268cd59dc65eaa7f25f0596"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3440 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/state/state.rs"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db2fc3274d55b75e548b72af011b44f79bdbdaaf449ce6ab0e53537f2bbacf2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 232 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e5d22bdf737137efb11aa8b116b3761eb7a7b2ab0164618e89d4ae0acad9cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 191 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/scip.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8a271466b5aa0da3639518ed0c5d2ad3b641ffe239f67cb589d76ab38862b3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 17 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/step_logger.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3ffd41c96d995aafaa3f986a869462c428300c30ef064219098b37552c8584"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 25 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/report/pysa/step_logger.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3408737d3c9628de7dad1eccb2d1e44c5e3fe2ccde50b13a68f618fe864198e9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 271 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/module/typeshed.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8298212c49bb95d4944512dcd9024a54c6a82835a70c635fe722c3d81d93781"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 274 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/module/typeshed.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea990921ab1dfd5626b9e709213458bcc8e47640af15cf3482f251704688029d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 294 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/module/typeshed.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aec2c9469321ff24470aca9b4f46c08bbc7a254fdd41030f10e579c08890986"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 44 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/module_helpers.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c15afe52efa383fcd5e708d18299d97ea042c9e0be37b6f5a35167173de1cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 56 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/module_helpers.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d7cf14c91b91d4071c62c7c0c5385e8d2941401ce65359c0edf05823a85a57"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 68 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/module_helpers.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd92b9ec00519a01b74533817d12f7b75e1f738c97f4cf07faef308d6020d8ef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 260 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/call_hierarchy.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7139aab43deadf695ceaacd40fc7175dd5bc41762b4ebef517dee443d1bbd3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 264 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/call_hierarchy.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"20426fafc23597c69cb884b6628a447ef173353c1a351fd1e112d16972f94a33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 109 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/initial_configuration.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6945ddde551ee476369de57501352180683876515cbf6543ed6721b94b6248d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 145 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/initial_configuration.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"af744b79c462f0b1994c18e799a38d481a02ac12840017de02a18b06932e46e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 401 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/queue.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4e916c18ec217fb3d802fa95f9ba67be08ea0d2ee5bde2b1ba2dc56a7b7bac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 423 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/queue.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"205cb9abfb06a317953b21350d89347c0fb9117dca49cdfed01c7904a424b21e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 434 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/queue.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9551ea23e81d931b8c7b02e36f8a6321daa71bd4b6305709ed06f9b7db3dd8f8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 628 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"189583cd964a78e50555fddeba357b9a60886b5041e936a2e7b75297a72308dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 630 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a10ee7b22250a1eaffb163a3bd4417f5f71ea86db2436828afdd6975ccd7527"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1296 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0113794c1983924722227a292c6528b87c82e498feed342581348ed72acc04"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1308 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"596f22ea4fd402dde99eb09a4b5f54c58f50186a74962856db9725a1f44628d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1315 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1550835dc1cd4fe8b40acd904af1c3a288d1ae781c90512f457d51452c90519"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1343 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b26e5652890111d19b598de43318e8d5bff8cc597c007886b271034ce674eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1361 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"729fc9f27499d4c68f9eafc0fa4af3b9cced478fe4840cac34eca52e14dcbbf4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1364 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a6aa7534fa9c6f21c2d8d02cc909b663edbe4dcc0ad978a26cbb2b0ff51ed4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1445 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8586f282c352a0f304967d6b17b7a0a86800c367577ca710d2b83a0221fe3d4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1465 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"836306b3d3b114fd6fcfc616b9ebcbc78a314002999efc3bf81cc365cd3d8c80"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1473 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e7cf03c0ddd9496301574f7ee3efaa9911c6acaaa64a4e301118956ee87ec9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1599 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c581d7a595260ad72e11ccd8e6be02c6cea8e61c64b92cd354467629590b1ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1942 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"132a1b4b25dff1df3d7448be6379dd9ff383c1304ebf03606fbeac24e1a34245"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1953 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"086b5ded8cf298755af52879ffddbceb8988b89f0bcece52d81e0c04bc7ca391"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1962 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd1632d0c0e6007725985a7dbd58f01e59f36e9f5dfd918d520630bf9029141"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2020 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"a609e113850a0a7b09e0db8da49f3690dfa2d5dc4c6cea3f6cc6fe9620e97617"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2158 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05e55fb2a2e3526e30ad79840a7d118fc1d7e41ed5e9403e06175a085956ecd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2325 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccb1c19221777d982054089cd6067ddb3ae1de5b8046099d8c80aa24e092077"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2336 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee5175b73e9371243d3dc99854704d9463f8a19b7dd056255f45fda366b8b9f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2343 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde8088f46e644b26b87908b7d04a112549549748e23ec247c65173f6409faa4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2396 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"6249cac316d3eddb7cfc34f0a2e0cbb5dfbbdf3a172a160d83df73bf0de25b24"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2460 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f14ee88992f822e5d982e230966c1330fbef50208449954168505cd3db0480"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 3019 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"76595d1078ca81c800d14a54f853279aec4291b084f745d8ea2f6ab565547453"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 3910 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3910}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d3e2ce0481105cae1622acff82a40ddc17f0223b3fee021478e70bb8a24c11"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 3928 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3928}}}],"partialFingerprints":{"codehealthFindingId/v1":"df24d13153d5eea77d2fa9f54d93f7d748b756cc2a7a7ad3e3cc16b118829618"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 3950 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3950}}}],"partialFingerprints":{"codehealthFindingId/v1":"c555ddd6f0087269e00c1ac4fa68a8223beb508e756b9d626c2bc2bc5f9d0273"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 3973 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":3973}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1862d617859ab2e7abf42c78f56528781a0753b0e11ad90ad8a125f4a1aba4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 4051 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4051}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47055b92c89c566bc115d62d49cfb277b64fc485586345a3b5ca902ba77280b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 4205 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4205}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c29daf8b1d1af53e2223f80c016f8d7d3888424d11ecf3d91c558321177c7b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4209 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4209}}}],"partialFingerprints":{"codehealthFindingId/v1":"086c2c6ad836a350085bb8c7c9ffced7affe6e8f36a8756464118c213a0c6696"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 4380 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec90c653dcbc9039dbef33be5d8867038be8c8cdc6383eed14677541c67a2e5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4426 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4426}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee021d0a546c41c69ddcc1fde9f0eca622ef04c76abee2ecd9e6fce89ff1e95"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 4435 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f695641695b6c040dca1aadb05479daae3a3e66ff102eacd78403ad8007d12cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 4598 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4598}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec92ae033199799389253733917bca193c27ab99fd1c138d02192d1e4f73427"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 4638 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4638}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2d84f5fd45df34892de3133a475cd1ca3dfc78c85f9daa8251de22fe6c5c79"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 4901 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4901}}}],"partialFingerprints":{"codehealthFindingId/v1":"300099b1878bce4246bdbc0c8cacc8a97e7b0ca52fe9da182e04f189b3826920"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 4986 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":4986}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a9fdbf454f2438b62c9989a742f084ac8710735e67d915f885903e7cb10f92"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 5692 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5692}}}],"partialFingerprints":{"codehealthFindingId/v1":"e182fd4defe86d66e94c336869a1d15f4dc54eb28a731691d72939f50a5294bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5701 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server.rs"},"region":{"startLine":5701}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0ad6231c0956eb31e4cfc3a94ad32d62b43b364c9b53020425587521915b9d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 171 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/will_rename_files.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7c4c24e37934468a3d9e8c4587057b3429a9e6f3020d14c3457be082275088"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 179 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/will_rename_files.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9b07e4ea4c90220d5f47797446bec420da45143c1cf46990f67cfac37acdbb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 237 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/will_rename_files.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bf3bfa091671bcecc4ed1cdb77f689239d2fa6f39e284b36e10516bc1b894d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 246 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/will_rename_files.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b103d8e34d934bf3031fd29e4bf7a73bb6f99ec4495b4b1f860b25182bb0c586"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 260 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/will_rename_files.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"be48b34785709d67310f05e79e587d1a9746911d7980f0c7e29a6971d918848d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 295 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/will_rename_files.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb6c43f901712a27f28256dde14c72e28c7367793e105bd7e2859de505e1ba5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 317 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/will_rename_files.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa7f3321524a57f2e61d07fef8efe9c918fd338eefaf17ab94fc7fdfef828cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 127 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fdd7848ad36c28010d79f9c6c4dc84382153ab75b4ed9cc6b33a560c57ebaa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 166 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e76c7078cff37ae75393686d1f4d198e342480effd59b9d7fbb7dce5f6666c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 227 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb63877e7166f00dde760b742bec958e47bfc3c81c29b2fb31e7fe1bf30a6d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 389 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a575e05de141e797c3e6ac5a8513a82c217d4e52d00fb7bb88a8c86d75e36c3f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 568 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5664326108ab86bea7ee7529333092efb2df1ebbb6bfa8c2fc3bdcf82ee7c5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 945 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/workspace.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab20a49850f9940a8ee62b9ee6465f35bf321e126de1358deba7040c7c89cffe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 67 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server/event_loop.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ac12add7d2550bc3293413d4ad07ee0aa4990d634903534196c433b0e3903a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 77 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/lsp/non_wasm/server/event_loop.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"def7e7ffc06b9d641d3ec2e6457db25424a02af99c5ce6c98f25275166eedd7e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 426 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/suppress.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"76134dc392724088756dcd2cca844c25a1de13de28b04930b7b3175e142e689e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 787 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/suppress.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"e616600ad55784259589819fe3de0bfdec28dee23f0504866337c106c606b94d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 793 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/suppress.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"277e2db70529739461bd493711fddfb392ecaa644b4e63c21e92184ce45e2608"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 795 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/suppress.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c90696c075ca61dcf37985fb7d16896333a64e4f076a670e4d5797a20e691d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 848 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/error/suppress.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebb6dced78709d0571b9ec78b2fcf4a0821dfebb89306378b300566b6c8d581"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 374 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/buck_check.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"710d6172a06a45d1a9d08426f1e93da7cbf1ae705d83e0460d8e98408efbd8c1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 214 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4515fcb9bf0d2361d4ab551629db790c56e174ed25f664a1c91e0e43de5301da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 294 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"780272509ca7386f5c04804ba6f67ca331d18fc0f4e4cde9e45311c5fd235ed5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1844 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ebb8ca07de665f01180658879da31c046f646cd34c326212f8ad8ec424a4fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2288 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"39175e2089716b1369bd16fa37d0ed1eae82b3719211071554c48edd84a3055e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 2300 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d288eb1a08909eb00c3d7e67a5f048c5eabbe932b9f30b05ebbd9590693d479c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2461 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"7770d9d03c3f7215c448b59130924a8a47973c73a62aecf89acba954b66e3161"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2463 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7c52aa10c20e28aa8fb60a8c021af88a60fc64aeb4b71fa6fdc963d8d994e6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2469 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/check.rs"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"6472b52afd9cd0c2b16dcaa83421382579504382a1b2d43b206fa6ea7fd0c3c3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 257 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/config_finder.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c77fb44d0f8d4886437d92e9ea7adc6bec2b15431105b7e710ae652456f387c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 264 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/config_finder.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff30303ec614332b91479601d9c0a79aab8681ebd0a7df7864d77864a918f0ab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 232 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/files.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac993545fcff7802c5340d4eeeee2dd052497dbdfd570a803ddf92274d7dd6f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 235 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/files.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4ed41946ba3f92636330817f11e5e9fb443c67616285c2a1672c28fa468c36"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 241 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/files.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8097c3479ae061736cbf7fc1c4c56a670a2c3b3478277ea23e296ccdf442bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 257 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/files.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3db2528490c294720020f3aded6bc35ec1fb38031b2e40099fe0d97fe3a174"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 278 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/files.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b207165056000b74e024e4436d4895c72110982c6fe275d267a9e38ba2fe2fbe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 338 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/files.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0862246fe30faf8caaec6d1af2f0cf10c6d452e269734d516fc3b5da84f0b5a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 147 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d61f7d8c96614b74fd3f6df410bd86cb26a209033970bf0a098963ca06200e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 217 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4600b8a230281436e5ffe4ab4d966f99084820cbd00885f0cd6aa2ac89b179d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 245 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc50cda5ce6ffb8ab49e9c2fb302fb797f2521e5d341ea2e2aa68b9eec2dbb2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 271 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17032bc60123d1a8f5de52167992f7e45bde38f2afb88f125f095083451b04a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 318 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e274af0b5ad0cee915362b0ef1ef29fb6106750df5fdbd113a8620eca83d4f9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 322 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca55c071adf2480e8d21e5e758a0613317034f55e1d71df67edfcb65d4ddea4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 339 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1201c3ece85fa27430b3cc241400822de7937a1d7754de9500705aa9c0550d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 355 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26703ac2436e5084b9ce1a54ad17e1a6781645f6a9668c9e713f5c0ea3237ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 358 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"898ad42a146d12ae199b11a9cd4b36d193a2ad465f8dd71d899c93559e5652bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 370 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf327132e2caf3994c2ee773f54325004e7cb1358485a184a47bfe6055156141"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 373 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ead2bf12d5455677fa7c4d15e3e2f8e593c6aca79b31659dbc1b925ad87257"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 389 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/commands/init.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b012a8c03c09a24a46a8b17805f9e36fb8800b66cd124d335f0ea35a463b85"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 495 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_util/src/globs.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"629fd1289422fad13b693e2063d2dd288e24c63a2d1572d2fb4416d8348c7c0b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 39 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_util/src/panic.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c69e02b400e39c5b99089d81767c2a2f7fe90a4ab7437bb6c3a7b3eef4190e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 77 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_util/src/thread_pool.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bd0ed9c7e413dea725930673e1ff23e0dac137eeee6bce10c3026e13e8eac7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 111 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_util/src/thread_pool.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9024f8094306ead6d149ccd032ce192ed30ecc8d619f2f4cfcf4d913e4d52fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 166 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_util/src/watcher.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e753a594ff8f2795999940e8b12ea6664f745e91ad9c583565b0efe56cb84a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 212 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_util/src/watcher.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d2cbc807a60207789dd9f836884bc5e2c44e477a041dc988e0270a8bc3ecaa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 293 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"753b6defdc775207bb5aaf932b0dbe65fc1ec0e68190d9dd57cd89e7f1ab9b23"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1573 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"5354daab70c05d392a76b7e1b9fa24fa4eb42a725e6c105cfc7b2676909c570a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1578 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"b904453f7cdeeecdb4d8fec8df9dfdfd650f666bacbcf602ec48df4e9f3b9507"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1757 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ba5aa7a0809916055b03ceb502073fd6387e65401022b384de8a850aed6f67"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1778 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"5813af4dfbc26aab748bffd753263d61a2923b3d4f46d2a86f86f97ee1fddb46"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2512 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/config.rs"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cf9b61ef10ba5c4421c4c0c4e4b608cfd2656580c10983e599613824abf8c9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 71 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/finder.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbea421363e38eab4a659f47f61f340c5bc999e394eeb18959411b3bd9e90db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 74 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/finder.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0356e46f0757e611658d180c380fde24f34efb1a983ba93cc80d8c7cac6b75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 77 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/finder.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aabd782d058dd70d4e97e015e9a71214260fff9bcfa4ae2df4d8abd4e8b1bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 108 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/finder.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"730161175336152ad7bb5e7e6d6f55f486562ceab605c2d9c71ff88bb8364d1e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 119 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/resolve_unconfigured.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ced64e92e9efac54a9a66c9e22bd2ad8911eddacca250d6e3572bc96dbfd94d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 248 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/run.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f087320d6dbfc890fb2b160ff2fda9869a844cdb72dfe6dc7b294fbfc6981fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 327 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/run.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f25e1f4275d889c3356a229e4adb30461ee326ee50a97c9d636e159f5da2f53"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 333 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/run.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"774f23c5c921d99ff967879ccbcf26aae396426ffec66738e33e4aede1464df6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 408 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/run.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c99cce53e90e19e807f51afd2edbc47b1ca6afb260f2401441d8dcdfafdd7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 418 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/run.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5787b2177f103f2bcc5efebc6fdbae0ac7cf3899325e087f2e55ce17ae63d4da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 477 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/run.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"97803a02e1592408ee4666f11e04d7b3400c8c0c9ec6e1ef13c703e7777a0159"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 486 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/run.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a7300c1965879cf21033b46b43a7fbf7c5badf31d030d81132d2099bbff672"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 492 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/run.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c5b6f769e9c291b7aa91c34f65b2ee570484ab1642b63daa12b3db88008704"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 499 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/run.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1f20ebb2bec108d0c9d09b9991cfb35b0a30f663079ebc22b3e1edfd15e862"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 259 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/migration/mypy/util.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"510695e0b38975dc736825817dd9a4d21de94c82cb81289ef8d43dfb1648e61d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 43 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_config/src/environment/interpreter_query.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"539d2243c49ca52879dc0398614045315ae0dde9b832bfbf1f95103754b365c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 185 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_build/src/lib.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e57b4c019f041719096f72a6f5fdf3cf260f7eaa4f78a126562e52de5957a3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 209 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_build/src/query.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be41af059a596a7f05a827804e57cc0dfe00bfdd15d1f502536e06b4dad9932"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 298 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_build/src/query.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"da23cb4dcbd6cad1312e049685ed06e9b7faf7e001afc88e7dca03364dac1db2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 308 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_build/src/query.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac4e37b8e6c7bef5e432a66af5706185e4e88dc42aadcc0b48f688d4e4649dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 93 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pyrefly_build/src/source_db/buck_check.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4e1b6734d7cf62cd2cbb6e255e2890f4d901270f091bb8bc8cce53d17aa48d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_dev_disclaimer_for\u0060 returns \u0060\u0027\u0027\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \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 on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_release_notes.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3288c0ae7c46a671225c4a10b39354160a98504e86d36258f6fcf6b3d520da"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060rebase_facet_subject\u0060 (in \u0060rebase_onto_subject\u0060) turns every \u0060Err\u0060 into \u0060Some(None)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/binding/narrow.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d3f4441c2d89dd2587269b24506ef72103233fda9915bc9cb15263e2e39e70"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_callers_report\u0060 turns every \u0060Err\u0060 into \u0060\u0022Callers Result: Cancelled\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/test/lsp/call_hierarchy.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"365a22e1a27c1faaa0a8052e2032544c2df7334038a567efee65839be658c10a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_callees_report\u0060 turns every \u0060Err\u0060 into \u0060\u0022Callees Result: Cancelled\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/test/lsp/call_hierarchy.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed79e60f34ff2d3284ba391da6d7313cdd3349d999a91e99fa49a1f513d85b97"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_implementations_report\u0060 turns every \u0060Err\u0060 into \u0060\u0022Implementation Result: Cancelled\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyrefly/lib/test/lsp/implementation.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eca03357666509281a1ec919246f249c32841886de19c7494c954c6ba8415c"}}],"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-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-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":160,"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."]}]}