{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02: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":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"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":"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":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"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":"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":"ruff_linter::checkers::ast::analyze::expression::expression (cyclomatic 431): ruff_linter::checkers::ast::analyze::expression::expression has cyclomatic complexity 431 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba23959449fc3a4466979f7838ebadc8526fa997a0b0fa6e2f16d60bc584ad2e"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::statement::statement (cyclomatic 416): ruff_linter::checkers::ast::analyze::statement::statement has cyclomatic complexity 416 (threshold 15). Of this number, 414 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":"crates/ruff_linter/src/checkers/ast/analyze/statement.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"074cdbebecfd4b73961bfd214286733bc4584c64c5fe3c8db4d83894b8df0d0b"}},{"ruleId":"D1","level":"warning","message":{"text":"Bindings::evaluate_known_cases (cyclomatic 254): Bindings::evaluate_known_cases has cyclomatic complexity 254 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc9aacffa5ce06ed64dd95b532b34e2263af24222ea17825719eb20994de5e7"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRelationChecker::check_signature_pair_inner (cyclomatic 236): TypeRelationChecker::check_signature_pair_inner has cyclomatic complexity 236 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda0d0f4faaab9910f5c4b654bd43c6b2a52dca7b1fedad50ff0ab0b4d810055"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRelationChecker::check_type_pair (cyclomatic 192): TypeRelationChecker::check_type_pair has cyclomatic complexity 192 (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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"e437314404608a0882df7c699fb05fb24f8953b1f4d8ec60f00c679f46430ce4"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticIndexBuilder::visit_stmt_impl (cyclomatic 172): SemanticIndexBuilder::visit_stmt_impl has cyclomatic complexity 172 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/ty_python_core/src/builder.rs"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd440958ec3561540174499b55eaafaab3e941c4ada19f5e5ff56906819f7c46"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::static_class::check_static_class_definitions (cyclomatic 168): ty_python_semantic::types::infer::builder::post_inference::static_class::check_static_class_definitions has cyclomatic complexity 168 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3a5de10f98f7e4b8779e4f7e952479164fbd3039cd528329949004ca9927f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::visit_expr (cyclomatic 124): Checker::visit_expr has cyclomatic complexity 124 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0edbae2542f97fb05be439832bf9ec27747a771cb77ffab708155830527af2"}},{"ruleId":"D1","level":"warning","message":{"text":"DisjointnessChecker::check_type_pair_impl (cyclomatic 124): DisjointnessChecker::check_type_pair_impl has cyclomatic complexity 124 (threshold 15). Of this number, 123 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":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":3763}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ef9d19e83512ccd383b6912505e7b453882c3c6cdcb8617e93e47f8101df47"}},{"ruleId":"D1","level":"warning","message":{"text":"SpecializationBuilder::infer_map_inner (cyclomatic 122): SpecializationBuilder::infer_map_inner has cyclomatic complexity 122 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"45de850db861b0ce4ecf5e5f99c1cb7d3b301b71f4c44e977b94af7ce47306d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::member_lookup_with_policy_and_receiver::member_lookup_with_policy_impl (cyclomatic 118): Type::member_lookup_with_policy_and_receiver::member_lookup_with_policy_impl has cyclomatic complexity 118 (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/ty_python_semantic/src/types.rs"},"region":{"startLine":6090}}}],"partialFingerprints":{"codehealthFindingId/v1":"c683ad19b28b896fcaec15c273e4fa1739bae8a8006e25290e9075f3b59a5e00"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::airflow::rules::moved_to_provider_in_3::check_names_moved_to_provider (cyclomatic 112): ruff_linter::rules::airflow::rules::moved_to_provider_in_3::check_names_moved_to_provider has cyclomatic complexity 112 (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/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cb3db4c372ff33ad8908b7e2d39a7bde4fa018beffe75b6bd2a7790187eafa"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayRepresentation::fmt_detailed (cyclomatic 111): DisplayRepresentation::fmt_detailed has cyclomatic complexity 111 (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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9b5e30ba2b1bc4c07d74185e7e199e35779f2c72e9770da9bad1364eb2e7b1"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_parameterized_special_form_type_expression (cyclomatic 109): TypeInferenceBuilder::infer_parameterized_special_form_type_expression has cyclomatic complexity 109 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2564}}}],"partialFingerprints":{"codehealthFindingId/v1":"0217f5e7be7448cc334d3135496d1965cad40d4749c8742f71ebdcd8d24f3c49"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_call_expression_impl (cyclomatic 109): TypeInferenceBuilder::infer_call_expression_impl has cyclomatic complexity 109 (threshold 15). Of this number, 105 points are the body\u0027s own statements and 4 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":9652}}}],"partialFingerprints":{"codehealthFindingId/v1":"176c883a5483ace70caf2671585c2e19eec94dd2c818322e58c5fa537dee62d3"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_type_expression_no_store (cyclomatic 108): TypeInferenceBuilder::infer_type_expression_no_store has cyclomatic complexity 108 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a5ba877455edbc1a3dbaa274bd50c1e5828cd446dab783d2c816da2f0b4c57"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::report_redundant_condition (cyclomatic 106): TypeInferenceBuilder::report_redundant_condition has cyclomatic complexity 106 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a644517a9fbf8e44e50ac6d844cf3e0f9536e97fe61376e5c3ac101c11f2236a"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::visit_stmt (cyclomatic 101): Checker::visit_stmt has cyclomatic complexity 101 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8a2aff7c44242230f99647374b84dd05dcb66716bce4c1b699e5e6163f1f20"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::overrides::check_class_declaration (cyclomatic 96): ty_python_semantic::types::overrides::check_class_declaration has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44fa6cb3237ad668ef462dedb2645c3d3fef8c0679b9188c992627970135dec"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_binary_expression_type_impl (cyclomatic 85): TypeInferenceBuilder::infer_binary_expression_type_impl has cyclomatic complexity 85 (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/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"37677753531773f07e9075ae9ea530bf0a473f4aff2ed96319abfc1ee57b711c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::expression::call_with_qualified_name (cyclomatic 81): ruff_linter::checkers::ast::analyze::expression::call_with_qualified_name has cyclomatic complexity 81 (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/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"faff6b1f6bb5e0fb4150ef70243f3f524556832f5039000ca19df6f11c169357"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::unparse_stmt (cyclomatic 80): Generator::unparse_stmt has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_codegen/src/generator.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ad6ad135c83deaa0bfe319437f54b11c165d1a4ac549126e0cd9e743fbc730"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingError::report_diagnostic (cyclomatic 80): BindingError::report_diagnostic has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":10621}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51f0898607b6127007a7cb28f5061118e8b6881cea30f1e2f72de94f4ae0c21"}},{"ruleId":"D1","level":"warning","message":{"text":"KnownFunction::check_call (cyclomatic 80): KnownFunction::check_call has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24a59dd69d746b034b1c57f48744848c01576af64bfde7baceace7c21cb3c7a"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_explicit_callable_specialization_impl (cyclomatic 80): TypeInferenceBuilder::infer_explicit_callable_specialization_impl 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":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7a2deb7b1d3f9dc30a585550e74f633833e8c3c51cdbfec2d8b8a4632ce4ef"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::numpy::rules::numpy_2_0_deprecation::numpy_2_0_deprecation (cyclomatic 78): ruff_linter::rules::numpy::rules::numpy_2_0_deprecation::numpy_2_0_deprecation has cyclomatic complexity 78 (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/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"543eaa342097679d4b9d644e74769967a02cf8780aa721b995ca09d8b57de355"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportStatement::detect (cyclomatic 78): ImportStatement::detect has cyclomatic complexity 78 (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/ty_ide/src/completion.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62283c7a5f174e06198bdd69ddc9d65ac494bc69b03d4b338b9ffdc38cfddcc"}},{"ruleId":"D1","level":"warning","message":{"text":"NarrowingConstraintsBuilder::evaluate_expr_compare (cyclomatic 78): NarrowingConstraintsBuilder::evaluate_expr_compare has cyclomatic complexity 78 (threshold 15). Of this number, 68 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":4047}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b94a72dce668cf21e0fab1435092a357b16455adf9b0683c51eab9db38c508"}},{"ruleId":"D1","level":"warning","message":{"text":"UnionBuilder::add_in_place_impl (cyclomatic 74): UnionBuilder::add_in_place_impl has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c28e874f58c0c697362a60b18da73479a5058a8f567e9a8678e0314ab5d0fa3"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::render_source_line (cyclomatic 73): ruff_annotate_snippets::renderer::render::render_source_line has cyclomatic complexity 73 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"830bbab0e821ddd0f926937e0a22368ad9e3cf265837519358b02e43aa124ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::airflow::rules::removal_in_3::check_name (cyclomatic 73): ruff_linter::rules::airflow::rules::removal_in_3::check_name 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":"crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bb8ccb429222a4892c35708bb8a8c0e46ead36ddfd960bb56029f8e1b24253"}},{"ruleId":"D1","level":"warning","message":{"text":"GotoTarget::from_covering_node (cyclomatic 72): GotoTarget::from_covering_node has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/goto.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d7589c67810b79751969f1c94b348fbd679022a63200caaf287950c494c6a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::unparse_expr (cyclomatic 71): Generator::unparse_expr 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":"crates/ruff_python_codegen/src/generator.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"53623f767935697d227dae86922f19754777f61b1b0ee8205da10cb918e61850"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::consume_ascii_character (cyclomatic 70): Lexer::consume_ascii_character has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/ruff_python_parser/src/lexer.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3246f43d0e9ff3ed7216fb56b05b24a8fb55d3b90a9b377329de488a075f8302"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticClassLiteral::own_generated_member (cyclomatic 70): StaticClassLiteral::own_generated_member has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3797080a7b1516905ec78076579c3f5c2e520fb5b27436e08db7e959fdd2d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_annotations::rules::definition::definition (cyclomatic 69): ruff_linter::rules::flake8_annotations::rules::definition::definition has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"83554231377fe0b13d62a2633fa2fda76b62df64334608c380ff573c321885cf"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_subscript_type_expression (cyclomatic 69): TypeInferenceBuilder::infer_subscript_type_expression has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6905c055a655053bf52bae967de960f45c85d9f7c0a5592024680bd9cb6c28e"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::infer::comparisons::infer_binary_type_comparison_inner (cyclomatic 66): ty_python_semantic::types::infer::comparisons::infer_binary_type_comparison_inner has cyclomatic complexity 66 (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/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ecffb93b90a7b0b63b8a095010c85f584a1aa50e7c31ee7c5e96d703c9db64"}},{"ruleId":"D1","level":"warning","message":{"text":"BoundSuperType::build (cyclomatic 65): BoundSuperType::build has cyclomatic complexity 65 (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/ty_python_semantic/src/types/bound_super.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c17c7492f3228abc7a59abb205cbcd1ea56f664e4d7a3285223d0c78f35517"}},{"ruleId":"D1","level":"warning","message":{"text":"ComparableExpr::eq (cyclomatic 64): ComparableExpr::eq has cyclomatic complexity 64 (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/ruff_python_ast/src/comparable.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e5dfc613963a33c6fcdcb52b9583514c01fba228851dcae8011195a609cadb"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::subscript (cyclomatic 64): Type::subscript has cyclomatic complexity 64 (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/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcfb3fa0da060d5773753ae2429976aefa3de5d0422f8db519b52ff0e2bdf0f"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_namedtuple_call_expression (cyclomatic 63): TypeInferenceBuilder::infer_namedtuple_call_expression 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":"crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b059cd796f39566ded3fe23f2c5bca5e5195b1751df503c697bcfb847352921c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_annotated_assignment_definition (cyclomatic 63): TypeInferenceBuilder::infer_annotated_assignment_definition 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4751}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb3be827e37624d2f84834fb3e6dc2205c67c423c619b2376b0b198e696b2d2"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolvedPythonType::from (cyclomatic 61): ResolvedPythonType::from has cyclomatic complexity 61 (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/ruff_python_semantic/src/analyze/type_inference.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff024eac1842607a01ca7bf3cbbe7882a2e8c519d27784af145911a7a759c678"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_function_definition (cyclomatic 59): TypeInferenceBuilder::infer_function_definition has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"2429110e825305975546de7926fd4c0626c2181dd0386914ba2dbf669f6688ab"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorContext::render (cyclomatic 59): ErrorContext::render has cyclomatic complexity 59 (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/ty_python_semantic/src/types/relation_error.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"45647a90f97b05d6fbfd7873138e803f3079a8783daf4a039cce3973e30b02a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::try_bool_impl (cyclomatic 59): Type::try_bool_impl has cyclomatic complexity 59 (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/ty_python_semantic/src/types/bool.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c45291eedd7d5a4d21fe3ca4ea339525fd9d98c827c2064ff06f1ba9266866f"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleTokenizer::next_token_inner (cyclomatic 57): SimpleTokenizer::next_token_inner 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":"crates/ruff_python_trivia/src/tokenizer.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcb3abdf5b829e144b5b435a25fc115591c763790b318997242e349b5017ac5"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_formatter::comments::placement::handle_enclosed_comment (cyclomatic 56): ruff_python_formatter::comments::placement::handle_enclosed_comment has cyclomatic complexity 56 (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/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8308bc4c28a7d50eab06440244bac0ef20496113cfb1e2b2adf043d74abce125"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRelationChecker::check_typeddict_pair (cyclomatic 56): TypeRelationChecker::check_typeddict_pair has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4d6c76b5d19b2ab0828c753159d358eaaf0cdaff8b70350e830b59f4d02f79"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectDatabase::apply_changes (cyclomatic 55): ProjectDatabase::apply_changes 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":"crates/ty_project/src/db/changes.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"34be55d200070ebf871d85548e4fdcf380a714b8cc29cf34c57460b6ecad1378"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::bindings_with_receiver (cyclomatic 55): Type::bindings_with_receiver 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":7162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a398dbf8432b132fea55555536d551b2b937be6d7836b769698b767cfe84d71c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_ast::visitor::transformer::walk_expr (cyclomatic 54): ruff_python_ast::visitor::transformer::walk_expr has cyclomatic complexity 54 (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/ruff_python_ast/src/visitor/transformer.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6225490ce8654adf42df19b80a360259ec482c73f1a6d1459784e82870060a1"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_bandit::rules::suspicious_imports::suspicious_imports (cyclomatic 53): ruff_linter::rules::flake8_bandit::rules::suspicious_imports::suspicious_imports has cyclomatic complexity 53 (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/ruff_linter/src/rules/flake8_bandit/rules/suspicious_imports.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"1683439570cc0a4940e56e7a860b7df182656828fb0759920d91e9acc6cba04f"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_ast::visitor::walk_expr (cyclomatic 53): ruff_python_ast::visitor::walk_expr has cyclomatic complexity 53 (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/ruff_python_ast/src/visitor.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1588499bfb35868ed9f9978bc12f8c9346655927a7493993eb984c4445e3e5"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_collection_literal_impl (cyclomatic 53): TypeInferenceBuilder::infer_collection_literal_impl has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":8063}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2361a39c0811c374f9ab02c960ca3b2feb66743930003d42a2ccf28034905a"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::deferred_scopes::deferred_scopes (cyclomatic 52): ruff_linter::checkers::ast::analyze::deferred_scopes::deferred_scopes 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":"crates/ruff_linter/src/checkers/ast/analyze/deferred_scopes.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a6e9986823895b46bc3b4553384fa5eeedb6496f60be0e1ff606b75ab6a2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"rule-filters.document$.subscribe() (cyclomatic 52): rule-filters.document$.subscribe() has cyclomatic complexity 52 (threshold 15). Most of this is not in the body itself: 9 of the 52 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 89, filter, a function literal at line 234, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/rule-filters.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db03b4342414dcbfc603c14e0535eb2dec13e97cd678bf9160f7408a676dc19"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_bandit::rules::suspicious_function_call::suspicious_function (cyclomatic 51): ruff_linter::rules::flake8_bandit::rules::suspicious_function_call::suspicious_function has cyclomatic complexity 51 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bandit/rules/suspicious_function_call.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19f45632c4a969e7164f9074ba471ef88f35cae8aea24b6598b389345fdcf14"}},{"ruleId":"D1","level":"warning","message":{"text":"LintConfiguration::as_rule_table (cyclomatic 51): LintConfiguration::as_rule_table has cyclomatic complexity 51 (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/ruff_workspace/src/configuration.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"f552b9a2a9401987dab2e9b22f5e14a29550b16b311e4d548a05d013d7d16e23"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::validate_subscript_assignment_impl (cyclomatic 51): TypeInferenceBuilder::validate_subscript_assignment_impl 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":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ed68b22a7f435659c66070d82bc5df742cec6791d0dea3aa7e41077fd7bcf1"}},{"ruleId":"D1","level":"warning","message":{"text":"InnerIntersectionBuilder::add_positive (cyclomatic 51): InnerIntersectionBuilder::add_positive has cyclomatic complexity 51 (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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e598e63992bf6d7ae6961d44fced876051361d81bc4b6b37486ab336e1563c76"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_element (cyclomatic 50): Printer::print_element 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/ruff_formatter/src/printer/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f83eb7859bedfdac4a2c7455bbb2b245d3741ca2d388d930efab6b67f5b911"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatSuite::fmt (cyclomatic 50): FormatSuite::fmt 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/ruff_python_formatter/src/statement/suite.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4df46006f8b92d0d0efcecfdef837379c9dda2d72ed2e366e9454d49eedbbe"}},{"ruleId":"D1","level":"warning","message":{"text":"FitsMeasurer::fits_element (cyclomatic 49): FitsMeasurer::fits_element has cyclomatic complexity 49 (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/ruff_formatter/src/printer/mod.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5827eac04a37b15468913315c84782037c3650d888b4f4754200b071661cc9"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticSyntaxError::fmt (cyclomatic 48): SemanticSyntaxError::fmt 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":"crates/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc88c888f59900444169615c1e464210230454a05d499a70aff392c2f97f4e6"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::checkers::noqa::check_noqa (cyclomatic 47): ruff_linter::checkers::noqa::check_noqa 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":"crates/ruff_linter/src/checkers/noqa.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f3898e841e2bfb24189426a2b36eddde610a1e5fe502ad764454c5f3844f7c"}},{"ruleId":"D1","level":"warning","message":{"text":"ComparableStmt::eq (cyclomatic 47): ComparableStmt::eq has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/comparable.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"932ee106462bc7d62e5b7d4f802a5e63d0136211c6f8e9e59f672c98508a4dcd"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_workspace::configuration::warn_about_deprecated_top_level_lint_options (cyclomatic 47): ruff_workspace::configuration::warn_about_deprecated_top_level_lint_options has cyclomatic complexity 47 (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/ruff_workspace/src/configuration.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"414c21c820399392456d5d29fb87174aa52354e3a75f839e0dea9fdcef1ac7d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::to_meta_type_with_recursion::to_meta_type_inner (cyclomatic 47): Type::to_meta_type_with_recursion::to_meta_type_inner has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":9470}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a86f68c74c04e6c35585ebfe5f6106edfe7137d712ea41ef3a1a425832dff9e"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::find_legacy_typevars_impl (cyclomatic 47): Type::find_legacy_typevars_impl has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":10430}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7e37546aa9dcbeca06eb78db4635d5c85e27007f96e5caf6c71320ae0f829a"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticIndexBuilder::visit_expr_with_context (cyclomatic 46): SemanticIndexBuilder::visit_expr_with_context has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f08a61211921f79c075ecf3399c9260df45c4fe5f5d65d218c800d821a49d80"}},{"ruleId":"D1","level":"warning","message":{"text":"UnionBuilder::push_type (cyclomatic 46): UnionBuilder::push_type has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd5909bcc57e6d03e0ba5ea93325b9171395549001339c1a49df7e35902a096"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::in_type_expression_impl (cyclomatic 46): Type::in_type_expression_impl has cyclomatic complexity 46 (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/ty_python_semantic/src/types.rs"},"region":{"startLine":9184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8081e5b3ee7d51acc0a80b37cf9f11c51323cc406560b090a80021dae8bea2a5"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::validate_attribute_deletion (cyclomatic 45): TypeInferenceBuilder::validate_attribute_deletion has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87b09e5f937d7d6e45fcdccd6f306afc4f6d75e3d25cd66343c6e63c5a30d39"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pydoclint::rules::check_docstring::check_docstring (cyclomatic 44): ruff_linter::rules::pydoclint::rules::check_docstring::check_docstring 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":"crates/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0853b14dad2e979977d5f0fce13d3bb23f5afb580ffc3f6ce76ef83b14d286"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::non_slot_assignment::is_attributes_not_in_slots (cyclomatic 44): ruff_linter::rules::pylint::rules::non_slot_assignment::is_attributes_not_in_slots 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":"crates/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf388dff02391172661780cb36454400a5f1922a64ab5cca205add03e6f4d1b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_typeddict_call_expression (cyclomatic 44): TypeInferenceBuilder::infer_typeddict_call_expression 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":"crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e9b0c5cd243f05f2db285c378cdd9fdd49194562062be39d103d4b175587d1"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_legacy_typevar (cyclomatic 44): TypeInferenceBuilder::infer_legacy_typevar has cyclomatic complexity 44 (threshold 15). Of this number, 43 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":"crates/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bbc09802f1fe83ebbea26538e81b44c12fcab25cbcb7949b59e749305f02c0"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::map_type (cyclomatic 44): Type::map_type has cyclomatic complexity 44 (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/ty_python_semantic/src/types.rs"},"region":{"startLine":10118}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff28fba65561f9ede57d0368b760ca3f59a9d189720def78b86c0ef66716dc5"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportReplacer::without_renames (cyclomatic 43): ImportReplacer::without_renames 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":"crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_import.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56d820f26122455ec1bf1285282e4fdf369c77c1ae5f0bb2976d561684e32f6"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_ast::helpers::any_over_stmt::inner (cyclomatic 43): ruff_python_ast::helpers::any_over_stmt::inner 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":"crates/ruff_python_ast/src/helpers.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8caa8668feaed32e6be3b8888b8b6469d0108b9f58c8106a52f5fa83fbef9b3"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticTokenVisitor::visit_stmt (cyclomatic 43): SemanticTokenVisitor::visit_stmt 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":"crates/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8edf7f49489784f655a8b89830e073124b7ede7d2f9c5f573e124f89ad7fbc"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_legacy_typevartuple (cyclomatic 43): TypeInferenceBuilder::infer_legacy_typevartuple has cyclomatic complexity 43 (threshold 15). Of this number, 42 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":"crates/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b3d03f524307d2c112e38f84646b4d6b2f705117d3d2c3bc4bec6abc63e497"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::dedicated::pydantic::lax_input_type_impl (cyclomatic 43): ty_python_semantic::types::dedicated::pydantic::lax_input_type_impl 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":"crates/ty_python_semantic/src/types/dedicated/pydantic.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5327fcd38bca0b6088cfc86292355f3e81586ccd473824bd317d3a260d3ca20"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::equality::evaluate_structural_comparison (cyclomatic 43): ty_python_semantic::types::equality::evaluate_structural_comparison 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":"crates/ty_python_semantic/src/types/equality.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f52795526812e8466596fb4dfb51185a03e6f5d99f5298f0e747ecd947155d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_ast::visitor::walk_stmt (cyclomatic 42): ruff_python_ast::visitor::walk_stmt has cyclomatic complexity 42 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/visitor.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c126313a301926f9b9e88a2cb25df32f27f9cf8c48a9596b1574135c6246277b"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_ast::visitor::transformer::walk_stmt (cyclomatic 42): ruff_python_ast::visitor::transformer::walk_stmt has cyclomatic complexity 42 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/visitor/transformer.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49467dc182a94878210e62929d52fe946eebbfcedda9508f7c3c8019821ded2"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticSyntaxChecker::check_stmt (cyclomatic 42): SemanticSyntaxChecker::check_stmt 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":"crates/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f2ddd3363d2e5325e083dc59bd89eb0df52fc86ff49c14ebc3c3bc975c57b1"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::try_upcast_to_callable_impl (cyclomatic 42): Type::try_upcast_to_callable_impl has cyclomatic complexity 42 (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/ty_python_semantic/src/types/callable.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b765f40842c23e665ef95958046e294c3fd54d7a7bef8167efde48633066094"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::render_snippet_annotations (cyclomatic 41): ruff_annotate_snippets::renderer::render::render_snippet_annotations has cyclomatic complexity 41 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a239e3ccfb4f6bfeb289112daa31cc5419e1375427a8639b03f4f76a96f812"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolVisitor::visit_stmt_impl (cyclomatic 41): SymbolVisitor::visit_stmt_impl 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":"crates/ty_ide/src/symbols.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"935220df1c871f3262831b16c6b160bb85e5bb2c7c3ba89177bfbf72054a3b94"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_class_definition (cyclomatic 41): TypeInferenceBuilder::infer_class_definition 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":"crates/ty_python_semantic/src/types/infer/builder/class.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bfc09aa7f7325470641f1dd1877c01cae0b0640910316ef48274eebec06d02"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_attribute_load_impl (cyclomatic 41): TypeInferenceBuilder::infer_attribute_load_impl has cyclomatic complexity 41 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 3 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":11269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adc2b48e5867091d273345925558c5478119a40f021b9150aea585465895859"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRelationChecker::check_variable_length_vs_tuple_spec (cyclomatic 41): TypeRelationChecker::check_variable_length_vs_tuple_spec 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":"crates/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c50e98ad42f5a0fa1664758cb8731cd9917decda748c23a988c759d3d374ff"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::overloaded_function::check_overloaded_function (cyclomatic 41): ty_python_semantic::types::infer::builder::post_inference::overloaded_function::check_overloaded_function 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":"crates/ty_python_semantic/src/types/infer/builder/post_inference/overloaded_function.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"614045de11bed0a7bbfae9514b9504bf9fa4b9f2e8e8e3b20b950ef75c35eee0"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff::check (cyclomatic 40): ruff::check 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/ruff/src/lib.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7441e6a990b6a71aac6ad4b9ba12f60e4940ba6ef6972a0cd5b41cbcd09a66"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextManagerError::report_diagnostic (cyclomatic 40): ContextManagerError::report_diagnostic has cyclomatic complexity 40 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 1 belongs 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":"crates/ty_python_semantic/src/types/context_manager.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7a7c73338ef37b26dc7d30f8ea14541839db776fcddc86f312f7cbf1d279ea"}},{"ruleId":"D1","level":"warning","message":{"text":"AllMembers::extend_with_type (cyclomatic 40): AllMembers::extend_with_type has cyclomatic complexity 40 (threshold 15). Of this number, 38 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/ty_python_semantic/src/types/list_members.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcb1f1d87f06d4f7b6c86a273c45da119c6f0294271d32cbaa6410947b459d3"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::definitions::definitions (cyclomatic 39): ruff_linter::checkers::ast::analyze::definitions::definitions has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/analyze/definitions.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b438a1bc828f6bfa94196635d0f9b8ce08ed0e4847e5aed16cce04cf1449d063"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::airflow::rules::runtime_value_in_dag_or_task::find_runtime_varying_call (cyclomatic 39): ruff_linter::rules::airflow::rules::runtime_value_in_dag_or_task::find_runtime_varying_call has cyclomatic complexity 39 (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/ruff_linter/src/rules/airflow/rules/runtime_value_in_dag_or_task.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fb2ffa49bbe9a0662722b985bf05369ce3289a680c5ca1af021b50e2843330"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_bandit::rules::hardcoded_sql_expression::is_explicit_concatenation (cyclomatic 39): ruff_linter::rules::flake8_bandit::rules::hardcoded_sql_expression::is_explicit_concatenation has cyclomatic complexity 39 (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/ruff_linter/src/rules/flake8_bandit/rules/hardcoded_sql_expression.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba3dcb6b98a37d7e3747f3b52445159b616d95bcf855afb5536045d8b2c9f9d"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatExpr::fmt (cyclomatic 39): FormatExpr::fmt has cyclomatic complexity 39 (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/ruff_python_formatter/src/expression/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efb4b169dba3b8de9f81354d445886358d6a2d7477dbd7f76d4b6aaf07aba79"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassBase::try_from_type (cyclomatic 39): ClassBase::try_from_type has cyclomatic complexity 39 (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/ty_python_semantic/src/types/class_base.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"205aebc95488effecd4c89d8464c8fb0c1185c1e25dde7515e3b25a88f417f4f"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::definition (cyclomatic 39): Type::definition has cyclomatic complexity 39 (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/ty_python_semantic/src/types.rs"},"region":{"startLine":10917}}}],"partialFingerprints":{"codehealthFindingId/v1":"787cd6e720b8d79b4e82f5fd6ac8e48d34eb965c146b26b732323ab5037e83eb"}},{"ruleId":"D1","level":"warning","message":{"text":"DunderAllNamesCollector::visit_stmt (cyclomatic 38): DunderAllNamesCollector::visit_stmt 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/ty_python_semantic/src/dunder_all.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be8fc6931c347046c67ebfbe94a2d2cc90d2850aa01741a1b7877bd6036ff99"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_subscript_load_impl (cyclomatic 37): TypeInferenceBuilder::infer_subscript_load_impl 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":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e376354bf74abd5fab30017a933bfaac786f3fad29d76c2807a5dd3170ba7141"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_legacy_paramspec (cyclomatic 37): TypeInferenceBuilder::infer_legacy_paramspec has cyclomatic complexity 37 (threshold 15). Of this number, 36 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":"crates/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"654bc14baa64c9eea36cec4cc302053bb59c2f514269a5849b04788f400d7c17"}},{"ruleId":"D1","level":"warning","message":{"text":"IterationError::report_diagnostic (cyclomatic 37): IterationError::report_diagnostic 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":"crates/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0fe8d43b71e5440f4c5306a65945ee5b31228a04bdc82b88f4c2d1ad7300d1"}},{"ruleId":"D1","level":"warning","message":{"text":"InnerIntersectionBuilder::add_negative (cyclomatic 37): InnerIntersectionBuilder::add_negative has cyclomatic complexity 37 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d9f15dbc2bc89685326a046eb96cbf2fba4f38fa626a47254142d1295e3ab8"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_annotation_expression_impl (cyclomatic 36): TypeInferenceBuilder::infer_annotation_expression_impl has cyclomatic complexity 36 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 8 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":"crates/ty_python_semantic/src/types/infer/builder/annotation_expression.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e4a425ba62ab23b09b3c53ee2bab1d87ca7628f540fb5e08335b870da73313"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::recursive_type_normalized_impl (cyclomatic 36): Type::recursive_type_normalized_impl has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":3949}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae289739e5505d07ffc95adff5ab8530c7ca7c185b3ae4eaf578842f1b40cef6"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::perflint::rules::manual_list_comprehension::manual_list_comprehension (cyclomatic 35): ruff_linter::rules::perflint::rules::manual_list_comprehension::manual_list_comprehension has cyclomatic complexity 35 (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/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f661459cc38f47318dd173463680a0088700a468b49b18e8c0c3788de083c49"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::extraneous_whitespace::extraneous_whitespace (cyclomatic 35): ruff_linter::rules::pycodestyle::rules::logical_lines::extraneous_whitespace::extraneous_whitespace 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":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2889e6e405e8e3c1e35714c5ee7a38218022196225bc7863fe4adb443763403c"}},{"ruleId":"D1","level":"warning","message":{"text":"Truthiness::from_expr (cyclomatic 35): Truthiness::from_expr 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":"crates/ruff_python_ast/src/helpers.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed64f477cd2380b743e30c58724362de8e917e753293c6976d7a1a188c949052"}},{"ruleId":"D1","level":"warning","message":{"text":"CallableBinding::check_types (cyclomatic 35): CallableBinding::check_types has cyclomatic complexity 35 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3931}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39173757b64caf8d1a669478be433828fbdaa34f7929bc9d091b7b52bdd4fee"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::linter::check_path (cyclomatic 34): ruff_linter::linter::check_path 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":"crates/ruff_linter/src/linter.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"486ce39671f2f801d0256dae3ab76a942e48727b0b27dbb3023aaa24707f11b7"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyflakes::rules::redefined_while_unused::redefined_while_unused (cyclomatic 34): ruff_linter::rules::pyflakes::rules::redefined_while_unused::redefined_while_unused 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":"crates/ruff_linter/src/rules/pyflakes/rules/redefined_while_unused.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"09107f39dabd87e9bb4e9963bc8dd3c1292468e9fdbec30844948caf70b9c2f5"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::outdated_version_block::outdated_version_block (cyclomatic 34): ruff_linter::rules::pyupgrade::rules::outdated_version_block::outdated_version_block 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":"crates/ruff_linter/src/rules/pyupgrade/rules/outdated_version_block.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f192c024c8710f4f5a71ba6fef4947313241bc735f1be1241002d1d8c8faa4"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::super_call_with_parameters::super_call_with_parameters (cyclomatic 34): ruff_linter::rules::pyupgrade::rules::super_call_with_parameters::super_call_with_parameters 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":"crates/ruff_linter/src/rules/pyupgrade/rules/super_call_with_parameters.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0429fb6c71c9d0f69de2d7e71a88d42b8a5f18cc930c05a4190b662931b5273c"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatStatementsLastExpression::fmt (cyclomatic 34): FormatStatementsLastExpression::fmt 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":"crates/ruff_python_formatter/src/statement/stmt_assign.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f52e5e836cb0451e9346ff0fe88d64aac4abd025912227a0a4f56dd663e0042"}},{"ruleId":"D1","level":"warning","message":{"text":"KnownClass::canonical_module (cyclomatic 34): KnownClass::canonical_module 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. This is NOT this file\u0027s highest cyclomatic complexity: KnownClass::name (cyclomatic 118) 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/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3e10465160a7f173eb0f587aeaee03fd406ed3e9ac6d0069377fb46afd2b50"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAttributeWriteEvaluator::evaluate (cyclomatic 34): AssignmentAttributeWriteEvaluator::evaluate 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":"crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fb076ea6fe6d5aa87dcc53132b3a3127143061860b74a8a70b3fa54a92ac13"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_function_body (cyclomatic 34): TypeInferenceBuilder::infer_function_body 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":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abf3389eaf4504cf19486e2272840871f69893d15173b9f758c24d7b1e02caa"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::validate_typevar_default (cyclomatic 34): TypeInferenceBuilder::validate_typevar_default 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":"crates/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e154883da1fa5f7f6a1fd295489396e29cb924b5dff1795cdea1d96163fc8f87"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassInfoConstraint::generate_impl (cyclomatic 34): ClassInfoConstraint::generate_impl 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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"788826274858f9bef1fcf065eb101860b3cfabbf4c73f23389c966cf859e3c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"DisjointnessChecker::check_typeddict_pair (cyclomatic 34): DisjointnessChecker::check_typeddict_pair 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":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"279892df0128912b99a301ec6fee8a3ba1ba18f5e01770f3752a3a1e6ac64eed"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_parameters (cyclomatic 33): Parser::parse_parameters 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":"crates/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":3326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c1c634af7c244921db86fe56aea309dd063d95c4b5a41fe8768063ef760e01"}},{"ruleId":"D1","level":"warning","message":{"text":"MainLoop::main_loop (cyclomatic 33): MainLoop::main_loop 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":"crates/ty/src/lib.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ef15208cf5b2aa573a8853cad2560325064266eb5dcb2fc28bd78fe0795558"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayKnownInstanceRepr::fmt_detailed (cyclomatic 33): DisplayKnownInstanceRepr::fmt_detailed 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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":3892}}}],"partialFingerprints":{"codehealthFindingId/v1":"2092248d3e18f614c6bfd4a7642859c7b5878df0edeb90614aba8ac45fe5664d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::airflow::rules::removal_in_3::check_method (cyclomatic 32): ruff_linter::rules::airflow::rules::removal_in_3::check_method has cyclomatic complexity 32 (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/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b805d30f37c5d677ad517e3ac12de80484e6408a25023a191db67dd640bf731"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_ast::helpers::any_over_expr::inner (cyclomatic 32): ruff_python_ast::helpers::any_over_expr::inner has cyclomatic complexity 32 (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: ruff_python_ast::helpers::is_non_empty_f_string::inner (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":"crates/ruff_python_ast/src/helpers.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e50ffe101b8bf5db84d2bb781384e59b2e711341ab7cdee2d2134ca5f913a1"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryContext::from_kind (cyclomatic 32): RecoveryContext::from_kind has cyclomatic complexity 32 (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: RecoveryContext::to_kind (cyclomatic 33) 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/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"89254086f890e41469aa424b845e9b069d0d614197f2058c3c80f965a01d73cc"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticClassLiteral::implicit_attribute_impl (cyclomatic 32): StaticClassLiteral::implicit_attribute_impl 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":"crates/ty_python_semantic/src/types/class/implicit_attributes.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d827e1d7b73b1b80211ae5a9e664b801112f366eee16fc4e87e6bee488bda6"}},{"ruleId":"D1","level":"warning","message":{"text":"SpecialFormType::in_type_expression (cyclomatic 32): SpecialFormType::in_type_expression has cyclomatic complexity 32 (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: SpecialFormType::candidates_from_name (cyclomatic 98) 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/ty_python_semantic/src/types/special_form.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"964ef76dc5b7a948c6611bae938152a7281550d8bc4a00f959c55bca7cece989"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::enums::enum_metadata (cyclomatic 32): ty_python_semantic::types::enums::enum_metadata 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":"crates/ty_python_semantic/src/types/enums.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d11781d923bd1c407f7e9df9073eb6b0b57894754bdf7cfda7812fde2570190"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_test::run_test (cyclomatic 32): ty_test::run_test 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":"crates/ty_test/src/lib.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2aeeb08b36c92a3732c1d6f93439e9bba2c2a83bae2ab8daf999d7da3bd155"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_impl (cyclomatic 31): Parser::parse_impl 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":"crates/mdtest/src/parser.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f843de79d99499889183bc4a5a2432a956ddb36e0401ab09032adf38d81957"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::isort::normalize::normalize_imports (cyclomatic 31): ruff_linter::rules::isort::normalize::normalize_imports has cyclomatic complexity 31 (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/ruff_linter/src/rules/isort/normalize.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"596da25d417e5e65bd4bd5fb9bc8eed552e600c361ecfcbbe6368912f8b5daeb"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::compound_statements::compound_statements (cyclomatic 31): ruff_linter::rules::pycodestyle::rules::compound_statements::compound_statements 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":"crates/ruff_linter/src/rules/pycodestyle/rules/compound_statements.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d00e11a145cbf99acd2407ae7225c25df2333926dd2c32d9c420e48bd096bf7"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_typealiastype_assignment_deferred (cyclomatic 31): TypeInferenceBuilder::infer_typealiastype_assignment_deferred 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. This is NOT this file\u0027s highest cyclomatic complexity: TypeInferenceBuilder::infer_value_expression_impl (cyclomatic 33) 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4311}}}],"partialFingerprints":{"codehealthFindingId/v1":"5901399695ad5df598eed0b95838ba2ca50346cb5165948d2517f7be1d02a0c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Mro::ancestors_of_static_class (cyclomatic 31): Mro::ancestors_of_static_class has cyclomatic complexity 31 (threshold 15). Of this number, 29 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":"crates/ty_python_semantic/src/types/mro.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a1ef29b831f3b2fa7a4c4b08dbecab81c4bb493fe0e2765cf601f661f196ef"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRelationChecker::check_type_satisfies_protocol (cyclomatic 31): TypeRelationChecker::check_type_satisfies_protocol 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":"crates/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"78816587fc015e6a875f4d180e38e6f3a6b990280514dc36fd33e05dd3a45278"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockBuilder::visit_stmt (cyclomatic 30): BlockBuilder::visit_stmt has cyclomatic complexity 30 (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/ruff_linter/src/rules/isort/block.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0690ea53e55e74c538b04ac659c59f5a1d9c6c35240b91fbb76c807d55095d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::perflint::rules::manual_dict_comprehension::manual_dict_comprehension (cyclomatic 30): ruff_linter::rules::perflint::rules::manual_dict_comprehension::manual_dict_comprehension 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":"crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0314698dea6b209c659eef25de1b0ded927ae89408438feb60076c09c0a22f46"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::whitespace_around_named_parameter_equals::whitespace_around_named_parameter_equals (cyclomatic 30): ruff_linter::rules::pycodestyle::rules::logical_lines::whitespace_around_named_parameter_equals::whitespace_around_named_parameter_equals 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":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/whitespace_around_named_parameter_equals.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"64eb0399031205a2de34abba5082913dc50fd57f7d14a6491a1bac173ca44f8a"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::unnecessary_lambda::unnecessary_lambda (cyclomatic 30): ruff_linter::rules::pylint::rules::unnecessary_lambda::unnecessary_lambda 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":"crates/ruff_linter/src/rules/pylint/rules/unnecessary_lambda.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a696cf09c48e042636e1b4bf29ef82d87fea2908da36601b6405170b03edd9"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryContextKind::list_terminator_kind (cyclomatic 30): RecoveryContextKind::list_terminator_kind has cyclomatic complexity 30 (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: RecoveryContext::to_kind (cyclomatic 33) 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/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"427fb10f3d10da039e41536d4ddfc594a46ee4510c0c1ab8bf66e59cde5204c5"}},{"ruleId":"D1","level":"warning","message":{"text":"SolutionWalker::validate_constrained (cyclomatic 30): SolutionWalker::validate_constrained 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":"crates/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7f73e0a37359bd924411e02a0ce26d57d6768f026d0bdba7be4cdcd46cb3c9"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_enum_call_expression (cyclomatic 30): TypeInferenceBuilder::infer_enum_call_expression 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":"crates/ty_python_semantic/src/types/infer/builder/enum_call.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"75430428cb10491e86c65b0125bdb147b49b5db719ddf20573ccf6fb1c49f6c4"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::validate_subscript_deletion_impl (cyclomatic 30): TypeInferenceBuilder::validate_subscript_deletion_impl 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":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"19df682643325e293d2112855c68b42ffb0f781c928111caec4d8a459bb4e022"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_annotated_assignment_statement (cyclomatic 30): TypeInferenceBuilder::infer_annotated_assignment_statement 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. This is NOT this file\u0027s highest cyclomatic complexity: TypeInferenceBuilder::infer_value_expression_impl (cyclomatic 33) 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4488}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed334bd35992b1df48b8ae9e0347189628f3615aac64aab25f5d9769ce64610b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_unary_expression_type (cyclomatic 30): TypeInferenceBuilder::infer_unary_expression_type has cyclomatic complexity 30 (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: TypeInferenceBuilder::infer_value_expression_impl (cyclomatic 33) 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":11708}}}],"partialFingerprints":{"codehealthFindingId/v1":"6656c01e24ebfcbed7257e91cd4694498f02c8a64b6fccbce6326283ec64fb3c"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::instance::protocol_materialization_is_noop_with_type_parameters (cyclomatic 30): ty_python_semantic::types::instance::protocol_materialization_is_noop_with_type_parameters 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":"crates/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf55946395d68b1bad2f57acb149cb715e93d64cbf99b05e15002a2ededaafd"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff::commands::format::warn_incompatible_formatter_settings (cyclomatic 29): ruff::commands::format::warn_incompatible_formatter_settings 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":"crates/ruff/src/commands/format.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e827085cfd5151d8c1645e034c9fa67381ff17a49ec4d688d6755ff0372cab"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceMap::annotated_lines (cyclomatic 29): SourceMap::annotated_lines 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":"crates/ruff_annotate_snippets/src/renderer/source_map.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"500c83cbb69a4ccc12c1cf35e91fa831a6d67932670b1ecc3b3277fc87e98f42"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::emit_suggestion_default (cyclomatic 29): ruff_annotate_snippets::renderer::render::emit_suggestion_default has cyclomatic complexity 29 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5050382700633971fabc8d7e95f2d19b4083e7988e2d13c9b3a8a07fcffc325"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::report_semantic_error (cyclomatic 29): Checker::report_semantic_error 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":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e1b02f65e74c47b98ccd1b8438331b80c254521b62d1763bd6f25327deac48"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::bad_generator_return_type::bad_generator_return_type (cyclomatic 29): ruff_linter::rules::flake8_pyi::rules::bad_generator_return_type::bad_generator_return_type 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/ruff_linter/src/rules/flake8_pyi/rules/bad_generator_return_type.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5bd11ab4decf15f943e1ae13bbb565720caf03a36401ad675c799e63a8cfa9"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::literal_comparisons::literal_comparisons (cyclomatic 29): ruff_linter::rules::pycodestyle::rules::literal_comparisons::literal_comparisons 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":"crates/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb23ae04889cd608d7763b429a00e1bcc6817e1f85206171f6d66ba33ed8359"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::missing_whitespace_around_operator::missing_whitespace_around_operator (cyclomatic 29): ruff_linter::rules::pycodestyle::rules::logical_lines::missing_whitespace_around_operator::missing_whitespace_around_operator 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":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/missing_whitespace_around_operator.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4677698cc81498b2e02c9dcf7074ffc0097ce7ec97e1e7101670d0d7f826c35e"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::sections::blanks_and_section_underline (cyclomatic 29): ruff_linter::rules::pydocstyle::rules::sections::blanks_and_section_underline 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":"crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c94d8ab7d6956a2dfd3e42c254545ae102a3643d697117351976279ec9a717"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalReferencesFinder::enter_node (cyclomatic 29): LocalReferencesFinder::enter_node 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":"crates/ty_ide/src/references.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefb0a37a9d01a205488b14c6d82da6fa15992b1d291b2357810e4849ca45c8e"}},{"ruleId":"D1","level":"warning","message":{"text":"UvMetadata::dependency_metadata (cyclomatic 29): UvMetadata::dependency_metadata 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":"crates/ty_project/src/uv/metadata/dependencies.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6cc57ed07b6103e95525e0221c65dc9a32e4da6c009b160eb8a097d27cfbda"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::identity_comparison_type::upcast (cyclomatic 29): Type::identity_comparison_type::upcast 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/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"20157ba2ca5b47dea43e73853435fadcfec8463d4765a387498d2345cdf0c794"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::apply_type_mapping_impl (cyclomatic 29): Type::apply_type_mapping_impl 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. This is NOT this file\u0027s highest cyclomatic complexity: Type::is_singleton (cyclomatic 32) 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/ty_python_semantic/src/types.rs"},"region":{"startLine":9931}}}],"partialFingerprints":{"codehealthFindingId/v1":"25370e3f4f1a237b0fac7f590a910dccfe68a9f3bf939e868401692ac94021f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::reachability::analyze_single_pattern_predicate_kind (cyclomatic 29): ty_python_semantic::reachability::analyze_single_pattern_predicate_kind 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":"crates/ty_python_semantic/src/reachability.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf47db6b8112ca845b33c66c47ef18f148fc4bdbd520c5679db20c9652b30b1d"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::set_theoretic::generic_gradual_intersections::base_top_intersection (cyclomatic 29): ty_python_semantic::types::set_theoretic::generic_gradual_intersections::base_top_intersection 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":"crates/ty_python_semantic/src/types/set_theoretic/generic_gradual_intersections.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f65d5e931d1778a933c84848d2178cd30c489617be1e68c25e24d4b6f8e89b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Playground.Playground (cyclomatic 29): Playground.Playground has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 4 of the 29 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 145, 98, 221, \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":"playground/ty/src/Playground.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12a3da2cb5c7c0db31a7a6f620ae133dc33118b1840b52518d50db84cc9ae27"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceMap::splice_lines (cyclomatic 28): SourceMap::splice_lines has cyclomatic complexity 28 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 5 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":"crates/ruff_annotate_snippets/src/renderer/source_map.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e51cdee4f7e6a75b21bb8711ea9f864b026e1d843155d9213fdc0affb8756c5"}},{"ruleId":"D1","level":"warning","message":{"text":"BlankLinesChecker::check_line (cyclomatic 28): BlankLinesChecker::check_line 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/ruff_linter/src/rules/pycodestyle/rules/blank_lines.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ae54620746c9f5c394a19f23b8fd1bdcdee0c7de9c5241180fbd54ca0b9d7a"}},{"ruleId":"D1","level":"warning","message":{"text":"FStringConversion::try_convert (cyclomatic 28): FStringConversion::try_convert 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/ruff_linter/src/rules/pyupgrade/rules/f_strings.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"98094da7bf0f5ced3348d8a22f6478af6979222efb8d6d3e5a75d646908fcd30"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticSyntaxChecker::visit_expr (cyclomatic 28): SemanticSyntaxChecker::visit_expr 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":"crates/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ff935f3940dd047faf838f3e5fce2d87ea30fa9cd2000ade249cad7f53efb7"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticModel::resolve_load (cyclomatic 28): SemanticModel::resolve_load 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. This is NOT this file\u0027s highest cyclomatic complexity: SemanticModel::add_module (cyclomatic 31) 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/ruff_python_semantic/src/model.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"418c254ae74fae0284f84dd5fef6ecd3319ad26c85864cef296c21e4641ae39f"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_ide::docstring::markdown::general::render_with_indentation_mode (cyclomatic 28): ty_ide::docstring::markdown::general::render_with_indentation_mode 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/ty_ide/src/docstring/markdown/general.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbfbf6c4b2b0794b29bf2ff22a9fedbf122db67e9a494e42d2551a4bda6040f"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticClassLiteral::own_fields_inner (cyclomatic 28): StaticClassLiteral::own_fields_inner 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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":2823}}}],"partialFingerprints":{"codehealthFindingId/v1":"5058024ec8eac1ffac0102d40249e688fe5a1021fcc461505c3753245020faa4"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_builtins_type_call (cyclomatic 28): TypeInferenceBuilder::infer_builtins_type_call 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/ty_python_semantic/src/types/infer/builder/type_call.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1275e192fae08c3fb007441d4dcd7eb96b75d70457fceffd4c364acbc1916333"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::constructor_bindings (cyclomatic 28): Type::constructor_bindings has cyclomatic complexity 28 (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: Type::is_singleton (cyclomatic 32) 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/ty_python_semantic/src/types.rs"},"region":{"startLine":8107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a88e800b3ba3dc0c8833c5b2c751b53f1faaa13337d82d1138ee9e620393b65"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::checkers::tokens::check_tokens (cyclomatic 27): ruff_linter::checkers::tokens::check_tokens 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/ruff_linter/src/checkers/tokens.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd76eff54ed883837b16514a8ed9015a1a71eb7071b677584ae18d733ee63df"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolvedClientCapabilities::new (cyclomatic 27): ResolvedClientCapabilities::new has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/capabilities.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9dfeb7fea6455fcceabea49e07d42525638c3aa877048fe5d18e8e874a2be4"}},{"ruleId":"D1","level":"warning","message":{"text":"GotoTarget::definitions (cyclomatic 27): GotoTarget::definitions 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":"crates/ty_ide/src/goto.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a283fa191f10696e4a751affd3fdf9e83c87cd5e278993c8889cdc1f98d217"}},{"ruleId":"D1","level":"warning","message":{"text":"Debouncer::add_event (cyclomatic 27): Debouncer::add_event 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":"crates/ty_project/src/watch/watcher.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6664b49fbbd72c88c71e3670238d5834aac7f16f5e003207f19cbb03aa5c3810"}},{"ruleId":"D1","level":"warning","message":{"text":"TruthinessAnalyzer::evaluate (cyclomatic 27): TruthinessAnalyzer::evaluate has cyclomatic complexity 27 (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/ty_python_semantic/src/types/infer/expression_truthiness.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5732774a54896c2531130e76cc0c8ded520d4634a8d593f6095a7874f68fb1"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::try_iterate_with_mode::non_async_special_case (cyclomatic 27): Type::try_iterate_with_mode::non_async_special_case 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":"crates/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f701886c7cf4be9b772a3ceaaa17b1fa7e0219d7a777fd8c2bcf54e5e5f99091"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::suppression::unused::check_unused_suppressions (cyclomatic 27): ty_python_semantic::suppression::unused::check_unused_suppressions 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/ty_python_semantic/src/suppression/unused.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebde87e1efb56fa0d38a40a62d9ac1b2d0d2e5a5293114334c15dc030b2998d"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::write_summary_text (cyclomatic 26): Printer::write_summary_text 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":"crates/ruff/src/printer.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c4c25a0bab12dc6c1a0362144d05241763e9660a1e11c7c6aca0b3042f02f5"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff::commands::format::format (cyclomatic 26): ruff::commands::format::format 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":"crates/ruff/src/commands/format.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b348b62fadbb842fffa859a454a1e5ef304fdc12ff6be9adbaae8722a098503"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::render (cyclomatic 26): ruff_annotate_snippets::renderer::render::render has cyclomatic complexity 26 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3d959fe7330fe5506076f3f718111548d85404fb2f2f4a4e4bbebb7a4094ef"}},{"ruleId":"D1","level":"warning","message":{"text":"LoopMutationsVisitor::visit_stmt (cyclomatic 26): LoopMutationsVisitor::visit_stmt 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":"crates/ruff_linter/src/rules/flake8_bugbear/rules/loop_iterator_mutation.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdb9bf95bd55bd819c535f7251d76c7295b05657ec6c11d70803058fe11c29f"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_type_checking::rules::typing_only_runtime_import::typing_only_runtime_import (cyclomatic 26): ruff_linter::rules::flake8_type_checking::rules::typing_only_runtime_import::typing_only_runtime_import 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":"crates/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f104c3d19c16d1fda31d17123ace2b58c37c276bcaf2284a179310d9426da06"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::native_literals::native_literals (cyclomatic 26): ruff_linter::rules::pyupgrade::rules::native_literals::native_literals 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":"crates/ruff_linter/src/rules/pyupgrade/rules/native_literals.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f37ba3cb88978df88fb95f8c4875e4b9eb0bf0f07b2134af09ba64a8eb9e425"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryContextKind::is_list_element (cyclomatic 26): RecoveryContextKind::is_list_element has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: RecoveryContext::to_kind (cyclomatic 33) 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/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccb3680c2de9f49493498b44a90e30c14b1333a38ddb49a29dac6eb36406e40"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryContextKind::create_error (cyclomatic 26): RecoveryContextKind::create_error has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: RecoveryContext::to_kind (cyclomatic 33) 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/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"e027129429bc9035a0d21190ac223c4fcd1597ec6e856c99436a1152e6db6c09"}},{"ruleId":"D1","level":"warning","message":{"text":"FoldingRangeVisitor::enter_node (cyclomatic 26): FoldingRangeVisitor::enter_node has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/folding_range.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b97bfce33ad94bf4e973b8825135ca04310ab15cf424e862b51ca79fae895c5"}},{"ruleId":"D1","level":"warning","message":{"text":"LoopBindingsVisitor::visit_stmt (cyclomatic 26): LoopBindingsVisitor::visit_stmt has cyclomatic complexity 26 (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/ty_python_core/src/builder/loop_bindings_visitor.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3518cb439f9d83f352fadf1e4e89fb80ae38b42c0885d7069b3f3d78af8a81"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticClassLiteral::own_class_member (cyclomatic 26): StaticClassLiteral::own_class_member has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afa916cdda2134c3975c19a8b763aeedc462917034dcce2bde290e1d69b2eae"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticClassLiteral::own_instance_member (cyclomatic 26): StaticClassLiteral::own_instance_member 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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"69245f46c6984636e63fdfb67d521506f3b10052bdd4162222f6510045eb56ab"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_paramspec_explicit_specialization_value (cyclomatic 26): TypeInferenceBuilder::infer_paramspec_explicit_specialization_value has cyclomatic complexity 26 (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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0002f981ee21a2bf837369812b2506353176a5fb445dcba3c0032d6caeb0495b"}},{"ruleId":"D1","level":"warning","message":{"text":"SubscriptErrorKind::report_diagnostic (cyclomatic 26): SubscriptErrorKind::report_diagnostic 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":"crates/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8ca7f36f73405f0c02a300bb99c23d674de4bbf7539e98aae36ceb51b77a54"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::generator_types (cyclomatic 26): Type::generator_types has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Type::is_singleton (cyclomatic 32) 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/ty_python_semantic/src/types.rs"},"region":{"startLine":8860}}}],"partialFingerprints":{"codehealthFindingId/v1":"451adb9bf1468c145cba3ddfc7083594d350347ad99a9b8737e78db0ee33f1e4"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::ide_support::unused_bindings::unused_bindings (cyclomatic 26): ty_python_semantic::types::ide_support::unused_bindings::unused_bindings 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":"crates/ty_python_semantic/src/types/ide_support/unused_bindings.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"653a132e24cb78755c1dbd504a53f6f489540712f1aea979187deb5d777d52f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_dev::generate_ty_cli_reference::generate_command (cyclomatic 25): ruff_dev::generate_ty_cli_reference::generate_command 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":"crates/ruff_dev/src/generate_ty_cli_reference.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a48e0eaeaee012727cf92e8f73d393eeb973a9ab9afff58f2de1dc531ffbe1"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_type_checking::rules::runtime_import_in_type_checking_block::runtime_import_in_type_checking_block (cyclomatic 25): ruff_linter::rules::flake8_type_checking::rules::runtime_import_in_type_checking_block::runtime_import_in_type_checking_block 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":"crates/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"445aa9c008773599f06f1db2993d3f5debaadcdf9762cccc375bdb0d4343b3b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::indent::indent (cyclomatic 25): ruff_linter::rules::pydocstyle::rules::indent::indent 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":"crates/ruff_linter/src/rules/pydocstyle/rules/indent.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1d9b64fc6ca463bbc06dbdd4858c6b7179e2067e2be535aa98bfa7f7cb03a0"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::missing_maxsplit_arg::missing_maxsplit_arg (cyclomatic 25): ruff_linter::rules::pylint::rules::missing_maxsplit_arg::missing_maxsplit_arg 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":"crates/ruff_linter/src/rules/pylint/rules/missing_maxsplit_arg.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3251599ba25852bc839132e270b9367f9f010a0e5f6bd5f5b27cd3b3f2c026"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::lex_interpolated_string_middle_or_end (cyclomatic 25): Lexer::lex_interpolated_string_middle_or_end 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":"crates/ruff_python_parser/src/lexer.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfe4e51073d7f18aee9736da2d05294ff131759876d4f7565176f85ef35b61b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_simple_statement (cyclomatic 25): Parser::parse_simple_statement 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/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1fa039c2a88d7a7c7700abdfe735d793817a9100e3af475bfc33a51777545b"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectFilesWalker::collect_vec (cyclomatic 25): ProjectFilesWalker::collect_vec 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":"crates/ty_project/src/walk.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d919d1827c00e8e01b3be6a2b21e1be1e74bb1e975379bbc410cdd9176d872b"}},{"ruleId":"D1","level":"warning","message":{"text":"NarrowingProjector::project (cyclomatic 25): NarrowingProjector::project 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":"crates/ty_python_semantic/src/reachability.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1d123e64362f9c9129ec7f5eeaf0eb702d47a3e3ea3bd7ea809dc5a90eee39"}},{"ruleId":"D1","level":"warning","message":{"text":"CallableBinding::report_diagnostics (cyclomatic 25): CallableBinding::report_diagnostics 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4813}}}],"partialFingerprints":{"codehealthFindingId/v1":"40db41ab9551384ca0f7313abfb833178e34f771ae1a38f0ecaee95958bb40a7"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayParameters::fmt_detailed (cyclomatic 25): DisplayParameters::fmt_detailed has cyclomatic complexity 25 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 12 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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2816}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c5cfe07fe2fe1719013cb53931e2de21b85f3973b73374079d643751234271"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_tuple_type_expression (cyclomatic 25): TypeInferenceBuilder::infer_tuple_type_expression 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":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a19fa61b223403db46a99855c578fb5e5a62d24ff9811f2d0fa94786d26fc1"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_assignment_deferred (cyclomatic 25): TypeInferenceBuilder::infer_assignment_deferred 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. This is NOT this file\u0027s highest cyclomatic complexity: TypeInferenceBuilder::infer_value_expression_impl (cyclomatic 33) 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4016}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f72c7ac1a4dfab49d60cb76aeb22cd6084248cd44ac7a571a5e819249bda12"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRelationChecker::check_target_union (cyclomatic 25): TypeRelationChecker::check_target_union 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":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dba21a6ec7553ea8010d0167af12a2506a63b521449bce6be35034cca0acb55"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff::diagnostics::lint_path (cyclomatic 24): ruff::diagnostics::lint_path 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/ruff/src/diagnostics.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cecfa61bfe1c17546d0f0a49208bb7e6b317f8d9735d544c92e92b0880450d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::render_title (cyclomatic 24): ruff_annotate_snippets::renderer::render::render_title has cyclomatic complexity 24 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ece0c323e72a9541651def0b34f3ea56c724c01dd6f8de47da2ac579ce7ccc"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::bindings::bindings (cyclomatic 24): ruff_linter::checkers::ast::analyze::bindings::bindings 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/ruff_linter/src/checkers/ast/analyze/bindings.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cff415e4eb8b8605ff3a1b0b2dd996af5cc62b2a4f47676b04a29d4d454ea84"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_unused_arguments::rules::unused_arguments::unused_arguments (cyclomatic 24): ruff_linter::rules::flake8_unused_arguments::rules::unused_arguments::unused_arguments 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/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"08afc6db3ae8a0b96f82e72266b467b27aff7306b411a7a325f91355fe0731ff"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::no_method_decorator::get_undecorated_methods (cyclomatic 24): ruff_linter::rules::pylint::rules::no_method_decorator::get_undecorated_methods 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/ruff_linter/src/rules/pylint/rules/no_method_decorator.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"19887f016572112dc2bbdb28fe74709513faae107e53c1b458c2fc5fbdcee36c"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatInterpolatedElement::fmt (cyclomatic 24): FormatInterpolatedElement::fmt 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/ruff_python_formatter/src/other/interpolated_string_element.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fdca9af97e99d221ed385c5fcbe34c860e1cf1f79ef5f489ef71b771823acb"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatImplicitConcatenatedStringFlat::new::merge_flags (cyclomatic 24): FormatImplicitConcatenatedStringFlat::new::merge_flags 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/ruff_python_formatter/src/string/implicit.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf496541cf80d4b50cbfb30547daf2ea65e5e6473a1f1cbd02ce78ea9421963"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchPatternVisitor::visit_pattern (cyclomatic 24): MatchPatternVisitor::visit_pattern 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/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa1a2fdce412aa09bd5316f2878f30f28a64053aaeb4d471e9e746fbe0a5975"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticModel::simulate_runtime_load_at_location_in_scope (cyclomatic 24): SemanticModel::simulate_runtime_load_at_location_in_scope 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. This is NOT this file\u0027s highest cyclomatic complexity: SemanticModel::add_module (cyclomatic 31) 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/ruff_python_semantic/src/model.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a14b0c29f7fb07919ad8c4332e8d4248022975b2eb18f342b9932128fdd262"}},{"ruleId":"D1","level":"warning","message":{"text":"ty::run_check (cyclomatic 24): ty::run_check has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/lib.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"350f71eeecd2ec47bb59fb4edb66670f2ccc979a832a3d1029d0cd9c06078160"}},{"ruleId":"D1","level":"warning","message":{"text":"CallInference::select_return_type (cyclomatic 24): CallInference::select_return_type has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49b6e494b23469fc97071f9c5b9ef558fa451ac85361c1575ee7a472a712949"}},{"ruleId":"D1","level":"warning","message":{"text":"SolutionWalker::pending_candidate_solution (cyclomatic 24): SolutionWalker::pending_candidate_solution 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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e879108406f154552b6a5909b2db8f0c0ca3b65cffa1589fe3de3302a1ac70"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayUnionType::fmt_detailed (cyclomatic 24): DisplayUnionType::fmt_detailed has cyclomatic complexity 24 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 5 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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c635e303b7107579e252d1576fc1de97d138ef81b8c0f62dcd8b8fd406cc92"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAttributeWriteEvaluator::evaluate_instance (cyclomatic 24): AssignmentAttributeWriteEvaluator::evaluate_instance 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/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"447e304335761548ec86c804ed0da62c46ef37d8f052fa96271c8e7cab3d531e"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_region_scope (cyclomatic 24): TypeInferenceBuilder::infer_region_scope 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. This is NOT this file\u0027s highest cyclomatic complexity: TypeInferenceBuilder::infer_value_expression_impl (cyclomatic 33) 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a1fccc852f95da72f4ef33963c53ada4cae78c6328e9c0b6df13cbfbd2b25b"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::diagnostic::report_incompatible_method_override (cyclomatic 24): ty_python_semantic::types::diagnostic::report_incompatible_method_override 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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5277}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9f946608c82236f54a7edd3fbf17b0d6b8e980058508d3a48fc2712e08d951"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::infer::comparisons::infer_binary_intersection_type_comparison (cyclomatic 24): ty_python_semantic::types::infer::comparisons::infer_binary_intersection_type_comparison 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/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf6eb24583fe1b9d5c2efcf24166ef8eb4f12d218b26a4456fc3609a8daaf5d"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::attribute_violation (cyclomatic 24): ty_python_semantic::types::overrides::attributes::attribute_violation has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"23987b8f2e53c290c2a4e4cd356f3611684166ba1c9e998717ca69a2f8ec85cb"}},{"ruleId":"D1","level":"warning","message":{"text":"LinePreprocessor::next (cyclomatic 23): LinePreprocessor::next 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":"crates/ruff_linter/src/rules/pycodestyle/rules/blank_lines.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba085304729c637895f902ce3964cba46433e92f9141d5232faa3a23a51f1929"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::checkers::logical_lines::check_logical_lines (cyclomatic 23): ruff_linter::checkers::logical_lines::check_logical_lines 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":"crates/ruff_linter/src/checkers/logical_lines.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7f7788cbd36bbd61e2cd76a1bbc96c83370f0cc87b9c53664e883e32f183f3"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::airflow::rules::xcom_pull_in_template_string::parse_xcom_pull_template (cyclomatic 23): ruff_linter::rules::airflow::rules::xcom_pull_in_template_string::parse_xcom_pull_template 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":"crates/ruff_linter/src/rules/airflow/rules/xcom_pull_in_template_string.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"96617b84e6bb862f18030685672767f1c2ec633f9c2a40a88d09924a21e5b8c9"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyflakes::rules::unused_import::unused_import (cyclomatic 23): ruff_linter::rules::pyflakes::rules::unused_import::unused_import 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":"crates/ruff_linter/src/rules/pyflakes/rules/unused_import.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"43be988c836b8035d25327db7b263bef3e6f2eaed616f10600ff060f5254aed2"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::unnecessary_dunder_call::unnecessary_dunder_call (cyclomatic 23): ruff_linter::rules::pylint::rules::unnecessary_dunder_call::unnecessary_dunder_call 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. This is NOT this file\u0027s highest cyclomatic complexity: DunderReplacement::from_method (cyclomatic 89) 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/ruff_linter/src/rules/pylint/rules/unnecessary_dunder_call.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c678a9f1b0a6f8f9b291cd78375a3c32d4437f8a642231c853a56f9987507a"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::f_strings::f_strings (cyclomatic 23): ruff_linter::rules::pyupgrade::rules::f_strings::f_strings 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/ruff_linter/src/rules/pyupgrade/rules/f_strings.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0456051b97551c76e034ebab39b91057c776e5093eb7fb96895c58572e8e46c"}},{"ruleId":"D1","level":"warning","message":{"text":"BackwardsTokenizer::next_token_inner (cyclomatic 23): BackwardsTokenizer::next_token_inner has cyclomatic complexity 23 (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: ruff_python_trivia::tokenizer::to_keyword_or_other (cyclomatic 37) 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/ruff_python_trivia/src/tokenizer.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2562b596a71b3ef2cbfd8ffd176d41a63b64e3afbfe00388ad8e982213a6b5"}},{"ruleId":"D1","level":"warning","message":{"text":"PortableGlobPattern::parse (cyclomatic 23): PortableGlobPattern::parse 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":"crates/ty_project/src/glob/portable.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"be07e723c722559f559db4799f4093203b8686f7ba2f855500f59ce60a963bb4"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticIndexBuilder::pop_scope (cyclomatic 23): SemanticIndexBuilder::pop_scope 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":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b94b44624a48ee778eede03922940a438bb0629ff60dbe4e5efee3486473653"}},{"ruleId":"D1","level":"warning","message":{"text":"PlaceLoadResolutionProcedure::resolve_enclosing_scopes (cyclomatic 23): PlaceLoadResolutionProcedure::resolve_enclosing_scopes 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":"crates/ty_python_semantic/src/place_load.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12e1432cf2310c530fbefc7d2f2299736f52cf71c91600f1fd4701419746e5d"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentMatcher::match_variadic (cyclomatic 23): ArgumentMatcher::match_variadic 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":5343}}}],"partialFingerprints":{"codehealthFindingId/v1":"781643f24358174d64c041c733c575ea42abc049126fe7ad4ece3fcfb1c36650"}},{"ruleId":"D1","level":"warning","message":{"text":"CandidateSolutions::compute_simple_bound_conjunction (cyclomatic 23): CandidateSolutions::compute_simple_bound_conjunction 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":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":3887}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db8401d40a54a0c9b4614ac0f001a19e04e6c508f296565f859840d677511df"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentAttributeWriteEvaluator::report (cyclomatic 23): AssignmentAttributeWriteEvaluator::report 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":"crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea2e65934096fa5deba3c2a0a39ebfcd3c776aebce98171e5fd450df68def55"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_assignment_definition_impl (cyclomatic 23): TypeInferenceBuilder::infer_assignment_definition_impl 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. This is NOT this file\u0027s highest cyclomatic complexity: TypeInferenceBuilder::infer_value_expression_impl (cyclomatic 33) 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":3617}}}],"partialFingerprints":{"codehealthFindingId/v1":"326256daa618a23d69cd53914d9f1cd7b184777b53837ef4ddf26d19adfc0a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"UnionElement::try_reduce (cyclomatic 23): UnionElement::try_reduce 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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2d99490cb0a65f17f640a97d12a7a4995ebbe6119a8978b805e5f31783d36e"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::place::place_from_bindings_impl (cyclomatic 23): ty_python_semantic::place::place_from_bindings_impl has cyclomatic complexity 23 (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/ty_python_semantic/src/place.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a80ef85886abe914f432d05845d927bf838c0dae6ea59ed4318a1e58e4e335"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::function::is_instance_truthiness (cyclomatic 23): ty_python_semantic::types::infer::builder::function::is_instance_truthiness 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/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2fa4335cc049beee46675550d8d52fcadc57a27734af195d04f7a9e46b55f3"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::set_theoretic::generic_gradual_intersections::dynamic_generalization_intersection (cyclomatic 23): ty_python_semantic::types::set_theoretic::generic_gradual_intersections::dynamic_generalization_intersection 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":"crates/ty_python_semantic/src/types/set_theoretic/generic_gradual_intersections.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a5c712c9f00d4254a703461c0bc3397ff1a82fc30e66fad2a9eb243140c6c6"}},{"ruleId":"D1","level":"warning","message":{"text":"Suppressions::check_suppressions (cyclomatic 22): Suppressions::check_suppressions has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 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":"crates/ruff_linter/src/suppression.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"f725d5e5a6e934536cd8e75692b30f46309a72237d63057b58143271a8bade25"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::context_manager_iterator::context_manager_iterator (cyclomatic 22): ruff_linter::rules::pyupgrade::rules::context_manager_iterator::context_manager_iterator 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":"crates/ruff_linter/src/rules/pyupgrade/rules/context_manager_iterator.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0586be9e5fbde05f40bdc6697d0daf893997cdb4ebdda7b781e2a38829448068"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::use_pep604_annotation::non_pep604_annotation (cyclomatic 22): ruff_linter::rules::pyupgrade::rules::use_pep604_annotation::non_pep604_annotation 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/ruff_linter/src/rules/pyupgrade/rules/use_pep604_annotation.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cc6378ccf3266098ccc1626a44623b1cd91317cae0f7c94456db820415be40"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::refurb::rules::sorted_min_max::sorted_min_max (cyclomatic 22): ruff_linter::rules::refurb::rules::sorted_min_max::sorted_min_max 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/rules/sorted_min_max.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eec2dfbdd3d9f0af9e8da643d7f9e2877a990f590326962bc712057cfc11b6d"}},{"ruleId":"D1","level":"warning","message":{"text":"IsortOptions::try_into_settings (cyclomatic 22): IsortOptions::try_into_settings 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/ruff_workspace/src/options.rs"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5658b509834a65221f65d04529c4f638243a2eebb794e0783ca21aeab502ad1"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::fixes::fix_all (cyclomatic 22): ty_python_semantic::fixes::fix_all 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/ty_python_semantic/src/fixes.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efcdebda5577abd4edcd25ffadfd160116e3fefb25cebc2c0c8c8af45748dbb"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::overrides::check_inherited_method_conflict (cyclomatic 22): ty_python_semantic::types::overrides::check_inherited_method_conflict 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/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5906122bcca93c2c2b2a88d0f03cc9dc9e443c5df9c60b196f2d9c425cc2247c"}},{"ruleId":"D1","level":"warning","message":{"text":"SecondaryPanel.SecondaryPanel (cyclomatic 22): SecondaryPanel.SecondaryPanel has cyclomatic complexity 22 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 8 belong to 5 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/ruff/src/Editor/SecondaryPanel.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3b94fc059d0c6daf5c9162a033b560c9accfeed9dc702f7d0b6ae1a3b3692b"}},{"ruleId":"D1","level":"warning","message":{"text":"ExplicitConfigOverrides::transform (cyclomatic 21): ExplicitConfigOverrides::transform has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/args.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"3304ade6754fd4748cb880225507188374ffacee59db9ba9c06e35963d055b44"}},{"ruleId":"D1","level":"warning","message":{"text":"Diff::write (cyclomatic 21): Diff::write 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. This is NOT this file\u0027s highest cyclomatic complexity: ruff_db::diagnostic::render::full::show_nonprinting (cyclomatic 38) 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/ruff_db/src/diagnostic/render/full.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"10616db303aa877acf499906f4ea3d9b9429fdfd229c195df71e95894c4508bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::propagate_expand::propagate_expands (cyclomatic 21): Document::propagate_expand::propagate_expands 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/ruff_formatter/src/format_element/document.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a67de4bb2472117adb8846ac91cd6c405daf6f714be4abaca4fcfd86f3c5b72"}},{"ruleId":"D1","level":"warning","message":{"text":"GroupNameFinder::visit_stmt (cyclomatic 21): GroupNameFinder::visit_stmt 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":"crates/ruff_linter/src/rules/flake8_bugbear/rules/reuse_of_groupby_generator.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1830d2f0805856f059f27fdd2a05d06560ab1cae71485231f0ff964ac519ae"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_bandit::rules::shell_injection::shell_injection (cyclomatic 21): ruff_linter::rules::flake8_bandit::rules::shell_injection::shell_injection 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":"crates/ruff_linter/src/rules/flake8_bandit/rules/shell_injection.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad29ee0d90b5b3ff9aef5a68362445ab98925b93866ee00c1846a81ee6cf8bf1"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_commas::rules::trailing_commas::check_token (cyclomatic 21): ruff_linter::rules::flake8_commas::rules::trailing_commas::check_token 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":"crates/ruff_linter/src/rules/flake8_commas/rules/trailing_commas.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e557a11171a8064ee06268d3aa6da09fc7cf90be0e5b42a5a097f4d4c6ebf2"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_dict_get::if_else_block_instead_of_dict_get (cyclomatic 21): ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_dict_get::if_else_block_instead_of_dict_get has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"532ae5d6d0c38684063f02d823c2efa8b1e9f39b4d867720fc000a668b7aef9e"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_if_exp::if_else_block_instead_of_if_exp (cyclomatic 21): ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_if_exp::if_else_block_instead_of_if_exp has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_if_exp.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5847f5bc1cd57410f3a0e88b98ebdf3870591990a523406c6758c01361d0a6cf"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::isort::format_import_block (cyclomatic 21): ruff_linter::rules::isort::format_import_block 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":"crates/ruff_linter/src/rules/isort/mod.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff8361e2f1e08c42dbce1186cf82234ffed891e2824e0a8f80633913499b62e"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::if_stmt_min_max::if_stmt_min_max (cyclomatic 21): ruff_linter::rules::pylint::rules::if_stmt_min_max::if_stmt_min_max has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/if_stmt_min_max.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac6a14b9868989ed57056c3e09db26cf69c76753570d9080a45afe05e71ea3c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::deprecated_mock_import::deprecated_mock_import (cyclomatic 21): ruff_linter::rules::pyupgrade::rules::deprecated_mock_import::deprecated_mock_import 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":"crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"7208177de80664dc4727bb4c5908edcab380d320a9880343fbc002c3c55a0af2"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::refurb::rules::bit_count::bit_count (cyclomatic 21): ruff_linter::rules::refurb::rules::bit_count::bit_count has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/rules/bit_count.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc9107400ee0ec233406c2734ed5bcdaa974e4a8fea0e3b1b62c0157285e125"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::refurb::rules::verbose_decimal_constructor::verbose_decimal_constructor (cyclomatic 21): ruff_linter::rules::refurb::rules::verbose_decimal_constructor::verbose_decimal_constructor 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":"crates/ruff_linter/src/rules/refurb/rules/verbose_decimal_constructor.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aab3d77bdcfe71b64f3275fc81dd4c01237fa6445043a651d96e6dc2c06743"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatExprAttribute::fmt_fields (cyclomatic 21): FormatExprAttribute::fmt_fields has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/expression/expr_attribute.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c445ebb9b07ce8fb0a2836c3333d01c4ad63fa2c8b4e84a92405b35ef38e70f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_formatter::verbatim::write_suppressed_statements (cyclomatic 21): ruff_python_formatter::verbatim::write_suppressed_statements 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":"crates/ruff_python_formatter/src/verbatim.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8e40318afcdcee5513567f2eb52c5e3d091dd457d0eeedc2a18c7797de4445"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::handle_implicitly_concatenated_strings (cyclomatic 21): Parser::handle_implicitly_concatenated_strings 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":"crates/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1ccad8529df7cc5bf67b936fb27679f1e0c509944d128c908188bce7261883"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextCursor::incomplete_keywords (cyclomatic 21): ContextCursor::incomplete_keywords 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. This is NOT this file\u0027s highest cyclomatic complexity: ContextCursor::is_expecting_expression (cyclomatic 30) 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/ty_ide/src/completion.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2263761eff66a366bd5329b1397cd8d81c9dc8bd925e5581e50ce7a3989450c6"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticTokenVisitor::classify_from_definition (cyclomatic 21): SemanticTokenVisitor::classify_from_definition 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":"crates/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9b813b60f68b8a7b4de1e1d335ef808674f76cf214fb420641ae95328e362d"}},{"ruleId":"D1","level":"warning","message":{"text":"PlaceLoadResolutionProcedure::next (cyclomatic 21): PlaceLoadResolutionProcedure::next 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":"crates/ty_python_semantic/src/place_load.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb533c2919ae2a7b7bc7a2be26492d07cb153ff182fbec8efac7d43e231cd39"}},{"ruleId":"D1","level":"warning","message":{"text":"AbstractMethods::annotate_diagnostic (cyclomatic 21): AbstractMethods::annotate_diagnostic 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":"crates/ty_python_semantic/src/types/abstract_methods.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6837a6a72fdd97b2f827d7957411e9cabe8c5f4a50358d09777559bcd2dd73"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassType::own_class_member (cyclomatic 21): ClassType::own_class_member 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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a7e004a09ad3d64090a787a94af2e0a5252f476fa1a7f2d07d523ab1a317e2"}},{"ruleId":"D1","level":"warning","message":{"text":"MroLookup::instance_member (cyclomatic 21): MroLookup::instance_member 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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":3131}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae400732dbfed4cef692acd7e5d57c2c113046fc7de9f73f670e38e980b445c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::check_boolean_test (cyclomatic 21): TypeInferenceBuilder::check_boolean_test 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":"crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/mod.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa9193cbabc3771c661c1907eb8cda68ac6cf236e94297c8b3a18ab7e24cebe"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_subclass_of_type_expression (cyclomatic 21): TypeInferenceBuilder::infer_subclass_of_type_expression 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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1c1cb8f87d7c626f1327bec491d674e22b57f5c40a5aabe75505df4a98f191"}},{"ruleId":"D1","level":"warning","message":{"text":"AddBinding::insert (cyclomatic 21): AddBinding::insert 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. This is NOT this file\u0027s highest cyclomatic complexity: TypeInferenceBuilder::infer_value_expression_impl (cyclomatic 33) 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":13606}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea885f2c80888b6f44c7fbac5075195008cbe3d5f3c162da9aaf3c3e143528c"}},{"ruleId":"D1","level":"warning","message":{"text":"NarrowingConstraintsBuilder::evaluate_expr_compare_op (cyclomatic 21): NarrowingConstraintsBuilder::evaluate_expr_compare_op 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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":3919}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fe428e3483de9310465cfa5c42ef1a112a21118c430913fadf42da0fe4f2d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::attribute_write::attribute_write_requirement (cyclomatic 21): ty_python_semantic::types::attribute_write::attribute_write_requirement 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/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"9890ceba7bfe8b7a93a518f223ec4a258c952001b95eae10e2db6cd553ea723e"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::diagnostic::report_dynamic_function_decorator_return (cyclomatic 21): ty_python_semantic::types::diagnostic::report_dynamic_function_decorator_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":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5659bc6a3c7206c2cd721be3f508ed173e920dd3c64b579d2f2a7011bc67e0"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::generics::find_typevar_binding (cyclomatic 21): ty_python_semantic::types::generics::find_typevar_binding has cyclomatic complexity 21 (threshold 15). Of this number, 20 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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cda5f2059149f086b4ab0630dba58039184c68716387644b7ca34f58d7cad2"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::narrow::containment::containment_behavior (cyclomatic 21): ty_python_semantic::types::narrow::containment::containment_behavior 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":"crates/ty_python_semantic/src/types/narrow/containment.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e74a7d8259d346e6dc4b11691e435707a0c40c91503baccccd0d5894f5d169"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::check_inherited_conflict (cyclomatic 21): ty_python_semantic::types::overrides::attributes::check_inherited_conflict 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":"crates/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ac9a8de7e0e90b6dd7a7108c165bdc2745bf8c6262c8c89a89f04913565cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::process_code_block (cyclomatic 20): Parser::process_code_block 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/mdtest/src/parser.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"357c056760aa11f4ab782350afff3652c271958543480f176af47e4232d4a29b"}},{"ruleId":"D1","level":"warning","message":{"text":"UnittestAssert::generate_assert (cyclomatic 20): UnittestAssert::generate_assert 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. This is NOT this file\u0027s highest cyclomatic complexity: UnittestAssert::try_from (cyclomatic 42) 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/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"5333002bb1b5c74b39009d9417f5133d259683270f6aa2e4755243eb17e5cb8c"}},{"ruleId":"D1","level":"warning","message":{"text":"BlankLinesChecker::check_lines (cyclomatic 20): BlankLinesChecker::check_lines 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/ruff_linter/src/rules/pycodestyle/rules/blank_lines.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ef9627fa67f6ad63468cca2950751eb65951d575c7c508b3291775632b9b36"}},{"ruleId":"D1","level":"warning","message":{"text":"TypingTarget::try_from_expr (cyclomatic 20): TypingTarget::try_from_expr has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/typing.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cb89fd829e4464cdaf2825745ba6d45c3688b77f9f7531c66fdddd4bb5fa37"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::enumerate_for_loop::enumerate_for_loop (cyclomatic 20): ruff_linter::rules::flake8_simplify::rules::enumerate_for_loop::enumerate_for_loop has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/enumerate_for_loop.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2718a287afa7c4ea8a1ba6576d54e908e46b16461415c98509018de224816c67"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::needless_bool::needless_bool (cyclomatic 20): ruff_linter::rules::flake8_simplify::rules::needless_bool::needless_bool has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/needless_bool.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd19f3eb71c6dda85f53c61feb4d12081bb57965f9dbda37e118370d63208d9"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_type_checking::rules::type_alias_quotes::quotes_are_unremovable (cyclomatic 20): ruff_linter::rules::flake8_type_checking::rules::type_alias_quotes::quotes_are_unremovable 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/ruff_linter/src/rules/flake8_type_checking/rules/type_alias_quotes.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"40307e08b2527ab21b7328d97d5d05684fdd755f07190be56c7c060af0f82433"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::whitespace_before_comment::whitespace_before_comment (cyclomatic 20): ruff_linter::rules::pycodestyle::rules::logical_lines::whitespace_before_comment::whitespace_before_comment 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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/whitespace_before_comment.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4561257b29efecfe98f421e24dcc3615c93349a290292adf1aaec697116aa35c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::blank_before_after_class::blank_before_after_class (cyclomatic 20): ruff_linter::rules::pydocstyle::rules::blank_before_after_class::blank_before_after_class 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/ruff_linter/src/rules/pydocstyle/rules/blank_before_after_class.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"02883acdfc7ef5f7c3e245cdc66bc89d4d7ff9c57ae07f9a207aadb127c8194d"}},{"ruleId":"D1","level":"warning","message":{"text":"UnqualifiedName::from_expr (cyclomatic 20): UnqualifiedName::from_expr 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":"crates/ruff_python_ast/src/name.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4619260e43c218f3626272f9bf4585bde6e519f07c5ab12e268dd2457caf10"}},{"ruleId":"D1","level":"warning","message":{"text":"Terminal::from_body (cyclomatic 20): Terminal::from_body has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Terminal::branch (cyclomatic 24) 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/ruff_python_semantic/src/analyze/terminal.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04710c7720f8098eb0bd50f560f469ac2f8ae927dbeb0a82f9e827d76c6fef0"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticTokenVisitor::visit_expr (cyclomatic 20): SemanticTokenVisitor::visit_expr 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":"crates/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2491720e01b2b0c79aefe01f511c7e30469a532181b4b4652bb1ffb7140cb2"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_ide::hover::hover (cyclomatic 20): ty_ide::hover::hover has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/hover.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"609b3c465d4da1a4a554e2f63ab285d0236648ab89b5cb81e7d57caa8d66fd2b"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticClassLiteral::try_metaclass::try_metaclass_inner (cyclomatic 20): StaticClassLiteral::try_metaclass::try_metaclass_inner 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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee05ecb17208505e60c967919ed97e44532f8fb6ec940a5ae884e149b9b0c578"}},{"ruleId":"D1","level":"warning","message":{"text":"SpecializationBuilder::common_typed_dict_protocol_constraints (cyclomatic 20): SpecializationBuilder::common_typed_dict_protocol_constraints has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (collect_typed_dicts, is_string_keyed_mapping). 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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa5bb62ce6829fe5a3eadfbeb780f3b3c68a99fd6637c018cbc242a505a259e"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_import_from_definition (cyclomatic 20): TypeInferenceBuilder::infer_import_from_definition 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/ty_python_semantic/src/types/infer/builder/imports.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6786a390b77edbafb50db52010ea5ac8923a1289b192b88265cfc58ecf30041"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_literal_parameter_type (cyclomatic 20): TypeInferenceBuilder::infer_literal_parameter_type 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":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":3197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e51d54ef0487400ebfa91e592ae12993c178787d8ca7e5847397fc6b442f65e"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_callable_parameter_types (cyclomatic 20): TypeInferenceBuilder::infer_callable_parameter_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":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":3324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63c961e86bd46852d24d802e59460109571e139ccc0544761144e77156b4194"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_and_check_argument_types (cyclomatic 20): TypeInferenceBuilder::infer_and_check_argument_types has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: TypeInferenceBuilder::infer_value_expression_impl (cyclomatic 33) 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":6060}}}],"partialFingerprints":{"codehealthFindingId/v1":"d263e471a981bdb1a985a9e52f6a23e30b9838af9fbe355253dc7351844650ee"}},{"ruleId":"D1","level":"warning","message":{"text":"BoundTypeVarInstance::apply_type_mapping_impl (cyclomatic 20): BoundTypeVarInstance::apply_type_mapping_impl 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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46ff36ca1d3f22981ae32d2c5e8b238dc119e3afd47760af5f52079b15923d6"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::class_member_with_policy_inner (cyclomatic 20): Type::class_member_with_policy_inner has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: Type::is_singleton (cyclomatic 32) 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/ty_python_semantic/src/types.rs"},"region":{"startLine":4509}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9aa3f0889d97962b7545ccb377b19964d1cce2ad9b751e29ef959242937b450"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::paramspec_validation::validate_paramspec_components (cyclomatic 20): ty_python_semantic::types::infer::builder::paramspec_validation::validate_paramspec_components 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/ty_python_semantic/src/types/infer/builder/paramspec_validation.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75618706be8638ecfb37338363e2a412b65c28b873a6648712bc82b2fe00572"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::typed_dict::validate_typed_dict_openness (cyclomatic 20): ty_python_semantic::types::infer::builder::post_inference::typed_dict::validate_typed_dict_openness 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/ty_python_semantic/src/types/infer/builder/post_inference/typed_dict.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2e5122af5d5f9a7a7f4ad7b204e67d0e72e611afc577a08085ee17ab0ad9ae"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::suspicious_conditions::exemptions::definition_contains_special_cased_condition (cyclomatic 20): ty_python_semantic::types::infer::builder::suspicious_conditions::exemptions::definition_contains_special_cased_condition 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":"crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/exemptions.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"6279fe8ac142396fb58bef60ea5a62202e6dec549cd92d1bec8b6ab6321a4a39"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::typed_dict::extract_unpacked_typed_dict_from_value_type (cyclomatic 20): ty_python_semantic::types::typed_dict::extract_unpacked_typed_dict_from_value_type 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/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5b0373044dcdaa7734f19031411bbfe39d2eda730460aa4b80cdbd50d291c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor.Editor (cyclomatic 20): Editor.Editor has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 175, handleSecondaryToolSelected, a function literal at line 142, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/ruff/src/Editor/Editor.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8737875fc4eca47bf5433f18425c970ae3ade4aa04917fa052a1d26e4999280b"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::pre_process (cyclomatic 19): ruff_annotate_snippets::renderer::render::pre_process has cyclomatic complexity 19 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":2727}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a83952e757cd83c3b1f274a92b5421d6276d996b2cba1169f7a0fcdbf8c1d3"}},{"ruleId":"D1","level":"warning","message":{"text":"GithubRenderer::render (cyclomatic 19): GithubRenderer::render 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":"crates/ruff_db/src/diagnostic/render/github.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a9687d3f98d50d26666fe841ed1e20877f4881a5185dc813fb68e1090079a6"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::visit_stmt (cyclomatic 19): Collector::visit_stmt 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":"crates/ruff_graph/src/collector.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"23337090c4bbbd4dd43acd54b482d7651baf6f6031feda4033e9e17370108541"}},{"ruleId":"D1","level":"warning","message":{"text":"SuppressionsBuilder::load_from_tokens (cyclomatic 19): SuppressionsBuilder::load_from_tokens 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":"crates/ruff_linter/src/suppression.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4054640418ff09edd7b54ff0a152806b716dd7ea3d499ae8eb7d6e37594d8ce"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::fix::codemods::remove_imports (cyclomatic 19): ruff_linter::fix::codemods::remove_imports 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":"crates/ruff_linter/src/fix/codemods.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d0a72af97b9128698d6fa746903ae114f4b676c584687ee02d1caa6bbbcc61"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_map (cyclomatic 19): ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_map 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":"crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1f96a3b01173558475a364741cd419977140b35d54d03c3eceb59e1844b38d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::non_self_return_type::non_self_return_type (cyclomatic 19): ruff_linter::rules::flake8_pyi::rules::non_self_return_type::non_self_return_type has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pyi/rules/non_self_return_type.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d56f8a91fe8a8ecf4be065eec1e7d76a911bbf14fb0ed43c6d3e72b76984c2d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_return::rules::function::unnecessary_assign (cyclomatic 19): ruff_linter::rules::flake8_return::rules::function::unnecessary_assign 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":"crates/ruff_linter/src/rules/flake8_return/rules/function.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dd75c51e4f4e936e94567382b223bf07d409696142a5c177f886164ea07194"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_self::rules::private_member_access::private_member_access (cyclomatic 19): ruff_linter::rules::flake8_self::rules::private_member_access::private_member_access 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":"crates/ruff_linter/src/rules/flake8_self/rules/private_member_access.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"660c2f5d834da828360bc7b833b7d70ac9cee16f7aa2547ef7e27d5306f6bd88"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_dict_lookup::if_else_block_instead_of_dict_lookup (cyclomatic 19): ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_dict_lookup::if_else_block_instead_of_dict_lookup 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":"crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_lookup.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b5ea01ccc800ce05cf77942f43657cde6beb57c065141998d60672ad192f75"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::import_private_name::import_private_name (cyclomatic 19): ruff_linter::rules::pylint::rules::import_private_name::import_private_name 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":"crates/ruff_linter/src/rules/pylint/rules/import_private_name.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"931e12aef60ac24be68735f301a3a17ab48a29d50f7a228ef17712b388c80cb5"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::logging::logging_call (cyclomatic 19): ruff_linter::rules::pylint::rules::logging::logging_call 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":"crates/ruff_linter/src/rules/pylint/rules/logging.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"880cea5df39244e98c07dab77cd47303c868ae2e562d6aad51d271a32387bbea"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::missing_fstring_syntax::should_be_fstring (cyclomatic 19): ruff_linter::rules::ruff::rules::missing_fstring_syntax::should_be_fstring 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":"crates/ruff_linter/src/rules/ruff/rules/missing_fstring_syntax.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c24dbf6c8b4e67d26497d08688c2272590fb1def9660db81e340f615ccfbe34"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatExprSlice::fmt_fields (cyclomatic 19): FormatExprSlice::fmt_fields 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":"crates/ruff_python_formatter/src/expression/expr_slice.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e12cb30c31be06b7cec18df5c987b1cd3334b61eea573d8279015e1e319ec0"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatParameters::fmt_fields (cyclomatic 19): FormatParameters::fmt_fields has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/other/parameters.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafa495a303848854ab96f533a8263b9e31eb11251c7a8316d9657d59f2e2fdf"}},{"ruleId":"D1","level":"warning","message":{"text":"ClauseHeader::visit (cyclomatic 19): ClauseHeader::visit 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":"crates/ruff_python_formatter/src/statement/clause.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e928a0e8848756998a10b7a14ca32aaa7c6e60db75ab68e3efb352f90af518"}},{"ruleId":"D1","level":"warning","message":{"text":"StringNormalizer::preferred_quote_style (cyclomatic 19): StringNormalizer::preferred_quote_style 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":"crates/ruff_python_formatter/src/string/normalize.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"757910e78dc0957c69dbd84aca97a855df1007451b8f1e2bd0023f905cefb8c5"}},{"ruleId":"D1","level":"warning","message":{"text":"UnicodeEscape::normalize (cyclomatic 19): UnicodeEscape::normalize 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":"crates/ruff_python_formatter/src/string/normalize.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4aeca2dfdb74a842b3560e063a2da1f42df274bf5a1ab5b540c9e0b66a920c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_formatter::string::normalize::normalize_string (cyclomatic 19): ruff_python_formatter::string::normalize::normalize_string 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":"crates/ruff_python_formatter/src/string/normalize.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"054128b951c111fe41e2981be172a99ef0ecd16b7782a17bbb0d32816b4483ee"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_semantic::analyze::class::any_member_declaration::any_stmt_in_body (cyclomatic 19): ruff_python_semantic::analyze::class::any_member_declaration::any_stmt_in_body 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":"crates/ruff_python_semantic/src/analyze/class.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"502fbe42fdbdb6a3d65b395119813a53fdc8542774a06f148e5c64aeaf63a4a8"}},{"ruleId":"D1","level":"warning","message":{"text":"RuffSettingsIndex::new (cyclomatic 19): RuffSettingsIndex::new has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5821c5a9a50b09d6a2456f0e3ba2236f8d0db9a9c0482556201af30fca87c4"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_server::lint::to_lsp_diagnostic (cyclomatic 19): ruff_server::lint::to_lsp_diagnostic 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":"crates/ruff_server/src/lint.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b4d803e139940c2fd716bd6435e249371d248e42840e4056736c4762d865a7"}},{"ruleId":"D1","level":"warning","message":{"text":"CallableBinding::filter_overloads_using_any_or_unknown (cyclomatic 19): CallableBinding::filter_overloads_using_any_or_unknown 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4400}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f41a6b995aba04338e3a318a62cce115462b172ec5f12a148ed9b9f1d2c8e3"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentMatcher::match_unpacked_variadic (cyclomatic 19): ArgumentMatcher::match_unpacked_variadic 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":5620}}}],"partialFingerprints":{"codehealthFindingId/v1":"88941c45ae5485de5195b078a753bbc8864650efeb6749be1973aba767c42059"}},{"ruleId":"D1","level":"warning","message":{"text":"SolutionWalker::binary_lower_bound_visits (cyclomatic 19): SolutionWalker::binary_lower_bound_visits 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":"crates/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"443df714c7e3596084c87b2187013983ba60488275ba0dce0ce9e6e82fc3fa92"}},{"ruleId":"D1","level":"warning","message":{"text":"SolutionWalker::attribute_typevar_failures (cyclomatic 19): SolutionWalker::attribute_typevar_failures 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":"crates/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ed311d339555306e436e352943db573d11e7afeb7ce705f450573c0c36b84b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_typing_namedtuple_fields (cyclomatic 19): TypeInferenceBuilder::infer_typing_namedtuple_fields has cyclomatic complexity 19 (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/ty_python_semantic/src/types/infer/builder/named_tuple.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6ac5d955a67da902f92550646f7f862d15097580eb69fbaf074ae535546740"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_dict_expression (cyclomatic 19): TypeInferenceBuilder::infer_dict_expression 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: TypeInferenceBuilder::infer_value_expression_impl (cyclomatic 33) 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":7856}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d4eec786ec1d65e4dcecdbc09d461c56b75e3d24974b8b01e9f4b93edaff43"}},{"ruleId":"D1","level":"warning","message":{"text":"VariableLengthTuple::mixed_forward_slice_plan (cyclomatic 19): VariableLengthTuple::mixed_forward_slice_plan 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":"crates/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9b8876cd9ea7e1e7f65f9a26662e031746ec8b0fff9c7b659dfd1efb74ed87"}},{"ruleId":"D1","level":"warning","message":{"text":"Unpacker::unpack_inner (cyclomatic 19): Unpacker::unpack_inner has cyclomatic complexity 19 (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/ty_python_semantic/src/types/unpacker.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2196b3d9dc44054d091ced33d47a2d99ac6de2cea117ebdbecef1ac55a406134"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::attribute_write::descriptor_setter_signature_domain (cyclomatic 19): ty_python_semantic::types::attribute_write::descriptor_setter_signature_domain has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09f5432683fa01bf5c5812d26b4924a1f4ae6525bd1335f6df30adac6d3e249"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::known_instance::walk_known_instance_type (cyclomatic 19): ty_python_semantic::types::known_instance::walk_known_instance_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. This is NOT this file\u0027s highest cyclomatic complexity: KnownInstanceType::recursive_type_normalized_impl (cyclomatic 24) 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/ty_python_semantic/src/types/known_instance.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b027f3257bc1d05bf9e53d6450db70d52d20275b3f3d64acd67cb1fafce571"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::match_pattern::definite_match_pattern_type_for_subject_impl (cyclomatic 19): ty_python_semantic::types::match_pattern::definite_match_pattern_type_for_subject_impl has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/match_pattern.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4caf08b81eb48f05a842e64f5506b433a64de006a6d69fc27b6e668d940f4d"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::check_override (cyclomatic 19): ty_python_semantic::types::overrides::attributes::check_override has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"373600a4a26f5006f950d559ed1bb5a07575e005fa3e21b6c440ce8d71d673fe"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff::diagnostics::lint_stdin (cyclomatic 18): ruff::diagnostics::lint_stdin 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/ruff/src/diagnostics.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0f4ca6c61b922b4287e9045cdfb27ab74df7c3abf693c2e752878df6ebca3b"}},{"ruleId":"D1","level":"warning","message":{"text":"ConciseRenderer::render (cyclomatic 18): ConciseRenderer::render 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/ruff_db/src/diagnostic/render/concise.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c1b32994fd7c8b3ba833ed7191f3838c4da44e0310f6120c4cf23804a4de54"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::handle_node_store (cyclomatic 18): Checker::handle_node_store 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":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":2905}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a9041f2be735e6aa9b10b87872f4cfcd860d9d90a8da6616c0564844d94881"}},{"ruleId":"D1","level":"warning","message":{"text":"SuspiciousVariablesVisitor::visit_expr (cyclomatic 18): SuspiciousVariablesVisitor::visit_expr 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/ruff_linter/src/rules/flake8_bugbear/rules/function_uses_loop_variable.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b544f5262b31f9d54f614445e698b97daf37c9700f75a0ce6946c6ed4f8b8318"}},{"ruleId":"D1","level":"warning","message":{"text":"UselessSuppressionComments::check_suppression_comment (cyclomatic 18): UselessSuppressionComments::check_suppression_comment 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/ruff_linter/src/rules/ruff/rules/invalid_formatter_suppression_comment.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2247b9f04fcbd624eb43e9b8f7b9a430b5eb32bb549f127a0629ccace0fab0"}},{"ruleId":"D1","level":"warning","message":{"text":"ReFunc::from_call_expr (cyclomatic 18): ReFunc::from_call_expr 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/ruff_linter/src/rules/ruff/rules/unnecessary_regular_expression.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2ecb955fae789d630ca5e8543b5bdc6c1f34f4cfe1ce2e14e62a8e8624e7a0"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_async::rules::long_sleep_not_forever::long_sleep_not_forever (cyclomatic 18): ruff_linter::rules::flake8_async::rules::long_sleep_not_forever::long_sleep_not_forever 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":"crates/ruff_linter/src/rules/flake8_async/rules/long_sleep_not_forever.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadb0259ac0b88a540919e9366cb2a0a6996b4093058b2165ff1246aa7b84f67"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::redundant_numeric_union::check_annotation (cyclomatic 18): ruff_linter::rules::flake8_pyi::rules::redundant_numeric_union::check_annotation 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":"crates/ruff_linter/src/rules/flake8_pyi/rules/redundant_numeric_union.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3278a968d2082b4a39d1dd7f4e697e92b6be7df7a2480bf612ec02c167a85f06"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flynt::rules::static_join_to_fstring::build_fstring (cyclomatic 18): ruff_linter::rules::flynt::rules::static_join_to_fstring::build_fstring 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/ruff_linter/src/rules/flynt/rules/static_join_to_fstring.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bba24031aface25414e8ce3297cc9fb70a884b2bb5ca4bd9c98b46735c80659"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::mccabe::rules::function_is_too_complex::get_complexity_number (cyclomatic 18): ruff_linter::rules::mccabe::rules::function_is_too_complex::get_complexity_number 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":"crates/ruff_linter/src/rules/mccabe/rules/function_is_too_complex.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bec947204ad01a599b3258e11eec594cafca5b2127a0006ffb889cb294fe22c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::missing_whitespace::missing_whitespace (cyclomatic 18): ruff_linter::rules::pycodestyle::rules::logical_lines::missing_whitespace::missing_whitespace 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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/missing_whitespace.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"544f654d1623f3f243acaf514601b18a5fa796158172f83d3073411aba9d8b7c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::printf_string_formatting::handle_part (cyclomatic 18): ruff_linter::rules::pyupgrade::rules::printf_string_formatting::handle_part 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/ruff_linter/src/rules/pyupgrade/rules/printf_string_formatting.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e103fd7e984ef45da8dfbd2a0675f5915bbf57d18b99f3649fb2cbba54dd2a"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::printf_string_formatting::convertible (cyclomatic 18): ruff_linter::rules::pyupgrade::rules::printf_string_formatting::convertible 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/ruff_linter/src/rules/pyupgrade/rules/printf_string_formatting.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73835a887178a04ed7237e14272c0c4303e8148ad1f9d24e7ce05636bdd8235"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::printf_string_formatting::printf_string_formatting (cyclomatic 18): ruff_linter::rules::pyupgrade::rules::printf_string_formatting::printf_string_formatting 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/ruff_linter/src/rules/pyupgrade/rules/printf_string_formatting.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b627f7f441bfa52b0db9d44034e378f368944e0a3df48f801e0dd44bd75dd5"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryLike::fmt (cyclomatic 18): BinaryLike::fmt 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/ruff_python_formatter/src/expression/binary_like.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f42031f53ba8aa80fa7a7b39e010213f946ba1eff7e0272d1aa5cde57a7e27"}},{"ruleId":"D1","level":"warning","message":{"text":"ClauseHeader::first_keyword_range (cyclomatic 18): ClauseHeader::first_keyword_range 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/ruff_python_formatter/src/statement/clause.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d33ff51f1cdc07a306b772f3d9eaefca0ec20d97b7d127a1ee4816ca0bd192"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_interpolated_element (cyclomatic 18): Parser::parse_interpolated_element 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: Parser::parse_primary_expression (cyclomatic 19) 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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"8948bd4bafec8d57f1acf2d7e4eefb1d31b6dc90e546b0f090a4e349a7dae008"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticSyntaxChecker::check_annotation (cyclomatic 18): SemanticSyntaxChecker::check_annotation 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/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a76068ecc2b6b00a062ed9f2b4bd47dfd39c69aceff737939095ac4713b8e9f"}},{"ruleId":"D1","level":"warning","message":{"text":"NotebookDocument::update (cyclomatic 18): NotebookDocument::update 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/ruff_server/src/edit/notebook.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b09f242093989927864a21d945589e2e99f2019f5994105c5f884f95913040"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeActions::run_with_snapshot (cyclomatic 18): CodeActions::run_with_snapshot 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/ruff_server/src/server/api/requests/code_action.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f0432d9dada8b836e4c190d87342c635c497560832beb8d4a2d130109f66f8"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonFilesVisitor::visit (cyclomatic 18): PythonFilesVisitor::visit 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/ruff_workspace/src/resolver.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf149f4f26c51cfe04074405427af1fb42e3c0fab57b7d93346b7684c08ec15"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticTokenVisitor::classify_from_type_for_attribute (cyclomatic 18): SemanticTokenVisitor::classify_from_type_for_attribute 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/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fbd85e044b0322a546693439a528e884244b8c30c7d943e44b80eebf69a09c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExportFinder::visit_stmt (cyclomatic 18): ExportFinder::visit_stmt 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/ty_python_core/src/re_exports.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f895159f9f02baa2259e1df258121ae95562d51ecc6d45d9127b7dc52924734"}},{"ruleId":"D1","level":"warning","message":{"text":"Binding::argument_type_context (cyclomatic 18): Binding::argument_type_context 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8996}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99b618d52fa8d6ab8ed1609b0d2b9f360cff41b997f7f9b886070ca3a394b15"}},{"ruleId":"D1","level":"warning","message":{"text":"MroLookup::class_member (cyclomatic 18): MroLookup::class_member 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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa2f38658292950d41c80aec093b2c9e28a5fee6102a1770d6ccea0febc3bba"}},{"ruleId":"D1","level":"warning","message":{"text":"SolutionWalker::constraint_failure_evidence (cyclomatic 18): SolutionWalker::constraint_failure_evidence 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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3f2305bb6fc4ee991538ae6c454326184f7c411e628a5cb8bb05ca61fe218e"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::validate_dynamic_type_bases (cyclomatic 18): TypeInferenceBuilder::validate_dynamic_type_bases 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/ty_python_semantic/src/types/infer/builder/dynamic_class.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccc580b1b77ede14cb62d85c7a66de73c964f4b4a8597199a73b16a113ae561"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::check_suite_for_redundant_conditions (cyclomatic 18): TypeInferenceBuilder::check_suite_for_redundant_conditions 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/ty_python_semantic/src/types/infer/builder/suspicious_conditions/mod.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c33a47a7827634c9f2399c5650e5d22a7c6c7f736af6ea7855c472f0469c12"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::add_binding (cyclomatic 18): TypeInferenceBuilder::add_binding 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. This is NOT this file\u0027s highest cyclomatic complexity: TypeInferenceBuilder::infer_value_expression_impl (cyclomatic 33) 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eb4720b2d0c8650f473539c5c7e52034f271e3e450cc136868b5f1757280f0"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_nested_match_pattern (cyclomatic 18): TypeInferenceBuilder::infer_nested_match_pattern 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. This is NOT this file\u0027s highest cyclomatic complexity: TypeInferenceBuilder::infer_value_expression_impl (cyclomatic 33) 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2988}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e53e4864f2f9bf842991f862916b6bc179f75c1fcfec098f67e16c7f1a670ec"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRelationChecker::check_protocol_member_read (cyclomatic 18): TypeRelationChecker::check_protocol_member_read 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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e5ac97250184bad61b73c7c2520a7809e99fed4a47d20e8361aae33479a349"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRelationChecker::check_protocol_member_access_pair (cyclomatic 18): TypeRelationChecker::check_protocol_member_access_pair 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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a264e952b8f1843b2474f50cc6f37fc2745394c95b27dcb7047f7abc37dd8371"}},{"ruleId":"D1","level":"warning","message":{"text":"Signature::bind_self_with_receiver (cyclomatic 18): Signature::bind_self_with_receiver 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":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2da08f65f16d52b1c31a6674b1cd126bdddd9b78e25a9d36931596c6ff517f"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::definition_resolution::definitions_for_attribute (cyclomatic 18): ty_python_semantic::types::definition_resolution::definitions_for_attribute 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":"crates/ty_python_semantic/src/types/definition_resolution.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0cedc3ff7cb5f0229da1132cba3e62843114744555c2e82131cb7a2f7c6ada"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::equality::compare_literal_to_other (cyclomatic 18): ty_python_semantic::types::equality::compare_literal_to_other 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":"crates/ty_python_semantic/src/types/equality.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"8896e39a9a3f310e1b9773092f95cb51cd3eb07192653133b8e565bd278b2f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::static_class::check_inferred_classvars (cyclomatic 18): ty_python_semantic::types::infer::builder::post_inference::static_class::check_inferred_classvars 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/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8839e664ec1bbaa62c53fe16742105ab88a0cf80c789aa75f791ca68bc0594bf"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::static_class::check_class_namespace_against_metaclass_members (cyclomatic 18): ty_python_semantic::types::infer::builder::post_inference::static_class::check_class_namespace_against_metaclass_members 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/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a87d014548ba77b806f92a5a99d97d5d65b6106d122ef95ef074c4b120dc4c"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::unbound_member_contract (cyclomatic 18): ty_python_semantic::types::overrides::attributes::unbound_member_contract 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":"crates/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdceccc1a18e9df2856662621deb61778550c17b8e90891b46cd5ebae1f1891"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::visitor::dynamic_content_impl (cyclomatic 18): ty_python_semantic::types::visitor::dynamic_content_impl 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. This is NOT this file\u0027s highest cyclomatic complexity: TypeKind::from (cyclomatic 25) 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/ty_python_semantic/src/types/visitor.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0adebfddeebe57a8e672f42d2070c767c3f87ec6481c307a30a00c76fdbf93e"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::main_loop (cyclomatic 18): Server::main_loop 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/ty_server/src/server/main_loop.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d21a24c8dcbb8aee5b69c5af8589c4fb63b76c66202ea9870c93448971f4c9b"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_edits::call::unwrapped_call_argument (cyclomatic 18): ruff_python_edits::call::unwrapped_call_argument 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":"crates/ruff_python_edits/src/call.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d8f4aaa6a0a679daff0f9a9bc9439488a91836ed481d4e75ec1660f285c8be"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_fill_entries (cyclomatic 17): Printer::print_fill_entries 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/ruff_formatter/src/printer/mod.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"312ec8e979b3d0142123ecc82a512938ba798dac87fa66a9554cbac384f0a4ca"}},{"ruleId":"D1","level":"warning","message":{"text":"ReturnVisitor::visit_stmt (cyclomatic 17): ReturnVisitor::visit_stmt 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/ruff_linter/src/rules/flake8_return/visitor.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"047705379e5b6c2103af477813424339f15f9ccd35283fc53ae428396e15f63d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_bugbear::rules::class_as_data_structure::class_as_data_structure (cyclomatic 17): ruff_linter::rules::flake8_bugbear::rules::class_as_data_structure::class_as_data_structure has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bugbear/rules/class_as_data_structure.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0984f42a3e45b1856e78ecaf5b8de156e51f16e219ca0bd45cc6d23bb3773b7"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_comprehensions::rules::unnecessary_map::unnecessary_map (cyclomatic 17): ruff_linter::rules::flake8_comprehensions::rules::unnecessary_map::unnecessary_map 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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_map.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9856f40bcfe0c0fc0acbf60c75367e6c51c927615b1cce58a84033e143a4f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_errmsg::rules::string_in_exception::string_in_exception (cyclomatic 17): ruff_linter::rules::flake8_errmsg::rules::string_in_exception::string_in_exception 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/ruff_linter/src/rules/flake8_errmsg/rules/string_in_exception.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d21fb7fbc4c5eab235bf4398f22814f83c9901712bd7b4b547ed67a7570e5c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_pie::rules::unnecessary_spread::unnecessary_spread_fix (cyclomatic 17): ruff_linter::rules::flake8_pie::rules::unnecessary_spread::unnecessary_spread_fix 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/ruff_linter/src/rules/flake8_pie/rules/unnecessary_spread.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefe66409416b7256e220dbf058beba8dd9711e65138f3e8fce625af78328df2"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::perflint::rules::unnecessary_list_cast::match_mutation (cyclomatic 17): ruff_linter::rules::perflint::rules::unnecessary_list_cast::match_mutation 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/ruff_linter/src/rules/perflint/rules/unnecessary_list_cast.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"35130c324fd5a2ace952921835e5130cb5ebbedc7f1d5ba2c7b0505565ea28d7"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::unspecified_encoding::is_violation (cyclomatic 17): ruff_linter::rules::pylint::rules::unspecified_encoding::is_violation 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/ruff_linter/src/rules/pylint/rules/unspecified_encoding.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebb6287ca44e72641f4008c500b056aff37b6c708785abf4bed2b0a0659bf4c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::logging_eager_conversion::logging_eager_conversion (cyclomatic 17): ruff_linter::rules::ruff::rules::logging_eager_conversion::logging_eager_conversion 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/ruff_linter/src/rules/ruff/rules/logging_eager_conversion.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae2ccbbd2046d1bf451c505dd7defdc6ba00495346c65fc7f1c02a370a652da"}},{"ruleId":"D1","level":"warning","message":{"text":"HashableExpr::from (cyclomatic 17): HashableExpr::from has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 3 function items inside it that branch (as_number, as_hashable_constant, as_hashable). 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. This is NOT this file\u0027s highest cyclomatic complexity: ComparableExpr::hash (cyclomatic 33) 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/ruff_python_ast/src/comparable.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"100b0ca0a38bd3169e1d3a904ed98a075e26c1a04dfd3f2a650926e97b9b67a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::unparse_pattern (cyclomatic 17): Generator::unparse_pattern 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":"crates/ruff_python_codegen/src/generator.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a57bc974a1c2c9ff49b6e6311df2399f113e7f4ce30e3838b9176f9b6a6036c"}},{"ruleId":"D1","level":"warning","message":{"text":"MaybeParenthesizeExpression::fmt (cyclomatic 17): MaybeParenthesizeExpression::fmt 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: ruff_python_formatter::expression::format_with_parentheses_comments (cyclomatic 35) 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/ruff_python_formatter/src/expression/mod.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2120299d0ecd90ecae40f379f03231d686a7cd3359d32bf0d11f0e79fd9fbe4"}},{"ruleId":"D1","level":"warning","message":{"text":"UnicodeEscape::display_escapes (cyclomatic 17): UnicodeEscape::display_escapes 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/ruff_python_literal/src/escape.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f8f8979d9bd8d9053522ba65bd21a8c0b26c79a6e8ccc9230e3b84d25cca38"}},{"ruleId":"D1","level":"warning","message":{"text":"CFGBuilder::process_stmts (cyclomatic 17): CFGBuilder::process_stmts 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/ruff_python_semantic/src/cfg/graph.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45b5d53344ebd6366c611eeb0b808526171301700e28031f15a7b6b447d1af3"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_module_resolver::module_glob::glob_to_regex (cyclomatic 17): ty_module_resolver::module_glob::glob_to_regex 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/ty_module_resolver/src/module_glob.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb890c928da3862080057c5f503382b41b7a16368a4458c2a4e328f84366cb9"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentTypeChecker::evaluate_paramspec_sub_call (cyclomatic 17): ArgumentTypeChecker::evaluate_paramspec_sub_call 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8085}}}],"partialFingerprints":{"codehealthFindingId/v1":"861ace820c9f3ffe84aeb066137bc45746cd2d8ceda199e8bba6e5ccca06ad83"}},{"ruleId":"D1","level":"warning","message":{"text":"CallInference::infer_legacy (cyclomatic 17): CallInference::infer_legacy 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6970}}}],"partialFingerprints":{"codehealthFindingId/v1":"393536c0fda80534e34a4f03e52e3564dc2a82860e332d9404b874fd87e41f2a"}},{"ruleId":"D1","level":"warning","message":{"text":"CallableDescription::new_with_settings (cyclomatic 17): CallableDescription::new_with_settings has cyclomatic complexity 17 (threshold 15). Of this number, 15 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":10080}}}],"partialFingerprints":{"codehealthFindingId/v1":"0261c0ce78876eb69032d01deeb28a0e0aef066fba4fd0978e773285acfad841"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticClassLiteral::slot_definition (cyclomatic 17): StaticClassLiteral::slot_definition 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/ty_python_semantic/src/types/class/slots.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"4065c3e96280b799309134161762901135fc2ee7319f9fad430134bdfe8bccad"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassType::into_callable_with_receiver (cyclomatic 17): ClassType::into_callable_with_receiver 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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e7de88a04d4ae2a06b9b20f43c3ea1c44574f53079d4564d00d0ff1d43714c"}},{"ruleId":"D1","level":"warning","message":{"text":"OverloadLiteral::raw_signature (cyclomatic 17): OverloadLiteral::raw_signature has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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/ty_python_semantic/src/types/function.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f06dad21858bb9bf1d554a997bd4aa5de72b7fd18225713fef9461f16a61745"}},{"ruleId":"D1","level":"warning","message":{"text":"Parameters::with_transformed_parameters (cyclomatic 17): Parameters::with_transformed_parameters 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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5282}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb941727c8292841487a37ae60212624e5e5d010f9ecab9665983ff5ef60a27"}},{"ruleId":"D1","level":"warning","message":{"text":"Tuple::try_for_each_element_pair (cyclomatic 17): Tuple::try_for_each_element_pair has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":2738}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c18b69e83b7fdf5fcb762062e3b2b59ae3d543a0e8ff8a47ca7aeee8e4c8b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::try_call_dunder_get (cyclomatic 17): Type::try_call_dunder_get has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (try_call_dunder_get_inner). 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. This is NOT this file\u0027s highest cyclomatic complexity: Type::is_singleton (cyclomatic 32) 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/ty_python_semantic/src/types.rs"},"region":{"startLine":5200}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a79bb5e551c5be456d2224e1148b9246238b6791f3474de1d85e8a9d09b16d"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::diagnostic::report_overridden_final_method (cyclomatic 17): ty_python_semantic::types::diagnostic::report_overridden_final_method 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":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5540}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9afb4f68a8a55e4220b49ca007ed85b34aea8f43f282d21f20808737bfe2b1"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::equality::known_literal_equality (cyclomatic 17): ty_python_semantic::types::equality::known_literal_equality 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/ty_python_semantic/src/types/equality.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"811f11016caf73480e2a4c2b6ac540204ec95ebd6f47ca052fe3adb5090017a2"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::overrides::check_inherited_conflicts (cyclomatic 17): ty_python_semantic::types::overrides::check_inherited_conflicts 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/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"363237da0d9efc362b4733247eb29848659bf4c34bc4282218ab5e1c509f7234"}},{"ruleId":"D1","level":"warning","message":{"text":"Files.FileEntry (cyclomatic 17): Files.FileEntry has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/ty/src/Editor/Files.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b016a5ad0216b7fdce096497e389e4c93c06927c85e13c26f4a21a2cd6bbafcb"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff::commands::format::format_source (cyclomatic 16): ruff::commands::format::format_source 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/ruff/src/commands/format.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"76153ed4fedc3172df7f7f6e6e82686ffbfbd44a19afd29e3f8a81e2beb7a9bc"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_dev::generate_rules_table::generate_table (cyclomatic 16): ruff_dev::generate_rules_table::generate_table 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/ruff_dev/src/generate_rules_table.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc31e78fda5d5e029de06ee73b68b939868c85cf89f2afc499d82dd64eb9550"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::noqa::find_suppression_comments (cyclomatic 16): ruff_linter::noqa::find_suppression_comments 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/ruff_linter/src/noqa.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"452cec5efcad3c511f1d2f25e1ef2bae41f2842ce2f31cfeb5313e625690399a"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_2020::rules::compare::compare (cyclomatic 16): ruff_linter::rules::flake8_2020::rules::compare::compare 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/ruff_linter/src/rules/flake8_2020/rules/compare.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9e74e02ea4322a7f8c2913b36f2471d11c92a205a6d56a42e6378dda5cfbc2"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_async::rules::async_zero_sleep::async_zero_sleep (cyclomatic 16): ruff_linter::rules::flake8_async::rules::async_zero_sleep::async_zero_sleep 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/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"51770620e36a43325f8c2f33272908e66736e6eb146996e331406273f7b53cb7"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_pie::rules::multiple_starts_ends_with::multiple_starts_ends_with (cyclomatic 16): ruff_linter::rules::flake8_pie::rules::multiple_starts_ends_with::multiple_starts_ends_with 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/ruff_linter/src/rules/flake8_pie/rules/multiple_starts_ends_with.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb9d3f034bf20e207b9bb052210bbe2fe3d7b842c15aab7eddfd50a98032460"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::simple_defaults::is_valid_default_value_with_annotation (cyclomatic 16): ruff_linter::rules::flake8_pyi::rules::simple_defaults::is_valid_default_value_with_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":"crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b5c3e89a3ffe7840294bc8c5cd89d1455fd5cb7b01b62b95a465d6729bf8a6"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_raise::rules::unnecessary_paren_on_raise_exception::unnecessary_paren_on_raise_exception (cyclomatic 16): ruff_linter::rules::flake8_raise::rules::unnecessary_paren_on_raise_exception::unnecessary_paren_on_raise_exception 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/ruff_linter/src/rules/flake8_raise/rules/unnecessary_paren_on_raise_exception.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7ff83b87ca6346db7795d1ae0a7691336519f14e47aee8b1655a703c08f9f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::flake8_type_checking::rules::type_alias_quotes::collect_typing_references (cyclomatic 16): ruff_linter::rules::flake8_type_checking::rules::type_alias_quotes::collect_typing_references 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/ruff_linter/src/rules/flake8_type_checking/rules/type_alias_quotes.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdc22d0eb853d600cb6f72dee0b43b471424dc5a2cb1a676a486227c427c455"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::isort::order::order_imports (cyclomatic 16): ruff_linter::rules::isort::order::order_imports 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/ruff_linter/src/rules/isort/order.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d589c82ae7e6e3597ca2f187300d333d6dc12052bb791da4210fa5850c1d9b"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::blank_before_after_function::blank_before_after_function (cyclomatic 16): ruff_linter::rules::pydocstyle::rules::blank_before_after_function::blank_before_after_function 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/ruff_linter/src/rules/pydocstyle/rules/blank_before_after_function.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dc278985444b46cc3117c63240aeb48adb95fc85ef89df60c0f269cb9299a0"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::not_missing::not_missing (cyclomatic 16): ruff_linter::rules::pydocstyle::rules::not_missing::not_missing 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/ruff_linter/src/rules/pydocstyle/rules/not_missing.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b743de9d684c11f314e62e72b975ac68ddab5bfd68681ceaa97e0bef039c61"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::sections::missing_args (cyclomatic 16): ruff_linter::rules::pydocstyle::rules::sections::missing_args has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ruff_linter::rules::pydocstyle::rules::sections::numpy_section_order (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"b085fbbd2edf99b5fa9b4337e3b83cb0aaed3a19df0b9a024d3c7d38f3b57068"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pyflakes::rules::invalid_literal_comparisons::locate_cmp_ops (cyclomatic 16): ruff_linter::rules::pyflakes::rules::invalid_literal_comparisons::locate_cmp_ops 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/ruff_linter/src/rules/pyflakes/rules/invalid_literal_comparisons.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb37596246b9358abcc1fed7a19685349b394c17b038b01153ab968f4c74a184"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::repeated_equality_comparison::repeated_equality_comparison (cyclomatic 16): ruff_linter::rules::pylint::rules::repeated_equality_comparison::repeated_equality_comparison 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/ruff_linter/src/rules/pylint/rules/repeated_equality_comparison.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5e3d42c532e1a846d3c988f91aa501395e938f45be7fe9b8e54e05d1b48494"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::ambiguous_unicode_character::ambiguous_unicode_character (cyclomatic 16): ruff_linter::rules::ruff::rules::ambiguous_unicode_character::ambiguous_unicode_character 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/ruff_linter/src/rules/ruff/rules/ambiguous_unicode_character.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26b7830fa3d05b572edeaf28fcbe738b2024fbc999950db0cdba5971bfebe39"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::sort_dunder_slots::sort_dunder_slots (cyclomatic 16): ruff_linter::rules::ruff::rules::sort_dunder_slots::sort_dunder_slots 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/ruff_linter/src/rules/ruff/rules/sort_dunder_slots.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59f0529ff8fb5ce1ca3854af52e5bea4d925ae80332569ea1801ab47681c4d0"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_macros::rule_namespace::derive_impl (cyclomatic 16): ruff_macros::rule_namespace::derive_impl 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/ruff_macros/src/rule_namespace.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f14523e21fa73ec995e5bb0b738665d12a4d9c230d135d03e0d4d34937b2d6b"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_markdown::format_code_blocks (cyclomatic 16): ruff_markdown::format_code_blocks 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/ruff_markdown/src/lib.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"186b5d1be0a5f8fe1cdd2be397b82633fba8be20842dfe642fad5b667c0f7326"}},{"ruleId":"D1","level":"warning","message":{"text":"ComparablePattern::eq (cyclomatic 16): ComparablePattern::eq has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ComparableExpr::hash (cyclomatic 33) 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/ruff_python_ast/src/comparable.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b56c8c327538cdb74e55535485b8879ea7244208232f0b656b8a1d08e202a6"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_lhs_expression (cyclomatic 16): Parser::parse_lhs_expression 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: Parser::parse_primary_expression (cyclomatic 19) 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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a1c2eb0a21f40598e78435713883f56a918495504153f4360033f9e9b38d84"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_set_or_dict_like_expression (cyclomatic 16): Parser::parse_set_or_dict_like_expression 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: Parser::parse_primary_expression (cyclomatic 19) 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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfa827a384d8f1bf540633185032996e01d8955b31a36e36f8fb2a9678ac5ae"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticSyntaxChecker::debug_shadowing (cyclomatic 16): SemanticSyntaxChecker::debug_shadowing 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":"crates/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d92b7a15ec69270c0b401aa44e8701e97ac23d3e534df8c479f9013d437635a"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_parser::parser::recovery::pattern_to_expr (cyclomatic 16): ruff_python_parser::parser::recovery::pattern_to_expr 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/ruff_python_parser/src/parser/recovery.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f75155461a02541f5e6baec95027b2f48e217a468d42eb1fb3a700408481cf8"}},{"ruleId":"D1","level":"warning","message":{"text":"ruff_python_semantic::analyze::terminal::sometimes_breaks (cyclomatic 16): ruff_python_semantic::analyze::terminal::sometimes_breaks 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: Terminal::branch (cyclomatic 24) 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/ruff_python_semantic/src/analyze/terminal.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b47598b54c3868745fdaa41f4484404c566005a00a314322733f32a8107960b"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentRanges::block_comments (cyclomatic 16): CommentRanges::block_comments 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/ruff_python_trivia/src/comment_ranges.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3b0fc33fbf321af5428714331a369ea0bec89601928a0f21d773a79d2b298d"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_ide::semantic_tokens::script_metadata_tokens (cyclomatic 16): ty_ide::semantic_tokens::script_metadata_tokens has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: SemanticTokenType::as_lsp_concept (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c378b25d79007717bdc5df4b9e5ef9f88f6945ed7c083891e09de002bee201d"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_module_resolver::resolve::is_pkgutil_extend_path (cyclomatic 16): ty_module_resolver::resolve::is_pkgutil_extend_path 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"94493c03f1144b0f5880b20e4b4e8d0fdb167bdfaef82dd79f06d893e9731703"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticIndexBuilder::visit_bool_expression (cyclomatic 16): SemanticIndexBuilder::visit_bool_expression 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/ty_python_core/src/builder.rs"},"region":{"startLine":3779}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8700d1da870c244250eec3cb1ac3e0b42086835bb9246854c90f35e2e2be91"}},{"ruleId":"D1","level":"warning","message":{"text":"Importer::import_for_diagnostic (cyclomatic 16): Importer::import_for_diagnostic 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/ty_python_semantic/src/importer.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba5abdaf060c8f1fd2a2de029e7446efc76cf5b4e892c47c975abe488cd00e4"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentTypeChecker::check_argument_type (cyclomatic 16): ArgumentTypeChecker::check_argument_type 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":7733}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6badd16ab262076cf6ef0db392167e015238886c71863126827a92f557ca11"}},{"ruleId":"D1","level":"warning","message":{"text":"CallInference::has_invariant_return_difference (cyclomatic 16): CallInference::has_invariant_return_difference 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dce2d7957bd97cc5df75aebefa63553bb7f7f94fdabba76268e32c09f7deb8a"}},{"ruleId":"D1","level":"warning","message":{"text":"CallInference::infer_typevartuple_argument_constraints (cyclomatic 16): CallInference::infer_typevartuple_argument_constraints 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":7415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b99092c08726f4ae1fe0713d120ea05e063f8fc631076d8276ffdde529ced85"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticClassLiteral::variance_equation (cyclomatic 16): StaticClassLiteral::variance_equation 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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1ae8b719ef3b2a497b6d05d48bbcdd86e8376b687a1eb55fa163f98e405765"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassType::could_coexist_in_mro_with_impl (cyclomatic 16): ClassType::could_coexist_in_mro_with_impl 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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb2a5e63d9a4452ec97c7c6fde766cef497bc004d22a3caaba961c697d21463"}},{"ruleId":"D1","level":"warning","message":{"text":"CandidateSolutions::promote_for_argument_context (cyclomatic 16): CandidateSolutions::promote_for_argument_context 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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":4063}}}],"partialFingerprints":{"codehealthFindingId/v1":"74acb503d5a512a534faa0ea1924ebfa2c8581f9fb37e7967ba1e1e9d71b0a6a"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldMetadata::collect_from_annotation (cyclomatic 16): FieldMetadata::collect_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":"crates/ty_python_semantic/src/types/dedicated/pydantic.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d5687fd64af14cba4ed5aa78e7f0c87baeb9d1f1a4ec708954cda9cd573acf"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::parse_enum_members_from_sequence (cyclomatic 16): TypeInferenceBuilder::parse_enum_members_from_sequence 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/ty_python_semantic/src/types/infer/builder/enum_call.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"4851e5dd61574368d78f62f41803b300c4bab41ecb777cbac8f3ee01fba71af6"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_new_class_call (cyclomatic 16): TypeInferenceBuilder::infer_new_class_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":"crates/ty_python_semantic/src/types/infer/builder/new_class.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e007e4ec3e38e4075344e108376f883c43934fa93931f546c5c9cc8ee157da7"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInferenceBuilder::infer_subscript_expression_types (cyclomatic 16): TypeInferenceBuilder::infer_subscript_expression_types 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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadadc43565ed7877b056e47ae2bfe5ac61dc89b6d56afcf9a5ac6362c9d0843"}},{"ruleId":"D1","level":"warning","message":{"text":"NarrowingConstraintsBuilder::evaluate_expr_call (cyclomatic 16): NarrowingConstraintsBuilder::evaluate_expr_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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":4614}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d512fab8fe72d15cb6ca59ff8e9e6edad8e02605a6c15faeba497e0d219bd2"}},{"ruleId":"D1","level":"warning","message":{"text":"ProtocolClass::validate_type_parameter_variance (cyclomatic 16): ProtocolClass::validate_type_parameter_variance 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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5598259a79de43fb9e24a90b592aa63541ff3ffbcba1970ef7249236368f9909"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRelationChecker::try_check_non_recursive_protocol_members (cyclomatic 16): TypeRelationChecker::try_check_non_recursive_protocol_members 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":"crates/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"81522c595de7556c57c7e563b33402d81494a1b1c6c4408c4e29d1dd3747546a"}},{"ruleId":"D1","level":"warning","message":{"text":"IntersectionBuilder::add_negative_impl (cyclomatic 16): IntersectionBuilder::add_negative_impl 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":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"8358590212daf386cbdf45922dc838c68fe2e3e81d5d3119860c5d2097aa86b4"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeVarInstance::type_is_self_referential (cyclomatic 16): TypeVarInstance::type_is_self_referential has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 3 function items inside it that branch (type_is_self_referential_impl, type_alias_is_self_referential, typevar_default_is_self_referential). 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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3933d884ec8e82a14a63cbe7224f739947d6c230c86a015232d8729a940c3c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::overloaded_function::check_non_generic_overload_implementation_consistency (cyclomatic 16): ty_python_semantic::types::infer::builder::post_inference::overloaded_function::check_non_generic_overload_implementation_consistency 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/ty_python_semantic/src/types/infer/builder/post_inference/overloaded_function.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9044a6ce3e3b1b12bd72463b34d78b90369b16a16e2437605fd3a7920cd376d"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::bind_attribute (cyclomatic 16): ty_python_semantic::types::overrides::attributes::bind_attribute 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/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb701e446c15c3360eb5ca38d8cd1dab01b5ed4bbcdec062808786da99d3555"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::check_instance_overrides (cyclomatic 16): ty_python_semantic::types::overrides::attributes::check_instance_overrides 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/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"639b7a980af879bc8bf24cc5808b53d6f9f8edb14b7124ba9e65df4def444603"}},{"ruleId":"D1","level":"warning","message":{"text":"ty_python_semantic::types::set_theoretic::builder::normalize_enum_complement_unions (cyclomatic 16): ty_python_semantic::types::set_theoretic::builder::normalize_enum_complement_unions 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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce58feb7dd3658475bce34d53ab0ebf1088ce6fce5984a14d7613189af0c375"}},{"ruleId":"D1","level":"warning","message":{"text":"Chrome.Chrome (cyclomatic 16): Chrome.Chrome has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 47, 26, 33, \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":"playground/ruff/src/Editor/Chrome.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ebaddafc7f7100dc563df35568d476826cdf2c3ce31f2761f87b88fcadafc2"}},{"ruleId":"D1","level":"warning","message":{"text":"ShareButton.ShareButton (cyclomatic 16): ShareButton.ShareButton has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/shared/src/ShareButton.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7572b8c44faa961ef1eef8b4936e25f7210591f4297e6b55d1fb76d096a9d765"}},{"ruleId":"D2","level":"warning","message":{"text":"Bindings::evaluate_known_cases (cognitive 741): Bindings::evaluate_known_cases has cognitive complexity 741 (threshold 15). Drivers by points: if/else 162 (601 pts), match/switch 23 (108 pts), loops 5 (18 pts), boolean chains 14 (nesting depth added 537). 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f17c5f21f67c82875bb8ec1d6ae20b223e7348c5d1fcc24b7cbc35fc853d342"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::statement::statement (cognitive 710): ruff_linter::checkers::ast::analyze::statement::statement has cognitive complexity 710 (threshold 15). Drivers by points: if/else 382 (650 pts), loops 17 (57 pts), boolean chains 2, match/switch 1 (nesting depth added 308). Of this number, 702 points are the body\u0027s own statements and 8 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":"crates/ruff_linter/src/checkers/ast/analyze/statement.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49d522decd2aa2e1fd43e0364a008bb0c93dc19f41b443ecd57f350101a8eb8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::expression::expression (cognitive 653): ruff_linter::checkers::ast::analyze::expression::expression has cognitive complexity 653 (threshold 15). Drivers by points: if/else 365 (587 pts), loops 9 (27 pts), boolean chains 26, match/switch 4 (13 pts) (nesting depth added 249). To reduce it, split the body into named stages: move each independent step or branch into 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/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"16943ea95b35539e2a49d6dab652733ce5b9cdd06c576453ea53b2a07b56f5cd"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRelationChecker::check_signature_pair_inner (cognitive 603): TypeRelationChecker::check_signature_pair_inner has cognitive complexity 603 (threshold 15). Drivers by points: if/else 123 (416 pts), match/switch 27 (90 pts), loops 17 (53 pts), boolean chains 44 (nesting depth added 392). 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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35b1798d86b6557521b1df8a097a1277bb2b2eeb50936c2a6390f580e47914a"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticIndexBuilder::visit_stmt_impl (cognitive 376): SemanticIndexBuilder::visit_stmt_impl has cognitive complexity 376 (threshold 15). Drivers by points: if/else 113 (276 pts), loops 28 (67 pts), boolean chains 25, match/switch 4 (8 pts) (nesting depth added 206). 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/ty_python_core/src/builder.rs"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf65839c4234f3cff21e3f062433723d9f1a7228dacc0b110d71e7fa4021d09"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::static_class::check_static_class_definitions (cognitive 366): ty_python_semantic::types::infer::builder::post_inference::static_class::check_static_class_definitions has cognitive complexity 366 (threshold 15). Drivers by points: if/else 106 (272 pts), loops 17 (49 pts), boolean chains 27, match/switch 7 (18 pts) (nesting depth added 209). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbfe07f00246c2d943a5882636d82b9a1f4873eed9e93032aab69283a38d718"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_expr (cognitive 275): Checker::visit_expr has cognitive complexity 275 (threshold 15). Drivers by points: if/else 50 (143 pts), loops 23 (82 pts), match/switch 15 (43 pts), boolean chains 7 (nesting depth added 180). To reduce it, split the body into named stages: move each independent step or branch into 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/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e891fca976bd633de2735bc5f3d57b0779e245c4c904dc16f44b8fa327318f1"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_parameterized_special_form_type_expression (cognitive 225): TypeInferenceBuilder::infer_parameterized_special_form_type_expression has cognitive complexity 225 (threshold 15). Drivers by points: if/else 87 (180 pts), loops 8 (29 pts), match/switch 5 (9 pts), boolean chains 7 (nesting depth added 118). 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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2564}}}],"partialFingerprints":{"codehealthFindingId/v1":"424f1d86adcabdc26e61443b7ad5b2506526c96d253ba2c085db626199622630"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::report_redundant_condition (cognitive 204): TypeInferenceBuilder::report_redundant_condition has cognitive complexity 204 (threshold 15). Drivers by points: if/else 84 (152 pts), boolean chains 26, match/switch 9 (20 pts), loops 2 (6 pts) (nesting depth added 83). To reduce it, split the body into named stages: move each independent step or branch into 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/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ef5368559e004ede582fe832424476bb40b427ad7ea422386b51c7be9ef86d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_call_expression_impl (cognitive 204): TypeInferenceBuilder::infer_call_expression_impl has cognitive complexity 204 (threshold 15). Drivers by points: if/else 61 (141 pts), match/switch 11 (26 pts), boolean chains 24, loops 4 (13 pts) (nesting depth added 104). Of this number, 198 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":9652}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae581d4fceb48527d78b30349e5d206fcfd5f673351e0c0b41871bd516599bc"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecializationBuilder::infer_map_inner (cognitive 202): SpecializationBuilder::infer_map_inner has cognitive complexity 202 (threshold 15). Drivers by points: if/else 58 (135 pts), loops 11 (31 pts), boolean chains 25, match/switch 5 (11 pts) (nesting depth added 103). To reduce it, split the body into named stages: move each independent step or branch into 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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b607c964d00585235fad845d30160d1bc92d2126070423c2f70ab4802092ab"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::overrides::check_class_declaration (cognitive 200): ty_python_semantic::types::overrides::check_class_declaration has cognitive complexity 200 (threshold 15). Drivers by points: if/else 58 (159 pts), boolean chains 31, match/switch 3 (8 pts), loops 1 (2 pts) (nesting depth added 107). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c35811244499868d34ed56a01d8808781ff04f5aada3fa538437503fe5599ad"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionBuilder::add_in_place_impl (cognitive 182): UnionBuilder::add_in_place_impl has cognitive complexity 182 (threshold 15). Drivers by points: if/else 37 (131 pts), match/switch 8 (26 pts), loops 5 (14 pts), boolean chains 11 (nesting depth added 121). To reduce it, split the body into named stages: move each independent step or branch into 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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"086463a182192ffea17e3a93a008ffa5d69df1079e157e36f1857c7e7e8a3fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_explicit_callable_specialization_impl (cognitive 175): TypeInferenceBuilder::infer_explicit_callable_specialization_impl has cognitive complexity 175 (threshold 15). Drivers by points: if/else 60 (130 pts), boolean chains 18, match/switch 6 (14 pts), loops 6 (13 pts) (nesting depth added 85). Of this number, 174 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa7b99d79b8414f91a4abe4719a7419f83d5145cb8fb608c2d138a3119229dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_stmt (cognitive 169): Checker::visit_stmt has cognitive complexity 169 (threshold 15). Drivers by points: if/else 54 (117 pts), loops 13 (28 pts), match/switch 7 (13 pts), boolean chains 11 (nesting depth added 84). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98beae38dbe8471435f999f95daa9697955169162b7ae6260e2e0b061025fb6"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_type_expression_no_store (cognitive 163): TypeInferenceBuilder::infer_type_expression_no_store has cognitive complexity 163 (threshold 15). Drivers by points: if/else 58 (138 pts), boolean chains 10, match/switch 4 (8 pts), loops 2 (7 pts) (nesting depth added 89). 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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d5a3c520027ee89198ff401d17dbc80b1e4841375d1026a7a8d8dc83f20ed5"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_annotations::rules::definition::definition (cognitive 161): ruff_linter::rules::flake8_annotations::rules::definition::definition has cognitive complexity 161 (threshold 15). Drivers by points: if/else 50 (134 pts), boolean chains 16, match/switch 2 (8 pts), loops 2 (3 pts) (nesting depth added 91). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"9454003d26ca8c29560211db444e49990f257a631f4196961007ce810d1cb9f5"}},{"ruleId":"D2","level":"warning","message":{"text":"KnownFunction::check_call (cognitive 157): KnownFunction::check_call has cognitive complexity 157 (threshold 15). Drivers by points: if/else 53 (126 pts), match/switch 6 (14 pts), loops 4 (13 pts), boolean chains 4 (nesting depth added 90). 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/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceac09c2c941e4b685017a2631bbbcdc46a67db2fc7ea58efb52936781266d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRelationChecker::check_typeddict_pair (cognitive 153): TypeRelationChecker::check_typeddict_pair has cognitive complexity 153 (threshold 15). Drivers by points: if/else 41 (121 pts), match/switch 4 (13 pts), loops 5 (10 pts), boolean chains 9 (nesting depth added 94). 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/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"7277dbf64e912905ab044616803e0609bb34f5ebe65114d195b81ebf40bcb037"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingError::report_diagnostic (cognitive 149): BindingError::report_diagnostic has cognitive complexity 149 (threshold 15). Drivers by points: if/else 55 (125 pts), match/switch 8 (18 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 83). 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":10621}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04dfc8d83edd6e28a4775e75a7d80c035fcdaac937787ec9fe29eb1ef3b96e5"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectDatabase::apply_changes (cognitive 142): ProjectDatabase::apply_changes has cognitive complexity 142 (threshold 15). Drivers by points: if/else 42 (117 pts), match/switch 6 (15 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 85). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_project/src/db/changes.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9738c61afd269c6bcb39435307f04a47ac7ddd6eeeb891673a8aa80a7bcf648"}},{"ruleId":"D2","level":"warning","message":{"text":"NarrowingConstraintsBuilder::evaluate_expr_compare (cognitive 138): NarrowingConstraintsBuilder::evaluate_expr_compare has cognitive complexity 138 (threshold 15). Drivers by points: if/else 51 (99 pts), match/switch 8 (22 pts), boolean chains 13, loops 3 (4 pts) (nesting depth added 63). Of this number, 130 points are the body\u0027s own statements and 8 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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":4047}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bb8e0d0af231a6cdc003fa655bfbedff16466361765a609edd6d75f93f0de4"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_annotated_assignment_definition (cognitive 135): TypeInferenceBuilder::infer_annotated_assignment_definition has cognitive complexity 135 (threshold 15). Drivers by points: if/else 45 (100 pts), match/switch 6 (20 pts), boolean chains 13, loops 1 (2 pts) (nesting depth added 70). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4751}}}],"partialFingerprints":{"codehealthFindingId/v1":"265354f0c7c66cf278fe0f009d585cdaedd7ad11abf6df361c2572db25be8fbc"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_subscript_type_expression (cognitive 132): TypeInferenceBuilder::infer_subscript_type_expression has cognitive complexity 132 (threshold 15). Drivers by points: if/else 42 (124 pts), match/switch 4 (8 pts) (nesting depth added 86). 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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb871381b0c012ea159c87a9f23b914dbde8cc8a8d6a2693d23ed460358fa34"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::checkers::noqa::check_noqa (cognitive 129): ruff_linter::checkers::noqa::check_noqa has cognitive complexity 129 (threshold 15). Drivers by points: if/else 33 (99 pts), boolean chains 14, loops 4 (9 pts), match/switch 2 (7 pts) (nesting depth added 76). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/noqa.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"243c2b939218e630bbdf8d7d6eba64be387eaca1877bbbde7f548f975750ed0e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::non_slot_assignment::is_attributes_not_in_slots (cognitive 128): ruff_linter::rules::pylint::rules::non_slot_assignment::is_attributes_not_in_slots has cognitive complexity 128 (threshold 15). Drivers by points: if/else 28 (98 pts), loops 8 (20 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 86). To reduce it, split the body into named stages: move each independent step or branch into 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/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ace548c9a2b9af7bdf7a908cf3ff5a08826eeae02449f9c23dcad1cb2894e73"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::validate_subscript_assignment_impl (cognitive 126): TypeInferenceBuilder::validate_subscript_assignment_impl has cognitive complexity 126 (threshold 15). Drivers by points: if/else 31 (101 pts), boolean chains 11, match/switch 4 (8 pts), loops 3 (6 pts) (nesting depth added 77). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"820ad1144610e9b36b7ccaaae1db0ca60bfe96785a281c5f6deb074c425a129d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::render_source_line (cognitive 123): ruff_annotate_snippets::renderer::render::render_source_line has cognitive complexity 123 (threshold 15). Drivers by points: if/else 35 (66 pts), loops 16 (27 pts), boolean chains 17, match/switch 6 (13 pts) (nesting depth added 49). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d7074f3cf93ebb921a6b4891031fa03e61332a9d15d9139cb9f7f813f23c25"}},{"ruleId":"D2","level":"warning","message":{"text":"LintConfiguration::as_rule_table (cognitive 120): LintConfiguration::as_rule_table has cognitive complexity 120 (threshold 15). Drivers by points: loops 22 (56 pts), if/else 23 (55 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 67). 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/ruff_workspace/src/configuration.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2c099c00dfe26fb72c6de89d5fc04c3bf4b89a378e6d60f2e2950825af8e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_collection_literal_impl (cognitive 120): TypeInferenceBuilder::infer_collection_literal_impl has cognitive complexity 120 (threshold 15). Drivers by points: if/else 33 (79 pts), loops 12 (29 pts), boolean chains 10, match/switch 1 (2 pts) (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":8063}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9575e2713a83590d0f054c345095e257f1e8cd19210cc6471f93ba56235c01"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::render_snippet_annotations (cognitive 117): ruff_annotate_snippets::renderer::render::render_snippet_annotations has cognitive complexity 117 (threshold 15). Drivers by points: if/else 30 (77 pts), loops 13 (33 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 70). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea1ca62188be0c5285b8c725ee40dd96a5b8b967cae1da68a1c174188fb774d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::validate_typevar_default (cognitive 117): TypeInferenceBuilder::validate_typevar_default has cognitive complexity 117 (threshold 15). Drivers by points: if/else 36 (104 pts), loops 2 (8 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 75). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"35801a0f30174f2209bcab4cd06fb1c5da0678276d5f527c4445fa1bcee66bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::extraneous_whitespace::extraneous_whitespace (cognitive 114): ruff_linter::rules::pycodestyle::rules::logical_lines::extraneous_whitespace::extraneous_whitespace has cognitive complexity 114 (threshold 15). Drivers by points: if/else 21 (103 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (nesting depth added 85). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f013394d834cb171a53482d4f0b148783bd5f48595bb343e18571571337325"}},{"ruleId":"D2","level":"warning","message":{"text":"GotoTarget::from_covering_node (cognitive 110): GotoTarget::from_covering_node has cognitive complexity 110 (threshold 15). Drivers by points: if/else 29 (79 pts), match/switch 7 (16 pts), boolean chains 13, loops 1 (2 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/goto.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e86a5a9b2b10f437ecec0f8b2453fe3351cffcebdcd2a95a11d130243eae92d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::sections::blanks_and_section_underline (cognitive 107): ruff_linter::rules::pydocstyle::rules::sections::blanks_and_section_underline has cognitive complexity 107 (threshold 15). Drivers by points: if/else 33 (99 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 70). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c7aab270e31c6c954b39c4cc460ec561dc1f21f87d3f40ed6b931fc4005625"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRelationChecker::check_type_pair (cognitive 107): TypeRelationChecker::check_type_pair has cognitive complexity 107 (threshold 15). Drivers by points: if/else 33 (56 pts), boolean chains 30, match/switch 10 (21 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c1bb528e494979d631fc0af9d6452a76502571ae791ec8a7fa94b3f9ed657f"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::write_summary_text (cognitive 106): Printer::write_summary_text has cognitive complexity 106 (threshold 15). Drivers by points: if/else 40 (105 pts), boolean chains 1 (nesting depth added 65). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/printer.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f9173c287aceee409ac55be32489d779e2e441ce88566fd5b7083d362bec52"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::isort::normalize::normalize_imports (cognitive 102): ruff_linter::rules::isort::normalize::normalize_imports has cognitive complexity 102 (threshold 15). Drivers by points: loops 15 (62 pts), if/else 12 (33 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 69). 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/ruff_linter/src/rules/isort/normalize.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"49697e739bc6bbf2377aa06e31cfc51fa669f6d1e12b4f690f9ccbbc10642cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::deferred_scopes::deferred_scopes (cognitive 101): ruff_linter::checkers::ast::analyze::deferred_scopes::deferred_scopes has cognitive complexity 101 (threshold 15). Drivers by points: if/else 44 (90 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/analyze/deferred_scopes.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c28e8e83bbf524d195e43f73140511e38026ba8b5e659a1fae9d204a162ba41"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::unparse_stmt (cognitive 101): Generator::unparse_stmt has cognitive complexity 101 (threshold 15). Drivers by points: if/else 32 (63 pts), loops 14 (30 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 51). 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/ruff_python_codegen/src/generator.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8868534e07301305a217fe8135f85c5e7207cda1053a6ec82e1dcc5bc1072e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_namedtuple_call_expression (cognitive 101): TypeInferenceBuilder::infer_namedtuple_call_expression has cognitive complexity 101 (threshold 15). Drivers by points: if/else 27 (62 pts), match/switch 9 (16 pts), boolean chains 15, loops 5 (8 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcd1cca0dd4b6b1412eceead3bf540aa6408243c69a36d1c7fc1a087f356dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydoclint::rules::check_docstring::check_docstring (cognitive 98): ruff_linter::rules::pydoclint::rules::check_docstring::check_docstring has cognitive complexity 98 (threshold 15). Drivers by points: if/else 29 (73 pts), loops 3 (10 pts), match/switch 3 (10 pts), boolean chains 5 (nesting depth added 58). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe39386d15a49102de41ace57e7c25e96ce6468d915761c1068e48797f3c946"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::literal_comparisons::literal_comparisons (cognitive 96): ruff_linter::rules::pycodestyle::rules::literal_comparisons::literal_comparisons has cognitive complexity 96 (threshold 15). Drivers by points: if/else 24 (74 pts), match/switch 5 (17 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce27ded0a5a174058041f88f69604becd1a44db2c8cb22f2a2ac7b6da8d08f65"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatSuite::fmt (cognitive 95): FormatSuite::fmt has cognitive complexity 95 (threshold 15). Drivers by points: if/else 30 (48 pts), match/switch 13 (35 pts), boolean chains 11, loops 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/statement/suite.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6da08aa28d40e4445bc90620593e9f0b087bf42b2f29f94661f9e7679f9aba0"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticClassLiteral::own_generated_member (cognitive 94): StaticClassLiteral::own_generated_member has cognitive complexity 94 (threshold 15). Drivers by points: if/else 34 (62 pts), boolean chains 18, match/switch 5 (9 pts), loops 2 (5 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"814fd3e1bd4788e0e47fb87c04b5865215f07c9f450493dd16f0da79310c4e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayRepresentation::fmt_detailed (cognitive 93): DisplayRepresentation::fmt_detailed has cognitive complexity 93 (threshold 15). Drivers by points: if/else 22 (49 pts), match/switch 15 (36 pts), loops 3 (8 pts) (nesting depth added 53). 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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a506ca9344f8080f4be78bd3612a0ce09cc536f8f29b94ddc771ce88af24ebae"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_function_definition (cognitive 92): TypeInferenceBuilder::infer_function_definition has cognitive complexity 92 (threshold 15). Drivers by points: if/else 26 (43 pts), match/switch 11 (29 pts), boolean chains 11, loops 5 (9 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f23f238d836fcbffc8fa8b5e6ddfe5718d59669d7acc480df4e81db18c74f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::consume_ascii_character (cognitive 90): Lexer::consume_ascii_character has cognitive complexity 90 (threshold 15). Drivers by points: if/else 53 (85 pts), boolean chains 4, match/switch 1 (nesting depth added 32). 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/ruff_python_parser/src/lexer.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e562c53a7fd8a9df7b226b845e4fcb07767b5f2dfd7e41d0bcaacdd14f00a316"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::overloaded_function::check_overloaded_function (cognitive 89): ty_python_semantic::types::infer::builder::post_inference::overloaded_function::check_overloaded_function has cognitive complexity 89 (threshold 15). Drivers by points: if/else 31 (69 pts), loops 6 (15 pts), boolean chains 5 (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":"crates/ty_python_semantic/src/types/infer/builder/post_inference/overloaded_function.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c603a9080a8c422caf9c400fcc1bb4052c18647dba401564feba961341eb345c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyflakes::rules::redefined_while_unused::redefined_while_unused (cognitive 87): ruff_linter::rules::pyflakes::rules::redefined_while_unused::redefined_while_unused has cognitive complexity 87 (threshold 15). Drivers by points: if/else 25 (76 pts), loops 5 (7 pts), boolean chains 4 (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":"crates/ruff_linter/src/rules/pyflakes/rules/redefined_while_unused.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2745404c8e4db0ff8ab0b26869c3bf0984f0c8bd328bc2db0cf72fad33567f"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionBuilder::push_type (cognitive 86): UnionBuilder::push_type has cognitive complexity 86 (threshold 15). Drivers by points: if/else 25 (53 pts), loops 6 (18 pts), boolean chains 13, match/switch 1 (2 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a6bb0b83592a1b982dade101d32a0b4a72b660cb1dec3eb4f61fc497d5ff16"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_impl (cognitive 84): Parser::parse_impl has cognitive complexity 84 (threshold 15). Drivers by points: if/else 21 (68 pts), match/switch 3 (10 pts), loops 2 (4 pts), boolean chains 2 (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":"crates/mdtest/src/parser.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a5c4dd054113498fb6e95ab55673380b56bd07d291a36f59a182921f4fddda"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::unparse_expr (cognitive 84): Generator::unparse_expr has cognitive complexity 84 (threshold 15). Drivers by points: if/else 27 (50 pts), loops 8 (19 pts), match/switch 6 (14 pts), boolean chains 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":"crates/ruff_python_codegen/src/generator.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb7b22f0e09d57c3b7a88bd1b966757454d403922792663b55d8c5c71acbf80"}},{"ruleId":"D2","level":"warning","message":{"text":"MainLoop::main_loop (cognitive 84): MainLoop::main_loop has cognitive complexity 84 (threshold 15). Drivers by points: if/else 20 (65 pts), match/switch 7 (17 pts), boolean chains 1, loops 1 (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":"crates/ty/src/lib.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb5b7ad3940c45b03bc3e2c8a3ed726710503ecc16ebd5b170a12d69386a19f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRelationChecker::check_variable_length_vs_tuple_spec (cognitive 83): TypeRelationChecker::check_variable_length_vs_tuple_spec has cognitive complexity 83 (threshold 15). Drivers by points: if/else 18 (52 pts), match/switch 6 (14 pts), boolean chains 9, loops 4 (8 pts) (nesting depth added 46). 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/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e80bb9993a835db0969fe4ae7518533268ab39bae98f2d89e48fe868aa1735"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::expression::call_with_qualified_name (cognitive 81): ruff_linter::checkers::ast::analyze::expression::call_with_qualified_name has cognitive complexity 81 (threshold 15). Drivers by points: if/else 80 (81 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ef1039c5da4401d0c71514cd482e1a40ef936cbc428389bc7186acd60d9940"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::whitespace_around_named_parameter_equals::whitespace_around_named_parameter_equals (cognitive 80): ruff_linter::rules::pycodestyle::rules::logical_lines::whitespace_around_named_parameter_equals::whitespace_around_named_parameter_equals has cognitive complexity 80 (threshold 15). Drivers by points: if/else 15 (63 pts), loops 3 (9 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 55). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/whitespace_around_named_parameter_equals.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fe8f41f4c137058865a1a8a8533ff33149cd285e1e493b1f0c596d4c0fad4c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff::check (cognitive 78): ruff::check has cognitive complexity 78 (threshold 15). Drivers by points: if/else 37 (65 pts), boolean chains 5, loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/lib.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4a36d580e1c5b34075190c2318f46dd9c7d9ae8bb8447055c80459a0e6129d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_typealiastype_assignment_deferred (cognitive 78): TypeInferenceBuilder::infer_typealiastype_assignment_deferred has cognitive complexity 78 (threshold 15). Drivers by points: if/else 23 (66 pts), loops 3 (5 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4311}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a5c78f5cceb455f95163867bd9456e59281e2f54913888f9c4c14a7255edd6"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatStatementsLastExpression::fmt (cognitive 77): FormatStatementsLastExpression::fmt has cognitive complexity 77 (threshold 15). Drivers by points: if/else 33 (68 pts), boolean chains 8, match/switch 1 (nesting depth added 35). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/statement/stmt_assign.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"183ca0622e0b2946637824d51f2bad2bf8b99b58c968f2388f9ce032be621068"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticTokenVisitor::visit_stmt (cognitive 76): SemanticTokenVisitor::visit_stmt has cognitive complexity 76 (threshold 15). Drivers by points: if/else 18 (44 pts), loops 12 (27 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 43). 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/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6eb45cde4c72f22594e283603621804ec29bd20375990703026d0fa3d7eb498"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::validate_subscript_deletion_impl (cognitive 76): TypeInferenceBuilder::validate_subscript_deletion_impl has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (62 pts), match/switch 3 (6 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 47). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4125c117e3debd69ba2b363a7c445c2228f12418e5d63435dbb73c09974a878"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_attribute_load_impl (cognitive 76): TypeInferenceBuilder::infer_attribute_load_impl has cognitive complexity 76 (threshold 15). Drivers by points: if/else 26 (58 pts), match/switch 4 (8 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 39). Of this number, 72 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":11269}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc73838730f31b550ff7f45e1d08fed69196df38c97d09e4cae353f28a04630a"}},{"ruleId":"D2","level":"warning","message":{"text":"InnerIntersectionBuilder::add_positive (cognitive 76): InnerIntersectionBuilder::add_positive has cognitive complexity 76 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 9 (26 pts), loops 6 (13 pts), boolean chains 6 (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":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"962725e5e0afb26a52b1296734354827cdc5364f91c18654a3a5dfedac1c7635"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::validate_attribute_deletion (cognitive 74): TypeInferenceBuilder::validate_attribute_deletion has cognitive complexity 74 (threshold 15). Drivers by points: if/else 17 (43 pts), match/switch 8 (20 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 39). 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abd44c4cd533d4058a6e6c0a90bb9e31141f48387b34c88d1e34f4e029d57de"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::no_method_decorator::get_undecorated_methods (cognitive 71): ruff_linter::rules::pylint::rules::no_method_decorator::get_undecorated_methods has cognitive complexity 71 (threshold 15). Drivers by points: if/else 15 (56 pts), match/switch 4 (11 pts), boolean chains 2, loops 2 (nesting depth added 48). 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/ruff_linter/src/rules/pylint/rules/no_method_decorator.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"774d822726d00468f781b5a503b223a7fcdb068f72c26506c4ef616931cda365"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_binary_expression_type_impl (cognitive 71): TypeInferenceBuilder::infer_binary_expression_type_impl has cognitive complexity 71 (threshold 15). Drivers by points: if/else 23 (46 pts), match/switch 7 (13 pts), boolean chains 12 (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":"crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfbf0131e7ea1364e2ac3c86a731fd9acdafcb0a603580401b659d92cbe876d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_typeddict_call_expression (cognitive 71): TypeInferenceBuilder::infer_typeddict_call_expression has cognitive complexity 71 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 7 (16 pts), boolean chains 8, match/switch 3 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1879746bfada71adeeab3290c0d4a54b80b1ddfc3160586afb7b92c8a2edb1f8"}},{"ruleId":"D2","level":"warning","message":{"text":"DunderAllNamesCollector::visit_stmt (cognitive 70): DunderAllNamesCollector::visit_stmt has cognitive complexity 70 (threshold 15). Drivers by points: if/else 22 (52 pts), match/switch 5 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/dunder_all.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12e60ce8ea49fd50f03c9dd8f1c2c831762cb6359739ccb076d7b78e81624c6"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_class_definition (cognitive 70): TypeInferenceBuilder::infer_class_definition has cognitive complexity 70 (threshold 15). Drivers by points: if/else 25 (48 pts), match/switch 5 (9 pts), loops 5 (8 pts), boolean chains 5 (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":"crates/ty_python_semantic/src/types/infer/builder/class.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"583bee4592af51171e07a9dab19a1886f2f7a3fd4aca43c982d49197c60f9436"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_function_body (cognitive 70): TypeInferenceBuilder::infer_function_body has cognitive complexity 70 (threshold 15). Drivers by points: if/else 21 (48 pts), loops 5 (12 pts), boolean chains 7, match/switch 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":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e6578c4704de037ee95aa8b76797c24726196b7dc46799be07d8da7722ef76"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleTokenizer::next_token_inner (cognitive 69): SimpleTokenizer::next_token_inner has cognitive complexity 69 (threshold 15). Drivers by points: if/else 43 (66 pts), boolean chains 2, match/switch 1 (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":"crates/ruff_python_trivia/src/tokenizer.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac3b67b86256618cdbbed8d502eb68bd53458fb15f9662a7bd4c68e76b00671"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_annotated_assignment_statement (cognitive 68): TypeInferenceBuilder::infer_annotated_assignment_statement has cognitive complexity 68 (threshold 15). Drivers by points: if/else 22 (52 pts), boolean chains 7, match/switch 2 (6 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4488}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d2807715623696ada72ff39607bd916c5468d86144d0f759ea98729f742f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::render (cognitive 67): ruff_annotate_snippets::renderer::render::render has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (46 pts), match/switch 2 (10 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 41). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70ddb2fcc223a1f1855ddb6f8cebf6eb8f86ea56cfc37b9531d42cceb75c1a3"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_annotation_expression_impl (cognitive 67): TypeInferenceBuilder::infer_annotation_expression_impl has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (36 pts), match/switch 9 (21 pts), boolean chains 5, loops 1 (5 pts) (nesting depth added 38). Of this number, 54 points are the body\u0027s own statements and 13 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":"crates/ty_python_semantic/src/types/infer/builder/annotation_expression.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"81824f2aa179116f57f9803b1b463ba57ad963c2ce58c4c3232aecfa84efdd57"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::member_lookup_with_policy_and_receiver::member_lookup_with_policy_impl (cognitive 67): Type::member_lookup_with_policy_and_receiver::member_lookup_with_policy_impl has cognitive complexity 67 (threshold 15). Drivers by points: boolean chains 27, if/else 16 (26 pts), match/switch 7 (14 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":6090}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb331b5f64e8bd37da3d4c95c4cbd58d0c069a35b94bc5c69a08ad59e2c5fea"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_dev::generate_ty_cli_reference::generate_command (cognitive 66): ruff_dev::generate_ty_cli_reference::generate_command has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 7 (23 pts), boolean chains 1 (nesting depth added 41). 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/ruff_dev/src/generate_ty_cli_reference.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddd79c178caa1c59a4fb2f123c036c95102c232dedea7db90778a2ed4084874"}},{"ruleId":"D2","level":"warning","message":{"text":"FStringConversion::try_convert (cognitive 65): FStringConversion::try_convert has cognitive complexity 65 (threshold 15). Drivers by points: if/else 18 (41 pts), match/switch 5 (17 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyupgrade/rules/f_strings.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8c4a639e3132fac7c85072c6206fc139290522d182d98e043ac8a10c181967"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::unnecessary_lambda::unnecessary_lambda (cognitive 64): ruff_linter::rules::pylint::rules::unnecessary_lambda::unnecessary_lambda has cognitive complexity 64 (threshold 15). Drivers by points: if/else 24 (54 pts), match/switch 3 (5 pts), loops 3 (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":"crates/ruff_linter/src/rules/pylint/rules/unnecessary_lambda.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dff5a89cadf7f277e29c770f8b0fa61289253b53feef7219a8dfb6673de946b"}},{"ruleId":"D2","level":"warning","message":{"text":"Mro::ancestors_of_static_class (cognitive 64): Mro::ancestors_of_static_class has cognitive complexity 64 (threshold 15). Drivers by points: if/else 22 (44 pts), match/switch 4 (10 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 32). Of this number, 62 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":"crates/ty_python_semantic/src/types/mro.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f0303fc5176b55c93f8fcdb222fe4ac9afcc0d1331af3f3ea2d5585cc6395d"}},{"ruleId":"D2","level":"warning","message":{"text":"ComparableExpr::eq (cognitive 63): ComparableExpr::eq has cognitive complexity 63 (threshold 15). Drivers by points: match/switch 32 (63 pts) (nesting depth added 31). 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/ruff_python_ast/src/comparable.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbbc2693b1a00bfb358595a6bdef19dec5a1211fa138f6ed21afc72280ac6c8"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticModel::resolve_load (cognitive 63): SemanticModel::resolve_load has cognitive complexity 63 (threshold 15). Drivers by points: if/else 19 (56 pts), boolean chains 3, match/switch 1 (3 pts), loops 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":"crates/ruff_python_semantic/src/model.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b7e8e05f103e43fbfca9f0aec3d1cb4f77600ece8692ada2e0a36c91551c29"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticClassLiteral::own_instance_member (cognitive 63): StaticClassLiteral::own_instance_member has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (45 pts), match/switch 3 (11 pts), boolean chains 7 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"20250373544c0018cd8748f2e6a21aa896f7ea968895e70c135ae650dc4eab2b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::definitions::definitions (cognitive 62): ruff_linter::checkers::ast::analyze::definitions::definitions has cognitive complexity 62 (threshold 15). Drivers by points: if/else 32 (56 pts), boolean chains 4, loops 1, match/switch 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/ruff_linter/src/checkers/ast/analyze/definitions.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8e60bf7f70bf8b86fc9b404fb5666075212d31b9ce9ee65f1ac005241fa70e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_formatter::string::normalize::normalize_string (cognitive 62): ruff_python_formatter::string::normalize::normalize_string has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (53 pts), loops 2 (8 pts), boolean chains 1 (nesting depth added 41). 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/ruff_python_formatter/src/string/normalize.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"f418a4263031b1f5988f3b491190d0601580d9c64389abd38bc07c7ab21f4bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolVisitor::visit_stmt_impl (cognitive 62): SymbolVisitor::visit_stmt_impl has cognitive complexity 62 (threshold 15). Drivers by points: if/else 27 (52 pts), loops 4 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/symbols.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6220954d689112b423f20872214b36db56c96a4e45d8345fcd9490a19376b407"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::emit_suggestion_default (cognitive 61): ruff_annotate_snippets::renderer::render::emit_suggestion_default has cognitive complexity 61 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 5 (10 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 26). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed37a6f7a8c6e35e71bf08035eb06c404d6537f633746beff2c30bde56471dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"FitsMeasurer::fits_element (cognitive 61): FitsMeasurer::fits_element has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 12 (27 pts), boolean chains 1 (nesting depth added 33). 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/ruff_formatter/src/printer/mod.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b043b35afb3ab39cb7f0115e59910f9f3d8341bc07b896f2801818b29b0112"}},{"ruleId":"D2","level":"warning","message":{"text":"DisjointnessChecker::check_type_pair_impl (cognitive 61): DisjointnessChecker::check_type_pair_impl has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (37 pts), match/switch 8 (14 pts), boolean chains 10 (nesting depth added 21). Of this number, 59 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":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":3763}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a45104aae56ae88d991cea7415f4337b7e78eff047564cda5f5e911a18c8c65"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryLike::fmt (cognitive 60): BinaryLike::fmt has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (54 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/expression/binary_like.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d432f38ffe7f873b0e333503eff40c6350c8292bd1bcef42ad96d1badd1c255a"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticSyntaxChecker::check_stmt (cognitive 60): SemanticSyntaxChecker::check_stmt has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (46 pts), loops 5 (12 pts), boolean chains 1, match/switch 1 (nesting depth added 32). 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/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"be97ec6135a018b5fe6b1cada1efb216fda4060117bdf6c1cb9030a2b3b58086"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticIndexBuilder::visit_expr_with_context (cognitive 60): SemanticIndexBuilder::visit_expr_with_context has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (47 pts), loops 2 (5 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"737591ccde5a6321ef523785aaec047c7e2556defe8c97a40ce12cb48770c4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMap::splice_lines (cognitive 59): SourceMap::splice_lines has cognitive complexity 59 (threshold 15). Drivers by points: if/else 22 (36 pts), loops 7 (13 pts), match/switch 4 (10 pts) (nesting depth added 26). Of this number, 51 points are the body\u0027s own statements and 8 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":"crates/ruff_annotate_snippets/src/renderer/source_map.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0a1a6dd9af2a8e46b7b87bbe3490c7751990ef6462dd748674745a7d7f59e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Diff::write (cognitive 59): Diff::write has cognitive complexity 59 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 7 (19 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_db/src/diagnostic/render/full.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d72e1fa0b094811b2d9da2206737a1fe931c7ba03e6b8e8256ed9a6c8d92c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_element (cognitive 59): Printer::print_element has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (41 pts), match/switch 9 (17 pts), boolean chains 1 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_formatter/src/printer/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"271a63e9bde1bc7437ab3c3abbad9360cf25237049543c5032a7e226f3acd4f3"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticClassLiteral::implicit_attribute_impl (cognitive 59): StaticClassLiteral::implicit_attribute_impl has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (46 pts), loops 5 (7 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class/implicit_attributes.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa324147e44c747a179176998644b9bf289a6df08421347291c8b666c6b4b658"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_subscript_load_impl (cognitive 59): TypeInferenceBuilder::infer_subscript_load_impl has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (41 pts), match/switch 4 (9 pts), boolean chains 5, loops 1 (4 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57aeea7f20e7e3c3f35a7c4a982eb22621fd6965dcb7955d68db2c98625b06b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_tuple_type_expression (cognitive 59): TypeInferenceBuilder::infer_tuple_type_expression has cognitive complexity 59 (threshold 15). Drivers by points: if/else 20 (51 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 32). 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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff2aa85db75bfb630a3f701dece387d48f48987168fdb29dd835d91eadf7deb"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::suppression::unused::check_unused_suppressions (cognitive 59): ty_python_semantic::suppression::unused::check_unused_suppressions has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 4 (9 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/suppression/unused.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0442af49a87778243e40c3914460cf57ddf4cdc0359bef80972caaf03803b120"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::whitespace_before_comment::whitespace_before_comment (cognitive 58): ruff_linter::rules::pycodestyle::rules::logical_lines::whitespace_before_comment::whitespace_before_comment has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (54 pts), boolean chains 3, loops 1 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/whitespace_before_comment.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea31c4849be207eb1efee16c5ddaa262892a3379d6e006c31cd50afd89c8cd09"}},{"ruleId":"D2","level":"warning","message":{"text":"Truthiness::from_expr (cognitive 58): Truthiness::from_expr has cognitive complexity 58 (threshold 15). Drivers by points: if/else 28 (48 pts), match/switch 3 (8 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":"crates/ruff_python_ast/src/helpers.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1396e54ced28a5eab8651780828eae0a770deb2139af92704f8f7da4e8f80325"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableBinding::check_types (cognitive 58): CallableBinding::check_types has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 7 (15 pts), match/switch 6 (13 pts), boolean chains 3 (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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3931}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1103ed1bb34927966c957b4b8f43080d694abc68c0a5ac3c45a3f6fe6c1233"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_dict_expression (cognitive 57): TypeInferenceBuilder::infer_dict_expression has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (44 pts), loops 3 (12 pts), boolean chains 1 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":7856}}}],"partialFingerprints":{"codehealthFindingId/v1":"93067f91bb5a5b992153f1e06ffed058db702b06566072b3ce753bfe9c95b511"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportReplacer::without_renames (cognitive 56): ImportReplacer::without_renames has cognitive complexity 56 (threshold 15). Drivers by points: if/else 34 (55 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":"crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_import.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dc4d88f14fb76e9f3458b36e89174a8262337b91434913c8ebc9b279fab4f1"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAttributeWriteEvaluator::evaluate (cognitive 56): AssignmentAttributeWriteEvaluator::evaluate has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (41 pts), match/switch 4 (8 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0961d6693fc8655731ee312cf4944242d03005b7d6a57b6a30675298093b672"}},{"ruleId":"D2","level":"warning","message":{"text":"BlankLinesChecker::check_line (cognitive 55): BlankLinesChecker::check_line has cognitive complexity 55 (threshold 15). Drivers by points: if/else 31 (50 pts), boolean chains 5 (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/ruff_linter/src/rules/pycodestyle/rules/blank_lines.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ccad17bfbccc9fc0ca36f8d348b99464980838dc6421d5f9b0c4d75d5e0470"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_formatter::verbatim::write_suppressed_statements (cognitive 55): ruff_python_formatter::verbatim::write_suppressed_statements has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 8 (24 pts), match/switch 2 (6 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/verbatim.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6dddfc6315f335cb12d368cf113190654affb48228a16a20bd208f5db52c43"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticModel::simulate_runtime_load_at_location_in_scope (cognitive 55): SemanticModel::simulate_runtime_load_at_location_in_scope has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (37 pts), match/switch 2 (9 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_semantic/src/model.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"5619a3ecc353a5079edf24b826156283b8ce8e9f5e6998087deec05e764b7b5d"}},{"ruleId":"D2","level":"warning","message":{"text":"MroLookup::instance_member (cognitive 55): MroLookup::instance_member has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (50 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":3131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69cf1bbf607adc54c4c212028bbd4f086c3060a07788084317ee3e4aa4f01b4"}},{"ruleId":"D2","level":"warning","message":{"text":"SolutionWalker::validate_constrained (cognitive 55): SolutionWalker::validate_constrained has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (38 pts), boolean chains 8, loops 3 (6 pts), match/switch 1 (3 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"66de60a20d8afa64023e40cc565131994149d6ff73bdff987da6efe4c141694f"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::ide_support::unused_bindings::unused_bindings (cognitive 55): ty_python_semantic::types::ide_support::unused_bindings::unused_bindings has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (38 pts), boolean chains 10, loops 3 (7 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":"crates/ty_python_semantic/src/types/ide_support/unused_bindings.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6f18a6be69ab30cc422b7ff93f1ceb30a2a2a0e633e65f2eee57da9785059b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bandit::rules::suspicious_imports::suspicious_imports (cognitive 54): ruff_linter::rules::flake8_bandit::rules::suspicious_imports::suspicious_imports has cognitive complexity 54 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 7 (20 pts), match/switch 4 (10 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bandit/rules/suspicious_imports.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21e4bcbd546bf8af0b1c64efb6a65f3b3cc9cd4928f6d1f9c50f818247ad089"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_type_checking::rules::runtime_import_in_type_checking_block::runtime_import_in_type_checking_block (cognitive 54): ruff_linter::rules::flake8_type_checking::rules::runtime_import_in_type_checking_block::runtime_import_in_type_checking_block has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 5 (11 pts), boolean chains 5, 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":"crates/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f985cd73e3d4f8adec71af3d1b4f966da3e64e0610d330109a3ae5b8b832ec9d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::outdated_version_block::outdated_version_block (cognitive 54): ruff_linter::rules::pyupgrade::rules::outdated_version_block::outdated_version_block has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (35 pts), match/switch 5 (15 pts), boolean chains 3, loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyupgrade/rules/outdated_version_block.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c735305fcabd5461e6817414901389b5bdf66844de9ec3821a7f420d05dbd581"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::use_pep604_annotation::non_pep604_annotation (cognitive 54): ruff_linter::rules::pyupgrade::rules::use_pep604_annotation::non_pep604_annotation has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), match/switch 3 (7 pts), boolean chains 4, loops 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyupgrade/rules/use_pep604_annotation.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"598324ed4beed487f14ceb79a010a2d659e6081a3f4acb03d6d7bbd9b145e8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundSuperType::build (cognitive 54): BoundSuperType::build has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 13 (27 pts), if/else 9 (20 pts), loops 4 (7 pts) (nesting depth added 28). 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/ty_python_semantic/src/types/bound_super.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"74635a40ba8eb4c86a4828f0b3ff6712831cfaffc771e1913c78bce24d516317"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::isort::format_import_block (cognitive 53): ruff_linter::rules::isort::format_import_block has cognitive complexity 53 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 5 (16 pts), match/switch 2 (7 pts), boolean chains 3 (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":"crates/ruff_linter/src/rules/isort/mod.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aed677fb7ad327da44793c121f84c5411110b70131bd64a19c68f21b276915"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableBinding::report_diagnostics (cognitive 53): CallableBinding::report_diagnostics has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (47 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4813}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa22042b1b8b657d773dc8a3efcff7852c0330c98e6e06b176038759d557ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bandit::rules::suspicious_function_call::suspicious_function (cognitive 52): ruff_linter::rules::flake8_bandit::rules::suspicious_function_call::suspicious_function has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (39 pts), boolean chains 6, match/switch 3 (6 pts), loops 1 (nesting depth added 25). Of this number, 39 points are the body\u0027s own statements and 13 belong to 4 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":"crates/ruff_linter/src/rules/flake8_bandit/rules/suspicious_function_call.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5beb77c077bfe7e266623e6d5a760a3cc6d736360559c35dd38ef707297d11"}},{"ruleId":"D2","level":"warning","message":{"text":"UnicodeEscape::normalize (cognitive 52): UnicodeEscape::normalize has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (40 pts), match/switch 3 (8 pts), loops 2 (4 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/string/normalize.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1dfbdf00b41ecac8d11177c38eda06805c15319c824b17997308329e830aef"}},{"ruleId":"D2","level":"warning","message":{"text":"NotebookDocument::update (cognitive 52): NotebookDocument::update has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 6 (20 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/edit/notebook.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69ae8b63f313adc1f259ee2f546a7f07ab4b34d60f1c11ba481d473dce5726c"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticClassLiteral::own_fields_inner (cognitive 52): StaticClassLiteral::own_fields_inner has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (41 pts), boolean chains 6, match/switch 1 (3 pts), loops 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":2823}}}],"partialFingerprints":{"codehealthFindingId/v1":"471d333f21d6aedd47aaeb11acf4d8a8387913cb099af93b21f8b71bd3474b10"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff::commands::format::warn_incompatible_formatter_settings (cognitive 51): ruff::commands::format::warn_incompatible_formatter_settings has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 7, loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 23). 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/ruff/src/commands/format.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"8886a8ce47fc1bbcc5870bae887fd46e6a1574dc00dbeaaf99bc902b54d09bb4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_ast::visitor::transformer::walk_expr (cognitive 51): ruff_python_ast::visitor::transformer::walk_expr has cognitive complexity 51 (threshold 15). Drivers by points: loops 15 (32 pts), if/else 8 (15 pts), match/switch 2 (4 pts) (nesting depth added 26). 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/ruff_python_ast/src/visitor/transformer.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"20315b5d0888d116e45030d95f4bf659f2c3c92cc628783fc20a52c960c8e6bc"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatImplicitConcatenatedStringFlat::new::merge_flags (cognitive 51): FormatImplicitConcatenatedStringFlat::new::merge_flags has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 2 (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/ruff_python_formatter/src/string/implicit.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"303a3fd93517e0666ef813c78cc1dafb929198cbf8def5e6ce4411b8d4b6f9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectFilesWalker::collect_vec (cognitive 51): ProjectFilesWalker::collect_vec has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (35 pts), match/switch 4 (11 pts), boolean chains 5 (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":"crates/ty_project/src/walk.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25466c4692ab28fa3bc131ceb5b2ce33162d7415e7adb28ead5c5d38f048d99"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextManagerError::report_diagnostic (cognitive 51): ContextManagerError::report_diagnostic has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 7 (14 pts), match/switch 10 (11 pts), boolean chains 3 (nesting depth added 18). Of this number, 50 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/ty_python_semantic/src/types/context_manager.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"88118290464b8a8ec5374849918d64ef8c1f3b183cf731cbcc9e70c8fc0fa4be"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::pre_process (cognitive 50): ruff_annotate_snippets::renderer::render::pre_process has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (36 pts), match/switch 2 (10 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 35). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":2727}}}],"partialFingerprints":{"codehealthFindingId/v1":"24963a31ac973ce7f469626c2d33d9adbbc1aa694971724d6d3773bca2516017"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::missing_whitespace_around_operator::missing_whitespace_around_operator (cognitive 50): ruff_linter::rules::pycodestyle::rules::logical_lines::missing_whitespace_around_operator::missing_whitespace_around_operator has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (38 pts), boolean chains 6, match/switch 2 (5 pts), loops 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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/missing_whitespace_around_operator.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0759c2122e547e9d23f1f99a72202ceb6417c32ad1012ec6c97f8af31b8bd7f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_ide::docstring::markdown::general::render_with_indentation_mode (cognitive 50): ty_ide::docstring::markdown::general::render_with_indentation_mode has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 9, match/switch 2 (7 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/docstring/markdown/general.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8b458a4d79b5c186139c5b47a4f3f03e9cdb88e10e11f0d549ffa0370d9d23"}},{"ruleId":"D2","level":"warning","message":{"text":"InnerIntersectionBuilder::add_negative (cognitive 50): InnerIntersectionBuilder::add_negative has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 6 (12 pts), match/switch 3 (7 pts), boolean chains 5 (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":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa713b25018d60b0ecb3787fc25a68347f0fcced41cae81ccd27f32c1660bd36"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::enums::enum_metadata (cognitive 50): ty_python_semantic::types::enums::enum_metadata has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (33 pts), match/switch 7 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/enums.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae31bdfdfb19c9e34497e9e3ca53b295e3f4b574aa7c0590e643d654fab0b53"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMap::annotated_lines (cognitive 49): SourceMap::annotated_lines has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 8 (13 pts), boolean chains 8 (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/ruff_annotate_snippets/src/renderer/source_map.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ff4632e847b0938e58ee0a57b8ede7ea4cb02048430228e7e71c7155064583"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolvedPythonType::from (cognitive 49): ResolvedPythonType::from has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 13 (34 pts), if/else 6 (15 pts) (nesting depth added 30). 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/ruff_python_semantic/src/analyze/type_inference.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a40df9badeaf4c394281d34f8e58d75bcc8ec715a6af09c1e1d5fb5a78fff4"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::diagnostic::report_inconsistent_generic_bases (cognitive 49): ty_python_semantic::types::diagnostic::report_inconsistent_generic_bases has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (41 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5105}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cf8c009f47c9bba1b5374e96487e5cd84560187951fcf0c040b3b5b50c90ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::indent::indent (cognitive 48): ruff_linter::rules::pydocstyle::rules::indent::indent has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydocstyle/rules/indent.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a60e87bd15b90772d76db03697436ce4ef7eeb6907affdd113f2e517d708a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::bindings_with_receiver (cognitive 48): Type::bindings_with_receiver has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 7 (14 pts), boolean chains 5 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":7162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7045c869634a1a64cc7f6e984873b7c74c79c2d879dc8a63ad39576a2ad555"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::super_call_with_parameters::super_call_with_parameters (cognitive 47): ruff_linter::rules::pyupgrade::rules::super_call_with_parameters::super_call_with_parameters has cognitive complexity 47 (threshold 15). Drivers by points: if/else 26 (40 pts), match/switch 3, boolean chains 2, 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":"crates/ruff_linter/src/rules/pyupgrade/rules/super_call_with_parameters.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d762e9b5efb671d6ea5a7ece63a107164f3f7f06acc8b0143cb99061c04f45"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_ast::visitor::walk_expr (cognitive 47): ruff_python_ast::visitor::walk_expr has cognitive complexity 47 (threshold 15). Drivers by points: loops 15 (30 pts), if/else 7 (13 pts), match/switch 2 (4 pts) (nesting depth added 23). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/visitor.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"507443146a88f085d3c242436c5ec300cc13f8943eee5a27a81b0b163ea5370c"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_interpolated_string_middle_or_end (cognitive 47): Lexer::lex_interpolated_string_middle_or_end has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (42 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/lexer.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f6cc8c7ee1b321acf15f025a3869fb66281a7e657c970f94b9140f2b746dac"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_workspace::configuration::warn_about_deprecated_top_level_lint_options (cognitive 46): ruff_workspace::configuration::warn_about_deprecated_top_level_lint_options has cognitive complexity 46 (threshold 15). Drivers by points: if/else 46. 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/ruff_workspace/src/configuration.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"be982f2668fbe97a611a7a381473a1bba2e771b01792fbcc2b64cc8b61dde54f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::check_suite_for_redundant_conditions (cognitive 46): TypeInferenceBuilder::check_suite_for_redundant_conditions has cognitive complexity 46 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 7 (21 pts), match/switch 1 (2 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/mod.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"2accbbfd934abb521e4d07fd6b9d381eb5ee661d9a36dac2e7eb36a7b097030a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff::diagnostics::lint_path (cognitive 45): ruff::diagnostics::lint_path has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 8 (16 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/diagnostics.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4177e346c5b096a2c1f1d467f01f693e9dc3cbb6150dfd47fd60760e86168af3"}},{"ruleId":"D2","level":"warning","message":{"text":"SuspiciousVariablesVisitor::visit_expr (cognitive 45): SuspiciousVariablesVisitor::visit_expr has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 3 (11 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 30). 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/ruff_linter/src/rules/flake8_bugbear/rules/function_uses_loop_variable.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a3f3fb258235a9cc416e0b27d1291e7525106d78559992096411d4aaf5c831"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::printf_string_formatting::clean_params_dictionary (cognitive 45): ruff_linter::rules::pyupgrade::rules::printf_string_formatting::clean_params_dictionary has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 2 (5 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyupgrade/rules/printf_string_formatting.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7703036fe037d1fe46ea344a2dc2200d3c4982d10d1bb0562a4d2b3dfbe9da"}},{"ruleId":"D2","level":"warning","message":{"text":"ComparableStmt::eq (cognitive 45): ComparableStmt::eq has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 23 (45 pts) (nesting depth added 22). 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/ruff_python_ast/src/comparable.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3d1836af0cb2f392c1330a315ba91ed8441fc5d2613fd7afc7cd0f07132702"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_parameters (cognitive 45): Parser::parse_parameters has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (39 pts), boolean chains 5, 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":"crates/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":3326}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb75291414b9d3567ffea98c07a3ca5c3d97ee42fbda2b199a0ef7caff120b9"}},{"ruleId":"D2","level":"warning","message":{"text":"UvMetadata::dependency_metadata (cognitive 45): UvMetadata::dependency_metadata has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 6 (8 pts), boolean chains 4, match/switch 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":"crates/ty_project/src/uv/metadata/dependencies.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e08c964f9e1d6c2a9952c3ad6d04f3af9f6dbb4e0e47ff8b3f3317168ab6c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::fixes::fix_all (cognitive 45): ty_python_semantic::fixes::fix_all has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 6 (8 pts), match/switch 1 (3 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":"crates/ty_python_semantic/src/fixes.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e309d50f2d7e4430003b972db3bbb89adbf1f1b7311e3e43653dc502930a27aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::typed_dict::validate_merged_dict_literal (cognitive 45): ty_python_semantic::types::typed_dict::validate_merged_dict_literal has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (44 pts), loops 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5ebba35b5b4f32d1eeb7bebafc835d4dee1625abf427b546459b8d7311dd3b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::render_title (cognitive 44): ruff_annotate_snippets::renderer::render::render_title has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (nesting depth added 18). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d14b97d96d0929e5cd87bc1ae239148cf8e5eeb72f3214403abb11cd6e1a0e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::printf_string_formatting::handle_part (cognitive 44): ruff_linter::rules::pyupgrade::rules::printf_string_formatting::handle_part has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 4 (14 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":"crates/ruff_linter/src/rules/pyupgrade/rules/printf_string_formatting.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3cb805892323e532b67493fc72a4273d71e2a9090b043ca97a9ff8ca30bf59"}},{"ruleId":"D2","level":"warning","message":{"text":"PortableGlobPattern::parse (cognitive 44): PortableGlobPattern::parse has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 3 (7 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":"crates/ty_project/src/glob/portable.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da9904ab3ec875b2efab0249a4fe620a942b30918a17d32d67dd04438c9dcad"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticIndexBuilder::pop_scope (cognitive 44): SemanticIndexBuilder::pop_scope has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 5 (10 pts), boolean chains 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebf3d4926237c4d0285a3390673cdcdd604dfa18d030f55c7d0541ed42c97b8"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_builtins_type_call (cognitive 44): TypeInferenceBuilder::infer_builtins_type_call has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (35 pts), boolean chains 3, loops 2 (3 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":"crates/ty_python_semantic/src/types/infer/builder/type_call.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b8eb7d3f4e8b5db0c6338e962f8966bc07b1e20619512b551f720795d8200c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff::commands::format::format (cognitive 43): ruff::commands::format::format has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 5, match/switch 4 (5 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/format.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"defc2058017654a70a30a95162fc1c7e394be480a5542ec85b8e865ba987d2f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::checkers::logical_lines::check_logical_lines (cognitive 43): ruff_linter::checkers::logical_lines::check_logical_lines has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 3, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/logical_lines.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8f6b2f6d8c765a9251664f0cb3169eeaa813f1d6879ad0a22ea4c26984bbf4"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_legacy_typevartuple (cognitive 43): TypeInferenceBuilder::infer_legacy_typevartuple has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 5 (8 pts), boolean chains 6, loops 1 (nesting depth added 16). Of this number, 42 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/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"108a7b84b47b36e6d53c13c4691bd75a41ceeeb5760265efab5bb3a0a979e428"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::enumerate_for_loop::enumerate_for_loop (cognitive 42): ruff_linter::rules::flake8_simplify::rules::enumerate_for_loop::enumerate_for_loop has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (37 pts), boolean chains 4, 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":"crates/ruff_linter/src/rules/flake8_simplify/rules/enumerate_for_loop.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"074e2546d224bfc13b5e0c197094dd8a116cc02191fd3935bb35f7b376696c13"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaceLoadResolutionProcedure::resolve_enclosing_scopes (cognitive 42): PlaceLoadResolutionProcedure::resolve_enclosing_scopes has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (33 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/place_load.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"977e419548b85440dce11d67dd25755a5a59d98378f4de45bb70bbf1121fedeb"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::apply_type_mapping_impl (cognitive 42): Type::apply_type_mapping_impl has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 6 (14 pts), boolean chains 5, 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":9931}}}],"partialFingerprints":{"codehealthFindingId/v1":"2747cc44da9cbaaff755b11365b09e4f597a873866a6cf5f00384a9818664732"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::comparisons::infer_binary_type_comparison_inner (cognitive 42): ty_python_semantic::types::infer::comparisons::infer_binary_type_comparison_inner has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 9 (12 pts), loops 4 (10 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/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ead0e31603960a21ee22f22e5be814ea64902d136a9a2545c40698e97f12ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::main_loop (cognitive 42): Server::main_loop has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (33 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/main_loop.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8716fcbb635f6396d65902ddf7866385e939d4fdf647feee182beb114ea895a5"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_test::run_test (cognitive 42): ty_test::run_test has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 5, match/switch 5, loops 2 (4 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":"crates/ty_test/src/lib.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6577be0da48988f08b0af1008e3d66969d19f67ddfa67c5f1be37184907c493b"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_fill_entries (cognitive 41): Printer::print_fill_entries has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 3 (6 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_formatter/src/printer/mod.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d8af6c14da661ed145c6b2db4cbe468311a6a34c584d47e1eeb642ddced3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockBuilder::visit_stmt (cognitive 41): BlockBuilder::visit_stmt has cognitive complexity 41 (threshold 15). Drivers by points: loops 16 (33 pts), if/else 5 (6 pts), boolean chains 1, match/switch 1 (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/ruff_linter/src/rules/isort/block.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e870dd3d75da1d007e0cf6c2a52d94c6f9f66fa19edec4a584c377ac77c773"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_type_checking::rules::typing_only_runtime_import::typing_only_runtime_import (cognitive 41): ruff_linter::rules::flake8_type_checking::rules::typing_only_runtime_import::typing_only_runtime_import has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 5 (7 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":"crates/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"271274b10a41061fd77103d4d1fcf8730ce1b63d048634035f771d374491f812"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::isort::order::order_imports (cognitive 41): ruff_linter::rules::isort::order::order_imports has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 5 (10 pts), match/switch 2 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/isort/order.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e735117c6521e450c7fa70e4952bb8c916b908c3cca619f063a749e6c05c248"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyflakes::rules::unused_import::unused_import (cognitive 41): ruff_linter::rules::pyflakes::rules::unused_import::unused_import has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 6, loops 4 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyflakes/rules/unused_import.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f737b01c18b346b8d2eca35de4ca51d2fbbf22cecdd0991c1a2509c1439e9b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_ast::visitor::walk_stmt (cognitive 41): ruff_python_ast::visitor::walk_stmt has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 10 (20 pts), match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/visitor.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77000f1188aa12af24fcdff25e343da2bda2b9e114b8bf24ca23233c6556e49"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_ast::visitor::transformer::walk_stmt (cognitive 41): ruff_python_ast::visitor::transformer::walk_stmt has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 10 (20 pts), match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/visitor/transformer.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ebe76f0e9626d208f20c91fa3e292fc0fd8c218213d6f34b057181cbce3713"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchPatternVisitor::visit_pattern (cognitive 41): MatchPatternVisitor::visit_pattern has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 6 (12 pts), boolean chains 1, match/switch 1 (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":"crates/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"907bde906873c4e1581f9e2f7bfc8a17c6922eada55b844321e049aa95ddc0ae"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::validate_dynamic_type_bases (cognitive 41): TypeInferenceBuilder::validate_dynamic_type_bases has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (33 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/dynamic_class.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bb04dc0c53d85bee55ec93ad28124aac16f1175f73b92449670e6854ec1fec"}},{"ruleId":"D2","level":"warning","message":{"text":"IterationError::report_diagnostic (cognitive 41): IterationError::report_diagnostic has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (29 pts), match/switch 5 (9 pts), loops 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"c189876a177dd34c5f05801ac58d5ded185ebcf5a5db30b7ba976823e886e327"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::typed_dict::extract_unpacked_typed_dict_from_value_type (cognitive 41): ty_python_semantic::types::typed_dict::extract_unpacked_typed_dict_from_value_type has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 6 (15 pts), match/switch 1 (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d14f1216904c4933f5acebf5babfed48fdf4e90091905ef78813027112d4f3a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::missing_maxsplit_arg::missing_maxsplit_arg (cognitive 40): ruff_linter::rules::pylint::rules::missing_maxsplit_arg::missing_maxsplit_arg has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 5 (7 pts), loops 3 (5 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/ruff_linter/src/rules/pylint/rules/missing_maxsplit_arg.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf8566af836cb848baa911957b8c2611ea152df8fc5f43bde2f1dfbe46d6a76"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::missing_fstring_syntax::should_be_fstring (cognitive 40): ruff_linter::rules::ruff::rules::missing_fstring_syntax::should_be_fstring has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 5 (8 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/missing_fstring_syntax.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7973b44284c15ab75b4821142ebbf7690d113a52d3293aea6fd30f26d4b219"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatInterpolatedElement::fmt (cognitive 40): FormatInterpolatedElement::fmt has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 2 (5 pts), match/switch 3 (5 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":"crates/ruff_python_formatter/src/other/interpolated_string_element.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b96aa1bf54a809812896a503f43760c3e2ba50982d0b789910a0b59527ff24"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_module_resolver::module_glob::glob_to_regex (cognitive 40): ty_module_resolver::module_glob::glob_to_regex has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_module_resolver/src/module_glob.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11346a31dd8abb0bdfe21ec22914a04508631a71f00b3cd4a6d95433daffe89"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassType::own_class_member (cognitive 40): ClassType::own_class_member has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 3 (9 pts), match/switch 3 (4 pts), boolean chains 1 (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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c022777dbde9fe1491991ccc76da5fa671dd1bf44024a4e64212f911cf92a2"}},{"ruleId":"D2","level":"warning","message":{"text":"AllMembers::extend_with_type (cognitive 40): AllMembers::extend_with_type has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 6 (11 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 19). Of this number, 37 points are the body\u0027s own statements and 3 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":"crates/ty_python_semantic/src/types/list_members.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d45053edbe5a0e5d919c5737f503b6161ad13b6abf72788793f60808775cd0e"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::constructor_bindings (cognitive 40): Type::constructor_bindings has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (30 pts), boolean chains 5, match/switch 3 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":8107}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e6215612ab8df00bb1b615c0c1b32bc83482bb6679ebb2e7a4f2d70b2cbb69"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::reachability::analyze_single_pattern_predicate_kind (cognitive 40): ty_python_semantic::reachability::analyze_single_pattern_predicate_kind has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21 (31 pts), match/switch 4 (7 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":"crates/ty_python_semantic/src/reachability.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71494f1fa34c67dba5f814a7e726b2affcc6986c2797b70ff313918c2379bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::overrides::check_inherited_method_conflict (cognitive 40): ty_python_semantic::types::overrides::check_inherited_method_conflict has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (36 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/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4d6b4183219c2e60622f9f90cc923e08cdbc717a11c021d5ae93bd1218e1ed"}},{"ruleId":"D2","level":"warning","message":{"text":"ReFunc::from_call_expr (cognitive 39): ReFunc::from_call_expr has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 3 (10 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 24). 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/ruff_linter/src/rules/ruff/rules/unnecessary_regular_expression.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5443028c6b18c392377d73bf0164ed8d38ea507e31275d3c10f188d53dc7eba"}},{"ruleId":"D2","level":"warning","message":{"text":"Suppressions::check_suppressions (cognitive 39): Suppressions::check_suppressions has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 16). Of this number, 30 points are the body\u0027s own statements and 9 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":"crates/ruff_linter/src/suppression.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b1c8d46b889edd2dc965340556e8b2468f79c026597c412b5cbc1ad6d7f2e3"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonFilesVisitor::visit (cognitive 39): PythonFilesVisitor::visit has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 3 (10 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":"crates/ruff_workspace/src/resolver.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"3904ee5fab106e3dfe218d48275bab100397bc1b07f19651f813327e5138da36"}},{"ruleId":"D2","level":"warning","message":{"text":"NarrowingProjector::project (cognitive 39): NarrowingProjector::project has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 4 (13 pts), boolean chains 6, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/reachability.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94293f1bb39842b629d34bb3d4ecd14552e8b29a237b0a5188033769c04b63c"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::generics::find_typevar_binding (cognitive 39): ty_python_semantic::types::generics::find_typevar_binding has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 6, match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 19). Of this number, 38 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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2f05441f66857e3826dc4fbba5a615693ca47a212814749113a4726a605a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::paramspec_validation::validate_paramspec_components (cognitive 39): ty_python_semantic::types::infer::builder::paramspec_validation::validate_paramspec_components has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 4, match/switch 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":"crates/ty_python_semantic/src/types/infer/builder/paramspec_validation.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddbf755baca1a69720d43a9329c21f3de9d8b2bf8e229453ceaf52f3336141b"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::set_theoretic::builder::normalize_enum_complement_unions (cognitive 39): ty_python_semantic::types::set_theoretic::builder::normalize_enum_complement_unions has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 5 (12 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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e894c3e3c220d42d6db9523b16aff50021efbd4f5d272ceaa6453b6fd334692"}},{"ruleId":"D2","level":"warning","message":{"text":"SuppressionsBuilder::load_from_tokens (cognitive 38): SuppressionsBuilder::load_from_tokens has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 3 (7 pts), match/switch 3 (6 pts), boolean chains 3 (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/ruff_linter/src/suppression.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba0776e8872da28b436adfbb31e1d8cf06696edeb34556dfc210a1a0710488f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::noqa::find_suppression_comments (cognitive 38): ruff_linter::noqa::find_suppression_comments has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 4 (11 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":"crates/ruff_linter/src/noqa.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5d746f5c9405db175acdfbcef9fdd1b437808ca51e8e1f89876c03135bfa65"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::airflow::rules::xcom_pull_in_template_string::parse_xcom_pull_template (cognitive 38): ruff_linter::rules::airflow::rules::xcom_pull_in_template_string::parse_xcom_pull_template has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 4, match/switch 1 (3 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":"crates/ruff_linter/src/rules/airflow/rules/xcom_pull_in_template_string.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"97da9ea568ad60e94cdd1947011ee356feb5af031349fcfea79135636bb9d624"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bandit::rules::shell_injection::shell_injection (cognitive 38): ruff_linter::rules::flake8_bandit::rules::shell_injection::shell_injection has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (33 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bandit/rules/shell_injection.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"277fd81e9b6b1621bb8b269a5b7821ea9c33931ad575d26ca92ec1260e8f5434"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::ast_bool_op::duplicate_isinstance_call (cognitive 38): ruff_linter::rules::flake8_simplify::rules::ast_bool_op::duplicate_isinstance_call has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (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":"crates/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"58327b17767d24b889793577d3152f345d5a1263b58ceb9e33cceda85979027d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::blank_before_after_class::blank_before_after_class (cognitive 38): ruff_linter::rules::pydocstyle::rules::blank_before_after_class::blank_before_after_class has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 2 (4 pts), 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/ruff_linter/src/rules/pydocstyle/rules/blank_before_after_class.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97904e712ca0ff758e86a221ab5e02e5766b9ef3065a7812c2164ec4183c63e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::repeated_equality_comparison::repeated_equality_comparison (cognitive 38): ruff_linter::rules::pylint::rules::repeated_equality_comparison::repeated_equality_comparison has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/repeated_equality_comparison.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d93d7f8b236a3814e3f77e7246469c69267389ade62670ac12b850fd2a62d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::deprecated_mock_import::deprecated_mock_import (cognitive 38): ruff_linter::rules::pyupgrade::rules::deprecated_mock_import::deprecated_mock_import has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 8, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 17). 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/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"356687314fbd3f991f2b46f967d0898054dcefa2bcb4dcf3fbd5f39fa34c6cdc"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableBinding::filter_overloads_using_any_or_unknown (cognitive 38): CallableBinding::filter_overloads_using_any_or_unknown has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 7 (14 pts), 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72439d49da39041d369c620fe3f606562137f2e68937d063dcd102103c3fbc7"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplaySpecialization::fmt_normal (cognitive 38): DisplaySpecialization::fmt_normal has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"786c567b2581341140991c1f9f80dee10bc64273bbd30e1168107210d6b59b88"}},{"ruleId":"D2","level":"warning","message":{"text":"TruthinessAnalyzer::evaluate (cognitive 38): TruthinessAnalyzer::evaluate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 6 (13 pts), boolean chains 5, 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":"crates/ty_python_semantic/src/types/infer/expression_truthiness.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8231461037bd4f564cfc45c9f2f66b26ac980bc760bf9777bfa9967444779172"}},{"ruleId":"D2","level":"warning","message":{"text":"DisjointnessChecker::check_typeddict_pair (cognitive 38): DisjointnessChecker::check_typeddict_pair has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 11, match/switch 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":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf4a26881a5ed8cccc92daa06fa97809d28bdc889a618ce5b4d614f16a1a257"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::try_bool_impl (cognitive 38): Type::try_bool_impl has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 8 (13 pts), boolean chains 4, 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/ty_python_semantic/src/types/bool.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1593b82b8a1e356cd8ee883bd56e31f70251709cf87df56765da9000f7e6e21"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::subscript (cognitive 38): Type::subscript has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 13, match/switch 6 (10 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":"crates/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"037d7c447fa6c48945f8fb8c65fc66c3b67f8bf4341e9bd578f1c54a782792c8"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::static_class::check_class_namespace_against_metaclass_members (cognitive 38): ty_python_semantic::types::infer::builder::post_inference::static_class::check_class_namespace_against_metaclass_members has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"414bcf7632d0d2ddbd0a48f90e149491c50b436983c3ed3176fe365aa79deba1"}},{"ruleId":"D2","level":"warning","message":{"text":"rule-filters.document$.subscribe() (cognitive 38): rule-filters.document$.subscribe() has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 11, loops 9 (10 pts), ternaries 3 (4 pts) (nesting depth added 5). Most of this is not in the body itself: 8 of the 38 points are its own statements and the rest belongs to 11 function items inside it that branch (updateURL, a function literal at line 89, filter, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/rule-filters.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b43727b65d75e1a8f817fa5223511b18018f8a860a529540d9b86100cf3a355"}},{"ruleId":"D2","level":"warning","message":{"text":"GithubRenderer::render (cognitive 37): GithubRenderer::render has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 4 (8 pts), match/switch 2 (5 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":"crates/ruff_db/src/diagnostic/render/github.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5355d77db0b40d43c7e7e37c332612fc8b77c66580674ed66697d2024562fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_deferred_string_type_definitions (cognitive 37): Checker::visit_deferred_string_type_definitions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (26 pts), match/switch 2 (7 pts), loops 2 (3 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":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a0d98be19424aa42b180825712c04da2976b2d348a470b15dd8f033ad5801c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::bad_generator_return_type::bad_generator_return_type (cognitive 37): ruff_linter::rules::flake8_pyi::rules::bad_generator_return_type::bad_generator_return_type has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 7 (15 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pyi/rules/bad_generator_return_type.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8a02287ed510188459e688a9339174e744276eb0d1fb1202f9ad6d2191cf60"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::native_literals::native_literals (cognitive 37): ruff_linter::rules::pyupgrade::rules::native_literals::native_literals has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyupgrade/rules/native_literals.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c48696698717c323e3ab4544a5cbf9c92c8ebabbc522b2f9d73ee00e4094772"}},{"ruleId":"D2","level":"warning","message":{"text":"Terminal::from_body (cognitive 37): Terminal::from_body has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_semantic/src/analyze/terminal.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"929d4660f248ea7f278b93dd5dcedec4ddddc2a2415593991b50aceee67e1b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractMethods::annotate_diagnostic (cognitive 37): AbstractMethods::annotate_diagnostic has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 3, 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/ty_python_semantic/src/types/abstract_methods.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8beb755ddf1087ac1f4f86f3a0a92dfc2ce9de30414f98d40f3946b0e704d8"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentMatcher::match_variadic (cognitive 37): ArgumentMatcher::match_variadic has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 5 (9 pts), boolean chains 5 (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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":5343}}}],"partialFingerprints":{"codehealthFindingId/v1":"48354a207b709676b957c6d793ca550263c570d63e7c769298e2bce59735421f"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayUnionType::fmt_detailed (cognitive 37): DisplayUnionType::fmt_detailed has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 5 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). Of this number, 30 points are the body\u0027s own statements and 7 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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"18185008d069dfeccde2df00aa312dc2f734d08644e9bbc27d556f428bc2d73e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_subclass_of_type_expression (cognitive 37): TypeInferenceBuilder::infer_subclass_of_type_expression has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 7 (18 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":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"a164f0a6d88f0adcad174a93cf126a872c5b419346ed80afeff48afff2498b01"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_assignment_deferred (cognitive 37): TypeInferenceBuilder::infer_assignment_deferred has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4016}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7d79a98c7a6a4be2e15d94b3af69f54bb8a82c92939e82ab139bbb9639feb9"}},{"ruleId":"D2","level":"warning","message":{"text":"AddBinding::insert (cognitive 37): AddBinding::insert has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 7, 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":13606}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d37a58bd9a42d63e25445b10d2a804ccea6ee5e0683867e5105c38adf790dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Unpacker::unpack_inner (cognitive 37): Unpacker::unpack_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 5 (13 pts), loops 4 (8 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/ty_python_semantic/src/types/unpacker.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dc4d8514ccd7f1b1b6736dc0d96a731f949a8f2d71b366ca3740b6fcf87613"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::instance::protocol_materialization_is_noop_with_type_parameters (cognitive 37): ty_python_semantic::types::instance::protocol_materialization_is_noop_with_type_parameters has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (27 pts), boolean chains 7, match/switch 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":"crates/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"044bbf0e8caa28194bb21d957dfb9503f0ce321a760daff7ecb2b44b2aa02ed5"}},{"ruleId":"D2","level":"warning","message":{"text":"ConciseRenderer::render (cognitive 36): ConciseRenderer::render has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (30 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_db/src/diagnostic/render/concise.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad1a88f7a4c3becbc8257a84d5984a21d8c6d47338ce6aff00afeb169b6baf0"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::visit_stmt (cognitive 36): Collector::visit_stmt has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (10 pts), boolean chains 1, 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":"crates/ruff_graph/src/collector.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4eacf480155f773539f4c568fe3ec84d3f293bcd97557559495d2546f457e8"}},{"ruleId":"D2","level":"warning","message":{"text":"LinePreprocessor::next (cognitive 36): LinePreprocessor::next has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/blank_lines.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ef0df5f8cce16c6f3550fa081eeb3abe611cf63acf56a44a23188b07ead5e2"}},{"ruleId":"D2","level":"warning","message":{"text":"BlankLinesChecker::check_lines (cognitive 36): BlankLinesChecker::check_lines has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/blank_lines.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebd1088655015f04a0bcb411b377adceb8f0d3e14257bb3bf55dbf161b85f07"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::perflint::rules::manual_dict_comprehension::manual_dict_comprehension (cognitive 36): ruff_linter::rules::perflint::rules::manual_dict_comprehension::manual_dict_comprehension has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 5 (8 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0d1c2216f7e7b3875dce4063d690effe9750a765db6abad5c2afd5a2f2eefe"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::perflint::rules::manual_list_comprehension::manual_list_comprehension (cognitive 36): ruff_linter::rules::perflint::rules::manual_list_comprehension::manual_list_comprehension has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 4, match/switch 4 (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/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9932f595b03e13c89a34c2be93eb40e53c94de6db83071897d704aea250bd6de"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAttributeWriteEvaluator::evaluate_instance (cognitive 36): AssignmentAttributeWriteEvaluator::evaluate_instance has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 4 (8 pts), boolean chains 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"0586904a34e2a0226fb66a18b904561baa8c650cff1e043f8f7b05a49e70a9f1"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_fstring_expression (cognitive 36): TypeInferenceBuilder::infer_fstring_expression has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (10 pts), match/switch 2 (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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":7427}}}],"partialFingerprints":{"codehealthFindingId/v1":"466b4e5e21af02921cd37674084f5e84dfc2afcdae0f3022e7363a2c0fd291eb"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRelationChecker::check_type_satisfies_protocol (cognitive 36): TypeRelationChecker::check_type_satisfies_protocol has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 15, 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/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dbcd5859bc0ef57d83a6abab8c02fee9994e8113ebd0268c3764a1b0493563"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::overrides::check_inherited_conflicts (cognitive 36): ty_python_semantic::types::overrides::check_inherited_conflicts has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"189d8535140f6c00b01861edb9e27227a1490f21f52465f0f84506add38dbc0d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff::diagnostics::lint_stdin (cognitive 35): ruff::diagnostics::lint_stdin has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 4 (8 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":"crates/ruff/src/diagnostics.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8639c80b185570311f42d82c0dc9a54e2e93998b84126821c3d3ea12e6e91978"}},{"ruleId":"D2","level":"warning","message":{"text":"BodyVisitor::visit_stmt (cognitive 35): BodyVisitor::visit_stmt has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (10 pts), match/switch 1 (nesting depth added 21). 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/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"f656b8fe23f79933d4698ac16c2cbe59db3773574bcd859d3dbcf1e98c87ef1c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::checkers::tokens::check_tokens (cognitive 35): ruff_linter::checkers::tokens::check_tokens has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (24 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/tokens.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"97428f1bfa1f8b173c3f60b3b1c9f65f05da751dfa22aa3b7d677ac51db9f8e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_call_around_sorted (cognitive 35): ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_call_around_sorted has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (33 pts), boolean chains 1, match/switch 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c1d310cf74071c6cf0343a8822c25b9c1d7f6487da0555633c57681bbf3b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::unnecessary_dunder_call::unnecessary_dunder_call (cognitive 35): ruff_linter::rules::pylint::rules::unnecessary_dunder_call::unnecessary_dunder_call has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/unnecessary_dunder_call.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f289b3b986219b71745fb989e8f4dd414745772b55f93e52dcd05dfb310e0e30"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::refurb::rules::verbose_decimal_constructor::verbose_decimal_constructor (cognitive 35): ruff_linter::rules::refurb::rules::verbose_decimal_constructor::verbose_decimal_constructor has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/rules/verbose_decimal_constructor.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dd53c15932ea0459d7dd0cecec1d9e2fd55891f79f1dba0e4889b57e725aea"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::never_union::never_union (cognitive 35): ruff_linter::rules::ruff::rules::never_union::never_union has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/never_union.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"218f1ee82de2cf4cc265762dcf397dcac5c019c65ce1888d8617730e38f09bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::handle_implicitly_concatenated_strings (cognitive 35): Parser::handle_implicitly_concatenated_strings has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 5 (15 pts), loops 5 (10 pts), if/else 7 (9 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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"014a1a1109eaf1c1d721b852d846161e9d7428ef8304b4f29d671bae4797c10e"}},{"ruleId":"D2","level":"warning","message":{"text":"CandidateSolutions::compute_simple_bound_conjunction (cognitive 35): CandidateSolutions::compute_simple_bound_conjunction has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 4 (9 pts), loops 4, 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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":3887}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0cc2f17ca3d1fa9864d98e72b9a2cd027c9fafa437c7e699d09b402064d88c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_enum_call_expression (cognitive 35): TypeInferenceBuilder::infer_enum_call_expression has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 10, loops 5 (7 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":"crates/ty_python_semantic/src/types/infer/builder/enum_call.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d83ec1042ab1c3da50b854a7eed145e38eafa85bb83261c4280a655dc1f51a3"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_import_from_statement (cognitive 35): TypeInferenceBuilder::infer_import_from_statement has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 3 (7 pts), boolean chains 4 (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":"crates/ty_python_semantic/src/types/infer/builder/imports.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b35080ae0a2826f81b6ded718602b7439a48c89c6bf41d4c8d20918a94e05aa"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_typing_namedtuple_fields (cognitive 35): TypeInferenceBuilder::infer_typing_namedtuple_fields has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (10 pts), match/switch 6 (10 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":"crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"fceb17b10e4dc5722d10fcc772dde23ec9bbf85b9dacc60e1a0ccee5672a4677"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_legacy_typevar (cognitive 35): TypeInferenceBuilder::infer_legacy_typevar has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 6 (9 pts), boolean chains 5, loops 1 (nesting depth added 10). 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, split the body into named stages: move each independent step or branch into 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/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e51f05009cc020da242ed96c8486db43cc2a3f84262ad9564ba40ca7a2a4ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::dedicated::pydantic::lax_input_type_impl (cognitive 35): ty_python_semantic::types::dedicated::pydantic::lax_input_type_impl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 24 (32 pts), match/switch 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/dedicated/pydantic.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"555c99d7d7dfdbf8a78bfd83be0a535d6ce12facc0af9a519f06cc729c9ff87d"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::check_inherited_conflict (cognitive 35): ty_python_semantic::types::overrides::attributes::check_inherited_conflict has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 2 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"88efba4f490ccd87ff042d73be7db4f8069829de7634faa381465ca5a1debbf2"}},{"ruleId":"D2","level":"warning","message":{"text":"UselessSuppressionComments::check_suppression_comment (cognitive 34): UselessSuppressionComments::check_suppression_comment has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 4 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/invalid_formatter_suppression_comment.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a96fa824f4e3ff7086e8bde22e90cf9113704b6992da8c326d8e4b6eb3c95d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::unresolved_references::unresolved_references (cognitive 34): ruff_linter::checkers::ast::analyze::unresolved_references::unresolved_references has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 1 (nesting depth added 23). 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/ruff_linter/src/checkers/ast/analyze/unresolved_references.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ee9608aa9551c9d157eccc3c60d29b4dca7124a5ef76a842ae303ad69eecbc"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyflakes::rules::unused_variable::remove_unused_variable (cognitive 34): ruff_linter::rules::pyflakes::rules::unused_variable::remove_unused_variable has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e92a748bf40f33d1333e7a001a33a23d3619d5c540c046e781b58f849eafa75"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::unnecessary_future_import::unnecessary_future_import (cognitive 34): ruff_linter::rules::pyupgrade::rules::unnecessary_future_import::unnecessary_future_import has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyupgrade/rules/unnecessary_future_import.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7b7180e76c43529a3fdf3b2c5b16b41db7b700594f2ac300289ebe3d35eb69"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::ambiguous_unicode_character::ambiguous_unicode_character (cognitive 34): ruff_linter::rules::ruff::rules::ambiguous_unicode_character::ambiguous_unicode_character has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/ambiguous_unicode_character.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20fa94342402f7845d506b32a414a82268934706d655ca152249b1190a885a6"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_markdown::format_code_blocks (cognitive 34): ruff_markdown::format_code_blocks has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 2 (7 pts), loops 2 (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/ruff_markdown/src/lib.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45118f582d0734fd69b29ec7259b77b96274922237abffac4d6e0d90d1c7ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportStatement::detect (cognitive 34): ImportStatement::detect has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 4 (7 pts), boolean chains 5, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/completion.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c836ab4a8e6c3355180aabdf462f226bf3c952f248544f2611cb15e21ce5123"}},{"ruleId":"D2","level":"warning","message":{"text":"SolutionWalker::attribute_typevar_failures (cognitive 34): SolutionWalker::attribute_typevar_failures has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 3 (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":"crates/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"694ac913102729e484ba3b31f7b22f8c4392b78d64d3f47ea6415f6d3980b100"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::diagnostic::report_dynamic_function_decorator_return (cognitive 34): ty_python_semantic::types::diagnostic::report_dynamic_function_decorator_return has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (25 pts), match/switch 4 (5 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baef7265eab7b7c506cdb7394384d81cc1b62a264bea31ec3479d4c8c63fde1"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::typed_dict::validate_typed_dict_openness (cognitive 34): ty_python_semantic::types::infer::builder::post_inference::typed_dict::validate_typed_dict_openness has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/post_inference/typed_dict.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e8fd226affcac0195d99247404b6e5fe69ed2a4d73102cea9224b50b93033b"}},{"ruleId":"D2","level":"warning","message":{"text":"Playground.Playground (cognitive 34): Playground.Playground has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (18 pts), error handling 2 (6 pts), boolean chains 5, ternaries 4, loops 1 (nesting depth added 6). Most of this is not in the body itself: 3 of the 34 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 145, 98, 221, \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":"playground/ty/src/Playground.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d909f7a3250fa68002e1a22929b2af293d72cee227934c0ec1360b6909a85c92"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopMutationsVisitor::visit_stmt (cognitive 33): LoopMutationsVisitor::visit_stmt has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (4 pts), boolean chains 2, 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/ruff_linter/src/rules/flake8_bugbear/rules/loop_iterator_mutation.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"186792299637deff7217045c091080b301c754418e9543498d7113486292c68e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::bindings::bindings (cognitive 33): ruff_linter::checkers::ast::analyze::bindings::bindings has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (30 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":"crates/ruff_linter/src/checkers/ast/analyze/bindings.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ab93654efff5d39ed17d5135e471d9a60ee9f1c0ae9a241ca8116b8d4f12f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_logging_format::rules::logging_call::logging_f_string (cognitive 33): ruff_linter::rules::flake8_logging_format::rules::logging_call::logging_f_string has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_logging_format/rules/logging_call.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"939fdd6cc6648f510d59d42cbcd96f9512cc67a46adf21bfd5b069c8144be5dc"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_unused_arguments::rules::unused_arguments::unused_arguments (cognitive 33): ruff_linter::rules::flake8_unused_arguments::rules::unused_arguments::unused_arguments has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 8, 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":"crates/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"681fb926d687361bd79b65d5de40691abd07dccc938c20589c81d00bb93c4df8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::single_string_slots::single_string_slots (cognitive 33): ruff_linter::rules::pylint::rules::single_string_slots::single_string_slots has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (27 pts), loops 2 (4 pts), match/switch 1 (2 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":"crates/ruff_linter/src/rules/pylint/rules/single_string_slots.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b098119ae64cf16329c1e31e52768e142838d7ca5241b3088cf89c3b4ced71"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_macros::config::derive_impl (cognitive 33): ruff_macros::config::derive_impl has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 2 (7 pts), match/switch 1 (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":"crates/ruff_macros/src/config.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2576746e7e5cefcea93d3ea4dfd30e847092e498f76d32dd708a5f1cb68ca36e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_type_param (cognitive 33): Parser::parse_type_param has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (33 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/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":3665}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c67bba3996287d7e05da430c8275801d62bcdb3605702c9ce91586009eb38a"}},{"ruleId":"D2","level":"warning","message":{"text":"KnownClass::check_call (cognitive 33): KnownClass::check_call has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (27 pts), match/switch 3 (6 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ae537700915b49aa8efc4cca6dbf570267833186a98abf6e7022680d85f90d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_assignment_definition_impl (cognitive 33): TypeInferenceBuilder::infer_assignment_definition_impl has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 3 (8 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":3617}}}],"partialFingerprints":{"codehealthFindingId/v1":"015454a00defc34ff7b44a17f495f57cf1041c20e468df5a1ea1a8458854b384"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtocolClass::for_each_member_candidate (cognitive 33): ProtocolClass::for_each_member_candidate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (7 pts), boolean chains 4 (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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc36ddbe4414979dfc165d32f45522b93831fbeef693c816eb1d68eeafa20f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_dev::generate_rules_table::generate_table (cognitive 32): ruff_dev::generate_rules_table::generate_table has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 2 (5 pts), boolean chains 1, 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/ruff_dev/src/generate_rules_table.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a14bd12231edb66d6adcd1f1839bbc3ea6d0fc1680df117e8596447517d23d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::fix::codemods::remove_imports (cognitive 32): ruff_linter::fix::codemods::remove_imports has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 3 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/fix/codemods.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f891a9a507a361cba117e615c2bf3088134b738778969fed44dca7bbcf56ab50"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::linter::check_path (cognitive 32): ruff_linter::linter::check_path has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 3 (6 pts), boolean chains 3, 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":"crates/ruff_linter/src/linter.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6e913b70e4d5ab5c3ea4b90b3ac99a161d5fa404dfcb498f2eb28826124276"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_2020::rules::compare::compare (cognitive 32): ruff_linter::rules::flake8_2020::rules::compare::compare has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 2, match/switch 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_2020/rules/compare.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"db763ba1435a9754b915a85938ba399a9e93d9838d2e448d2194b356b5d6ee38"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::compound_statements::compound_statements (cognitive 32): ruff_linter::rules::pycodestyle::rules::compound_statements::compound_statements has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/compound_statements.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3524480217eb25bbf1f35dc0d0dda088cb4109631cbef4feeaa1a14f3ebdd673"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::whitespace_around_keywords::whitespace_around_keywords (cognitive 32): ruff_linter::rules::pycodestyle::rules::logical_lines::whitespace_around_keywords::whitespace_around_keywords has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (23 pts), match/switch 2 (7 pts), boolean chains 1, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/whitespace_around_keywords.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dde16020343a72babc95c43ee61dac80940ff0dcc9ea4e4c0e4944166915c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::unspecified_encoding::is_violation (cognitive 32): ruff_linter::rules::pylint::rules::unspecified_encoding::is_violation has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 4 (8 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":"crates/ruff_linter/src/rules/pylint/rules/unspecified_encoding.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b66d4ffa8800644aaec3a93eca3cf2b91486f26457309398f0f92300f06e1e0"}},{"ruleId":"D2","level":"warning","message":{"text":"DocstringLinePrinter::run_action_queue (cognitive 32): DocstringLinePrinter::run_action_queue has cognitive complexity 32 (threshold 15). Drivers by points: loops 5 (16 pts), if/else 3 (11 pts), match/switch 2 (5 pts) (nesting depth added 22). 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/ruff_python_formatter/src/string/docstring.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a95452b3a8cf8563b21b8aa175b402b850eeed735a24d82340d06904b2e8237"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticTokenVisitor::classify_from_definition (cognitive 32): SemanticTokenVisitor::classify_from_definition has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 3 (6 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":"crates/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"486f488b7a8d2965624a6f729a36bf122d4c4726bfa393f14a79f2c2711dd09f"}},{"ruleId":"D2","level":"warning","message":{"text":"SolutionWalker::pending_candidate_solution (cognitive 32): SolutionWalker::pending_candidate_solution has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 6, match/switch 4 (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":"crates/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ec3b941c9b8cf9b760a8b1bb4998a624c77bd0278afc62cca263a507cab5e4"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_callable_parameter_types (cognitive 32): TypeInferenceBuilder::infer_callable_parameter_types has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 2, loops 1 (2 pts), match/switch 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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":3324}}}],"partialFingerprints":{"codehealthFindingId/v1":"257232b843609709001eeeca66d65f44d2cba8040e9190668376cd9d087215d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassInfoConstraint::generate_impl (cognitive 32): ClassInfoConstraint::generate_impl has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 7 (14 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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba92a2072ee80169c14d48926dcc661ffb00b82a74178fff61205fedf462471"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::definition_resolution::definitions_for_attribute (cognitive 32): ty_python_semantic::types::definition_resolution::definitions_for_attribute has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 6 (10 pts), loops 2 (5 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/ty_python_semantic/src/types/definition_resolution.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c9c2d24c7368b61380d7f4ff3ac5f2c3baa497d73dfb99badb59b2c89b9132"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::diagnostic::report_incompatible_method_override (cognitive 32): ty_python_semantic::types::diagnostic::report_incompatible_method_override has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 4 (7 pts), boolean chains 5, 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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5277}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c836ac008d330b0d6e3ff6ec36e124eb5191d28580d8d808ba99c4a7945652"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::set_theoretic::generic_gradual_intersections::base_top_intersection (cognitive 32): ty_python_semantic::types::set_theoretic::generic_gradual_intersections::base_top_intersection has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 7, 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":"crates/ty_python_semantic/src/types/set_theoretic/generic_gradual_intersections.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"10197e2dc759e164ad929e7ab7ad40de2a674e89a9131d3b2d2e3031c07766ab"}},{"ruleId":"D2","level":"warning","message":{"text":"mdtest::run (cognitive 31): mdtest::run has cognitive complexity 31 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 4 (7 pts), match/switch 2 (7 pts), boolean chains 4 (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/mdtest/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5397ffc5a57fd2d594b6dada561d8621c945176484177a4c0b5f86c3a0ead00e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff::commands::format::format_source (cognitive 31): ruff::commands::format::format_source has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (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":"crates/ruff/src/commands/format.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd0ffbf13f47e0ac4e016f4f6c60eaec49777c1382d703008d1bc6098b95046"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::airflow::rules::removal_in_3::check_method (cognitive 31): ruff_linter::rules::airflow::rules::removal_in_3::check_method has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 11 (14 pts) (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":"crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ab4425f1f12d815358c64b1dff90f499d4ad0cc3aa15e881d47084d4167c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pie::rules::multiple_starts_ends_with::multiple_starts_ends_with (cognitive 31): ruff_linter::rules::flake8_pie::rules::multiple_starts_ends_with::multiple_starts_ends_with has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 2, 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":"crates/ruff_linter/src/rules/flake8_pie/rules/multiple_starts_ends_with.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca7d98ba7e94ed303d7ac19dd3e79ead925ba4f6611502f21e4544c3a4cc9c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_raise::rules::unnecessary_paren_on_raise_exception::unnecessary_paren_on_raise_exception (cognitive 31): ruff_linter::rules::flake8_raise::rules::unnecessary_paren_on_raise_exception::unnecessary_paren_on_raise_exception has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_raise/rules/unnecessary_paren_on_raise_exception.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aec3de511bd83c1d3b4c9f15f49af0f42f9296e15dbf384cf05b62c8aebb82"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_dict_lookup::if_else_block_instead_of_dict_lookup (cognitive 31): ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_dict_lookup::if_else_block_instead_of_dict_lookup has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_lookup.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f22c984a0399a40d5d59da334b9979f19707a1c68d2c8ca6f718e51cadbc59f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::space_around_operator::space_around_operator (cognitive 31): ruff_linter::rules::pycodestyle::rules::logical_lines::space_around_operator::space_around_operator has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (23 pts), match/switch 2 (7 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"782fb187c55fb4d1b8eff3cf9a45cf8e87829e323bda2e0914a44e15993e5db4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::blank_before_after_function::blank_before_after_function (cognitive 31): ruff_linter::rules::pydocstyle::rules::blank_before_after_function::blank_before_after_function has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 2 (4 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":"crates/ruff_linter/src/rules/pydocstyle/rules/blank_before_after_function.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c6406e397f344e4e08e57af2f9bf3a3f27c0bd4dbe3490c829a17813033899"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::multi_line_summary_start::multi_line_summary_start (cognitive 31): ruff_linter::rules::pydocstyle::rules::multi_line_summary_start::multi_line_summary_start has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 1 (3 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydocstyle/rules/multi_line_summary_start.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab762fca07e79ce8feb17a927c81c6633b9be98796befd69f9bb831f10003c3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_markdown::format_pycon_block (cognitive 31): ruff_markdown::format_pycon_block has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (8 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/ruff_markdown/src/lib.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d298421e5c98b35660f73bd7b651e1c2b2efdb74e8f65aa196998407ac766ff1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_arguments (cognitive 31): Parser::parse_arguments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ae380475c48402a38d66dee7fda17d2034c1325358693444d5d6cdcd53c5af"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentRanges::block_comments (cognitive 31): CommentRanges::block_comments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 5, 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/ruff_python_trivia/src/comment_ranges.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1219a43b68ca22c390799263466e4988c00c72ee8f51d65b7352cd41a939ba7b"}},{"ruleId":"D2","level":"warning","message":{"text":"IsortOptions::try_into_settings (cognitive 31): IsortOptions::try_into_settings has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, loops 4, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_workspace/src/options.rs"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1e2bfa70e112be2df4fce8ca5cb8fff94728c3ae2873dda35a0255b61d8ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecializationFlowGraph::strongly_connected_parameter_components (cognitive 31): SpecializationFlowGraph::strongly_connected_parameter_components has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 6 (11 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/cyclic.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"38498af89dd07cfa2274af5ad72df8895598d88bb3694fa1571928d977856e9b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_legacy_paramspec (cognitive 31): TypeInferenceBuilder::infer_legacy_paramspec has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 5 (8 pts), boolean chains 3, loops 1 (nesting depth added 10). Of this number, 30 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/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b401392a9b664245b4c91a88b6d2df8dc7aa23d8328d563f676b4eb51757e46"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRelationChecker::check_target_union (cognitive 31): TypeRelationChecker::check_target_union has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (21 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":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a26133fb13d71a6e56edd48d4c05625fd88bc4f0c791d83f01dd487726a43f"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundTypeVarInstance::apply_type_mapping_impl (cognitive 31): BoundTypeVarInstance::apply_type_mapping_impl has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (27 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7716b2f26cc82ceac212b34c78142c563d59c303cf1c70da5718de5cda9b1f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::generator_types (cognitive 31): Type::generator_types has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 7 (10 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":8860}}}],"partialFingerprints":{"codehealthFindingId/v1":"4049700291321f16a25740b3a6472b64df96672a146eb342dfbc8da4f782749d"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::static_class::check_inferred_classvars (cognitive 31): ty_python_semantic::types::infer::builder::post_inference::static_class::check_inferred_classvars has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d855ec9f1addae5f83e8c90f549f7e02f97d860b4cb5643429183c0754939ed5"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::comparisons::infer_binary_intersection_type_comparison (cognitive 31): ty_python_semantic::types::infer::comparisons::infer_binary_intersection_type_comparison has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (14 pts), if/else 9 (13 pts), boolean chains 2, loops 2 (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":"crates/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38f2aba8081da96677fe94541e9e7c58f793da8135f141a4d875f080fad14f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::attribute_violation (cognitive 31): ty_python_semantic::types::overrides::attributes::attribute_violation has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"5486d48b0f118b8a821c9776ec132b88d999dd28c3bec20654c5e82998f80cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::check_instance_overrides (cognitive 31): ty_python_semantic::types::overrides::attributes::check_instance_overrides has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (6 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":"crates/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc07518cfdc01a91a4aa930631464f82f294c85b9c116e61702bacec6ca11b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::typed_dict::validate_typed_dict_constructor (cognitive 31): ty_python_semantic::types::typed_dict::validate_typed_dict_constructor has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c5788e0aaa651445ad640c6efa7d9b6b43d150b46c3ed7de81694336542614"}},{"ruleId":"D2","level":"warning","message":{"text":"FitsMeasurer::fits_text (cognitive 30): FitsMeasurer::fits_text has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 3 (10 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 19). Of this number, 29 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/ruff_formatter/src/printer/mod.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f851de6f8e235d6868259b67e94a1bf907ea48b71b68051c0bc0a8d804f7046"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::report_semantic_error (cognitive 30): Checker::report_semantic_error has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (29 pts), 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":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8010e0ad1017a48e4443aa6e48b48fc1bb523a6fec5e3066b93bed2fc60eda"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_exports (cognitive 30): Checker::visit_exports has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":3387}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13f8e6551dfbbc1a07d7539a5b2da4f7dc829ddb45e4fd06c46e9b5f15c8eee"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::sections::common_section (cognitive 30): ruff_linter::rules::pydocstyle::rules::sections::common_section has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (30 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":"crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c160cc241011310daafe81e5c378f2afbc940ba55de829d9103fe1921f54df2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::import_private_name::import_private_name (cognitive 30): ruff_linter::rules::pylint::rules::import_private_name::import_private_name has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, match/switch 2 (4 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":"crates/ruff_linter/src/rules/pylint/rules/import_private_name.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b41ebc178d150fa2a4d0bc27205360ed9ef2ccfd5246a1e91fb56c018a54249"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::mutable_class_default::mutable_class_default (cognitive 30): ruff_linter::rules::ruff::rules::mutable_class_default::mutable_class_default has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (24 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/mutable_class_default.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b039501b30e273ecfdb48c878213d48caad71f1228300c60a6f6c1f1b68a60"}},{"ruleId":"D2","level":"warning","message":{"text":"UnicodeEscape::display_escapes (cognitive 30): UnicodeEscape::display_escapes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 7, loops 3 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_literal/src/escape.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6530592e2bcf2009db383a33682410de1ee8a438c82de648eed901b91b861af"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_string (cognitive 30): Lexer::lex_string has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/lexer.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb435c607942cbdc89ed895d19969557967538d93b57be1eab3c5b4d8f330ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticSyntaxChecker::visit_expr (cognitive 30): SemanticSyntaxChecker::visit_expr has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (6 pts), match/switch 3 (6 pts), boolean chains 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/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0582bfdd3e21c9eabc6e26ba0fb195c0aa571bb5eebc6bdcf2332f2fbcd7034"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::main_loop (cognitive 30): Server::main_loop has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/main_loop.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bbc549aba8891f5f696c50655922756983c91f460be3cab73c0651eebbcb93"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolvedClientCapabilities::new (cognitive 30): ResolvedClientCapabilities::new has cognitive complexity 30 (threshold 15). Drivers by points: if/else 26 (30 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/capabilities.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"035b82804bbe95700c19e198399679f16af98a22d6331e7e9a14a433cf3253dc"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticIndexBuilder::visit_bool_expression (cognitive 30): SemanticIndexBuilder::visit_bool_expression has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":3779}}}],"partialFingerprints":{"codehealthFindingId/v1":"30da586318a01fdb3e195b8a8af86cadd24a6d7be4e11a1c239de63e77530d82"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentMatcher::match_unpacked_variadic (cognitive 30): ArgumentMatcher::match_unpacked_variadic has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, loops 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":5620}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb91c474ef8598f88e5c2c3118ab2617ba109d878a1362ff61eca964efb4267"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentTypeChecker::evaluate_paramspec_sub_call (cognitive 30): ArgumentTypeChecker::evaluate_paramspec_sub_call has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8085}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19ee0aaa956a00a73e3ebdb684317e29700ac79c93e3b2980b1d232de68beef"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_import_from_definition (cognitive 30): TypeInferenceBuilder::infer_import_from_definition has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (28 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":"crates/ty_python_semantic/src/types/infer/builder/imports.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde490b0286aac124b79bee4a77aaf0612ba7b5aba1ea56ff0388637190a435c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_new_class_call (cognitive 30): TypeInferenceBuilder::infer_new_class_call has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 1 (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":"crates/ty_python_semantic/src/types/infer/builder/new_class.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e37e3b50b4d41a5db0ee337b64882de3b50e943014b4cbc1d18bc4d6941bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"NarrowingConstraintsBuilder::narrow_type_by_len_comparison (cognitive 30): NarrowingConstraintsBuilder::narrow_type_by_len_comparison has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":3670}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf0757eeb0df0b7b2e3a39eb11511c242ba41bafc2b311db1ba4118aa42b383"}},{"ruleId":"D2","level":"warning","message":{"text":"SubscriptErrorKind::report_diagnostic (cognitive 30): SubscriptErrorKind::report_diagnostic has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 2 (3 pts) (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/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ba0da8700e4f8fc8000b87f52594e5685a6d7fd0e45df0843d52917fc96a0e"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::try_upcast_to_callable_impl (cognitive 30): Type::try_upcast_to_callable_impl has cognitive complexity 30 (threshold 15). Drivers by points: loops 3 (11 pts), match/switch 5 (10 pts), if/else 5 (8 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":"crates/ty_python_semantic/src/types/callable.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e8132fde5f744b03363b1e14fca77f9664e438eef20720d3d59b04f6b1bd9d"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::suppression::suppressions (cognitive 30): ty_python_semantic::suppression::suppressions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 3 (13 pts), match/switch 3 (11 pts), loops 2 (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/ty_python_semantic/src/suppression.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11ad0dc0e79200d82741019877fbda9fa60107d6614559f977aa45cb1ed4874"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_errmsg::rules::string_in_exception::string_in_exception (cognitive 29): ruff_linter::rules::flake8_errmsg::rules::string_in_exception::string_in_exception has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_errmsg/rules/string_in_exception.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cec29302352518d43fbc452f73e865d693625a422ef8df091c0618e04d82662"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_return::rules::function::unnecessary_assign (cognitive 29): ruff_linter::rules::flake8_return::rules::function::unnecessary_assign has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (27 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":"crates/ruff_linter/src/rules/flake8_return/rules/function.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfa5c2c68c627ac5ba037e40c98ecb3b9aa74c270d3f338e427a0e7508bdb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_type_checking::rules::type_alias_quotes::quotes_are_unremovable (cognitive 29): ruff_linter::rules::flake8_type_checking::rules::type_alias_quotes::quotes_are_unremovable has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_type_checking/rules/type_alias_quotes.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ded90b89048ea8b3c405772dc1251a412e830bfaa1cc9a1283aa975ea9159a4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::tryceratops::rules::error_instead_of_exception::error_instead_of_exception (cognitive 29): ruff_linter::rules::tryceratops::rules::error_instead_of_exception::error_instead_of_exception has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 1 (5 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":"crates/ruff_linter/src/rules/tryceratops/rules/error_instead_of_exception.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"771a10c155b1216874c5b82bbe111194f819859d464548fddb4951654e5bb250"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_macros::rule_namespace::derive_impl (cognitive 29): ruff_macros::rule_namespace::derive_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (7 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_macros/src/rule_namespace.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"54529f76ca401e1e6726cb29c6a863dc82171411ecae7411e89d3fddcbbc2943"}},{"ruleId":"D2","level":"warning","message":{"text":"StringNormalizer::preferred_quote_style (cognitive 29): StringNormalizer::preferred_quote_style has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 4, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/string/normalize.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6d88fca7beab0e2b474621b7020ecaa836f52b19d7774604d3ba6bf5fe7d81"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_lhs_expression (cognitive 29): Parser::parse_lhs_expression has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b92509b23965ae6abf75ae0acee51b562670e4adb1c385eeee22daae2f3200"}},{"ruleId":"D2","level":"warning","message":{"text":"Definitions::resolve (cognitive 29): Definitions::resolve has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_semantic/src/definition.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c51f38ded5c29fa442a44fb4e807e63eef189c22495a15e46d02823bd98f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticModel::extract_dunder_all_names (cognitive 29): SemanticModel::extract_dunder_all_names has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 16). Of this number, 25 points are the body\u0027s own statements and 4 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":"crates/ruff_python_semantic/src/model/all.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cac99180fb001af6ca435318ad5b799e3f41158aca4f9765466ee607865727"}},{"ruleId":"D2","level":"warning","message":{"text":"InlayHint::type_annotation (cognitive 29): InlayHint::type_annotation has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 1 (2 pts), boolean chains 1, 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":"crates/ty_ide/src/inlay_hints.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4947be2d8cdcc69d675a6e318feb27e849c41261bcad9d12a3c51aa8efdb876d"}},{"ruleId":"D2","level":"warning","message":{"text":"Debouncer::add_event (cognitive 29): Debouncer::add_event has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 7 (14 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":"crates/ty_project/src/watch/watcher.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df086705dffb93b627bd669c6a9a8bc14532597f7a7ba1f2996ef96232affa7"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopBindingsVisitor::visit_stmt (cognitive 29): LoopBindingsVisitor::visit_stmt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 7 (14 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/ty_python_core/src/builder/loop_bindings_visitor.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b891a14585213f2497bb55fbbdd20ee51b526fb3ebfe08b3a2a56e5f93f36856"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportFinder::visit_stmt (cognitive 29): ExportFinder::visit_stmt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (11 pts), boolean chains 1, 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/ty_python_core/src/re_exports.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7142116b6f344ee8005fcb9b131b47fed6f524d874ff5d9c6077fc7738a695"}},{"ruleId":"D2","level":"warning","message":{"text":"CallInference::select_return_type (cognitive 29): CallInference::select_return_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 4, loops 2, match/switch 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35755707e8592454ebd5877b6ab9c37ed3b67f926adbed00be5bd64cbd3cf09"}},{"ruleId":"D2","level":"warning","message":{"text":"CallInference::infer_legacy (cognitive 29): CallInference::infer_legacy has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6970}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fd4848f7b5bb3f7070626f660b6e6db8db03966f741ac3afa261462a509c83"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::diagnose_single_length_tuple (cognitive 29): TypeInferenceBuilder::diagnose_single_length_tuple has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 2 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4521478b8415ca467fbb9898e5642f43d1374b2caaa6f17249679335453169"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::place::place_by_id (cognitive 29): ty_python_semantic::place::place_by_id has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 4 (5 pts), boolean chains 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/place.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a274f45807e371401fc59263c262dff9bdf4c8e3b8864addfb0c0d45c9bf48b5"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::string_annotation::parse_string_annotation (cognitive 29): ty_python_semantic::types::string_annotation::parse_string_annotation has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/string_annotation.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26cac8a7ab87284e2a93ea648d41a1b998c71531adbe891e02d5ecdbf230d14"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupNameFinder::visit_stmt (cognitive 28): GroupNameFinder::visit_stmt has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bugbear/rules/reuse_of_groupby_generator.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42b1a1544c0db41663a0f510694ef38d7f6c2c987d901a8545f4c21b6d440cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Suppressions::check_rule_codes (cognitive 28): Suppressions::check_rule_codes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/suppression.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6aed070a11d52e1bce5c3c9e29c32b141ef301c1f34352c57060f92577dc28"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_comprehensions::rules::unnecessary_map::unnecessary_map (cognitive 28): ruff_linter::rules::flake8_comprehensions::rules::unnecessary_map::unnecessary_map has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (24 pts), 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":"crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_map.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fa226da002b69e7a171aa42b7570ecab0151e1d3538e8f840d013d1903e66f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pie::rules::unnecessary_dict_kwargs::unnecessary_dict_kwargs (cognitive 28): ruff_linter::rules::flake8_pie::rules::unnecessary_dict_kwargs::unnecessary_dict_kwargs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pie/rules/unnecessary_dict_kwargs.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8688eea75db9e2bdb7bb21752f00a942c3df95c08ab7d43693baea6b8e01a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_self::rules::private_member_access::private_member_access (cognitive 28): ruff_linter::rules::flake8_self::rules::private_member_access::private_member_access has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (27 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":"crates/ruff_linter/src/rules/flake8_self/rules/private_member_access.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65073802e10492da726fc95092d2e0da725f71c24a45b816a3df0f4e9ff63b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flynt::rules::static_join_to_fstring::build_fstring (cognitive 28): ruff_linter::rules::flynt::rules::static_join_to_fstring::build_fstring has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flynt/rules/static_join_to_fstring.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af394ab3c377014bf45d9aac605661b26fc2a8ff0fdd2e744d9286518c36a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::comparison_with_itself::comparison_with_itself (cognitive 28): ruff_linter::rules::pylint::rules::comparison_with_itself::comparison_with_itself has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/comparison_with_itself.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4acd5db4a5616c655a4e790204a6ba1498f2669a6347d68fb8625654d2d0708"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::context_manager_iterator::context_manager_iterator (cognitive 28): ruff_linter::rules::pyupgrade::rules::context_manager_iterator::context_manager_iterator has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22 (23 pts), match/switch 3 (4 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":"crates/ruff_linter/src/rules/pyupgrade/rules/context_manager_iterator.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c580dc137fe9a419d73ac0ee1825854ff3a87b05578eeab739955298fca674a0"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatExprSlice::fmt_fields (cognitive 28): FormatExprSlice::fmt_fields has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/expression/expr_slice.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61112a617f82c32fc5c55ea1677ea7f11c71e1af1f1b89fc45f215690498f9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_token (cognitive 28): Lexer::lex_token has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/lexer.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62298a7d2b95d94924efe5219cd12fbcc82ba2eae0ec447c4e07f316fd5434f"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticSyntaxChecker::check_annotation (cognitive 28): SemanticSyntaxChecker::check_annotation has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (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":"crates/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a8816e3b08ee2576a0d0b1e0b7db4630ce4bc8a141b5a88d26b63d1e793e96"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticModel::resolve_qualified_import_name (cognitive 28): SemanticModel::resolve_qualified_import_name has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 1, match/switch 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_semantic/src/model.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e56f2d0fa0a03af9b08fa4a8336303f4604a46b9b425c165e0d8d10578dfaf"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticClassLiteral::try_metaclass::try_metaclass_inner (cognitive 28): StaticClassLiteral::try_metaclass::try_metaclass_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, 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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"107ab45af4ac67c52a5f201076fdaf475bd9aa8c823270f83971294b2e75caeb"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticClassLiteral::own_class_member (cognitive 28): StaticClassLiteral::own_class_member has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 7, match/switch 2 (nesting depth added 4). 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, 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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f1258e0c3fc930466ab75d2611449af7806d40903cfca123beba495b2fc308"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_parameter_definition (cognitive 28): TypeInferenceBuilder::infer_parameter_definition has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 3, match/switch 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":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad98101f3ebdd8244b5b739c26ebe94eade8444afb03d6c88661c0774b3bbc0"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::report_import_not_found (cognitive 28): TypeInferenceBuilder::report_import_not_found has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (4 pts), boolean chains 3 (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":"crates/ty_python_semantic/src/types/infer/builder/imports.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e47da1260474bf38c3ee07c2bfe87885c4277623affb88264a18218fd2a9de"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::try_iterate_with_mode::non_async_special_case (cognitive 28): Type::try_iterate_with_mode::non_async_special_case has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (6 pts), match/switch 3 (5 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Type::try_iterate_with_mode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ca8e0bceb823a4dacfe31d8c014ac2e978e8cf8066db97b15038092dd551a7"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::place::place_from_bindings_impl (cognitive 28): ty_python_semantic::place::place_from_bindings_impl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 6 (10 pts), loops 1 (3 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":"crates/ty_python_semantic/src/place.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3afd1781ae1f5d21310ca5d547c4f818dbc4b92fcd7cc57c75cb7d3da4ca64"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::equality::evaluate_structural_comparison (cognitive 28): ty_python_semantic::types::equality::evaluate_structural_comparison has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 5 (9 pts), boolean chains 8 (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":"crates/ty_python_semantic/src/types/equality.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ee837c6667ef50b57180531a981d7671d8b6994f2c434b6b81681b004d2468"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::narrow::containment::containment_behavior (cognitive 28): ty_python_semantic::types::narrow::containment::containment_behavior has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 4 (8 pts), loops 2 (4 pts) (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":"crates/ty_python_semantic/src/types/narrow/containment.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf183ef150f6714758aa869bb0899fd6408cd8de07e91fac75a9839fa58abc0"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::set_theoretic::generic_gradual_intersections::dynamic_generalization_intersection (cognitive 28): ty_python_semantic::types::set_theoretic::generic_gradual_intersections::dynamic_generalization_intersection has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 7, 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":"crates/ty_python_semantic/src/types/set_theoretic/generic_gradual_intersections.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"048b712dc9e536f7453c16deb5172ae59e000528ddc0c154650149d3690b8dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff::commands::format_stdin::format_stdin (cognitive 27): ruff::commands::format_stdin::format_stdin has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 2 (3 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/format_stdin.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6caef2fe4a9b3b2351a93ddc618a6584ab6f80e2bbb2e043ec0eb1d43e77a7f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bugbear::rules::duplicate_exceptions::duplicate_exceptions (cognitive 27): ruff_linter::rules::flake8_bugbear::rules::duplicate_exceptions::duplicate_exceptions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (9 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":"crates/ruff_linter/src/rules/flake8_bugbear/rules/duplicate_exceptions.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb467573deb26898080709c4d0aeeeb88896ba8d5c19b64caef752f42b7dca8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_django::rules::all_with_model_form::all_with_model_form (cognitive 27): ruff_linter::rules::flake8_django::rules::all_with_model_form::all_with_model_form has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (6 pts), match/switch 1 (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":"crates/ruff_linter/src/rules/flake8_django/rules/all_with_model_form.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcfe96e83370a592af421ae47d197e14ae0cf1438139adc297be21dee621783"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::unnecessary_literal_union::unnecessary_literal_union (cognitive 27): ruff_linter::rules::flake8_pyi::rules::unnecessary_literal_union::unnecessary_literal_union has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 1 (4 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":"crates/ruff_linter/src/rules/flake8_pyi/rules/unnecessary_literal_union.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9c9ec698b952eacfcc8216d2aeb5e37b97d0b88e9e92fa948b69ea186358f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_type_checking::rules::type_alias_quotes::collect_typing_references (cognitive 27): ruff_linter::rules::flake8_type_checking::rules::type_alias_quotes::collect_typing_references has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 1 (2 pts), boolean chains 1, 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/ruff_linter/src/rules/flake8_type_checking/rules/type_alias_quotes.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"28051e532ad56646154fb815fddc30fc0634f9c7559b95caf5663f0ee969f6c8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::isort::annotate::annotate_imports (cognitive 27): ruff_linter::rules::isort::annotate::annotate_imports has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 4 (7 pts), boolean chains 1, match/switch 1 (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":"crates/ruff_linter/src/rules/isort/annotate.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc977167caa149493535c693352f8fd824f7468e2c3bb4ffeb2aa94d18deef0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::mccabe::rules::function_is_too_complex::get_complexity_number (cognitive 27): ruff_linter::rules::mccabe::rules::function_is_too_complex::get_complexity_number has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 4 (10 pts), match/switch 1 (2 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/ruff_linter/src/rules/mccabe/rules/function_is_too_complex.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"38409afc1bf522b0b3942846d3e0844b033a47d6c674ea4678652b60df63d9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::perflint::rules::manual_dict_comprehension::convert_to_dict_comprehension (cognitive 27): ruff_linter::rules::perflint::rules::manual_dict_comprehension::convert_to_dict_comprehension has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 4 (6 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":"crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6405e89a5a723a5052526bc433a87c41bac3e7e2d8f19e9160ba0ac4d509899d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::perflint::rules::unnecessary_list_cast::match_mutation (cognitive 27): ruff_linter::rules::perflint::rules::unnecessary_list_cast::match_mutation has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (26 pts), 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":"crates/ruff_linter/src/rules/perflint/rules/unnecessary_list_cast.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db933390ec10d4edd89e84785a7ab6292f4610590819535a85435efe817337d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::ends_with_period::ends_with_period (cognitive 27): ruff_linter::rules::pydocstyle::rules::ends_with_period::ends_with_period has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (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":"crates/ruff_linter/src/rules/pydocstyle/rules/ends_with_period.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ddc68d78de04493ece71d19b59192098c78e6ecbe13c12ff076b91707ed989"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::ends_with_punctuation::ends_with_punctuation (cognitive 27): ruff_linter::rules::pydocstyle::rules::ends_with_punctuation::ends_with_punctuation has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (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":"crates/ruff_linter/src/rules/pydocstyle/rules/ends_with_punctuation.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6120df5c18baf36845e7d8b35e117bb3739451dec6a5e886f2e26d3c78611780"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::f_strings::f_strings (cognitive 27): ruff_linter::rules::pyupgrade::rules::f_strings::f_strings has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 3 (7 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyupgrade/rules/f_strings.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9017ef583bd397139f1a09da9a0c38ca439f8b592fbdc32610ddf46ac1b5e86"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::printf_string_formatting::printf_string_formatting (cognitive 27): ruff_linter::rules::pyupgrade::rules::printf_string_formatting::printf_string_formatting has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (4 pts), 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":"crates/ruff_linter/src/rules/pyupgrade/rules/printf_string_formatting.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"58723d6303187d4f490ea51db21de6dbf1d3abe3cdd01ad3ae2799156c84cfc4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::implicit_optional::implicit_optional (cognitive 27): ruff_linter::rules::ruff::rules::implicit_optional::implicit_optional has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/implicit_optional.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05f80f4cea5fc96c0483f7ad55f063c0f9089516a186c7de99e75a10b46e1c6"}},{"ruleId":"D2","level":"warning","message":{"text":"MaybeParenthesizeExpression::fmt (cognitive 27): MaybeParenthesizeExpression::fmt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 5 (8 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/expression/mod.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b24877430d9cdf3162e1685660657204527b64f4865a49cd4ffacdb7c0830c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_interpolated_element (cognitive 27): Parser::parse_interpolated_element has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"481281a09c0e88ff189a97847547b99da79ebabc8c27add9e53587ce4134b17b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_server::lint::to_lsp_diagnostic (cognitive 27): ruff_server::lint::to_lsp_diagnostic has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 2 (3 pts), 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":"crates/ruff_server/src/lint.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"068a30bf7660d0b22f096106e3f9e3899fd89ea7ed2715b8f93fb29e2681b61e"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_completion_eval::main (cognitive 27): ty_completion_eval::main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_completion_eval/src/main.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdc009a1f4d8e1c11019ec808bc8d9d87f8b276728dfda729723a585f659902"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaceLoadResolutionProcedure::next (cognitive 27): PlaceLoadResolutionProcedure::next has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/place_load.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"0465441af2782a41f677a0a7b207af4bc9a84d1e968f1f35c0e82002d1b05062"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAttributeWriteEvaluator::evaluate_class (cognitive 27): AssignmentAttributeWriteEvaluator::evaluate_class has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (5 pts), boolean chains 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":"crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d494f026068bec7747be4ba356c81c7235926396837b98cd4edc542dc2b91b"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentAttributeWriteEvaluator::report (cognitive 27): AssignmentAttributeWriteEvaluator::report has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 1, 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":"crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"597b1dbda32a2e2d12fa0abfa06f248dbf93157fed03fff3effdb18845b01bde"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_paramspec_explicit_specialization_value (cognitive 27): TypeInferenceBuilder::infer_paramspec_explicit_specialization_value has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9f8acd9db8de10849b4f3fd1421f81d0970ef30cd4ede7d33f041d26a45d66"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_callable_type::inner (cognitive 27): TypeInferenceBuilder::infer_callable_type::inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into 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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a739bcbef90b4288d1301c2d61520f70969f04b5ce1343535d22550ca5aa244e"}},{"ruleId":"D2","level":"warning","message":{"text":"VariableLengthTuple::mixed_forward_slice_plan (cognitive 27): VariableLengthTuple::mixed_forward_slice_plan has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5, match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"462379606da5987b351631c6cc4734261119e23e447292292d06fc737f8ff5bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Tuple::try_for_each_element_pair (cognitive 27): Tuple::try_for_each_element_pair has cognitive complexity 27 (threshold 15). Drivers by points: loops 13 (26 pts), match/switch 1 (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":"crates/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":2738}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4648efe167a0154fc21c5024bf1a113eb04da7ef3e294170aa1e69acda12227"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::dynamic_class::report_mro_error_kind (cognitive 27): ty_python_semantic::types::infer::builder::dynamic_class::report_mro_error_kind has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/dynamic_class.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21eefe261fb0026a8e968baf5949b5a4d7bd360acf58553024a26d9163b0eb4"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::function::is_instance_truthiness (cognitive 27): ty_python_semantic::types::infer::builder::function::is_instance_truthiness has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de5a8a4f9a2313b8b6c686cd43aa53dfa74ce2f00a7e2b84654dec820372bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_dev::generate_docs::process_documentation (cognitive 26): ruff_dev::generate_docs::process_documentation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (4 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/generate_docs.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a4df00bd7c858b55b96e9e4b6f5eec18a7ab025c681f61faf3c42a56b75dc0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pytest_style::rules::assertion::fix_composite_condition (cognitive 26): ruff_linter::rules::flake8_pytest_style::rules::assertion::fix_composite_condition has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/assertion.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3a275bb7c620ee5c5c7933e4cc45e5c8cf450bffc7d31182c5593bbfb5e507"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pytest_style::rules::parametrize::check_names (cognitive 26): ruff_linter::rules::flake8_pytest_style::rules::parametrize::check_names has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (10 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4752533801e0c8031753566c8ae4bcb33bb266dc766f1d98c738ebca997568"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydoclint::rules::check_docstring::parse_raises_google (cognitive 26): ruff_linter::rules::pydoclint::rules::check_docstring::parse_raises_google has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85f8fbe7125120c7954f4ca41a668ec0716f52d5ff35905b0300039c3f5e3b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::deprecated_c_element_tree::deprecated_c_element_tree (cognitive 26): ruff_linter::rules::pyupgrade::rules::deprecated_c_element_tree::deprecated_c_element_tree has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (6 pts), boolean chains 4, match/switch 1 (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":"crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_c_element_tree.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"794bb185bd79fb0f014e71933cd8c564c83bc8792e4414c1d79b6b62789111a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Notebook::from_raw_notebook (cognitive 26): Notebook::from_raw_notebook has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (8 pts), match/switch 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":"crates/ruff_notebook/src/notebook.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8044535b0462d8fe55c95799026b62d5b4eca6d077f56f30a377f35d165f5d80"}},{"ruleId":"D2","level":"warning","message":{"text":"FlatBinaryExpressionSlice::fmt (cognitive 26): FlatBinaryExpressionSlice::fmt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/expression/binary_like.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ca0cfbea3802442cd99c95baef644931acde7c4f6b304b1f8edc68df204b53"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatExprAttribute::fmt_fields (cognitive 26): FormatExprAttribute::fmt_fields has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, match/switch 1 (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":"crates/ruff_python_formatter/src/expression/expr_attribute.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"69627006edf18fdbb220dad18903d63ff88043dc9fa8106439145a88bd87911b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_formatter::comments::placement::handle_enclosed_comment (cognitive 26): ruff_python_formatter::comments::placement::handle_enclosed_comment has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 2 (3 pts), boolean chains 2 (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":"crates/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a609b3f0f6ab381d30c2ea2777f832ab7b09994607c961221e27277e06836c08"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_match_pattern_literal (cognitive 26): Parser::parse_match_pattern_literal has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/parser/pattern.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8d74d17bf146576665815082141fd64257b5acd08af74e4c03740792cfd664"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassType::into_callable_with_receiver (cognitive 26): ClassType::into_callable_with_receiver has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0313b9eae30327c61ab0a6e6dfd0ce46040253f6dbe91d221babbb5f293d2b29"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_and_check_argument_types (cognitive 26): TypeInferenceBuilder::infer_and_check_argument_types has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, loops 2 (3 pts), match/switch 2 (3 pts) (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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":6060}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b4dcd3361b698a8809467f688c5491a7635969ae686184b5864bd57c119fbe"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionElement::try_reduce (cognitive 26): UnionElement::try_reduce has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 3, match/switch 2 (3 pts) (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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8e09dd37955de5b66768e1bc017c78c4f115aa26f9bfd5df9dc57471a746fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::find_legacy_typevars_impl (cognitive 26): Type::find_legacy_typevars_impl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (10 pts), match/switch 3 (4 pts) (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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":10430}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d323a119afaaec038ce347ee1cf1f963948668e9341e1bc38d5af640e29e232"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorAssertionParser::parse (cognitive 25): ErrorAssertionParser::parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mdtest/src/assertion.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da5ebb4ac4a9b4b3804f7c5d62538317eca3c4d6322fc9412baba2935039317"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_formatter::buffer::clean_interned (cognitive 25): ruff_formatter::buffer::clean_interned has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (8 pts), loops 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":"crates/ruff_formatter/src/buffer.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc255f47c872b864deb363f83c6bea4edbaa985c9603800f2fa9d2704bb27135"}},{"ruleId":"D2","level":"warning","message":{"text":"ReturnVisitor::visit_stmt (cognitive 25): ReturnVisitor::visit_stmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_return/visitor.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab37d289e9e95d0d365f58a828893919a71204c0add4ea8d81cc86b77dac9df"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingTarget::try_from_expr (cognitive 25): TypingTarget::try_from_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 1, 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":"crates/ruff_linter/src/rules/ruff/typing.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"386cf08935f25258073988eda1093c88f18b09400a7d45fabf30b241c843d477"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bandit::rules::django_extra::is_call_insecure (cognitive 25): ruff_linter::rules::flake8_bandit::rules::django_extra::is_call_insecure has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 3 (11 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bandit/rules/django_extra.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"82898229ee4bd237ba7f8cb235f882de3a87d7c1a20571ed692a4c0dfdf3b749"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::unnecessary_type_union::unnecessary_type_union (cognitive 25): ruff_linter::rules::flake8_pyi::rules::unnecessary_type_union::unnecessary_type_union has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 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":"crates/ruff_linter/src/rules/flake8_pyi/rules/unnecessary_type_union.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c65a4924a92bc305ce45e3f11494f710f98aa6b8bacf32b09172784cd35145"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::perflint::rules::manual_list_comprehension::convert_to_list_extend (cognitive 25): ruff_linter::rules::perflint::rules::manual_list_comprehension::convert_to_list_extend has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 5 (8 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":"crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb675b6609e69fbfdddef3f63c8c724f28955debb41f198a9e7687b0ca24b40c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::tryceratops::rules::verbose_raise::verbose_raise (cognitive 25): ruff_linter::rules::tryceratops::rules::verbose_raise::verbose_raise has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (21 pts), loops 2 (4 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/tryceratops/rules/verbose_raise.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d158e0826d7156ccf2f60072016d87988df5e3f824831b14dd11617d06007179"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatParameters::fmt_fields (cognitive 25): FormatParameters::fmt_fields has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (20 pts), loops 3, boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/ruff_python_formatter/src/other/parameters.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"637cf0b24701ecc5e1c70264a28d9fce9259f7e97c1565151d171e3da92c95d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_set_or_dict_like_expression (cognitive 25): Parser::parse_set_or_dict_like_expression has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 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":"crates/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d712c0eac66f50bb794366ba1dd27046a756f8e921e6a07da00dd5734c8322"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_ipython_escape_command_value (cognitive 25): Parser::parse_ipython_escape_command_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 3, 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":"crates/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a9f6abff2cb7ab74e497e89bb44ab7ac41e381b57df8055541e3c924c1e6a9"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticSyntaxChecker::debug_shadowing (cognitive 25): SemanticSyntaxChecker::debug_shadowing has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 3 (7 pts), match/switch 2 (4 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":"crates/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f335370f820107928901949034b9284a8560d4185385f217fd5a82f9e90ae3b4"}},{"ruleId":"D2","level":"warning","message":{"text":"StringParser::parse_interpolated_string_middle (cognitive 25): StringParser::parse_interpolated_string_middle has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (7 pts), boolean chains 2, 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/ruff_python_parser/src/string.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"245c3fda7419f09b009c3baacba16062f00b0d479de46116db113fe5cd31567c"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticModel::lookup_symbol_in_scope (cognitive 25): SemanticModel::lookup_symbol_in_scope has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (3 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":"crates/ruff_python_semantic/src/model.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c822586563b63c5ab0663799d579b2bb06b9bad12148d4bcc70a04bd64bae5"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_workspace::resolver::match_any_exclusion (cognitive 25): ruff_workspace::resolver::match_any_exclusion has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (24 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":"crates/ruff_workspace/src/resolver.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b3a813fee25666e64362dd15296bce9f84a54a96b7d9ce048ea8c4367e45ec"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaceFromDeclarationsResult::with_imported_final_impl (cognitive 25): PlaceFromDeclarationsResult::with_imported_final_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/place.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da56a06379ab969209839bc7552fba9fd86dac2b4547a2846177a4ed36e88ab"}},{"ruleId":"D2","level":"warning","message":{"text":"CallArguments::with_known_unpacking (cognitive 25): CallArguments::with_known_unpacking has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/arguments.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"b269f9390cd453a8999ba47e6f509ed0f48b2e50506ce244d893889135b86924"}},{"ruleId":"D2","level":"warning","message":{"text":"Bindings::report_element_diagnostics (cognitive 25): Bindings::report_element_diagnostics has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe3e5a0f6a9a42a38798fd82b6076f4981096811dc0212590ab9bed88cba2de"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassType::abstract_methods (cognitive 25): ClassType::abstract_methods has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 12). Of this number, 24 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/ty_python_semantic/src/types/abstract_methods.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"641ef8fdf1e30e8bde36d92052d8a2c063b3fd4af98cc2ef8418b7c68ae89044"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_exception (cognitive 25): TypeInferenceBuilder::infer_exception has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a547904fb8390e50781df4abe06825cbea5e2fab8c433484334ae209a8efe0e7"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRelationChecker::check_protocol_member_read (cognitive 25): TypeRelationChecker::check_protocol_member_read has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (20 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":"crates/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d3b51b190c0ea7f2a6b6778b1579d79cc93338af55421e0f61f839a6144f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRelationChecker::check_fixed_length_tuple_vs_tuple_spec (cognitive 25): TypeRelationChecker::check_fixed_length_tuple_vs_tuple_spec has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), match/switch 2 (3 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":"crates/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e3ad232411a97a9c24c0836f124ea8e34b094c95a2d59dc4399cc3a09ee3a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Signature::bind_self_with_receiver (cognitive 25): Signature::bind_self_with_receiver has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 8, match/switch 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":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcceb48d5c195b7b855f8edbfe816826c43138b092833c3755db094c40cce696"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::in_type_expression_impl (cognitive 25): Type::in_type_expression_impl has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 4 (9 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). 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/ty_python_semantic/src/types.rs"},"region":{"startLine":9184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf842896a9adcd3c144c8b10c5d3d63d92b632c2dee388288fc607bb804b45e"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::diagnostic::report_invalid_key_on_typed_dict (cognitive 25): ty_python_semantic::types::diagnostic::report_invalid_key_on_typed_dict has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":4617}}}],"partialFingerprints":{"codehealthFindingId/v1":"4662113b73ae6fb2b4099c81673f6b49f60c7131dff8f0fa24a77fd563f20074"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::enums::inherited_enum_data_type (cognitive 25): ty_python_semantic::types::enums::inherited_enum_data_type has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (5 pts), loops 2 (3 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":"crates/ty_python_semantic/src/types/enums.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d02e8c3d0dd64d6dccb999d6fe1a2a3009c47aa64f494a79af5cb3dfa4f16b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::subscript::legacy_generic_class_context (cognitive 25): ty_python_semantic::types::infer::builder::subscript::legacy_generic_class_context has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f4f193d8aa6c9e5e438a204dcb33224af574d23e4526d6be5a41d268396bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::match_pattern::definite_match_pattern_type_for_subject_impl (cognitive 25): ty_python_semantic::types::match_pattern::definite_match_pattern_type_for_subject_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 2 (3 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":"crates/ty_python_semantic/src/types/match_pattern.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9c1278c43daa8ae9bdd0f2833904c9439ba5946400f9de3fac519c7ed552a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::process_code_block (cognitive 24): Parser::process_code_block has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mdtest/src/parser.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"9505560c77653f9bf3500c6d9a0d6f25ca06f31b5ba3efe1831836c1e0880024"}},{"ruleId":"D2","level":"warning","message":{"text":"mdtest::validate_inline_snapshot (cognitive 24): mdtest::validate_inline_snapshot has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (23 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":"crates/mdtest/src/lib.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"70894e48f869d4c8c7c001c8aeb0b8b69131097c3ed71e14493e3d546c991056"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_datetimez::rules::call_datetime_strptime_without_zone::call_datetime_strptime_without_zone (cognitive 24): ruff_linter::rules::flake8_datetimez::rules::call_datetime_strptime_without_zone::call_datetime_strptime_without_zone has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (6 pts), loops 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":"crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_strptime_without_zone.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d6f5394b6d1b003bf6167402e987dc0b347b7d46d5a6a8811d85731a83cd17"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_implicit_str_concat::rules::implicit::implicit (cognitive 24): ruff_linter::rules::flake8_implicit_str_concat::rules::implicit::implicit has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 4 (10 pts), boolean chains 2, 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/ruff_linter/src/rules/flake8_implicit_str_concat/rules/implicit.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d585e7d2ec3c3ffbab426a72faf6f244066f6bb38df89c7a3b6995726609800"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pytest_style::rules::parametrize::check_values (cognitive 24): ruff_linter::rules::flake8_pytest_style::rules::parametrize::check_values has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9c7124e3a2d8e3a7d4ec9acddd403071853587257a9603ebbc4af53286f30f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::collapsible_if::nested_if_statements (cognitive 24): ruff_linter::rules::flake8_simplify::rules::collapsible_if::nested_if_statements has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 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":"crates/ruff_linter/src/rules/flake8_simplify/rules/collapsible_if.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"498435032029a980ce1abca5a0becb30f15a4ce42b4eae5a67c38228b764dd5e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::logging::logging_call (cognitive 24): ruff_linter::rules::pylint::rules::logging::logging_call has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/logging.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"22605e1146d4ce79272e9beb0e08366e0402e56bd363d706a54f0e63f6560a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::refurb::rules::sorted_min_max::sorted_min_max (cognitive 24): ruff_linter::rules::refurb::rules::sorted_min_max::sorted_min_max has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 5 (8 pts), boolean chains 2, 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/ruff_linter/src/rules/refurb/rules/sorted_min_max.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d4ec1018f617a4051915515050fd7ca5696c1be8ad45ac290f6b83fdc9320d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::explicit_f_string_type_conversion::explicit_f_string_type_conversion (cognitive 24): ruff_linter::rules::ruff::rules::explicit_f_string_type_conversion::explicit_f_string_type_conversion has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (2 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/ruff_linter/src/rules/ruff/rules/explicit_f_string_type_conversion.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edf0d1bca7d2e1a1d0f49d07001dbb24a8818813e49b5a0d8137deba33289d1"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeActions::run_with_snapshot (cognitive 24): CodeActions::run_with_snapshot has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, match/switch 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":"crates/ruff_server/src/server/api/requests/code_action.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3824a3e32811a31eaa3071cf5f450989f37da13d0075797cd4c23607e0bc27"}},{"ruleId":"D2","level":"warning","message":{"text":"ty::run_check (cognitive 24): ty::run_check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, boolean chains 3, match/switch 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":"crates/ty/src/lib.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9884efd352035da1505e3c76245cc7097683d9365cabf1703a7f01017adee3af"}},{"ruleId":"D2","level":"warning","message":{"text":"PendingReachability::merge_place_states (cognitive 24): PendingReachability::merge_place_states has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (3 pts), boolean chains 2, 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":"crates/ty_python_core/src/use_def.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabf80ae7193ed2ae11fbcafa9107b559977fcef1c1705739bc1682ec711b6fc"}},{"ruleId":"D2","level":"warning","message":{"text":"MroLookup::class_member (cognitive 24): MroLookup::class_member has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f01cc46c15d4a3743f7bc61cd5f418ed4212303325765ea7b55c1829b05497"}},{"ruleId":"D2","level":"warning","message":{"text":"CandidateSolutions::promote_for_argument_context (cognitive 24): CandidateSolutions::promote_for_argument_context has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (6 pts), boolean chains 3, 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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":4063}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c34f2121f02c25ee41fd46379ae5f964a0ff0e30daa36c2e167ea42e8e36ab"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::parse_enum_members_from_sequence (cognitive 24): TypeInferenceBuilder::parse_enum_members_from_sequence has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 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":"crates/ty_python_semantic/src/types/infer/builder/enum_call.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"739c655e2a1bc335eb3bca47faa36e15a0bd91a5ecda309fcf9cbf7761dee252"}},{"ruleId":"D2","level":"warning","message":{"text":"NarrowingConstraintsBuilder::evaluate_expr_compare_op (cognitive 24): NarrowingConstraintsBuilder::evaluate_expr_compare_op has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":3919}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b85045ea9f3f642cee3192e65718296db10d59d7039b8951b79ed6292db0f11"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRelationChecker::check_protocol_member_access_pair (cognitive 24): TypeRelationChecker::check_protocol_member_access_pair has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, 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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"55125566076f35e37e9a58861525e3abef3fa35c6ddf31a897dc8ce433fc89b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::try_call_dunder_get::try_call_dunder_get_inner (cognitive 24): Type::try_call_dunder_get::try_call_dunder_get_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7f194799a1e7d96c2f2d8389080436384c6935e1802f03a7d7a6dd5312c18f"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::place::loop_header_reachability_impl (cognitive 24): ty_python_semantic::place::loop_header_reachability_impl has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/place.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"4033d8ad946a52c14c20aa5d7554b2da219f08ae7e2015dec4d4eb4b281c915b"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::diagnostic::report_overridden_final_method (cognitive 24): ty_python_semantic::types::diagnostic::report_overridden_final_method has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 3, match/switch 1 (2 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":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5540}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c2aeab7d5e85df0ea35af8fb7b63a6712ece4423fb5e9431da1b29cd14256f"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::ide_support::stub_mapping::map_stub_definition (cognitive 24): ty_python_semantic::types::ide_support::stub_mapping::map_stub_definition has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce12a525d06ee7da63793fbd87cbf1b306525bd0575b2fc21070da9f6df59b97"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::bind_attribute (cognitive 24): ty_python_semantic::types::overrides::attributes::bind_attribute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 6 (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":"crates/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"169741eaa1df7f5020dce6b1141ec06d72b12f80c7eeff02b763edc48a91fc0e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeActionRequestHandler::run_with_snapshot (cognitive 24): CodeActionRequestHandler::run_with_snapshot has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (8 pts), loops 2 (4 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":"crates/ty_server/src/server/api/requests/code_action.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e013332748539e452fb052c5234719b15e0e2ef0f303ff4b316b3392ce3578"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineFileAssertions::from_comment_ranges (cognitive 23): InlineFileAssertions::from_comment_ranges has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mdtest/src/assertion.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f833a1db77252358bb637ec693ae746f71562c68612f6f193e49479c3cffdccd"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupNameFinder::visit_expr (cognitive 23): GroupNameFinder::visit_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bugbear/rules/reuse_of_groupby_generator.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64df9982ccc82d881ba6b1a18d25435a580219aa462238f91b4dc571fc15be0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::airflow::rules::removal_in_3::is_context_key_access (cognitive 23): ruff_linter::rules::airflow::rules::removal_in_3::is_context_key_access has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 2 (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":"crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cde96b3e0f27c3bd9f9069b7059332d67a020296701eab98c9d72d6bb91c32"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_comprehensions::rules::unnecessary_comprehension::unnecessary_list_set_comprehension (cognitive 23): ruff_linter::rules::flake8_comprehensions::rules::unnecessary_comprehension::unnecessary_list_set_comprehension has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, 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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_comprehension.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2285b63647e8b0cea506b6fa4f6bda00b4e3749b24ae91c647200f9f74fbe9a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_django::rules::exclude_with_model_form::exclude_with_model_form (cognitive 23): ruff_linter::rules::flake8_django::rules::exclude_with_model_form::exclude_with_model_form has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (6 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/ruff_linter/src/rules/flake8_django/rules/exclude_with_model_form.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed490a1e4c1c263bae1ee583e8f89e2870c6a9c28da75fff6747e5ea3cab3517"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::needless_bool::needless_bool (cognitive 23): ruff_linter::rules::flake8_simplify::rules::needless_bool::needless_bool has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 3 (5 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/needless_bool.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f8045c8de29a64bdebb247a93eb83d5ccd62292127efc36d3b1f665f39396f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::blank_after_summary::blank_after_summary (cognitive 23): ruff_linter::rules::pydocstyle::rules::blank_after_summary::blank_after_summary has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (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":"crates/ruff_linter/src/rules/pydocstyle/rules/blank_after_summary.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1978eac3f4b75564aadfc7f57ae6e0cfa674633305ab53416d2c4343ff8577c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::sections::missing_args (cognitive 23): ruff_linter::rules::pydocstyle::rules::sections::missing_args has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcce468570131b80b67a9b4e8930b03289718f844e7d23ee0655f1b34bbc222"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::bad_string_format_character::call (cognitive 23): ruff_linter::rules::pylint::rules::bad_string_format_character::call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/bad_string_format_character.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29a6f73a78e8b2616dc880ded41f08912526d6c6530764c96a01666dd9559d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::compare_to_empty_string::compare_to_empty_string (cognitive 23): ruff_linter::rules::pylint::rules::compare_to_empty_string::compare_to_empty_string has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/compare_to_empty_string.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eafc066be3cad72ab478df4eb7cf4d4e3c422e8b16bdc58b3881b0a9fa8b7f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::repeated_keyword_argument::repeated_keyword_argument (cognitive 23): ruff_linter::rules::pylint::rules::repeated_keyword_argument::repeated_keyword_argument has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (5 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":"crates/ruff_linter/src/rules/pylint/rules/repeated_keyword_argument.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b423596007c7232abe92ed1da21daf59a5a42a162b64feb9711a408ec26402"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::deprecated_mock_import::clean_import_aliases (cognitive 23): ruff_linter::rules::pyupgrade::rules::deprecated_mock_import::clean_import_aliases has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (5 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":"crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfc466215c5728c5de8a5efaa72a9c05ba720fcb5c93e5b37146438dc250b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::printf_string_formatting::convertible (cognitive 23): ruff_linter::rules::pyupgrade::rules::printf_string_formatting::convertible has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 6, 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/ruff_linter/src/rules/pyupgrade/rules/printf_string_formatting.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcb1cd5c93719b91a20245b7bc9d0e9f647021fbac17060a6e07e8cbd856dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_macros::map_codes::map_codes (cognitive 23): ruff_macros::map_codes::map_codes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6 (8 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":"crates/ruff_macros/src/map_codes.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54d617f14ed6bf0b7fbd4497e804922ddfe97f4815e7d6be3b3033428277e8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_comma_separated_list (cognitive 23): Parser::parse_comma_separated_list 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":"crates/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"63699571ca35a1d1bc506e3525dcc9ac372b994b8da663ca36bbec3e1b36e4b7"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalReferencesFinder::enter_node (cognitive 23): LocalReferencesFinder::enter_node has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/references.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6d679c82c3cc05db046a3446e890d020d1182cd229f0cbe397bd78b0f702b4"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticTokenVisitor::visit_expr (cognitive 23): SemanticTokenVisitor::visit_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (8 pts), loops 1 (2 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":"crates/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"109630b9ca2e5f605248d369f7e3e99ee46c4d6366420a6373bdeb3b8ec9bb99"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_ide::docstring::markdown::structured::render_sections_into (cognitive 23): ty_ide::docstring::markdown::structured::render_sections_into has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/docstring/markdown/structured.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c72e959bb14e951ae52debf7162ede06d18dc407c98b7a9985e9ff91ca3c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_ide::hover::hover (cognitive 23): ty_ide::hover::hover has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/hover.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8656b9458dec175fe17b2f940479ccd73aac798a3c8f83e2e163ada9c1bb601"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_module_resolver::resolve::site_packages_editables (cognitive 23): ty_module_resolver::resolve::site_packages_editables has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_module_resolver/src/resolve.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"300f31d1818ac1af0cb2eaf2d4e4485ac78a615760c587acd7c43b05a44fde52"}},{"ruleId":"D2","level":"warning","message":{"text":"UvEnvironments::poll_sync (cognitive 23): UvEnvironments::poll_sync has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 4 (11 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":"crates/ty_project/src/uv/environments.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"719ce110e1826e5864d8337f2eab5bea66aa17178b0ba454f709714a6fcd9336"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundSuperError::report_diagnostic (cognitive 23): BoundSuperError::report_diagnostic has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 2 (4 pts) (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":"crates/ty_python_semantic/src/types/bound_super.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"05efb76c5f7db9918a9eb9a60978022de4e0ee20ec419281a8a13ca1e452b7de"}},{"ruleId":"D2","level":"warning","message":{"text":"Binding::argument_type_context (cognitive 23): Binding::argument_type_context has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 7 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8996}}}],"partialFingerprints":{"codehealthFindingId/v1":"f680d881285d8e0f762e59545f2c3a63264a06d825334179b6528f1b5c2aba5c"}},{"ruleId":"D2","level":"warning","message":{"text":"Binding::partial_application (cognitive 23): Binding::partial_application has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":9662}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e800aec96e506ef2ef5239016e4f95296c2d46aa56e7e3bb16d17055c9a4299"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticClassLiteral::merged_dataclass_params (cognitive 23): StaticClassLiteral::merged_dataclass_params has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94431d4604c6c8b6269f4d937f05bf2cd579039ec8a5e63324e0b9ea16632c0"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayParameter::fmt_detailed (cognitive 23): DisplayParameter::fmt_detailed has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (7 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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce546a1bd77ba49a7629031a8b6246c071a5d2d0b727055c77e5eeafeb72876"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::invalid_assignment_to_final_attribute (cognitive 23): TypeInferenceBuilder::invalid_assignment_to_final_attribute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (21 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/ty_python_semantic/src/types/infer/builder/final_attribute.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"423c1757e5fddad07b3d43b20f6d367dc413c3780dc4dce815cc7b4e8c53d3c8"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_region_scope (cognitive 23): TypeInferenceBuilder::infer_region_scope has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts), match/switch 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5417c73c53971b0fd97e735ed58b975f5f3f62f027743711aafa1d9986d3baaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::visit_specialization_impl (cognitive 23): Type::visit_specialization_impl has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":4089}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbac419b2ac71925cea5aba0fe2e022c12b71fef5924121e2c32b0e28e3f076e"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::narrow::specialize_narrowing_target (cognitive 23): ty_python_semantic::types::narrow::specialize_narrowing_target has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"3721bf56a6dadd29d3787dafb7170f12d36366506abcf0c41be1d237be87d57a"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::typed_dict::validate_merged_unpacked_keyword_argument (cognitive 23): ty_python_semantic::types::typed_dict::validate_merged_unpacked_keyword_argument has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 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":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":2990}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db92e7e4ce9d3bcfb9b8876a64eb2053bcfcefdc348910795dba16376a400aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_server::server::api::semantic_tokens::generate_semantic_tokens (cognitive 23): ty_server::server::api::semantic_tokens::generate_semantic_tokens has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/ty_server/src/server/api/semantic_tokens.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18ea7f1a002987ee1a76fbcf2f8bc30ddcef642b81b8f4c6aa2fbd9f342c401"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff::commands::format::format_path (cognitive 22): ruff::commands::format::format_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 3 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/format.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c775baf2be58c4e3204ac29eb3d3e8b9dddf7a3109023a60247afae95300d8c"}},{"ruleId":"D2","level":"warning","message":{"text":"JunitRenderer::render (cognitive 22): JunitRenderer::render has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_db/src/diagnostic/render/junit.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a032158df4c029763454065db098f0ad20d36c8a62b203bae6337937ab4c0461"}},{"ruleId":"D2","level":"warning","message":{"text":"FileNoqaDirectives::extract (cognitive 22): FileNoqaDirectives::extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (5 pts), match/switch 2 (5 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":"crates/ruff_linter/src/noqa.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c4e7b56a1f82bc2742cb3934a9ab0a910d75e45aaf9bc9ab3334e45226d14f"}},{"ruleId":"D2","level":"warning","message":{"text":"LoggerCandidateVisitor::visit_expr (cognitive 22): LoggerCandidateVisitor::visit_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (20 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/tryceratops/helpers.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0516df86c817734c2ea40d9fdd7939356d096159c0b94640fb49f4f243bf032"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::fastapi::rules::fastapi_unused_path_parameter::fastapi_unused_path_parameter (cognitive 22): ruff_linter::rules::fastapi::rules::fastapi_unused_path_parameter::fastapi_unused_path_parameter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/fastapi/rules/fastapi_unused_path_parameter.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb81231a2c7ded70e470505178bac5b2206902cbb71469a813460a1ba5430f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_comprehension_in_call (cognitive 22): ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_comprehension_in_call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (6 pts), match/switch 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"b118dccc07ec94cd5be2808e0eb065a110fdeaa01cb85ac22fb610321f215339"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::redundant_numeric_union::check_annotation (cognitive 22): ruff_linter::rules::flake8_pyi::rules::redundant_numeric_union::check_annotation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5, match/switch 1 (2 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/ruff_linter/src/rules/flake8_pyi/rules/redundant_numeric_union.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf0715a12ad6020a2649e43e59a42a33fa909ad58c416772790873db1a0a1de"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pytest_style::rules::raises::raises_call (cognitive 22): ruff_linter::rules::flake8_pytest_style::rules::raises::raises_call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 2 (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":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/raises.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fff9ff14db8e9dce1619744dd07f834854919ac8023937786f5a9ff2c9c150a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_quotes::rules::check_string_quotes::strings (cognitive 22): ruff_linter::rules::flake8_quotes::rules::check_string_quotes::strings 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":"crates/ruff_linter/src/rules/flake8_quotes/rules/check_string_quotes.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6554ecfd8fb1842d2bd7c5c78a8633be3fc90ca592903aa6d5616f75f4b0e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_slots::helpers::has_slots (cognitive 22): ruff_linter::rules::flake8_slots::helpers::has_slots has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 2 (4 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":"crates/ruff_linter/src/rules/flake8_slots/helpers.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4618c156301f6708169d33c0ff6b8639e5bcc42f57760417f7877e70875272a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydoclint::rules::check_docstring::parse_parameters_numpy (cognitive 22): ruff_linter::rules::pydoclint::rules::check_docstring::parse_parameters_numpy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (6 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c94e2313785c52627d7106499b4dbc8cd419b9d94498bc353894b7dcd67a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::unparse_pattern (cognitive 22): Generator::unparse_pattern has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (8 pts), match/switch 2 (4 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_codegen/src/generator.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e7a332b8748d8c73518d13a0f3fbd99ec413a3c194163461a693f8977b2e34"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatImplicitConcatenatedStringFlat::fmt (cognitive 22): FormatImplicitConcatenatedStringFlat::fmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/string/implicit.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f571887c18fb0f1796d38c182973617932cd892438111a1bd168fec061cf6c7d"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryContextKind::list_terminator_kind (cognitive 22): RecoveryContextKind::list_terminator_kind has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (8 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":"crates/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"186baae8daf7e1801a195539429fadbe8d3c8a554afb5a4019bd213572ad7704"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_workspace::resolver::project_files_in_path (cognitive 22): ruff_workspace::resolver::project_files_in_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 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/ruff_workspace/src/resolver.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9d4553a7682ec3e468fa4932347ea063c31ccf125cadef61ec9dee87f7e21c"}},{"ruleId":"D2","level":"warning","message":{"text":"SectionItem::render (cognitive 22): SectionItem::render has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 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":"crates/ty_ide/src/docstring/markdown/structured.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89a718a870c0294c140ed843a086621f4194e2e23d8793746451828f70df628"}},{"ruleId":"D2","level":"warning","message":{"text":"FoldingRangeVisitor::add_import_ranges (cognitive 22): FoldingRangeVisitor::add_import_ranges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 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":"crates/ty_ide/src/folding_range.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"810728814561e70fcfa5e3aa48b9d251e5a1db3986fe9b0eb577cbe6438a7066"}},{"ruleId":"D2","level":"warning","message":{"text":"FoldingRangeVisitor::add_comment_ranges (cognitive 22): FoldingRangeVisitor::add_comment_ranges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, 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/ty_ide/src/folding_range.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3508d6b43ee13bdde7aa83340d7e04a5b3853c5693b2a91df6bbe2e17a9d66a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructorBinding::instance_return_specialization (cognitive 22): ConstructorBinding::instance_return_specialization has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). 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/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f0623e34e9e330579d7b8db4f2984f3a2b06867000455fdf0c6b9b6ecc119f"}},{"ruleId":"D2","level":"warning","message":{"text":"CallInference::intersect_specialized_returns (cognitive 22): CallInference::intersect_specialized_returns has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts), boolean chains 3, 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6716}}}],"partialFingerprints":{"codehealthFindingId/v1":"2244cec7eaac1cfc41b8505e144984dd333a409714c363a2370a10db18c76703"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticClassLiteral::validate_members (cognitive 22): StaticClassLiteral::validate_members has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 2, match/switch 1 (2 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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":2715}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d60a62db9dca6a2699d3291a2bade50ff91b2e34cbd31c580678609f21e1e3"}},{"ruleId":"D2","level":"warning","message":{"text":"MroLookup::class_body_declaration (cognitive 22): MroLookup::class_body_declaration has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, 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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":2873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12eee983a4ff2746b44fb3c546755e9c45f2a34b8df00f1e19e0d1cc40bc16e"}},{"ruleId":"D2","level":"warning","message":{"text":"PathAssignments::discover_constraint (cognitive 22): PathAssignments::discover_constraint has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 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":"crates/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc60034c0402b2c3b4948957c4eebc0d7187e4aecbc5add445ebacf9fd882b7a"}},{"ruleId":"D2","level":"warning","message":{"text":"SolutionWalker::binary_lower_bound_visits (cognitive 22): SolutionWalker::binary_lower_bound_visits has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6, 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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a44cb5ebf9db1a41a15f288c1a6492fa71cde70063a812dafd2a80227ee36ea"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayKnownInstanceRepr::fmt_detailed (cognitive 22): DisplayKnownInstanceRepr::fmt_detailed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 1 (2 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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":3892}}}],"partialFingerprints":{"codehealthFindingId/v1":"459b6e65bdfc61af550c42d76ed1a85f39ddf5accce70b53adfb474d2f82f4e3"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::check_union_operator (cognitive 22): TypeInferenceBuilder::check_union_operator has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (4 pts), loops 1 (3 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":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"832bd58d83a0642efcfa23b758fe3f7e43b72b9aa6c19b9f2d2dc6590c4d8859"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_literal_parameter_type (cognitive 22): TypeInferenceBuilder::infer_literal_parameter_type has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (6 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":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":3197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6ca6fe9ca5590603dee241071e88fbb7c76553e42555b5b9419003bbc857e7"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_target_impl (cognitive 22): TypeInferenceBuilder::infer_target_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (6 pts), match/switch 2 (5 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":3491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c4c40980bf6e838b3ff503c28ede1ac52decebd3976de9ad381d8923bb78d4"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_all_argument_types (cognitive 22): TypeInferenceBuilder::infer_all_argument_types has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":6615}}}],"partialFingerprints":{"codehealthFindingId/v1":"1444ae8464515dabe8cde1976e93bae5f564ff08a5af43de9e27f99e559844e2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_chained_boolean_types (cognitive 22): TypeInferenceBuilder::infer_chained_boolean_types has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (9 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":11988}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c155db26d291e4d656ebd3267b52ca23da9cde21f0643e5499aa208cb7417ef"}},{"ruleId":"D2","level":"warning","message":{"text":"NarrowingConstraintsBuilder::evaluate_expr_call (cognitive 22): NarrowingConstraintsBuilder::evaluate_expr_call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, 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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":4614}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf39f7a0040f986e77da89127e9f1d6efe0e5df7acb41a6233d63ee232912a0"}},{"ruleId":"D2","level":"warning","message":{"text":"NarrowingConstraintsBuilder::evaluate_type_guard_call (cognitive 22): NarrowingConstraintsBuilder::evaluate_type_guard_call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, 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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":4767}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb09c919cc96b4621507d074fc66f9ffef585d6671227dc57b8722535a1abcd"}},{"ruleId":"D2","level":"warning","message":{"text":"InnerIntersectionBuilder::has_empty_enum_complement (cognitive 22): InnerIntersectionBuilder::has_empty_enum_complement has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"907f32f73ee189aa6cf840d9acf49b7d3630a0f2338b574a893518b0d1756653"}},{"ruleId":"D2","level":"warning","message":{"text":"Parameters::with_transformed_parameters (cognitive 22): Parameters::with_transformed_parameters has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, match/switch 2 (3 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":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5282}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba018e29955b77a6aaf67aeb9a0bd00268732f50c92b0c7ff4b1505aef650fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::diagnostic::report_invalid_or_unsupported_base (cognitive 22): ty_python_semantic::types::diagnostic::report_invalid_or_unsupported_base has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (4 pts), 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":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":4412}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ee88922767e8667fcf5e458de27187593b8383e74d80f6d21f3992f698f845"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::ide_support::direct_subtypes (cognitive 22): ty_python_semantic::types::ide_support::direct_subtypes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c2df5fadfd66e338caade7059f13bfd7684a687a59576db80f7ed9476ba410"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::overloaded_function::check_non_generic_overload_implementation_consistency (cognitive 22): ty_python_semantic::types::infer::builder::post_inference::overloaded_function::check_non_generic_overload_implementation_consistency has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (3 pts), match/switch 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":"crates/ty_python_semantic/src/types/infer/builder/post_inference/overloaded_function.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"184aa0fcb4570ceeb5e7b2d688f61bea3afb6d7ea481f8159377806e238ecf26"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::typed_dict::validate_typed_dict_class_body_statements (cognitive 22): ty_python_semantic::types::infer::builder::post_inference::typed_dict::validate_typed_dict_class_body_statements has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/post_inference/typed_dict.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4daa80c495690e27fe5b2e417c89f3e4428ce1392b1c3cd4976c79f88ade505"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_site_packages::site_packages_directories_from_sys_prefix (cognitive 22): ty_site_packages::site_packages_directories_from_sys_prefix has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3 (7 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":"crates/ty_site_packages/src/lib.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6ea6a9f5ead1d2cfdaf5ba65469b36226ad44be29e633b3be8456504b237e1"}},{"ruleId":"D2","level":"warning","message":{"text":"SecondaryPanel.SecondaryPanel (cognitive 22): SecondaryPanel.SecondaryPanel has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 2 (5 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 8 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/ruff/src/Editor/SecondaryPanel.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b90fe34f976838a89adb37b8683b3d05ed61af0df84aea012ecbaa6c35c8b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Files.FileEntry (cognitive 22): Files.FileEntry has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 5 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 8). Of this number, 14 points are the body\u0027s own statements and 8 belong to 3 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":"playground/ty/src/Editor/Files.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b0cfb1de3af4c293bf8c14aa819c113d76e5d75d87a4f456a3a6a016933b05"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryWalker::walk (cognitive 21): MemoryWalker::walk has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (8 pts), loops 2 (3 pts) (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/ruff_db/src/system/memory_fs.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a9f68388a6bd40c1fb5540e9b5688a8e35c96e47d6acc70de056486669ba18"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::propagate_expand::propagate_expands (cognitive 21): Document::propagate_expand::propagate_expands has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (8 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":"crates/ruff_formatter/src/format_element/document.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d028b45ead3a80d23b13b77b5f66fe48c4b95bee4dc40a9ac2476579b6d252"}},{"ruleId":"D2","level":"warning","message":{"text":"SortClassification::of_elements (cognitive 21): SortClassification::of_elements has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/sequence_sorting.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"624a3cff52aea2e52d1e98f4733674696a0065fb92f4da344293cd1996506172"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::directives::extract_isort_directives (cognitive 21): ruff_linter::directives::extract_isort_directives has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, 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":"crates/ruff_linter/src/directives.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc6148db8b2f3691156229a73287c7948f17ed6b2144d95a32a90e5e9f00c41"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::linter::lint_fix (cognitive 21): ruff_linter::linter::lint_fix has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/linter.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0d57f5f6a22b986663d8f6c67d9eff5cd40851e2de8fc6e6ff120ccbc61c18"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bandit::rules::hardcoded_bind_all_interfaces::hardcoded_bind_all_interfaces (cognitive 21): ruff_linter::rules::flake8_bandit::rules::hardcoded_bind_all_interfaces::hardcoded_bind_all_interfaces has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (6 pts), match/switch 2 (4 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":"crates/ruff_linter/src/rules/flake8_bandit/rules/hardcoded_bind_all_interfaces.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c72cd9a9e3987f8cb851c516bb5e5427b364772b72920e4f3aa8173253a8b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pie::rules::unnecessary_spread::unnecessary_spread_fix (cognitive 21): ruff_linter::rules::flake8_pie::rules::unnecessary_spread::unnecessary_spread_fix has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (4 pts), boolean chains 2, 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":"crates/ruff_linter/src/rules/flake8_pie/rules/unnecessary_spread.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf89e9975b6796ce89e7bb22a7816762980551e4e6a4c5ad769c73718ef745d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::unused_private_type_definition::unused_private_type_var (cognitive 21): ruff_linter::rules::flake8_pyi::rules::unused_private_type_definition::unused_private_type_var has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 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":"crates/ruff_linter/src/rules/flake8_pyi/rules/unused_private_type_definition.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9a191c651b09982702275acbfc396df318ac289781413384a90beb35f5c434"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::isort::format_imports (cognitive 21): ruff_linter::rules::isort::format_imports has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (7 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/isort/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b05e8bfaa470612169d3a4b657aa86f318961d3f09fadace3892fda12bee25"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::missing_whitespace::missing_whitespace (cognitive 21): ruff_linter::rules::pycodestyle::rules::logical_lines::missing_whitespace::missing_whitespace has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 2 (7 pts), boolean chains 2, 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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/missing_whitespace.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e9450a2f8e04c20ca969d75219c33e2b33aa79caa2a34e7c3ca6b659b79217"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::helpers::get_section_contexts (cognitive 21): ruff_linter::rules::pydocstyle::helpers::get_section_contexts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydocstyle/helpers.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5269ee833022919daf43995254c078fc06726bc56c731a3415f8a74ef17e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::backslashes::backslashes (cognitive 21): ruff_linter::rules::pydocstyle::rules::backslashes::backslashes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 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":"crates/ruff_linter/src/rules/pydocstyle/rules/backslashes.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b151c6073b45f01e1e13a4b71d9d2067deeb20c4d8cc24192945aaf7668346bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyflakes::rules::invalid_literal_comparisons::invalid_literal_comparison (cognitive 21): ruff_linter::rules::pyflakes::rules::invalid_literal_comparisons::invalid_literal_comparison has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyflakes/rules/invalid_literal_comparisons.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf98c6d63f52942fc1c4b312945b497c2749fcb0de05403654a4f505bfca3951"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::redefined_slots_in_subclass::slots_members (cognitive 21): ruff_linter::rules::pylint::rules::redefined_slots_in_subclass::slots_members has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 1 (2 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/ruff_linter/src/rules/pylint/rules/redefined_slots_in_subclass.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c1967052b941a1eb8edfd5f80681cfa98572798d8e416ea6725c4999e02200"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::outdated_version_block::version_always_less_than (cognitive 21): ruff_linter::rules::pyupgrade::rules::outdated_version_block::version_always_less_than has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (6 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/ruff_linter/src/rules/pyupgrade/rules/outdated_version_block.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f605a3bbabb541d0b49b7b904fe9fa3dc62b5b9bf24bfb74c3e08aa825b868"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::helpers::dataclass_kind (cognitive 21): ruff_linter::rules::ruff::helpers::dataclass_kind has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/helpers.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f429116010cf07ebb8e661b265713c12b45247e71ca4ed144bc8bcf7ea1054"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::unnecessary_assign_before_yield::unnecessary_assign_before_yield (cognitive 21): ruff_linter::rules::ruff::rules::unnecessary_assign_before_yield::unnecessary_assign_before_yield has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 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":"crates/ruff_linter/src/rules/ruff/rules/unnecessary_assign_before_yield.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bb2806ddd03b0d5131f2a7abaab91da489db073a84ff5ba8d2410cb7f542c3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_ast::helpers::any_over_stmt::inner (cognitive 21): ruff_python_ast::helpers::any_over_stmt::inner has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 20, match/switch 1. 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/ruff_python_ast/src/helpers.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f776e44c771062e51e37c18d00d71dc286258f9add5672b008c6c5aa51ef5b31"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_formatter::comments::placement::handle_comprehension_comment (cognitive 21): ruff_python_formatter::comments::placement::handle_comprehension_comment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 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/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad637ff76fc4d1d7270439cfa8f7d1517acc40c3cb9f5944ef6b2a19053f10d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::try_parse_parenthesized_with_items (cognitive 21): Parser::try_parse_parenthesized_with_items has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"996fa93aeeadd39c7831f62c7cd6cce8a6b1a8cbed81219361265acd19e659b5"}},{"ruleId":"D2","level":"warning","message":{"text":"RuffSettingsIndex::new (cognitive 21): RuffSettingsIndex::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 4 (7 pts), boolean chains 1, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c7736af01059da452fd6246c46ef30b0faf2133ca0ada1ee771669efa4bc22"}},{"ruleId":"D2","level":"warning","message":{"text":"Group::merge (cognitive 21): Group::merge has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/all_symbols.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c601cffb7985180aa5a4edc0c7204cbc53c73fe6bfe139d4dd84786afebdf5"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_ide::completion::completion (cognitive 21): ty_ide::completion::completion has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/completion.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c76515e011452f41bf1bb944e08dcdfcee2956186f1573b3a68bf928eded6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Options::to_search_paths (cognitive 21): Options::to_search_paths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_project/src/metadata/options.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1880227c33a4d6a9a779f581decdb8684d9c731473837af5b9e6af97b12404"}},{"ruleId":"D2","level":"warning","message":{"text":"Importer::import_for_diagnostic (cognitive 21): Importer::import_for_diagnostic has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, match/switch 2 (4 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":"crates/ty_python_semantic/src/importer.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ce3bb3951e4247e62b48db4711d3d5efd010b3afb57a0c259e69a49946fbe5"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticClassLiteral::total_ordering_root_method (cognitive 21): StaticClassLiteral::total_ordering_root_method has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (3 pts), match/switch 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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ff5d7591e80e146a5f7c392f2b5a82d7a6136803462cf933d6293449650d43"}},{"ruleId":"D2","level":"warning","message":{"text":"SolutionWalker::constraint_failure_evidence (cognitive 21): SolutionWalker::constraint_failure_evidence has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fde37c7303bc4be28e80b3d05be110b32000912254ad4a9e3b8a912b5c02114"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayCallableType::fmt_detailed (cognitive 21): DisplayCallableType::fmt_detailed has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (2 pts), 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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c2d09c92e7009859620e0e7d29275c79d2cac4b23fbefa68c8d51b759fc64f"}},{"ruleId":"D2","level":"warning","message":{"text":"OverloadLiteral::raw_signature (cognitive 21): OverloadLiteral::raw_signature has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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/ty_python_semantic/src/types/function.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfac632baac877b51a8b10b93e3c19e8d87c4340fdabd2c194b6b6d0e9fa8f6e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_nested_match_pattern (cognitive 21): TypeInferenceBuilder::infer_nested_match_pattern has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (8 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2988}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54c920df1e9acedd0d43e76c2b8b571c084d7d2eb66d12d7cefe4eb3c902b67"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::report_deprecated_functions (cognitive 21): TypeInferenceBuilder::report_deprecated_functions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":10855}}}],"partialFingerprints":{"codehealthFindingId/v1":"0967c990bc3a017ba3eba7e4a7c228aa5b473912afd9ee6e0f8bf7af9d26bd6d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parameters::from_normalized (cognitive 21): Parameters::from_normalized has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5135}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a1a20cbe33be13f32c45c8e395480366192e9652f9fc59bfecb252efa5f553"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::to_meta_type_with_recursion::to_meta_type_inner (cognitive 21): Type::to_meta_type_with_recursion::to_meta_type_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (8 pts), loops 1 (3 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/ty_python_semantic/src/types.rs"},"region":{"startLine":9470}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5d61aefd30a150e2fe582fb1cc29ce56bbb001cd8dc91ac6ead1aba0bd48db"}},{"ruleId":"D2","level":"warning","message":{"text":"AwaitError::report_diagnostic (cognitive 21): AwaitError::report_diagnostic has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (3 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/ty_python_semantic/src/types.rs"},"region":{"startLine":12523}}}],"partialFingerprints":{"codehealthFindingId/v1":"1399b1412a5b9bd7f1f008be93e46103e32665ce5399593bda5b33477955187f"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::check_override (cognitive 21): ty_python_semantic::types::overrides::attributes::check_override has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 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":"crates/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea089721356cc261d2511adec4236d4acf60b95329889076cb37f13e362a52eb"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::visitor::dynamic_content_impl (cognitive 21): ty_python_semantic::types::visitor::dynamic_content_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, loops 1 (2 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/ty_python_semantic/src/types/visitor.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5aef8890b01b07d36358f9c3feb09fd2398a116d51d2186d9d25d0f0a410c6"}},{"ruleId":"D2","level":"warning","message":{"text":"SysPrefixPath::from_executable_home_path_real (cognitive 21): SysPrefixPath::from_executable_home_path_real has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (2 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":"crates/ty_site_packages/src/lib.rs"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"809883896833936f42110c4f81bb214a272a4eb24c60d1cd38ed1daef364a8a5"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigArgumentParser::parse_ref (cognitive 20): ConfigArgumentParser::parse_ref has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 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":"crates/ruff/src/args.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ad380778e3c0de59de26959b6806db0ebb7248eeef6c281b4aeea02432c13d"}},{"ruleId":"D2","level":"warning","message":{"text":"ExplicitConfigOverrides::transform (cognitive 20): ExplicitConfigOverrides::transform has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/args.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f99ca7195d75ca25678ecbe84b272e1b9cc5b4211824c2b35a386396817d34"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff::commands::analyze_graph::analyze_graph (cognitive 20): ruff::commands::analyze_graph::analyze_graph has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (3 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/ruff/src/commands/analyze_graph.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5569bf1f8de1e4615ab212e6ae67b2fe7f8d5089477913f068b18a04bb2979aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff::commands::check::check (cognitive 20): ruff::commands::check::check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, loops 1 (2 pts), 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/ruff/src/commands/check.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9363069e87807133a0cf1aa7e4e588c8eff568404ecae9186f315d1a47a8de9b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::render_short_message (cognitive 20): ruff_annotate_snippets::renderer::render::render_short_message has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts) (nesting depth added 10). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75097cdaf3e137013a1085f416da39737292c2421aed62c6bbc7ba794ca6a65"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::directives::extract_noqa_line_for (cognitive 20): ruff_linter::directives::extract_noqa_line_for has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4, 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":"crates/ruff_linter/src/directives.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b7a5d0c9b139c98fcb0f5da26a90a53c7089a2644597a015896f9084721e8f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::docstrings::sections::is_docstring_section (cognitive 20): ruff_linter::docstrings::sections::is_docstring_section has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/docstrings/sections.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff03136582fd42788d1df602fe9d3aef38fd9fd9113b04451b1d4964fe702a13"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::airflow::rules::removal_in_3::check_name (cognitive 20): ruff_linter::rules::airflow::rules::removal_in_3::check_name has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 10 (17 pts), if/else 3 (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/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9cbfc6627c65f668c34dad0e0581fbdfd9385cf54a22b9aa6f41eabfa67b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bugbear::rules::class_as_data_structure::class_as_data_structure (cognitive 20): ruff_linter::rules::flake8_bugbear::rules::class_as_data_structure::class_as_data_structure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bugbear/rules/class_as_data_structure.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e67b3f24882cee79aefb20306419617888ad3095f4df3f33851fd53782dfb42"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bugbear::rules::unused_loop_control_variable::unused_loop_control_variable (cognitive 20): ruff_linter::rules::flake8_bugbear::rules::unused_loop_control_variable::unused_loop_control_variable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bugbear/rules/unused_loop_control_variable.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ba583b0f5195d4635c63dcd93b624c1fc3c2fa76dd2ed6143eaef8a9e24f26"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_map (cognitive 20): ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_map has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 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":"crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb95ea293983d0d4d53d00ac389ebd48e1279aeb6fbba7e4b2cc1713bb874ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::duplicate_union_member::duplicate_union_member (cognitive 20): ruff_linter::rules::flake8_pyi::rules::duplicate_union_member::duplicate_union_member has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 1 (2 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pyi/rules/duplicate_union_member.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4395d5e49e35e2bfcfd4b841fb02261a87dc0ff789f5e82dc49ccd81bf9ba2bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::non_self_return_type::non_self_return_type (cognitive 20): ruff_linter::rules::flake8_pyi::rules::non_self_return_type::non_self_return_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, 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":"crates/ruff_linter/src/rules/flake8_pyi/rules/non_self_return_type.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"682ca545acfe5bd1c94e2bef3eb31ce69fb640fbda5fc2e8d4b9dc00bf557443"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::open_file_with_context_handler::match_async_exit_stack (cognitive 20): ruff_linter::rules::flake8_simplify::rules::open_file_with_context_handler::match_async_exit_stack has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/ruff_linter/src/rules/flake8_simplify/rules/open_file_with_context_handler.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c325f16f00a35161ecd62be9aea2bc74bb27b9b75a6bd3f5c8cdfd9aff8279"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pandas_vet::rules::inplace_argument::inplace_argument (cognitive 20): ruff_linter::rules::pandas_vet::rules::inplace_argument::inplace_argument has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pandas_vet/rules/inplace_argument.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b549aeb2649e2ae4308395f002a83d8db034bc5c8838cddb3b980a062ac5cab9"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pep8_naming::helpers::is_django_model_import::match_model_import (cognitive 20): ruff_linter::rules::pep8_naming::helpers::is_django_model_import::match_model_import has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pep8_naming/helpers.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c55f8dae52cd716bddf5f5d00670a77cc44df0bd37d322dd207aa141358456a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::indentation::indentation (cognitive 20): ruff_linter::rules::pycodestyle::rules::logical_lines::indentation::indentation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (18 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":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/indentation.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e580411e421ad21c72f22a211a18fe30353d5a7e99977e829610c18a736cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydoclint::rules::check_docstring::parse_parameters_google (cognitive 20): ruff_linter::rules::pydoclint::rules::check_docstring::parse_parameters_google has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b12f20bf9c3a033d7eb7a7d49eb336e6f260efe3740e67df46f2a104b87d4b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::deprecated_mock_import::format_mocks (cognitive 20): ruff_linter::rules::pyupgrade::rules::deprecated_mock_import::format_mocks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 1 (2 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/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9d07a0810a9f7d188f3b837d28a5ae87ef15b459394f4e8ef655adb005a882"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::refurb::rules::print_empty_string::print_empty_string (cognitive 20): ruff_linter::rules::refurb::rules::print_empty_string::print_empty_string has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/rules/print_empty_string.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5242476d6667a618c48148026aaaf7bdf8ff2e084dbc63f0dcd8ec4e9632dfb3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::function_call_in_dataclass_default::function_call_in_dataclass_default (cognitive 20): ruff_linter::rules::ruff::rules::function_call_in_dataclass_default::function_call_in_dataclass_default has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (4 pts), boolean chains 2, 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":"crates/ruff_linter/src/rules/ruff/rules/function_call_in_dataclass_default.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"135b810df90001eac49ef80e613a0862fc52e4002991495fbdb724a7186de7cb"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::tryceratops::rules::verbose_log_message::verbose_log_message (cognitive 20): ruff_linter::rules::tryceratops::rules::verbose_log_message::verbose_log_message has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 3 (7 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":"crates/ruff_linter/src/rules/tryceratops/rules/verbose_log_message.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c39c33c0216e6af3ac1577b5c3c1ff03a8b372af4713fcd040c3344d45a349"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_codegen::stylist::detect_indentation (cognitive 20): ruff_python_codegen::stylist::detect_indentation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_codegen/src/stylist.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeebd307c8e71efc0f54f1f92c604fe8868cd5174e3b24f8a405859d6dbb83da"}},{"ruleId":"D2","level":"warning","message":{"text":"Indentation::trim_start (cognitive 20): Indentation::trim_start has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/string/docstring.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f44838a9e5b4cdca245fee6c6bedf037e1c83cf5075e2fb7feaa57b4c628998"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_simple_statement (cognitive 20): Parser::parse_simple_statement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 pts), boolean chains 3 (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":"crates/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b62bacca8ff3ec49f2f0a8b6663311b520db623e797a9f8b95d05937e54c191"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_semantic::analyze::class::has_metaclass_new_signature (cognitive 20): ruff_python_semantic::analyze::class::has_metaclass_new_signature has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 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":"crates/ruff_python_semantic/src/analyze/class.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c21e13062893963ab9946f83e1769b841941f895c020440faa91241e699578"}},{"ruleId":"D2","level":"warning","message":{"text":"TyFormat::format_event (cognitive 20): TyFormat::format_event has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/logging.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e1cdbaad151754829a18269cd72757b2228a20e0d6b64ab502d2b0a1bfd7e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextCursor::incomplete_keywords (cognitive 20): ContextCursor::incomplete_keywords has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, match/switch 4 (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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfef0efb4e62eb0bb22158f4be7316861d0156164dfac88371aadb95d3ce963"}},{"ruleId":"D2","level":"warning","message":{"text":"Bindings::evaluate_property_calls (cognitive 20): Bindings::evaluate_property_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind/property.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"750529fd236409a714aab1b32bc569435be712e3ce5d1dc5840ccaf2823a80c2"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeId::is_never_satisfied_with_limits (cognitive 20): NodeId::is_never_satisfied_with_limits 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). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (simple_conjunction_is_satisfiable). 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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bed42241891250e86cfc2440546ad1e3bf817126cff8a2f822ce26ea68c93d2"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayParameters::fmt_detailed::display_parameters (cognitive 20): DisplayParameters::fmt_detailed::display_parameters has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, 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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2817}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6a659a5491f1853ba2d8d1b21c252d036ca52efdfaa30a0a6c3cc6d7e51575"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_collections_namedtuple_fields (cognitive 20): TypeInferenceBuilder::infer_collections_namedtuple_fields has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 1 (2 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":"crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41a1dec22d79a9fcc9d3a98cd95592cacdb1cb81559a8ddcd61d792398f6574"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::add_secondary_annotations_for_redundant_if_or_elif (cognitive 20): TypeInferenceBuilder::add_secondary_annotations_for_redundant_if_or_elif has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ba72d2d73ba8b091bec180a6cb8208baead25f6f7a10ba15c728d56bbf9373"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_dangling_typeddict_spec (cognitive 20): TypeInferenceBuilder::infer_dangling_typeddict_spec has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 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":"crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"df40f362571147415e751369f9d018fb2fd2e09484e3a9ae10099f7514aea59d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::add_binding (cognitive 20): TypeInferenceBuilder::add_binding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc91d664c36b841c4eaafad28d7a9cf55f3547e9c61656143074a8c2f6480283"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::validate_class_pattern (cognitive 20): TypeInferenceBuilder::validate_class_pattern has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"866e113d6bf156b4bc4a70db1b3789d86abca5131eea01bad3eefe047a58bd73"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_unary_expression_type (cognitive 20): TypeInferenceBuilder::infer_unary_expression_type has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 10 (17 pts), if/else 1 (3 pts) (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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":11708}}}],"partialFingerprints":{"codehealthFindingId/v1":"9828d8c48feee8128a2454f4801ff9a45d01e441ce85bf17ea0bf715b7044b34"}},{"ruleId":"D2","level":"warning","message":{"text":"Mro::of_dynamic_class (cognitive 20): Mro::of_dynamic_class has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3, 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":"crates/ty_python_semantic/src/types/mro.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c894b261b4662a490386513cbf97b12bfd791a722098af13869391a4cad368c"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtocolClass::validate_type_parameter_variance (cognitive 20): ProtocolClass::validate_type_parameter_variance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, 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":"crates/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"65861d504c9fa834792053eceac371d4e35d74817be0b28194d1e7a22aea0c27"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorContext::render (cognitive 20): ErrorContext::render has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 5 (8 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":"crates/ty_python_semantic/src/types/relation_error.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec5e8ffc34895d01cf53fa4c724ae700ba868f34990f87156dd26cefa1dc96f"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::map_type (cognitive 20): Type::map_type has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 4 (6 pts) (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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":10118}}}],"partialFingerprints":{"codehealthFindingId/v1":"002de5d559df32e5866ef8acef7f7473e026793b0ee8748851e810224adf5b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::equality::evaluate_target_union (cognitive 20): ty_python_semantic::types::equality::evaluate_target_union has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2, 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":"crates/ty_python_semantic/src/types/equality.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d87d8de494d8219f16ba9a0df15412e7ab06e9d176329daa5fb85535cbafc9"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::equality::compare_nominal_instances (cognitive 20): ty_python_semantic::types::equality::compare_nominal_instances has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (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/ty_python_semantic/src/types/equality.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34b5946f067109fc6327284e075a2a86e21fab0a00b9073cf8dd092920e2250"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::function::check_class_method_typevar_variance (cognitive 20): ty_python_semantic::types::infer::builder::post_inference::function::check_class_method_typevar_variance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 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":"crates/ty_python_semantic/src/types/infer/builder/post_inference/function.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e2e123396eda362dd802cf052b1669555979178549e79eb08627d812dbd507"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::function::check_legacy_typevar_defaults (cognitive 20): ty_python_semantic::types::infer::builder::post_inference::function::check_legacy_typevar_defaults has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/post_inference/function.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9cbd1af09b4b19ef99efd686a94cd8c20eeb2b1e1dad33da3fe2b5bf5c7940"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::overrides::attributes::unbound_member_contract (cognitive 20): ty_python_semantic::types::overrides::attributes::unbound_member_contract has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, boolean chains 8, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"db64d11e3542bf332f3287bd771a7e3454d4ed72255a033898483b588e1d51ee"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatCommandError::fmt (cognitive 19): FormatCommandError::fmt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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":"crates/ruff/src/commands/format.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc539f773412a146f2785dba375cfa86a218ca5f448d4a1521d7f5d6b0f90a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_dev::generate_docs::main (cognitive 19): ruff_dev::generate_docs::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/generate_docs.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e61391113a087e7f38a25e250d7090b2ada79c892afb1d990b8c8de6634126"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportReplacer::with_renames (cognitive 19): ImportReplacer::with_renames has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 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":"crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_import.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda29088c684c9cf26d1623ccbf10a0e3ae2284e0b29d9cd01428fa73cfa9fef"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenFlags::prefix (cognitive 19): TokenFlags::prefix has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (19 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":"crates/ruff_python_ast/src/token.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9b7770da367c00ffa75f030e0937d1f930915190404d35dc40d8f8455f0b78"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_2020::rules::subscript::subscript (cognitive 19): ruff_linter::rules::flake8_2020::rules::subscript::subscript has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, 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":"crates/ruff_linter/src/rules/flake8_2020/rules/subscript.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"731ba393549dbfd01558170adf7a89196c17cff1acf50ce3f37d2343b8ac2897"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bugbear::rules::mutable_argument_default::move_initialization (cognitive 19): ruff_linter::rules::flake8_bugbear::rules::mutable_argument_default::move_initialization has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 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":"crates/ruff_linter/src/rules/flake8_bugbear/rules/mutable_argument_default.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1451719ff61bfa3fc6697ba367db0c149538d79c7ec940b3596fd0e79365854"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pie::rules::unnecessary_dict_kwargs::duplicates (cognitive 19): ruff_linter::rules::flake8_pie::rules::unnecessary_dict_kwargs::duplicates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pie/rules/unnecessary_dict_kwargs.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb47c19db8017dd4a872d1b6d7df1beec466946bdced8ccd3e565eb0b5ecf23f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_dict_get::if_else_block_instead_of_dict_get (cognitive 19): ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_dict_get::if_else_block_instead_of_dict_get has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 1, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"763e9f8100477327611c28b3b656d2990fbedbe7b3e80ba698a17ffd98980500"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_if_exp::if_else_block_instead_of_if_exp (cognitive 19): ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_if_exp::if_else_block_instead_of_if_exp has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 5, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_if_exp.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3212df884b5d8ef324721394796052cee652c937c595adeb8762bffaaf2f7704"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::open_file_with_context_handler::match_exit_stack (cognitive 19): ruff_linter::rules::flake8_simplify::rules::open_file_with_context_handler::match_exit_stack has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 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":"crates/ruff_linter/src/rules/flake8_simplify/rules/open_file_with_context_handler.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5c3802e9e33c02d575622d18060701e8ffaeb0cd4ee1bd63d201e394613a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::reimplemented_builtin::convert_for_loop_to_any_all (cognitive 19): ruff_linter::rules::flake8_simplify::rules::reimplemented_builtin::convert_for_loop_to_any_all has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"842a7524160d7bff561227d773a456c17ff0e618ffe82840f1d14b4cf14cf974"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::isort::format::format_single_line (cognitive 19): ruff_linter::rules::isort::format::format_single_line has cognitive complexity 19 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 5 (7 pts), boolean chains 1 (nesting depth added 5). 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/ruff_linter/src/rules/isort/format.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d994ac5ca1c4757b7eb0375e504a62afec36c89e0f8b13eea975fc15bbe8b63a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pygrep_hooks::rules::blanket_type_ignore::blanket_type_ignore (cognitive 19): ruff_linter::rules::pygrep_hooks::rules::blanket_type_ignore::blanket_type_ignore has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pygrep_hooks/rules/blanket_type_ignore.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1d3fd5d9011c32658e2d0bf6a76a025076bc8e13e0061df7d7569fa9c7138d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::assert_on_string_literal::assert_on_string_literal (cognitive 19): ruff_linter::rules::pylint::rules::assert_on_string_literal::assert_on_string_literal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 5 (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":"crates/ruff_linter/src/rules/pylint/rules/assert_on_string_literal.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"50478c70f8d44dcac35d73324030e64b4b95d726a810cf280b14760650394c67"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::refurb::rules::reimplemented_starmap::reimplemented_starmap (cognitive 19): ruff_linter::rules::refurb::rules::reimplemented_starmap::reimplemented_starmap has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 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":"crates/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b811ea0dd009051ee07b378693c985b33ba71cd989c42380b6c2b962f8bf26"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::logging_eager_conversion::logging_eager_conversion (cognitive 19): ruff_linter::rules::ruff::rules::logging_eager_conversion::logging_eager_conversion has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/logging_eager_conversion.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"859b26bb1877ccfb78ff5993d74c3c23785e62e37ccebf4b635051271ae17369"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::sort_dunder_slots::sort_dunder_slots (cognitive 19): ruff_linter::rules::ruff::rules::sort_dunder_slots::sort_dunder_slots has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 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":"crates/ruff_linter/src/rules/ruff/rules/sort_dunder_slots.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"207819f1dc8e62a9f7df5021068a2e445170d2d88cc821b74d14d95e62282456"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::unnecessary_iterable_allocation_for_first_element::match_iteration_target (cognitive 19): ruff_linter::rules::ruff::rules::unnecessary_iterable_allocation_for_first_element::match_iteration_target has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 5 (8 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":"crates/ruff_linter/src/rules/ruff/rules/unnecessary_iterable_allocation_for_first_element.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"22eb27f602bf61e7edf7280cc493c928b1a16747a86b2bf04261e28d2dab710d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::tryceratops::rules::raise_vanilla_args::contains_message (cognitive 19): ruff_linter::rules::tryceratops::rules::raise_vanilla_args::contains_message has cognitive complexity 19 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 2 (6 pts), match/switch 2 (4 pts) (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":"crates/ruff_linter/src/rules/tryceratops/rules/raise_vanilla_args.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"127343ed4d146362d842fc1fd7a89df6bc28587c29a7af5a48979f29468684d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_macros::derive_message_formats::parse_expr (cognitive 19): ruff_macros::derive_message_formats::parse_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 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":"crates/ruff_macros/src/derive_message_formats.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9373bbdd3b91dd50a0d63da79d451a0096ab6f32843318c1c8141c7edb55b2b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_ast::helpers::is_unpacking_assignment (cognitive 19): ruff_python_ast::helpers::is_unpacking_assignment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, 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":"crates/ruff_python_ast/src/helpers.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fa87a7bb67ae73e3222d5b3ab3c45ec2e96a2e30d1eacc0ddc84522a85f70c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_formatter::comments::placement::handle_lambda_comment (cognitive 19): ruff_python_formatter::comments::placement::handle_lambda_comment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 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":"crates/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d95cdca22455730a8ffb3b4994f4a34312d2520332202a4d162af1aaade97b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_formatter::expression::expr_number_literal::normalize_floating_number (cognitive 19): ruff_python_formatter::expression::expr_number_literal::normalize_floating_number has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/ruff_python_formatter/src/expression/expr_number_literal.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aa8d72a1ce300f6d434a80e776f4d101e6377d840a42be6f9b5cee52987430"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_slice (cognitive 19): Parser::parse_slice has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b811941e4ba767bbe812cb36e8c2511e520e251788b3a4a770cdeeeafe25264"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_module_resolver::resolve::is_pkgutil_extend_path (cognitive 19): ty_module_resolver::resolve::is_pkgutil_extend_path 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":"crates/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f79a63a4a480f46ce2b95888a54f7bf72112d6d386a1dece4945b834066a36b"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectWatcher::update_once (cognitive 19): ProjectWatcher::update_once has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 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":"crates/ty_project/src/watch/project_watcher.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f627cf252e8e3be7b24071fbf703694d545eb4673b9845f2fd580e3aef319b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"CallInference::infer_typevartuple_argument_constraints (cognitive 19): CallInference::infer_typevartuple_argument_constraints has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":7415}}}],"partialFingerprints":{"codehealthFindingId/v1":"206947b6b0609d5b0544619d81fde4cfc12d41d7d3759f2def2cc01f92f4ece1"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldMetadata::collect_from_annotation (cognitive 19): FieldMetadata::collect_from_annotation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/dedicated/pydantic.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcebe853789528c65f1ed1f56c67e2c2eadc37de19e5feb6bd6606c7d75725a"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayTuple::fmt_detailed (cognitive 19): DisplayTuple::fmt_detailed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"4339caad8d1f189dbbbbaccd6e79a285aaec93a613d39e1c4f80d8dde48969e1"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::check_boolean_test (cognitive 19): TypeInferenceBuilder::check_boolean_test has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, boolean chains 4, loops 2 (4 pts), match/switch 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/mod.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"128899457f12589e34f6904dbea9ca3bb3dd4da2772039f989afd22844077a71"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_typed_dict_constructor (cognitive 19): TypeInferenceBuilder::infer_typed_dict_constructor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, loops 1 (2 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/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f622c6e7dbaf1af86b96d5189d11c8ff8c05b0cce6663eebc9c160d94e85d475"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::validate_fields_arg (cognitive 19): TypeInferenceBuilder::validate_fields_arg has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 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":"crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7737f6a67a20a98a4ad11354119bdc9cf454aeb2589c6f7253b20ae78d4d50c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::add_declaration_with_binding (cognitive 19): TypeInferenceBuilder::add_declaration_with_binding has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdec36bce36eda8f64ea214abbc41da187c9ed8cf0b02b45e277ddabffc5e949"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_lambda_expression (cognitive 19): TypeInferenceBuilder::infer_lambda_expression has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3 (5 pts), boolean chains 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":9191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f929a6385103ded8c83958fcb6069e17c8ea8cc219923239e6760c0be8e08bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::narrow_place_with_applicable_constraints (cognitive 19): TypeInferenceBuilder::narrow_place_with_applicable_constraints has cognitive complexity 19 (threshold 15). Drivers by points: if/else 2 (9 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":10622}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cf5792c317050d458cbd466819105d10480cc4eb4959f39a42006168624dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"IntersectionBuilder::add_positive_impl (cognitive 19): IntersectionBuilder::add_positive_impl has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts), match/switch 2, boolean chains 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":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae3eed27e007ac335b1baa3311b4d4b4c575fbb42c5e5143f89d118d47258a0"}},{"ruleId":"D2","level":"warning","message":{"text":"IntersectionBuilder::add_negative_impl (cognitive 19): IntersectionBuilder::add_negative_impl has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (11 pts), boolean chains 4, if/else 1 (2 pts), match/switch 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":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"63749ce78f2f4d562e82889954d58e34f7c29a2ca8a6f6cb49124d25e9860eb6"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::attribute_write::descriptor_setter_signature_domain (cognitive 19): ty_python_semantic::types::attribute_write::descriptor_setter_signature_domain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 6, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"189401b233286f42241af795b1c9dfc66e2047558fad5f1e620b8ace4cf3574e"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::definition_resolution::scoped_definitions_for_name (cognitive 19): ty_python_semantic::types::definition_resolution::scoped_definitions_for_name has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts), loops 2, 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":"crates/ty_python_semantic/src/types/definition_resolution.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dede5f4db72d1d1b424e6def80fa4e106e7733df7a2871439bf8b2e6b69e0b"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionRangeRequestHandler::run_with_snapshot (cognitive 19): SelectionRangeRequestHandler::run_with_snapshot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/ty_server/src/server/api/requests/selection_range.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca26a6d2994be47b0a7ba651083e575db47810d3436c0c9d4114cbdf80bd5aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::write_once (cognitive 18): Printer::write_once has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/printer.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c879cf2cf6f54922250e10db5af385cdcaa0b0231fb9fb2f4d5ed722684f25"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_dev::format_dev::format_dev_multi_project (cognitive 18): ruff_dev::format_dev::format_dev_multi_project has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 pts), 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":"crates/ruff_dev/src/format_dev.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"033cd1306f196424d51ffcd50b83191d2c5b4d6a5d259fe6377f53a6c6b1a699"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::add_binding (cognitive 18): Checker::add_binding has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 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":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":2813}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5ddc695071ae1f02d4871efccaba56be301765de0a3db07b6ad0505536e728"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::handle_node_store (cognitive 18): Checker::handle_node_store has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":2905}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64cba3b1e86266a483f92e31f9c72bd2b7ee3ce207c601026fc27ca04d4e702"}},{"ruleId":"D2","level":"warning","message":{"text":"Importer::import_symbol (cognitive 18): Importer::import_symbol has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), 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":"crates/ruff_linter/src/importer/mod.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf10c13ef8b16087ded0f0a96ac5e59e9dfc06e84c6e2c0c6a6c8a65a60e9a3"}},{"ruleId":"D2","level":"warning","message":{"text":"UnittestAssert::generate_assert (cognitive 18): UnittestAssert::generate_assert has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (3 pts) (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":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be291c0095e19590766d9476cd0a29c69ee539e5c73eb92ab77a1f51e4ec5af"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::checkers::ast::analyze::except_handler::except_handler (cognitive 18): ruff_linter::checkers::ast::analyze::except_handler::except_handler has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 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":"crates/ruff_linter/src/checkers/ast/analyze/except_handler.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ddb68efef9272f6d8dc8d44b3cdc68032ef731332fa735db3e232bf9609cde"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_async::rules::async_zero_sleep::async_zero_sleep (cognitive 18): ruff_linter::rules::flake8_async::rules::async_zero_sleep::async_zero_sleep has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e59a53c8988776ebe9c0767dfc9223ce8d980d9ca0f23bb68a21a64f3bf25c2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bugbear::rules::duplicate_exceptions::duplicate_handler_exceptions (cognitive 18): ruff_linter::rules::flake8_bugbear::rules::duplicate_exceptions::duplicate_handler_exceptions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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":"crates/ruff_linter/src/rules/flake8_bugbear/rules/duplicate_exceptions.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba140e14946e13b5a9874701807585973fe034b92bbd5709d269abc85d771d70"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_datetimez::helpers::followed_by_astimezone (cognitive 18): ruff_linter::rules::flake8_datetimez::helpers::followed_by_astimezone has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 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/ruff_linter/src/rules/flake8_datetimez/helpers.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff4b3a3f62c402c81a362569d6c628d70e529468f03791a48b3d58a0238863e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_logging_format::rules::logging_call::logging_call (cognitive 18): ruff_linter::rules::flake8_logging_format::rules::logging_call::logging_call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_logging_format/rules/logging_call.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad41e8e3aff03e9585258ab7bb4c9cb2cff0f2c2d2e29d9c6fad16527fdf0c45"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::exit_annotations::check_positional_args_for_overloaded_method (cognitive 18): ruff_linter::rules::flake8_pyi::rules::exit_annotations::check_positional_args_for_overloaded_method has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 1 (nesting depth added 4). Of this number, 16 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":"crates/ruff_linter/src/rules/flake8_pyi/rules/exit_annotations.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fae6c145e37837c8942ad42459c69e254f320a623970b166cc5ca51a6c0c05"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::exit_annotations::non_none_annotation_element (cognitive 18): ruff_linter::rules::flake8_pyi::rules::exit_annotations::non_none_annotation_element has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), 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":"crates/ruff_linter/src/rules/flake8_pyi/rules/exit_annotations.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c3db07dda1e632acd623b24838dad96ed7f0936e7b1a6c3478a06000b91c94"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_todos::rules::todos::todos (cognitive 18): ruff_linter::rules::flake8_todos::rules::todos::todos has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"243b7be9bb50554c24cb5da41893751f5987a28b506d67b42d6dcce58aae2f03"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pycodestyle::rules::logical_lines::redundant_backslash::redundant_backslash (cognitive 18): ruff_linter::rules::pycodestyle::rules::logical_lines::redundant_backslash::redundant_backslash has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/redundant_backslash.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc70ff2fa82a488fd8cdf9c52a6aa81d1505f4f52354670f76b24bc564e42ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::if_stmt_min_max::if_stmt_min_max (cognitive 18): ruff_linter::rules::pylint::rules::if_stmt_min_max::if_stmt_min_max has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, match/switch 2 (3 pts), boolean chains 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":"crates/ruff_linter/src/rules/pylint/rules/if_stmt_min_max.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2d08deca6a31cdc8300e95e6c193db4a610985eebd8cf45c04839e77a9cb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprSubscript::needs_parentheses (cognitive 18): ExprSubscript::needs_parentheses has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/expression/expr_subscript.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f13a47676fb956c8d836f843edf12a3c4954c9ac9d7642c79b39e475842f59"}},{"ruleId":"D2","level":"warning","message":{"text":"QualifiedName::fmt (cognitive 18): QualifiedName::fmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/name.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd1397e6552c6c38b1d90a55866d9e1506f8bc3615c956ee721e033aae58d98"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyStringFlags::prefix (cognitive 18): AnyStringFlags::prefix has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 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":"crates/ruff_python_ast/src/nodes.rs"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2361259eadfeffa34b6bbda8fb8a7b8bbef087c9cdde6a81fd78c6cd286cc8b6"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatBody::fmt (cognitive 18): FormatBody::fmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 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/ruff_python_formatter/src/expression/expr_lambda.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba501381df18a6d082b8321cb87c11186b0af5307779412b4592dd6c437fe4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldNamePart::parse_part (cognitive 18): FieldNamePart::parse_part has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_literal/src/format.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fa9bf3133a5ccd1e0ea4491d17e5a8b69e97b1c5355200ba5939ff6267c35c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_except_clause (cognitive 18): Parser::parse_except_clause has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 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":"crates/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd22992d0bcb2a873840ebc7709f9218e31affbaf181cb1985fa88f0ad6f34ca"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_semantic::analyze::typing::match_annotated_subscript (cognitive 18): ruff_python_semantic::analyze::typing::match_annotated_subscript has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_semantic/src/analyze/typing.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"79df4a8b05558385ffe8bcdb35ac688a2f02e7b68e969d979f206147dae30cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_server::lint::check (cognitive 18): ruff_server::lint::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (4 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":"crates/ruff_server/src/lint.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca748d0fb9f2c4a184a6961845444e6845d604307f858ce1c4359e16414dbc61"}},{"ruleId":"D2","level":"warning","message":{"text":"InlayHintVisitor::visit_expr (cognitive 18): InlayHintVisitor::visit_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/inlay_hints.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cab9c47c6055502a53adc52172e533edad035d34cce2ac0a5b5ce1ad95bff17"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_ide::references::references_for_search (cognitive 18): ty_ide::references::references_for_search has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, 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":"crates/ty_ide/src/references.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9650f3d4b38c78e78202851a44193a4a3c61b3672a498fff4e5dd9e1bd0d778"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSearchCursor::list_modules (cognitive 18): ModuleSearchCursor::list_modules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (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":"crates/ty_module_resolver/src/resolve/search.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec392ce1aa0390d9a64c2aa5c723f3fd6db06dcc3bdcb41ccd174f8bd124e85f"}},{"ruleId":"D2","level":"warning","message":{"text":"OverrideOptions::lint (cognitive 18): OverrideOptions::lint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 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":"crates/ty_project/src/metadata/options.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b69da05e5184b768252a609592398402f08f5175ec34108273ec41df7ac90e6"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticIndexBuilder::add_dict_key_assignment_definitions_impl (cognitive 18): SemanticIndexBuilder::add_dict_key_assignment_definitions_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 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":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"925a8aa96baddf3fd7b85ba8626584b28c5decba7b38c7dd1f47a1eb05562bab"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicTypeBuilder::add (cognitive 18): PublicTypeBuilder::add has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, 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":"crates/ty_python_semantic/src/place.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e02a87ff613fdb2a28e5a7366bba12c1a84d2d761e73dabc43a97b3c84a126"}},{"ruleId":"D2","level":"warning","message":{"text":"Bindings::apply_generic_context_in_place (cognitive 18): Bindings::apply_generic_context_in_place has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 1 (4 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"6306553dbe10f0489ad5982704964a7ba0f9cca09764935b3dbe43b6573cac68"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentTypeChecker::check_argument_type (cognitive 18): ArgumentTypeChecker::check_argument_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7 (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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":7733}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea730d13326e9f2b871f755a76cef44d463bba5863c3fd4bf81e400c74439941"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentTypeChecker::check_argument_types (cognitive 18): ArgumentTypeChecker::check_argument_types has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), boolean chains 3, 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":7971}}}],"partialFingerprints":{"codehealthFindingId/v1":"620456d751b4b73657cde41673096b0f1ebd867a0a06092ba56ec536c694fb6b"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticClassLiteral::slot_definition (cognitive 18): StaticClassLiteral::slot_definition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (3 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":"crates/ty_python_semantic/src/types/class/slots.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4e3a568ae3cc510b57339b3a0a78e095f2aa061539af7d55db496f90a608b6"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassType::could_coexist_in_mro_with_impl (cognitive 18): ClassType::could_coexist_in_mro_with_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d411f60fb9f602884ecfdd272c3c051c702c9f5988eb4960818d37c59211d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassBase::try_from_type (cognitive 18): ClassBase::try_from_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (8 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":"crates/ty_python_semantic/src/types/class_base.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d4d9f7a5850738d50e7c2d53f22b212ac672959109b62182364908bab4c108"}},{"ruleId":"D2","level":"warning","message":{"text":"AmbiguousNameCollector::record (cognitive 18): AmbiguousNameCollector::record has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"0036277d93f7a3d533456f6f7f343e8df323c205f9392dcf748b4dc2ff4d20cb"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecializationBuilder::infer_from_callable_signature (cognitive 18): SpecializationBuilder::infer_from_callable_signature has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (7 pts), match/switch 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":3905}}}],"partialFingerprints":{"codehealthFindingId/v1":"9085c574c1b1e435d959d40a13cc3ae9e407cdcfbccfe27b60c9129e194f2565"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_enum_spec (cognitive 18): TypeInferenceBuilder::infer_enum_spec has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (11 pts), if/else 5 (7 pts) (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/ty_python_semantic/src/types/infer/builder/enum_call.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e88db078ed21a45a6ac7d1faf7514d3ab9838c9ad8c047676b381a8750c8077"}},{"ruleId":"D2","level":"warning","message":{"text":"DisjointnessChecker::protocol_member_has_disjoint_type_from_ty (cognitive 18): DisjointnessChecker::protocol_member_has_disjoint_type_from_ty has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 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":"crates/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":3374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d38fa9391972777b3ac7f98f51645f755ec1a12fb44012cad1d7df416618384"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableSignature::apply_type_mapping_impl (cognitive 18): CallableSignature::apply_type_mapping_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (try_apply_type_mapping_for_paramspec). 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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb04c3f9e834bc31bc7714f9a97072535c13870fbbbab77ea8c43c642986588"}},{"ruleId":"D2","level":"warning","message":{"text":"TypedDictType::openness::class_based_openness (cognitive 18): TypedDictType::openness::class_based_openness has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (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":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f711e56449f9dd59e83a8399f960ce7a1c28826e0caea39861bc1be4670a0d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionTypeInstance::value_expression_types (cognitive 18): UnionTypeInstance::value_expression_types has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 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/ty_python_semantic/src/types/union_type_instance.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80e3b9c653ec1666c37a37de2ffe0c6d8d9d51222740523ecae09ee99a0d9fa"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionTypeInstance::recursive_type_normalized_impl (cognitive 18): UnionTypeInstance::recursive_type_normalized_impl has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 4 (5 pts), loops 1 (2 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/ty_python_semantic/src/types/union_type_instance.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a315f14d56e37afea585891b1f111ed2afb5a571046e0ef3cc63bd166e9660da"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::try_iterate_with_mode (cognitive 18): Type::try_iterate_with_mode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 8 (16 pts), loops 2 (6 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. This shape REPEATS in the file: one other method here (Type::try_iterate_with_mode::non_async_special_case) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"109dca370b34cd812940b84a22681ba04a0da1d5ab6b42c2a92b83b067f7689d"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::class_namespace_member (cognitive 18): Type::class_namespace_member has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 2, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcb9ae7e2464af97ad18c301b8c567d9bc07b1dacd4a37b3c801a1278329599"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::place::place_from_declarations_impl (cognitive 18): ty_python_semantic::place::place_from_declarations_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 1 (3 pts), 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/ty_python_semantic/src/place.rs"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0123af3fa07127cc7ae0c097d02b47c0b613690e6ce1c0e79720531866e9f0a"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::reachability::evaluate_reachability_path (cognitive 18): ty_python_semantic::reachability::evaluate_reachability_path has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (4 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":"crates/ty_python_semantic/src/reachability.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68bfd44c389d44ffd7502596373f72d6078fc13eee2c4da3ffc33a99d387897"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::diagnostic::report_unsupported_comparison (cognitive 18): ty_python_semantic::types::diagnostic::report_unsupported_comparison has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 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":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5779}}}],"partialFingerprints":{"codehealthFindingId/v1":"35adc6efb82f91c3955647a4e895fbc82342b26783bc6898a07b44e78f70b96d"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::function::check_classinfo_in_isinstance (cognitive 18): ty_python_semantic::types::infer::builder::function::check_classinfo_in_isinstance has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (3 pts), loops 1 (2 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":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa49949ba8fd74147af145acb8d6d3ed4ab2bc8b82a9540148df83a982f7e39"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::function::check_legacy_typevar_ordering (cognitive 18): ty_python_semantic::types::infer::builder::post_inference::function::check_legacy_typevar_ordering has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/post_inference/function.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c2c9211e2b649780f437d6bb3d8264264109d50843dcd22dad512347718e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::suspicious_conditions::exemptions::place_condition_definition_info (cognitive 18): ty_python_semantic::types::infer::builder::suspicious_conditions::exemptions::place_condition_definition_info has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (6 pts), loops 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":"crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/exemptions.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5393b6f47034e439b5cc1321a2d9c5e401281707f4dc4b17b8d81a82994ec44b"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::comparisons::infer_tuple_rich_comparison (cognitive 18): ty_python_semantic::types::infer::comparisons::infer_tuple_rich_comparison has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 1 (4 pts), loops 2 (4 pts) (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":"crates/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4beeded23cafe5c705bb76d69216d6097f82790a062c96c9cb4b8cb1ee93a16"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::typed_dict::collect_guaranteed_keys_from_merged_unpacked_keyword (cognitive 18): ty_python_semantic::types::typed_dict::collect_guaranteed_keys_from_merged_unpacked_keyword has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3cf99d3efdd5fb0b18c167c89c6f6a8a9c46e4666e17faccb4cbff88a29de2"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_server::server::api::diagnostics::to_lsp_diagnostic (cognitive 18): ty_server::server::api::diagnostics::to_lsp_diagnostic has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), match/switch 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":"crates/ty_server/src/server/api/diagnostics.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7a06a5ba90609e0431214ce43df35fd1fbb2f0fdc23dff2e2b81acb4d70d71"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_site_packages::discover_package_dirs (cognitive 18): ty_site_packages::discover_package_dirs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), match/switch 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":"crates/ty_site_packages/src/lib.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c23b021abbc88c94dedb27f2b4f2209057af0b561e0838fb38e14268a44a02"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_edits::call::unwrapped_call_argument (cognitive 18): ruff_python_edits::call::unwrapped_call_argument has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), loops 1 (2 pts), 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":"crates/ruff_python_edits/src/call.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd53147805ac885943de5c257f7a1df0b46f995b068021f8b44babd4b8109598"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatResults::to_diagnostics (cognitive 17): FormatResults::to_diagnostics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 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":"crates/ruff/src/commands/format.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c09946f927e6059f44042d9f3cdc4a2c29f7260d27f63be367e33dbccbd40fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff::commands::check_stdin::check_stdin (cognitive 17): ruff::commands::check_stdin::check_stdin has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (17 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/check_stdin.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53affed74397701a126977b2fa058977908f7fc234af4d93dc13f4fa5f6be59"}},{"ruleId":"D2","level":"warning","message":{"text":"AzureRenderer::render (cognitive 17): AzureRenderer::render has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_db/src/diagnostic/render/azure.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f4aebe7ff2798d93efefc230e575118f3b9a84ea83b623d7070ba843516ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"SectionContexts::from_docstring (cognitive 17): SectionContexts::from_docstring has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"crates/ruff_linter/src/docstrings/sections.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"50503570ce6a906517febd69551e11b142e3486ccea848691c12edb9f4ad7992"}},{"ruleId":"D2","level":"warning","message":{"text":"SuppressionParser::eat_codes (cognitive 17): SuppressionParser::eat_codes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/ruff_linter/src/suppression.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb018f1c2177bf0bcfae890ae74fd61ed523612c80490072171ddb9f6abcad3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::airflow::helpers::is_guarded_by_try_except (cognitive 17): ruff_linter::rules::airflow::helpers::is_guarded_by_try_except has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/ruff_linter/src/rules/airflow/helpers.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad98da0e363c002e1355b078ff8c81439e412bf3a174ef1a5665680e3183423"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_async::rules::long_sleep_not_forever::long_sleep_not_forever (cognitive 17): ruff_linter::rules::flake8_async::rules::long_sleep_not_forever::long_sleep_not_forever has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_async/rules/long_sleep_not_forever.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c549cddcf803aa7da2166449c58c2afec3becfbfed777596cd789fff918167"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_implicit_str_concat::rules::explicit::explicit (cognitive 17): ruff_linter::rules::flake8_implicit_str_concat::rules::explicit::explicit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_implicit_str_concat/rules/explicit.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e37890f92e3ca18c4bfd996db82a772068544d62c8ea9b96cf0cb0afdd72cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::redundant_none_literal::create_fix (cognitive 17): ruff_linter::rules::flake8_pyi::rules::redundant_none_literal::create_fix has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pyi/rules/redundant_none_literal.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d7f1ce7b7cfab54a37d962b97a882010c628f8ab2e72e29ced5a61e58496b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::ast_bool_op::is_short_circuit (cognitive 17): ruff_linter::rules::flake8_simplify::rules::ast_bool_op::is_short_circuit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, match/switch 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/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"452ae4f93c1928a4fa920c86d0bbf5c781eab44fbd6e9cdb8ed61cf5007e64d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_tidy_imports::rules::lazy_import_immediately_resolved::lazy_import_immediately_resolved (cognitive 17): ruff_linter::rules::flake8_tidy_imports::rules::lazy_import_immediately_resolved::lazy_import_immediately_resolved has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, 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":"crates/ruff_linter/src/rules/flake8_tidy_imports/rules/lazy_import_immediately_resolved.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2d9db996f1441a9ba2fa62987f80712ae6cd274cd7bbde5114882d25437f65"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_tidy_imports::rules::lazy_import_mismatch::lazy_import_mismatch (cognitive 17): ruff_linter::rules::flake8_tidy_imports::rules::lazy_import_mismatch::lazy_import_mismatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (5 pts), boolean chains 4, 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/ruff_linter/src/rules/flake8_tidy_imports/rules/lazy_import_mismatch.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a66812109e3d5d3f190370241932a2af85ab3c94694327a28bb993778523f83"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_todos::rules::todos::static_errors (cognitive 17): ruff_linter::rules::flake8_todos::rules::todos::static_errors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9d3724a773d5cf034a4324327b9221469792944465006236d8e1bf61e71053"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_use_pathlib::rules::builtin_open::builtin_open (cognitive 17): ruff_linter::rules::flake8_use_pathlib::rules::builtin_open::builtin_open has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_use_pathlib/rules/builtin_open.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f4305d415968824d926c3ed63e86a95d011e3e5a339bf5c49bb5bfaaea7dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::numpy::rules::numpy_2_0_deprecation::is_guarded_by_try_except (cognitive 17): ruff_linter::rules::numpy::rules::numpy_2_0_deprecation::is_guarded_by_try_except has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac468ea0b17834d8353e37bf894ca701de7162cc6ed792183746fca0aa3db648"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::helpers::num_statements (cognitive 17): ruff_linter::rules::pylint::helpers::num_statements has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (5 pts), match/switch 1 (2 pts) (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":"crates/ruff_linter/src/rules/pylint/helpers.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f145de4ee5068b94246bebabf2023392c686c62528254f3354f73b4c75afc56d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::dict_index_missing_items::extract_dict_name (cognitive 17): ruff_linter::rules::pylint::rules::dict_index_missing_items::extract_dict_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (17 pts) (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/dict_index_missing_items.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"477a93113a24028566d14df0f529be149a5b1daeb1f3de01f26263cb188e372e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::unnecessary_encode_utf8::unnecessary_encode_utf8 (cognitive 17): ruff_linter::rules::pyupgrade::rules::unnecessary_encode_utf8::unnecessary_encode_utf8 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"crates/ruff_linter/src/rules/pyupgrade/rules/unnecessary_encode_utf8.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec6e0cf304b40e339d6f27a1ecd740974ed6c20acd72504dcef274b22005e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::refurb::rules::fstring_number_format::fstring_number_format (cognitive 17): ruff_linter::rules::refurb::rules::fstring_number_format::fstring_number_format has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16 (17 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/rules/fstring_number_format.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9f03f75af06cbcfabeae5c81dfee4dd84b036a7c90bea42d800e0632324186"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::refurb::rules::unnecessary_enumerate::unnecessary_enumerate (cognitive 17): ruff_linter::rules::refurb::rules::unnecessary_enumerate::unnecessary_enumerate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"512682f3cbec8b577b045e361f03d130507f82be21ece8ec6abe3efb5273cca0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::legacy_form_pytest_raises::legacy_raises_warns_deprecated_call (cognitive 17): ruff_linter::rules::ruff::rules::legacy_form_pytest_raises::legacy_raises_warns_deprecated_call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/legacy_form_pytest_raises.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"575fded47ac8d5d880964a3c64f5e460cc5fdf1d7dd93bb67cffc4687c0d6a02"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::toml::rule_selectors::check_selectors (cognitive 17): ruff_linter::toml::rule_selectors::check_selectors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 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":"crates/ruff_linter/src/toml/rule_selectors.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4026fc6bd9c66069123ff512f1020d3bb9f4876b0fcbb7080dfd6269486f8c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"ComparablePattern::eq (cognitive 17): ComparablePattern::eq has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 9 (17 pts) (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/ruff_python_ast/src/comparable.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2418c67f177ef9a3ebcbe45d18196fc54997d23b3516ef9cff6bf1188497808d"}},{"ruleId":"D2","level":"warning","message":{"text":"ClauseHeader::visit (cognitive 17): ClauseHeader::visit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (2 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":"crates/ruff_python_formatter/src/statement/clause.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2460802c940c945c4532f19173480526e0998f5d939936ac05b5537c35480377"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_formatter::expression::has_own_parentheses (cognitive 17): ruff_python_formatter::expression::has_own_parentheses has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/expression/mod.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20a2ed8a096a8547ea61373765988116f3c5919694585c260a9e355d95b85d1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_formatter::statement::stmt_function_def::format_function_header (cognitive 17): ruff_python_formatter::statement::stmt_function_def::format_function_header 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":"crates/ruff_python_formatter/src/statement/stmt_function_def.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1dbf6d4ccfc382c883971a53fa73f216060a175eb368a9dbaaccc95b54b621"}},{"ruleId":"D2","level":"warning","message":{"text":"Insertion::start_of_file (cognitive 17): Insertion::start_of_file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 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":"crates/ruff_python_importer/src/insertion.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e793da8123e93ccbcdb1daf700e507e134d38bc553c49acdbf1b287cf5ccdf"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryContextKind::create_error (cognitive 17): RecoveryContextKind::create_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (5 pts) (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":"crates/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f87db4c852dfb8bdaa4b898eb5c706e9b61fca124e0a22b67e11702e7ec6813"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_parser::lexer::keywords::find_multiplier (cognitive 17): ruff_python_parser::lexer::keywords::find_multiplier has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 2 (8 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/lexer/keywords.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbac9fd3eff80346016a946c2b457f88593ba6f5d2f349a7b85e603e87fbe52d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_semantic::analyze::class::any_member_declaration::any_stmt_in_body (cognitive 17): ruff_python_semantic::analyze::class::any_member_declaration::any_stmt_in_body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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/ruff_python_semantic/src/analyze/class.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef0d26f3e7ba3a77f1a7e84f33847a7545e7db1bff951f9d234534137ed7f73"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_semantic::analyze::typing::is_immutable_annotation (cognitive 17): ruff_python_semantic::analyze::typing::is_immutable_annotation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_semantic/src/analyze/typing.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e8f1a5cc2d80c3a77176742dd3aa82c6ffd059380139eb72e70325fd3d8068"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_semantic::analyze::typing::check_type (cognitive 17): ruff_python_semantic::analyze::typing::check_type has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 2 (6 pts) (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":"crates/ruff_python_semantic/src/analyze/typing.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c29ee300e3c36468488a072e30356e4a453d862a5892b882fa6419aa43f1cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::package_roots (cognitive 17): Resolver::package_roots has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_workspace/src/resolver.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"194ac58c2377ae26453bc70d8571017a373f21a5ce28d3598db578598444f677"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_workspace::pyproject::load_options (cognitive 17): ruff_workspace::pyproject::load_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (17 pts) (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_workspace/src/pyproject.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8b82115fb3685c524c7f4a69fed56ebe4813c7872e189b16be8a8cf2203c30"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaceLoadResolutionProcedure::decide_resolution_path (cognitive 17): PlaceLoadResolutionProcedure::decide_resolution_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4 (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/ty_python_semantic/src/place_load.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"911a24f7021d94a80901419278a0aab62b73ddeba3a656906386e47b4762c313"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalIndex::intersecting_rev (cognitive 17): IntervalIndex::intersecting_rev has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/suppression.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7c3d684f3313825d03096bd2fbf1ae5f13293f9da9173e51377e535a500595"}},{"ruleId":"D2","level":"warning","message":{"text":"CallInference::collect_typevartuple_arguments (cognitive 17): CallInference::collect_typevartuple_arguments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":7583}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1245663b3e59315f07134f32064b0139b867f6c94fd165e428faf5ed038c74d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_class_type_params (cognitive 17): TypeInferenceBuilder::infer_class_type_params has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/class.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceadc296ab6711895d273a4d3ae6f3ab6e0e427df996c9f4c6250c744b1e8d51"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::validate_subscript_assignment (cognitive 17): TypeInferenceBuilder::validate_subscript_assignment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 1 (4 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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d82824b62de950de2fda1b2e04b709cf6e22d21e60b33da1980842f33241f0"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::specialize_generic_class_from_callable_context (cognitive 17): TypeInferenceBuilder::specialize_generic_class_from_callable_context has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":7098}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b436a1fd6a9bcd5aa2d4e0d3ac5443ac616796cbde71512a72030283083dd50"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternSuccessAnalyzer::class_pattern_arguments_for_arm (cognitive 17): PatternSuccessAnalyzer::class_pattern_arguments_for_arm has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, 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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9970a6e4d17d817dcaff927f458bc84e3d0463c91730259da438da6a1591bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"NarrowingConstraintsBuilder::narrow_type_by_len (cognitive 17): NarrowingConstraintsBuilder::narrow_type_by_len 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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":3601}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65f549588dab496e85f99d9a6c901e1e66d2b9eb38956e3679414ae8d793d76"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecialFormType::in_type_expression (cognitive 17): SpecialFormType::in_type_expression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, 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":"crates/ty_python_semantic/src/types/special_form.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef30f9eed86030704c147e90176c788d71b386a502b20d3e59ebc357f718827c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeExpander::expand (cognitive 17): TypeExpander::expand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 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":"crates/ty_python_semantic/src/types/type_expansion.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6fd03e6701a641bdb518a2b57c8295c71c2ca75263e64156b13bc83c9a07b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::can_suppress_exceptions::can_suppress_exceptions_impl (cognitive 17): Type::can_suppress_exceptions::can_suppress_exceptions_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 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/ty_python_semantic/src/types/context_manager.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0364c78d518d3d228361fedfbd5a31d29945625822390fab4396a2cf37ae12"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::identity_comparison_type (cognitive 17): Type::identity_comparison_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (4 pts), match/switch 3 (4 pts) (nesting depth added 6). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 2 function items inside it that branch (upcast, upcast_partial). 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/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c232b9351cb3ff70de3a35aecfad8969dd45f52a71977327cb64d50bead0c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::class_member_with_policy_inner (cognitive 17): Type::class_member_with_policy_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":4509}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee739a628cda750f385d0e21dc7faae52584de305014831c55f42d9d0a101fc6"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::subscript::py_slice_with_step (cognitive 17): ty_python_semantic::subscript::py_slice_with_step has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (8 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/subscript.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae34892956b0a61efb142ed6cdc840e2445bf78da19d2fd5eff9f936d23267a"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::definition_resolution::resolve_definition_recursive (cognitive 17): ty_python_semantic::types::definition_resolution::resolve_definition_recursive has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 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":"crates/ty_python_semantic/src/types/definition_resolution.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f701c143998d9b590dc3bd852666facb332e451f9bc68cf41c9b6f1761eab8"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::equality::compare_literal_to_other (cognitive 17): ty_python_semantic::types::equality::compare_literal_to_other has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, match/switch 2 (3 pts) (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":"crates/ty_python_semantic/src/types/equality.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"8963a88a2dc983076867d89835b621435ebc0dad0db09ce24eb1379d6fc9478e"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::ide_support::inlay_hint_call_argument_details (cognitive 17): ty_python_semantic::types::ide_support::inlay_hint_call_argument_details has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 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":"crates/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd76ed347ef08bd62ca5b10cbee8c37ac17092f0ba2802023b38cef022fecde0"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::suspicious_conditions::exemptions::is_special_cased_condition_expression (cognitive 17): ty_python_semantic::types::infer::builder::suspicious_conditions::exemptions::is_special_cased_condition_expression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (3 pts), boolean chains 2 (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/ty_python_semantic/src/types/infer/builder/suspicious_conditions/exemptions.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"086c357d0419509c87113b3e5bc3fdfd2112064b6f55e4b17bc78110151cbefa"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostics::to_lsp_diagnostics (cognitive 17): Diagnostics::to_lsp_diagnostics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 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/ty_server/src/server/api/diagnostics.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"234011f6115f06a3627d2a0c5747e451dbc60eaee18bbe36f26f4f7d069df9a7"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonEnvironmentPath::new (cognitive 17): PythonEnvironmentPath::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, 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":"crates/ty_site_packages/src/lib.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"9518f5a2dc92a6a0a76d6e58805a787b5a4ffe176d261ddd6ee90f069d990641"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_site_packages::real_stdlib_directory_from_sys_prefix (cognitive 17): ty_site_packages::real_stdlib_directory_from_sys_prefix has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/ty_site_packages/src/lib.rs"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bade0fb06825b1a09efc86212fab2141c2f5c3db2590213a09803147ad9911"}},{"ruleId":"D2","level":"warning","message":{"text":"mdtest::matcher::match_reveal_type_diagnostic (cognitive 16): mdtest::matcher::match_reveal_type_diagnostic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, 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":"crates/mdtest/src/matcher.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c66f1769b0c91a092cd8476ad9d4f90b0771ea1360f471285f1ccadfdc2d63d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_annotate_snippets::renderer::render::draw_line (cognitive 16): ruff_annotate_snippets::renderer::render::draw_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts) (nesting depth added 6). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"74af0af2e843820212f9a43954c1bd0f8b6f254019a95734b55d4c6835b714bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_benchmark::real_world_projects::copy_directory_recursive (cognitive 16): ruff_benchmark::real_world_projects::copy_directory_recursive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_benchmark/src/real_world_projects.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdad62c6a963a4b20b94959eb3170162784a7397bc06713a9e94c05b3fa9a6a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_deferred_lambdas (cognitive 16): Checker::visit_deferred_lambdas has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":3317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2820fbe14201ea7ec40c06fd7126c4ee724f8d8643a01c45245c1e5bfc13b7"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingReference::from_references (cognitive 16): TypingReference::from_references has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_type_checking/helpers.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"92754568ca733542c562674062c7b55639d0e4e4d217264d9342063f4cc78eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"SequenceIndexVisitor::visit_expr (cognitive 16): SequenceIndexVisitor::visit_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (16 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":"crates/ruff_linter/src/rules/pylint/helpers.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"417e6f554c6c0e07ea9a5faaa91e70a45af32da14c9e69dced24e5bdb4acbcec"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeDiff::fmt (cognitive 16): CodeDiff::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/source_kind.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8333a34c7e6c1b0cbc82f9a9b37ba86f9b02431e6426c79ae91010155d33214"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bandit::rules::jinja2_autoescape_false::jinja2_autoescape_false (cognitive 16): ruff_linter::rules::flake8_bandit::rules::jinja2_autoescape_false::jinja2_autoescape_false has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 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":"crates/ruff_linter/src/rules/flake8_bandit/rules/jinja2_autoescape_false.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34002c39064221d982d74f2d4f68bb1e52f353b905fa7505204f2b2a9e5db8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_bugbear::rules::abstract_base_class::abstract_base_class (cognitive 16): ruff_linter::rules::flake8_bugbear::rules::abstract_base_class::abstract_base_class has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bugbear/rules/abstract_base_class.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"03867a4293117766788a4c389998ff4ede4e1f3cc1a16f7ae67d02e25f30e5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_commas::rules::trailing_commas::trailing_commas (cognitive 16): ruff_linter::rules::flake8_commas::rules::trailing_commas::trailing_commas has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (3 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/ruff_linter/src/rules/flake8_commas/rules/trailing_commas.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"da80a2deda418c1663088be5bfc5833b976a48625df9f14776eb9bfc5f698f66"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_commas::rules::trailing_commas::check_token (cognitive 16): ruff_linter::rules::flake8_commas::rules::trailing_commas::check_token has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, 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":"crates/ruff_linter/src/rules/flake8_commas/rules/trailing_commas.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf294e5fc144681aa8d0e0798dd9d004d71fb28926277b1a4fb2d93a837ccb01"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_django::rules::unordered_body_content_in_model::get_element_type (cognitive 16): ruff_linter::rules::flake8_django::rules::unordered_body_content_in_model::get_element_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 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":"crates/ruff_linter/src/rules/flake8_django/rules/unordered_body_content_in_model.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92df49581e037ea4e1a75b6604abe8c8416d4ae9b7686b699a22fb52df5512f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_logging::rules::exc_info_outside_except_handler::exc_info_outside_except_handler (cognitive 16): ruff_linter::rules::flake8_logging::rules::exc_info_outside_except_handler::exc_info_outside_except_handler has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 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":"crates/ruff_linter/src/rules/flake8_logging/rules/exc_info_outside_except_handler.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f560921bbc3ff3ad3df01944a86b3f388bc4a6ed75041f9ef000d93a6b70f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_logging_format::rules::logging_call::check_log_record_attr_clash (cognitive 16): ruff_linter::rules::flake8_logging_format::rules::logging_call::check_log_record_attr_clash has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 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":"crates/ruff_linter/src/rules/flake8_logging_format/rules/logging_call.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b970cfd4d4e3087b06335b4e62e569e01bdc9870794a14b01fcfeb2a85efa414"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pie::rules::non_unique_enums::non_unique_enums (cognitive 16): ruff_linter::rules::flake8_pie::rules::non_unique_enums::non_unique_enums has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pie/rules/non_unique_enums.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b509310eb6478de90e9b786a858ebb8af2583676105475b8b93a864d1da2be"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::simple_defaults::is_valid_default_value_with_annotation (cognitive 16): ruff_linter::rules::flake8_pyi::rules::simple_defaults::is_valid_default_value_with_annotation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, match/switch 2 (3 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":"crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a0d1dcfc079e313bdb99d306eb3aaa347cef53f4a62f6ba7623d92cc178b13"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pyi::rules::unrecognized_version_info::version_check (cognitive 16): ruff_linter::rules::flake8_pyi::rules::unrecognized_version_info::version_check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (3 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":"crates/ruff_linter/src/rules/flake8_pyi/rules/unrecognized_version_info.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2d29ab3816692d9645211ed37167a41483e414bb98b887bf96d5a192582767"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_pytest_style::rules::parametrize::handle_value_rows (cognitive 16): ruff_linter::rules::flake8_pytest_style::rules::parametrize::handle_value_rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (2 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":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1b1c14295d02b44be6a9768a4a99371a87dc2d0c2902bf88f03e84c7488cc2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::ast_bool_op::compare_with_tuple (cognitive 16): ruff_linter::rules::flake8_simplify::rules::ast_bool_op::compare_with_tuple has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 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":"crates/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9289bf65f0265fbd15764c516e4b9e29503490b2451fcba5f3507558bb658d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::flake8_simplify::rules::suppressible_exception::suppressible_exception (cognitive 16): ruff_linter::rules::flake8_simplify::rules::suppressible_exception::suppressible_exception has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 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/ruff_linter/src/rules/flake8_simplify/rules/suppressible_exception.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6f6601e80627a07b1e2679876f58a26c9cf6a8f61f9bd4cadd3851ea4fb7d2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::isort::format::format_multi_line (cognitive 16): ruff_linter::rules::isort::format::format_multi_line has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/isort/format.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9be7e11530e3002c56d7fbdc83c6572e1c11629bf1299d703dff64e402dfe29"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::isort::rules::organize_imports::organize_imports (cognitive 16): ruff_linter::rules::isort::rules::organize_imports::organize_imports has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 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":"crates/ruff_linter/src/rules/isort/rules/organize_imports.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc199cae2aad72d60cf9648398186d67842b3924f686d71430ca0a98ed78f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::not_missing::not_missing (cognitive 16): ruff_linter::rules::pydocstyle::rules::not_missing::not_missing has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, 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, 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/ruff_linter/src/rules/pydocstyle/rules/not_missing.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5501ec7a40b90c295c2e3db6c1047448e3c4d48ec501e03fd9763faa52de9d47"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pydocstyle::rules::sections::parameters_section (cognitive 16): ruff_linter::rules::pydocstyle::rules::sections::parameters_section has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (6 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":"crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a4a60c9daa7099c3cf153677662d92768e70197da7c8ab0e02e92480e31b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pylint::rules::useless_return::useless_return (cognitive 16): ruff_linter::rules::pylint::rules::useless_return::useless_return has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (16 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":"crates/ruff_linter/src/rules/pylint/rules/useless_return.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1130779c0ce8761c7dab148ad66d7d3db63a8e5a3de3daf68408d31f46590e1c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::pyupgrade::rules::extraneous_parentheses::match_extraneous_parentheses (cognitive 16): ruff_linter::rules::pyupgrade::rules::extraneous_parentheses::match_extraneous_parentheses has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (6 pts), loops 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":"crates/ruff_linter/src/rules/pyupgrade/rules/extraneous_parentheses.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a977ebfa9ac9e3d37e7acc90d128a62630491221c4443f2390875874701bd23a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::refurb::rules::bit_count::bit_count (cognitive 16): ruff_linter::rules::refurb::rules::bit_count::bit_count has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, match/switch 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":"crates/ruff_linter/src/rules/refurb/rules/bit_count.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6621a9fad7887069990c869ee75b56c428680b254915ffaba3a9464b256602ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::refurb::rules::readlines_in_for::readlines_in_iter (cognitive 16): ruff_linter::rules::refurb::rules::readlines_in_for::readlines_in_iter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 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":"crates/ruff_linter/src/rules/refurb/rules/readlines_in_for.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ada3871ac956e12c66172ccc7d2e9726ea3d6d439abbca832fe4495e6e7fd1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::asyncio_dangling_task::asyncio_dangling_binding (cognitive 16): ruff_linter::rules::ruff::rules::asyncio_dangling_task::asyncio_dangling_binding has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (3 pts), match/switch 1 (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/ruff_linter/src/rules/ruff/rules/asyncio_dangling_task.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09c9ac96e26bd4332b27a7b0c357ec40f27ba1cc783f1778d523b29b25e1c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::ruff::rules::unnecessary_iterable_allocation_for_first_element::unnecessary_iterable_allocation_for_first_element (cognitive 16): ruff_linter::rules::ruff::rules::unnecessary_iterable_allocation_for_first_element::unnecessary_iterable_allocation_for_first_element has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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":"crates/ruff_linter/src/rules/ruff/rules/unnecessary_iterable_allocation_for_first_element.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebc5b2417c2130b0b50fc3628dd796764ba1d989381df2c76bf2662319b660e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_linter::rules::tryceratops::rules::try_consider_else::try_consider_else (cognitive 16): ruff_linter::rules::tryceratops::rules::try_consider_else::try_consider_else has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/tryceratops/rules/try_consider_else.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74f2a2953667584adf8f0b366dda8b326d2791c99cfb7b6cce18b3ceb707c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_macros::cache_key::derive_cache_key (cognitive 16): ruff_macros::cache_key::derive_cache_key has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (3 pts), loops 1 (2 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":"crates/ruff_macros/src/cache_key.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c6ab4427e12646c395655680ce82bf9abd906241a2359d811faee2f3e501bf"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyNodeRef::last_child_in_body (cognitive 16): AnyNodeRef::last_child_in_body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), 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":"crates/ruff_python_ast/src/node.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf843709f97fb7f09c60b4e7d5d3eff2ce11c42c2d9ff0c73235230fa31567a7"}},{"ruleId":"D2","level":"warning","message":{"text":"SideEffect::from_expr (cognitive 16): SideEffect::from_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, 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":"crates/ruff_python_ast/src/helpers.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"26161d73d882c0ec2888ef191b80f0377cc1e432a0e6e4223802553717e615f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_ast::helpers::extract_handled_exceptions (cognitive 16): ruff_python_ast::helpers::extract_handled_exceptions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (6 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/ruff_python_ast/src/helpers.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba466bcb2aa8ef4d4156c71edfe4ca96823021c9c1aebc5de827116a01ce2a02"}},{"ruleId":"D2","level":"warning","message":{"text":"CallChainLayout::from_expression (cognitive 16): CallChainLayout::from_expression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (2 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":"crates/ruff_python_formatter/src/expression/mod.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9278e488a0d50dde1b10ed07e47ded5c76771ac44ecc44343b148b3f565a67"}},{"ruleId":"D2","level":"warning","message":{"text":"NarrowRange::enter_node (cognitive 16): NarrowRange::enter_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 2 (6 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/ruff_python_formatter/src/range.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"536d032c3bd62bbbd2f4f53d9095fec2b43faa4524ab2eef4abfde4674bf2bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"ruff_python_semantic::analyze::terminal::sometimes_breaks (cognitive 16): ruff_python_semantic::analyze::terminal::sometimes_breaks 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":"crates/ruff_python_semantic/src/analyze/terminal.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a72af2c1925a457bb0fef8636e6a219bd75932a195991c13711e31c560415a"}},{"ruleId":"D2","level":"warning","message":{"text":"TriviaRanges::from (cognitive 16): TriviaRanges::from 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":"crates/ruff_python_ast/src/token/tokens.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"167d44660fc533901253b417a26f7a5e5847b9ba3dc191b2e45bca0e465bafda"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::initialize (cognitive 16): Server::initialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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/ruff_server/src/server/main_loop.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4155c23859c761cf119834ca19180fc772e3920334fa7b58e058805f47898dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"Relevance::new (cognitive 16): Relevance::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d346ea15aafeb94ed2608a7dcc3529c886b89cfb858dbfb013e06370fff5463"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalReferencesFinder::check_covering_node (cognitive 16): LocalReferencesFinder::check_covering_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/references.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"089063893a053ff561fe3b80b98c1227f1a2a0e4d2a63128575c6f913499d661"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_ide::completion::add_argument_completions (cognitive 16): ty_ide::completion::add_argument_completions 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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71e2021e860f65b23cb46331227779a963965dacf6e851b639663627410fa60"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_ide::docstring::document::syntax::split_trailing_parenthetical (cognitive 16): ty_ide::docstring::document::syntax::split_trailing_parenthetical has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/docstring/document/syntax.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8bed5482e4955b14edad801a4448f229f32fb8a12dc15053e4355d996647e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_module_resolver::resolve::dynamic_resolution_paths (cognitive 16): ty_module_resolver::resolve::dynamic_resolution_paths has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"b577969e7c9fe8bafad1708ea0df9c1185d5e708aaa6adcf973b9ebd1dab64da"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageName::new (cognitive 16): PackageName::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_project/src/metadata/pyproject.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"975c71802f966ebea25bbab715715f9083cb498e8efe4145154a078da55e44d5"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticIndexBuilder::record_lazy_snapshots (cognitive 16): SemanticIndexBuilder::record_lazy_snapshots has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b51508a0284a872432a2021ee194b3d995f1f2d218dd18a8bee620b88737d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticIndexBuilder::with_type_params (cognitive 16): SemanticIndexBuilder::with_type_params has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (6 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/ty_python_core/src/builder.rs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d53cc3ae13262985861c7c36cbde2f18bf8e50b7bec001fe2a7e463cff0616"}},{"ruleId":"D2","level":"warning","message":{"text":"Importer::find (cognitive 16): Importer::find has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 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":"crates/ty_python_semantic/src/importer.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6df03b94be776ac691e75ce7b93352fb3c289fcea9600ceb61f8e06fd2fc7b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructorBinding::analyze_overload_returns (cognitive 16): ConstructorBinding::analyze_overload_returns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4b65c57205b3a6ebd778f2195228c58b6e394d2cd35f6b69627d7e34cdbae9"}},{"ruleId":"D2","level":"warning","message":{"text":"Bindings::report_diagnostics_impl (cognitive 16): Bindings::report_diagnostics_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"28741645fc6b46b0b19ca29b1cb7f61300a97322b48529f3effaf04062cc5538"}},{"ruleId":"D2","level":"warning","message":{"text":"CallInference::has_invariant_return_difference (cognitive 16): CallInference::has_invariant_return_difference has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, match/switch 2 (3 pts) (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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d51351d7e8a0f14891ea371ccde9f23ec08ea296f33741383b4d1320baad8be"}},{"ruleId":"D2","level":"warning","message":{"text":"DynamicClassLiteral::try_metaclass (cognitive 16): DynamicClassLiteral::try_metaclass has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), 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":"crates/ty_python_semantic/src/types/class/dynamic_literal.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f707fee957cb1f24923eb7c4e7dd4aeee34c2a8ce305680d6bb1747960bca151"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticClassLiteral::variance_equation (cognitive 16): StaticClassLiteral::variance_equation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb2fed1fdcea78598e6f2d49d629d235bd94e6cf13be59c0f8ed637f9bcf39f"}},{"ruleId":"D2","level":"warning","message":{"text":"PathAssignments::visit (cognitive 16): PathAssignments::visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (5 pts) (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":"crates/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c018234c8a84c45817af214e6c4888eba4e6c64d939af12b42317b61d5db757c"}},{"ruleId":"D2","level":"warning","message":{"text":"PathAssignments::add_assignment (cognitive 16): PathAssignments::add_assignment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (4 pts), loops 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":"crates/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e60a7ae26f8f438b49cb1cf9f89324edf676484af5f89e4b5d4bf5f403ef28"}},{"ruleId":"D2","level":"warning","message":{"text":"Constrained::preferred_constraint (cognitive 16): Constrained::preferred_constraint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (3 pts), match/switch 1 (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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec1beb8cb895b52357a92d91218c4a1e936b2946e6bdc54ebda48f4f694a420"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecializationBuilder::insert_hash_map_type_mapping (cognitive 16): SpecializationBuilder::insert_hash_map_type_mapping has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":3445}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f5b907b5e6feda560348e645ba9fbbf01c8ebfa2a38c89da518a7e540baf25"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecializationBuilder::common_typed_dict_protocol_constraints (cognitive 16): SpecializationBuilder::common_typed_dict_protocol_constraints has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, match/switch 1 (nesting depth added 1). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (collect_typed_dicts, is_string_keyed_mapping). 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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"f731b04f1a7ff4354ab56842a2156b658a20e81e19a3511326ea1c161e36ff2c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_subscript_expression_types (cognitive 16): TypeInferenceBuilder::infer_subscript_expression_types has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (4 pts), boolean chains 3 (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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"75021db8376cb8efc7c44ca608d2904447e66cc2250cee63dc716b57d8d9a329"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_concatenate_tail (cognitive 16): TypeInferenceBuilder::infer_concatenate_tail has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":3540}}}],"partialFingerprints":{"codehealthFindingId/v1":"5661ea6548b9c423561d3c891339c75caeaf4b1613d233e054ad56f2ec802391"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_typevar_deferred (cognitive 16): TypeInferenceBuilder::infer_typevar_deferred has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (4 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":"crates/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6abbb285c067ca307050437d5bedd54f796b84b7f1f6e97619ef5ecb17caddf"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::infer_nested_bindings_definition (cognitive 16): TypeInferenceBuilder::infer_nested_bindings_definition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), match/switch 2, 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"651780d0be7e8304865792d3688e5cbd77046307b4544932a8b95a940459c4df"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInferenceBuilder::report_unresolved_reference (cognitive 16): TypeInferenceBuilder::report_unresolved_reference has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":11103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc780e2c1d58b299ef1e81c1be9ab0fff8bbddb608f5c89846097f94a1ca377"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternSuccessAnalyzer::analyze_pattern_subject_arms (cognitive 16): PatternSuccessAnalyzer::analyze_pattern_subject_arms has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":3345}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1d02c0c9c1e40d9de6fee90d81c262f72425844097fb4b25c6f9350e2c4d51"}},{"ruleId":"D2","level":"warning","message":{"text":"Parameters::expand_starred_variadic_annotations (cognitive 16): Parameters::expand_starred_variadic_annotations has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 5 (6 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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5864}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e94f6521d7ddd49c1b18f9dcddaeed8baf0c2cfd3bbb4077c73256b1ddef0f0"}},{"ruleId":"D2","level":"warning","message":{"text":"VarianceComponent::solution (cognitive 16): VarianceComponent::solution has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (7 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/ty_python_semantic/src/types/variance/equations.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67432d029b7685b1297a7e8fe27c92571c11bb5619b7e6acd9a723558c2eb9c"}},{"ruleId":"D2","level":"warning","message":{"text":"Type::pending_narrowing_normalized (cognitive 16): Type::pending_narrowing_normalized has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":3872}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17b9b157eee8c986817052f65f1e1bea9e112287ae1ee85dec4351ff0866290"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::reachability::analyze_enum_literal_union_pattern_predicate (cognitive 16): ty_python_semantic::reachability::analyze_enum_literal_union_pattern_predicate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 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":"crates/ty_python_semantic/src/reachability.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a878125252d0e661b903b971972ecc4105e2ae3bf807874d960886584594a47"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::attribute_write::instance_attribute_write_requirement (cognitive 16): ty_python_semantic::types::attribute_write::instance_attribute_write_requirement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (4 pts), boolean chains 2 (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":"crates/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa2ca0eb038a6b9c8b9ac63a5a265952dff950b6933f1c25d3b4adb00af57f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ty_python_semantic::types::infer::builder::post_inference::static_class::check_class_slots (cognitive 16): ty_python_semantic::types::infer::builder::post_inference::static_class::check_class_slots has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 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":"crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf37b6245a52ca0cd9e15b73d2bea532f639df829bacaa9fc0babee9f6a7e2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Pool::new (cognitive 16): Pool::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c097effa5245717efa7ff1c5ea1c5ebf6ddc3f697421ca18c3112fca22f9b29"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.Editor (cognitive 16): Editor.Editor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 4, error handling 2, match/switch 1, ternaries 1. Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 6 function items inside it that branch (handleSecondaryToolSelected, a function literal at line 175, a function literal at line 62, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/ruff/src/Editor/Editor.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4cd07444126e585c86c8d6cab02e0d36ff566336a7bb179e3d7e3df7c967e4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeInferenceBuilder: ClassTooLong \u2014 8140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 465 methods, 2 blocks, lines 306-12904. The bar is 400 significant lines; this is 7740 over it, 20.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64634249363f0445f4b077f33537105bc351e7923519431d674db209ff5f4e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/builder.rs: FileTooLong \u2014 8904 significant 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: TypeInferenceBuilder (2 blocks, 306-12904). The bar is 500 significant lines; this is 8404 over it, 17.81\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a75b9584702ceb54cafbf0d8c25b34a7358570721be099a2443b1d0d07490f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 8149 significant 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: Type (5 blocks, 2075-11585). The bar is 500 significant lines; this is 7649 over it, 16.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd63b6eb606eeeca0d372f6df3da121c670a1eebe73c58bd7123817f7d0c334"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeInferenceBuilder: TooManyMethods \u2014 465 methods, declared across 22 files: infer/builder.rs (254), builder/type_expression.rs (37), builder/function.rs (27), builder/subscript.rs (19), \u002B18 more file(s). The bar is 30 methods; this is 435 over it, 15.50\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ca8ee7e9d4082e1fbfd29e0680def082075d582471d08f0d0d1fc7717aeafd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: call/bind.rs: FileTooLong \u2014 7151 significant 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 6651 over it, 14.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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cca8b97b609efd21b8be811c927521acae2664a011c43ddd0f8701fac9f7b4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Type: ClassTooLong \u2014 5667 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 312 methods, 5 blocks, lines 2075-11585. The bar is 400 significant lines; this is 5267 over it, 14.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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f054d9503ae1064dc8c0bdf2abdb10a63791dc03c8cc26de79b23355e9715c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::checkers::ast::analyze::statement::statement: FunctionTooLong \u2014 ruff_linter::checkers::ast::analyze::statement::statement runs 1161 significant 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 1061 over it, 11.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/analyze/statement.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09c245c298d3e9805e418ac32ebd264fae07b9a2da1230b2136c9beb0c420f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeRelationChecker.check_signature_pair_inner: MethodTooLong \u2014 check_signature_pair_inner runs 1160 significant 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 1060 over it, 11.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3100}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cbaf6f880b44bad4bb391b9f00cce32813b5fde1d2132e6dcb7c57b8521b09"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::checkers::ast::analyze::expression::expression: FunctionTooLong \u2014 ruff_linter::checkers::ast::analyze::expression::expression runs 1135 significant 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 1035 over it, 11.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":"crates/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2244e37e1937cb293e97af4d04379957bd1b3eadffe37dfee3772224dbc81fdb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Bindings.evaluate_known_cases: MethodTooLong \u2014 evaluate_known_cases runs 1117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1017 over it, 11.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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e9785f961bb4ddc6ca645f789ba9c3a5c3b0c5bf51cab3ab6fe33d821141b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Type: TooManyMethods \u2014 312 methods, declared across 21 files: src/types.rs (205), types/relation.rs (33), types/callable.rs (14), types/instance.rs (14), \u002B17 more file(s). The bar is 30 methods; this is 282 over it, 10.40\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/ty_python_semantic/src/types.rs"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bef8e7db589c53bac11cfbc8c446ed65c62241e742d90a4953f7e2d0a17a7c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SemanticIndexBuilder.visit_stmt_impl: MethodTooLong \u2014 visit_stmt_impl runs 1017 significant 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 917 over it, 10.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":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"56178e4cc83ce5776082c6c4ac0949815e5bac4e9f6084dcfb022a85f36b199a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::codes::code_to_rule: FunctionTooLong \u2014 ruff_linter::codes::code_to_rule runs 1016 significant 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 916 over it, 10.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":"crates/ruff_linter/src/codes.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"44410e735fd5260096c06ab90f307ee2c00a0f9550cd32cc33f05203854fd943"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/diagnostic.rs: FileTooLong \u2014 4324 significant 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 101 free functions. The bar is 500 significant lines; this is 3824 over it, 8.65\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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5eac3c4cc10a064b0dd0de0c949280238ae013b1b6b3788c3d206ee9f2a1ea1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SemanticIndexBuilder: ClassTooLong \u2014 3442 significant 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 237-6043. The bar is 400 significant lines; this is 3042 over it, 8.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16856e10a2103ab8bc2d2c192b19e2cbbb159f7e268dbf19e5b2cd01bcec44c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::airflow::rules::moved_to_provider_in_3::check_names_moved_to_provider: FunctionTooLong \u2014 ruff_linter::rules::airflow::rules::moved_to_provider_in_3::check_names_moved_to_provider runs 851 significant 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 751 over it, 8.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":"crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b6f09f3036db6256301cb8acd39850523c2dd16e640b18e175390c05e19e5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/signatures.rs: FileTooLong \u2014 4164 significant 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 3664 over it, 8.33\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b02d4dcedcc176ba204e714c88834a419557a4d1a277dd3752c0cae13caad1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/narrow.rs: FileTooLong \u2014 3747 significant 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 3247 over it, 7.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa78ecf48f88c4547986db4a706824f00330a143a01d9e7b6883f37161567203"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builder.rs: FileTooLong \u2014 3727 significant 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: SemanticIndexBuilder (4 blocks, 237-6043). The bar is 500 significant lines; this is 3227 over it, 7.45\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/ty_python_core/src/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6123a171ccb906cbf6002e7ad85f1a8aee2c51143555e340d6c7e2c56dedb81"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeRelationChecker.check_type_pair: MethodTooLong \u2014 check_type_pair runs 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) in one body. The bar is 100 significant lines; this is 584 over it, 6.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":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11d3ec98414ccb83280760fc061a355fabaf54c7011e313bfede9b1a765be0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::infer::builder::post_inference::static_class::check_static_class_definitions: FunctionTooLong \u2014 ty_python_semantic::types::infer::builder::post_inference::static_class::check_static_class_definitions runs 642 significant 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 542 over it, 6.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":"crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"390c57d54fe313a180b9ba61e9e727c4752cab8b64f9e6dcc977606dc03cd8c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/constraints.rs: FileTooLong \u2014 3161 significant 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 2661 over it, 6.32\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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06a6c74f82c8a6736add815e12fe9cdf017bb7a8aaa46f064e580c44dce769f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/generics.rs: FileTooLong \u2014 3093 significant 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 2593 over it, 6.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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75cbf79a8292bd436a26da7fb7bb4caf52fef67d7300dd01876fbe58bc0bea4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 184 methods, declared across 4 files: parser/statement.rs (63), parser/expression.rs (60), parser/mod.rs (47), parser/pattern.rs (14). The bar is 30 methods; this is 154 over it, 6.13\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/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cd3ec5f5a1a484f4a755a93d4ae29d6f7dde2dc949e9af3cce42622c4ac435"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DisjointnessChecker.check_type_pair_impl: MethodTooLong \u2014 check_type_pair_impl runs 587 significant 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 487 over it, 5.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":3763}}}],"partialFingerprints":{"codehealthFindingId/v1":"6028e8be4de7fe62ba47c297b0276af19d8b365ded48851d241d7a47a6421556"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.member_lookup_with_policy_and_receiver: MethodTooLong \u2014 member_lookup_with_policy_and_receiver runs 576 significant 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 476 over it, 5.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":6051}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7ae5eafd0e7c21b160491ef70fee34003d2f1f7f856d3fa438060408e534c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/relation.rs: FileTooLong \u2014 2843 significant 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 2343 over it, 5.69\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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8a649274515294b7b485892f3685b7948ec4f6cbc5f82d4f37773c255f1987"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/display.rs: FileTooLong \u2014 2779 significant 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 2279 over it, 5.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f308298cf764a24c912534a5e2c273204cfca676a645e5402b6f55d0e48c861"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.report_redundant_condition: MethodTooLong \u2014 report_redundant_condition runs 548 significant 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 448 over it, 5.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":"crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"40712564cd1893ae2791b72026a83a33cd7bc5440f3d70cb2ecc78d19eb7564e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_type_expression_no_store: MethodTooLong \u2014 infer_type_expression_no_store runs 536 significant 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 436 over it, 5.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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ff206f6e69c2c81c4030a57cc0a3af12044f556400a8558fb5e057b63ed9d5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StaticClassLiteral: ClassTooLong \u2014 2091 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 116 methods, 4 blocks, lines 83-3815. The bar is 400 significant lines; this is 1691 over it, 5.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96ddc03b202cd21c647070e18562ea5e7fc3b718645b1aada3d125487badf2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DisplayRepresentation.fmt_detailed: MethodTooLong \u2014 fmt_detailed runs 522 significant 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 422 over it, 5.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0558c61527ad279031c2193670713131f3252a06f0604f224426ef9d78e43052"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpecializationBuilder.infer_map_inner: MethodTooLong \u2014 infer_map_inner runs 514 significant 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 414 over it, 5.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f873a95c16105648260757fcb2e536814950abed29c05a63dda38bb2fa94e312"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_binary_expression_type_impl: MethodTooLong \u2014 infer_binary_expression_type_impl runs 498 significant 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 398 over it, 4.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e989ca167b4856b3f29cba573ed5627cd3713a12aea8c03e2e9ff30e4e0dcfe8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/type_expression.rs: FileTooLong \u2014 2487 significant 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 98% of them inside a single declaration: TypeInferenceBuilder (59-3711). The bar is 500 significant lines; this is 1987 over it, 4.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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d75eded783effcf39b091c384da1df95f81627cdfe38106c5722afc9204530"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/protocol_class.rs: FileTooLong \u2014 2459 significant 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 1959 over it, 4.92\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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"673d4b94407bacd86aa72d7781533f408fecce51934c9be59efa4a74212b2637"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Checker.visit_stmt: MethodTooLong \u2014 visit_stmt runs 489 significant 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 389 over it, 4.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":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dcd42ddb95e1d4fd99792bf03a0fe78bd69b918410ed2446f1fb3953e74b21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingError.report_diagnostic: MethodTooLong \u2014 report_diagnostic runs 488 significant 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 388 over it, 4.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":10621}}}],"partialFingerprints":{"codehealthFindingId/v1":"7503875e9f7c2d94557d8799be7dec083bbbf5e011c3caeeed10cda3e268262d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticModel: TooManyMethods \u2014 145 methods, declared across 2 files: src/model.rs (143), model/all.rs (2). The bar is 30 methods; this is 115 over it, 4.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":"crates/ruff_python_semantic/src/model.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"393c2de234e79e92f4836dcf0fd293703d61998a9b7fc6bb3595fcfa8fbd3fbd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Checker: ClassTooLong \u2014 1921 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 67 methods, 6 blocks, lines 196-3481. The bar is 400 significant lines; this is 1521 over it, 4.80\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/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"73db8bd92753bf636b0b7f8fa59bd26238c151adc91e8080a2dc19eb8a3315a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_explicit_callable_specialization_impl: MethodTooLong \u2014 infer_explicit_callable_specialization_impl runs 479 significant 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 379 over it, 4.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc5f1aff4b9c939ae4a5b8191f6d5d6dd24a511c88d9eb81e4a359d6161b44f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/options.rs: FileTooLong \u2014 2343 significant 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 1843 over it, 4.69\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/ruff_workspace/src/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf1568317d78b2c2c4662951a021b07d36f1e2509d816a750a8defa139c5f2d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: KnownClass: ClassTooLong \u2014 1869 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 2 blocks, lines 34-2220. The bar is 400 significant lines; this is 1469 over it, 4.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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a58999b89c4bb4377d817369295f4c1fa2732df0aafbd7d75e199a7c695285"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class/static_literal.rs: FileTooLong \u2014 2302 significant 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: StaticClassLiteral (4 blocks, 83-3815). The bar is 500 significant lines; this is 1802 over it, 4.60\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22988f66c0fedf731ba875a9bb1c7f3c6c8ae38f0f1e90958e541314fb1c27eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/mod.rs: FileTooLong \u2014 2292 significant 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: Checker (6 blocks, 196-3481). The bar is 500 significant lines; this is 1792 over it, 4.58\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dece3ca282b3649db692a86bc843046629d70267e8adf941cb21e508a049d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_call_expression_impl: MethodTooLong \u2014 infer_call_expression_impl runs 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) in one body. The bar is 100 significant lines; this is 347 over it, 4.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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":9652}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d3c5298024dc4edd79c77d55c81a4ee6c078f8d8e0cc7c48906f961ed8fd40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_parameterized_special_form_type_expression: MethodTooLong \u2014 infer_parameterized_special_form_type_expression runs 439 significant 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 339 over it, 4.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":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eae36591343a9edd00b561ce2c189ca0b2cdd1a1418ddce77d6d85414cbf93a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Bindings: ClassTooLong \u2014 1743 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 58 methods, 4 blocks, lines 636-3492. The bar is 400 significant lines; this is 1343 over it, 4.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffa09f4f67a8066abab9c11ee52e8b0dc1e77af7d88b8d5d2b6cc835d418c62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/typed_dict.rs: FileTooLong \u2014 2146 significant 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 32 free functions. The bar is 500 significant lines; this is 1646 over it, 4.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd64f5512dbca47a361a71bf49ac6f1c3132dcd998f9daa0ee677b16bd93f4f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::overrides::check_class_declaration: FunctionTooLong \u2014 ty_python_semantic::types::overrides::check_class_declaration runs 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) in one body. The bar is 100 significant lines; this is 329 over it, 4.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/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"346fc78912d9d77880e19709750f897ab2fa93991108716167329f1a07f98968"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/nodes.rs: FileTooLong \u2014 2141 significant 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 1641 over it, 4.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":"crates/ruff_python_ast/src/nodes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dbdcc61a5c85cc09e83a5128923758bf4e74599d490f8e63e83eb7a895a781"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/use_def.rs: FileTooLong \u2014 2137 significant 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 1637 over it, 4.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/ty_python_core/src/use_def.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2433bfc803b168e2987d0cb087fa9697451359322de615ac4b46bf7837c85b1e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticIndexBuilder: TooManyMethods \u2014 127 methods. The bar is 30 methods; this is 97 over it, 4.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e90b130b72fcff0e0b464ccff320e4d8e6af8806c7f5ef6ad8092038d6dbad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/class.rs: FileTooLong \u2014 2115 significant 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 1615 over it, 4.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f1b190f7d039637674a60f8a1e11e207ff2309b67c49f1a1c9845f2c9db120"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NarrowingConstraintsBuilder: ClassTooLong \u2014 1686 significant 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 1686-5560. The bar is 400 significant lines; this is 1286 over it, 4.22\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"059aa1be02d918775c137d7d63175a38a8cfc700d001d50d9ac983833919b202"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Checker.visit_expr: MethodTooLong \u2014 visit_expr runs 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) in one body. The bar is 100 significant lines; this is 320 over it, 4.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":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb8ad0b3744651a81ded2e7f52645417a977b968c45132abe48896647b833f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::numpy::rules::numpy_2_0_deprecation::numpy_2_0_deprecation: FunctionTooLong \u2014 ruff_linter::rules::numpy::rules::numpy_2_0_deprecation::numpy_2_0_deprecation runs 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) in one body. The bar is 100 significant lines; this is 301 over it, 4.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/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab411d4647b9039835f5d09488061d0e11b9496304ff650d8938119cfc6d206"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/tuple.rs: FileTooLong \u2014 2003 significant 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 1503 over it, 4.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/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdce2454e510f2513c3c1a54a57b89a7f414b48a1163f9cfce1996947c45c75"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class/known.rs: FileTooLong \u2014 1943 significant 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 96% of them inside a single declaration: KnownClass (2 blocks, 34-2220). The bar is 500 significant lines; this is 1443 over it, 3.89\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/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c84aeaa24bce591bd272ba6113661d486b92ee9865d9323a78f353c05eb6672"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StaticClassLiteral: TooManyMethods \u2014 116 methods, declared across 5 files: class/static_literal.rs (95), class/slots.rs (13), class/implicit_attributes.rs (6), types/protocol_class.rs (1), \u002B1 more file(s). The bar is 30 methods; this is 86 over it, 3.87\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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2ff04fa4609e7c6f8eddb591d98db66fc9108d6302cfabd131c65e773268a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generator.unparse_stmt: MethodTooLong \u2014 unparse_stmt 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":"crates/ruff_python_codegen/src/generator.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c59a0e02fdbe59db103a0f4e399f966426574a842d71ac4d7eabb52a70cdea1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/subscript.rs: FileTooLong \u2014 1825 significant 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: TypeInferenceBuilder (67-2565). The bar is 500 significant lines; this is 1325 over it, 3.65\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bce0f255385a1eefc59756cf528cb40bacd25a42718508557de46adf1183dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/completion.rs: FileTooLong \u2014 1818 significant 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 1318 over it, 3.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"091d8aadef7c7c73c0f442e1111b45b9f3984d7fe291cd3a46dbe03c116267a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownFunction.check_call: MethodTooLong \u2014 check_call 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":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d04eba874902029bdcb96feeed7eb974efda2abcc00becd23a6dc16abbcd0e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ErrorContext.render: MethodTooLong \u2014 render runs 362 significant 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 262 over it, 3.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":"crates/ty_python_semantic/src/types/relation_error.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"446ab369a7830cd5242a3c08deac944b5f721c34b430d8d4a95e81fcd5e44ce1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SpecializationBuilder: ClassTooLong \u2014 1441 significant 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 2515-5052. The bar is 400 significant lines; this is 1041 over it, 3.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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2211cdb7682af14668484de14f847c1b55e4351f9f08e844b15fb607fea886"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generator.unparse_expr: MethodTooLong \u2014 unparse_expr runs 356 significant 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 256 over it, 3.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":"crates/ruff_python_codegen/src/generator.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7401f79d9ee441eff8dfe3a35f7d0587b0f94e7352d2bbc3685d8919c316935"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/render.rs: FileTooLong \u2014 1774 significant 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 1274 over it, 3.55\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/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed09b2dc6af31e52dfc1f5b95c4d7752716eb526777162a25ccee339a432e4a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.bindings_with_receiver: MethodTooLong \u2014 bindings_with_receiver runs 351 significant 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 251 over it, 3.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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":7162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a27615dad8c0da4e7118a0c3079cfe8c8bee5c55436df784b680edf17a70517"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NarrowingConstraintsBuilder.evaluate_expr_compare: MethodTooLong \u2014 evaluate_expr_compare runs 348 significant 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 248 over it, 3.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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":4047}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b31b730c2c431b0aec51f25704d544d58f08a811226e61e8474e3d8ff15610e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::infer::comparisons::infer_binary_type_comparison_inner: FunctionTooLong \u2014 ty_python_semantic::types::infer::comparisons::infer_binary_type_comparison_inner runs 340 significant 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 240 over it, 3.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":"crates/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda37b13372eb3c1db737ff15286fb40dd7da3e1c723604bbee45ec9432d1af8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/function.rs: FileTooLong \u2014 1693 significant 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 1193 over it, 3.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"462d38a9ececa832ba964a3959abcdb3503763b4f2d2d4727cb03ef4735223f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticClassLiteral.own_generated_member: MethodTooLong \u2014 own_generated_member runs 337 significant 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 237 over it, 3.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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f61449869f73a6e93a4bbdd49c913e18ecf692bd4fb07620b82cee360db818"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/statement.rs: FileTooLong \u2014 1609 significant 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: Parser (80-4072). The bar is 500 significant lines; this is 1109 over it, 3.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":"crates/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d5e1cb7a64862614fbd4e65a97c170b00b311e3abfdcccac330626503960d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/typevar.rs: FileTooLong \u2014 1607 significant 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 1107 over it, 3.21\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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2e5a2083f4ca3a500d632f813f3930523ef8c52c8849660d0b7c279b4ef6d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/comparable.rs: FileTooLong \u2014 1604 significant 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 71 free functions. The bar is 500 significant lines; this is 1104 over it, 3.21\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/ruff_python_ast/src/comparable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82d19c85b08647043756544f28f952a18379e6e555ae06cf5881aa76eb0ffdf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IterationError.report_diagnostic: MethodTooLong \u2014 report_diagnostic runs 319 significant 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 219 over it, 3.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":"crates/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcdd30740184d4b3ba684376352215d13d9fd17dda6c560e427d631d1d47282"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/expression.rs: FileTooLong \u2014 1575 significant 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 1075 over it, 3.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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a091ec4855970a6854d58f65f94f1cd3079f31e25c11fd579e44b70688eca034"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: set_theoretic/builder.rs: FileTooLong \u2014 1559 significant 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 1059 over it, 3.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"183e02bd38b9cd4bbdd4c9fa229b6f2dbe1f253822d64f75cd30382b3e7c1c0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metadata/options.rs: FileTooLong \u2014 1557 significant 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 1057 over it, 3.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":"crates/ty_project/src/metadata/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabe4fb99f0c0449b100f9e65ce6e747a84673b8f41b6bf4e4116544e68e994f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeRelationChecker: ClassTooLong \u2014 1232 significant 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, 2 blocks, lines 1253-3444. The bar is 400 significant lines; this is 832 over it, 3.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc66250ddacd4055c8e401e2844cf3361b32936a598f6da99232d220486d7d54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/place.rs: FileTooLong \u2014 1538 significant 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 1038 over it, 3.08\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/ty_python_semantic/src/place.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b3a399610e3a0d8a6f4393579f8d9383a9175ca089f44d8a022b7a3c49e2cd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SolutionWalker: ClassTooLong \u2014 1211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 2 blocks, lines 73-1867. The bar is 400 significant lines; this is 811 over it, 3.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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16c785942e770f1743c13d486ffd990924a7bf6d3c701d9ce3a3ba3fc561d03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/infer.rs: FileTooLong \u2014 1498 significant 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 998 over it, 3.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dc43d2a6884d7f5d2a53b5d62586ed095ce27957713fb388a72676bbefdd10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/overrides.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). The bar is 500 significant lines; this is 984 over it, 2.97\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/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b114142493732304c339fcfe9c478d0ed76f6b9c7c155afa0a96d0d7ee5e8472"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SemanticModel: ClassTooLong \u2014 1176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 145 methods, 2 blocks, lines 59-2521. The bar is 400 significant lines; this is 776 over it, 2.94\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_semantic/src/model.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e0171577a125fd40f747b80c48607cac24165f04d2197877a956462b29ac1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/equality.rs: FileTooLong \u2014 1469 significant 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 969 over it, 2.94\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/ty_python_semantic/src/types/equality.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9776a0a38418dcb10841e0addc90466a1aa1f5c02418dac8abcb17590fcbf636"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.identity_comparison_type: MethodTooLong \u2014 identity_comparison_type runs 291 significant 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 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"766ab61b9d838f1720ba75e4be712749412e9836363c7bd985b7089a265dae33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.validate_subscript_assignment_impl: MethodTooLong \u2014 validate_subscript_assignment_impl runs 290 significant 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 190 over it, 2.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde1373148693d30deaceabe8108cf0777fae9e1bc99d4c20ecca1cfa4b37b89"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::airflow::rules::removal_in_3::check_name: FunctionTooLong \u2014 ruff_linter::rules::airflow::rules::removal_in_3::check_name 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":"crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a45f86368b35a5d0074fc8cb150bbbf30ed8ec9e746683ca36fcad97e9af9f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: constraints/solutions.rs: FileTooLong \u2014 1442 significant 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: SolutionWalker (2 blocks, 73-1867). The bar is 500 significant lines; this is 942 over it, 2.88\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"649f68a09462a0c410ca059ab8a51fa2b2e49aadf107f9383526b74711be55a9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Generator: ClassTooLong \u2014 1153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 3 blocks, lines 90-1638. The bar is 400 significant lines; this is 753 over it, 2.88\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/ruff_python_codegen/src/generator.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9fadad45790deb59affe8b2b47d6d4f05dcdaf443f6f7fbd0e1b644f60f16f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analyze/expression.rs: FileTooLong \u2014 1417 significant 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 917 over it, 2.83\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/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dab290fe6825dddf84482df0a1f4757b92408fe327e7326143673515e6524a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/function.rs: FileTooLong \u2014 1415 significant 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 915 over it, 2.83\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/ty_python_semantic/src/types/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b1055a6403f808ee3ecc73e2dc7d735886018bc01e9a5f6b4ecc38aff123e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_collection_literal_impl: MethodTooLong \u2014 infer_collection_literal_impl 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":8063}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb52fa3eac7f7d9ed24caaf09b26802a16686b55a6b321c8deb2bf4634e747b2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Signature: ClassTooLong \u2014 1117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 64 methods, 3 blocks, lines 688-2609. The bar is 400 significant lines; this is 717 over it, 2.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":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae59b7f2f93a9d7156189683050c90a9223eb4030c217b6bd6e16cd858772d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/reachability.rs: FileTooLong \u2014 1372 significant 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 38 free functions. The bar is 500 significant lines; this is 872 over it, 2.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/ty_python_semantic/src/reachability.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08f61725c718ed921d47b72d85572836556a89789400ed8f76ff5e4c8c5f0b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/model.rs: FileTooLong \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), about 86% of them inside a single declaration: SemanticModel (2 blocks, 59-2521). The bar is 500 significant lines; this is 870 over it, 2.74\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_semantic/src/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d372c6fb55bbed56185a349e70d42bf43539af5f755c0ee905887ab601d464"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.subscript: MethodTooLong \u2014 subscript runs 274 significant 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 174 over it, 2.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":"crates/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e2526f5d6d8511b04558bba502c2c61057efd17702790ddab2242f3af89f7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Configuration.into_settings: MethodTooLong \u2014 into_settings runs 271 significant 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 171 over it, 2.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/ruff_workspace/src/configuration.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b5cb4783449630962a3fcb15b59e270a27ebd27b3dc051eef48bf0833ee3a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BoundSuperType.build: MethodTooLong \u2014 build runs 271 significant 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 171 over it, 2.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/ty_python_semantic/src/types/bound_super.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f253d3b7a673d50b2079d7d36b3dcd373cdd6dce0502195c72df5b834ae3b35a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: constraints/sequents.rs: FileTooLong \u2014 1351 significant 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 851 over it, 2.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"123fa162c79c2856f1bf60a1c393c7217833c5099a33421e28db3ab1dfe0c004"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_test::run_test: FunctionTooLong \u2014 ty_test::run_test runs 267 significant 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 167 over it, 2.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_test/src/lib.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2340e4e6418ae6acc3dd94b9140c0350cdc7cbbcd7c0202f861ebd30c933216a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeRelationChecker: TooManyMethods \u2014 80 methods, declared across 15 files: types/relation.rs (32), types/attribute_write.rs (9), types/signatures.rs (8), types/protocol_class.rs (7), \u002B11 more file(s). The bar is 30 methods; this is 50 over it, 2.67\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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"1139257c9123a146c31b83cdfb414f4835cd65c835d30cb0d01724d8eaf115db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/configuration.rs: FileTooLong \u2014 1326 significant 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 826 over it, 2.65\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/ruff_workspace/src/configuration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b5a82166f738a0804a248037352a3620667ba759731114185e716b4d6f38e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::checkers::ast::analyze::expression::call_with_qualified_name: FunctionTooLong \u2014 ruff_linter::checkers::ast::analyze::expression::call_with_qualified_name 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":"crates/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e19787f3b09267e0386567315ccc4a02299f2afd5f327242c01824adf7388f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_annotated_assignment_definition: MethodTooLong \u2014 infer_annotated_assignment_definition runs 262 significant 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 162 over it, 2.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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4751}}}],"partialFingerprints":{"codehealthFindingId/v1":"90764dafbd9e6a41fe42dfe2492d062ccf6a3953ddd80d5c9d6a0597376ca312"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1308 significant 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 808 over it, 2.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":"crates/ty_site_packages/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2826c15cef8c66a3bb149e26f04f3eac646bc72cfc43ff354bf0f8cdb91af1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/ide_support.rs: FileTooLong \u2014 1301 significant 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 801 over it, 2.60\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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"943bc3e66efcd1e54ccb8b93caa29820460bf813d697602baeb678a5d9cb26d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/instance.rs: FileTooLong \u2014 1294 significant 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 794 over it, 2.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec347e8a11cf27b107346aff82ec7c5152147f3cb798e1ac66e3bfde6ee263cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_class_definition: MethodTooLong \u2014 infer_class_definition runs 252 significant 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 152 over it, 2.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":"crates/ty_python_semantic/src/types/infer/builder/class.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"189ef83fb2d681d5d9fa79aa57a19eac2bba8e9cca4074a23acc53f17e401a96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_function_definition: MethodTooLong \u2014 infer_function_definition runs 246 significant 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 146 over it, 2.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":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"548540d3d1986c90f3083705aed2bca7f341ac10366492f184b258e80cc1914f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/generator.rs: FileTooLong \u2014 1222 significant 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: Generator (3 blocks, 90-1638). The bar is 500 significant lines; this is 722 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":"crates/ruff_python_codegen/src/generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"197a46667398d207a9b438ac0e5cf6193d08a3f5dc53e7937561a7a202e3fad3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/attribute_write.rs: FileTooLong \u2014 1222 significant 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 722 over it, 2.44\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/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"564895d2f3c866954b2645bd09b8c4f57456c25da602e29990e6bbad68d4d30a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.try_iterate_with_mode: MethodTooLong \u2014 try_iterate_with_mode runs 243 significant 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 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":"crates/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee446779759c79c931ae1697a04cf1c3963dda6aa2bc5c44a899294a6f1770b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1212 significant 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 712 over it, 2.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":"crates/ty_wasm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbb957e150b3881e7ac4dacc1e5f1215d709a8b64b2b9a8a5230eb368e807ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_legacy_typevar: MethodTooLong \u2014 infer_legacy_typevar runs 242 significant 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 142 over it, 2.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":"crates/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2e3ddfd1aa169dd18d6040e0efe2465fd2c300282b226c98f4f4dd24cd6189"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.find_legacy_typevars_impl: MethodTooLong \u2014 find_legacy_typevars_impl runs 241 significant 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 141 over it, 2.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":10430}}}],"partialFingerprints":{"codehealthFindingId/v1":"7830b3e6f33edc9477f92491f688537e6a99e67b01da0433e48d030d1f7a0f10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/helpers.rs: FileTooLong \u2014 1200 significant 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 48 free functions. The bar is 500 significant lines; this is 700 over it, 2.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":"crates/ruff_python_ast/src/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe8ef81f7a255e564570efa402ed2db09894bcf0ebd69533c138abe500963f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_attribute_load_impl: MethodTooLong \u2014 infer_attribute_load_impl runs 238 significant 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 138 over it, 2.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":11269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff1317a9d38bed89e666118b09698311039b9e9022a3ab4981c52cbec17ec8a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UseDefMapBuilder: ClassTooLong \u2014 950 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 51 methods, 2 blocks, lines 2185-3653. The bar is 400 significant lines; this is 550 over it, 2.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/use_def.rs"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d04b314ab302316bba2359bb81fef238a92543d32270b8f948e9808877d0a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.validate_attribute_deletion: MethodTooLong \u2014 validate_attribute_deletion runs 237 significant 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 137 over it, 2.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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8811ea613b8f85c45a380c46de167c5e10210280a3eaf12a642269b270636be6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/definition.rs: FileTooLong \u2014 1184 significant 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 684 over it, 2.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/ty_python_core/src/definition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a90918d23f3da2db9110c5c94feccde5c9246d01d096a6ced11ac298e5f2dc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 1180 significant 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: Session (2 blocks, 61-1492). The bar is 500 significant lines; this is 680 over it, 2.36\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/ty_server/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c261f9ef1442d72ac687a4e23d74691f0ec3dd5c729af693adc1bc3461068e9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeRelationChecker.check_typeddict_pair: MethodTooLong \u2014 check_typeddict_pair runs 236 significant 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 136 over it, 2.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/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cd763bef4581f4c375797ebb06932e540904d982ffce747119586fb3917118"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analyze/statement.rs: FileTooLong \u2014 1175 significant 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 675 over it, 2.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":"crates/ruff_linter/src/checkers/ast/analyze/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffa97c68778dca074243644303b3360fc3913dfc515881bb4b80c5994819057"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProjectDatabase.apply_changes: MethodTooLong \u2014 apply_changes runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 135 over it, 2.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_project/src/db/changes.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab446c1abe080cee5b01d45a8a7446843585cb675c80bafd731891705c55e8c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PatternSuccessAnalyzer: ClassTooLong \u2014 931 significant 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 429-3503. The bar is 400 significant lines; this is 531 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d611c3e07c4638df0008334d257e233b576dfad2342849159cc66e9ddb1e51b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_namedtuple_call_expression: MethodTooLong \u2014 infer_namedtuple_call_expression 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":"crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cab3bd73f83e1b37c412c81ad16366fe5ef1d08d6f2f4833d0103e98476af01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_annotations::rules::definition::definition: FunctionTooLong \u2014 ruff_linter::rules::flake8_annotations::rules::definition::definition 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":"crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce470cc7fbc6a38806bb2e15c902ec8fecd90fdab96c45d0df5ec3d18d9f789d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::checkers::ast::analyze::definitions::definitions: FunctionTooLong \u2014 ruff_linter::checkers::ast::analyze::definitions::definitions runs 228 significant 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 128 over it, 2.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":"crates/ruff_linter/src/checkers/ast/analyze/definitions.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59900b7a1b2f0c4fa586f1c1df0737a74683f9aa43ed2ea54904a98a0d0511e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/typevar.rs: FileTooLong \u2014 1136 significant 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 98% of them inside a single declaration: TypeInferenceBuilder (34-1626). The bar is 500 significant lines; this is 636 over it, 2.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec189a6db93391cffb2d4524a9b4d3a898867160c57622126e033d81d699bbb0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DunderReplacement.from_method: MethodTooLong \u2014 from_method runs 227 significant 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 127 over it, 2.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/ruff_linter/src/rules/pylint/rules/unnecessary_dunder_call.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31fbd968b8cd7d164dfcf4227a08362af275c334831bed6a7ccb4d574690b44"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: ruff_linter::preview: TooManyFunctions \u2014 68 free functions. The bar is 30 free functions; this is 38 over it, 2.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":"crates/ruff_linter/src/preview.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ce2e08b3a13bbf95055696d20b518116324ee994792b247a9e3763376d6d77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/codes.rs: FileTooLong \u2014 1130 significant 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 630 over it, 2.26\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/ruff_linter/src/codes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edeb372e585ff69188879edcf35fb24c23fd20c2c7db26d96d1e8916158b69fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_subscript_type_expression: MethodTooLong \u2014 infer_subscript_type_expression runs 226 significant 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 126 over it, 2.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e96b148a30e12b5e96b5261cfae28b229c5bd535a52afe447758650c194574"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/semantic_errors.rs: FileTooLong \u2014 1128 significant 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 628 over it, 2.26\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/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3da4f298613da4ec8f2c871352b6ebf62f2df7758dce14a6926990fa84cabe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_python_ast::visitor::transformer::walk_expr: FunctionTooLong \u2014 ruff_python_ast::visitor::transformer::walk_expr 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":"crates/ruff_python_ast/src/visitor/transformer.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d30721d5acb30d02ee04244783b62a3aa5112c025e9076d910e5f56151a7be0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Checker: TooManyMethods \u2014 67 methods. The bar is 30 methods; this is 37 over it, 2.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c264b7b57fdc17bacf093e629d6f8bac733f85d9961297e2c9dab643c4871f95"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnionBuilder.add_in_place_impl: MethodTooLong \u2014 add_in_place_impl runs 221 significant 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 121 over it, 2.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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c505e3dbb020f9c05a39c3d2ca7b06a4ddc65de034b02fba317b7f0a63d04ef3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: suspicious_conditions/diagnostic.rs: FileTooLong \u2014 1098 significant 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: TypeInferenceBuilder (60-1634). The bar is 500 significant lines; this is 598 over it, 2.20\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ef5fda7075ea721caebc40161e8954e6e90818965f7f8ff8d668ced7c92c3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/comparisons.rs: FileTooLong \u2014 1090 significant 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 590 over it, 2.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":"crates/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9b25bc98ea7e6ea4f145a58f3499af107b224843262eaffb9b18dcaa9d6b2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_python_ast::visitor::walk_expr: FunctionTooLong \u2014 ruff_python_ast::visitor::walk_expr runs 218 significant 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 118 over it, 2.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":"crates/ruff_python_ast/src/visitor.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3e437bc9f00b658de13ddb01763b9533d51e576970809389394b086d42c100"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CallableBinding: ClassTooLong \u2014 865 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 4 blocks, lines 3505-5042. The bar is 400 significant lines; this is 465 over it, 2.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3505}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fecb297f2f79cc17f938572930f675e21403a978b6b514e7d3b463b77f8377"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GotoTarget.from_covering_node: MethodTooLong \u2014 from_covering_node runs 214 significant 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 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/goto.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe53b41b510103c4accc1d8209b8c60b044598be58cf628583714858deaa7a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::enums::enum_metadata: FunctionTooLong \u2014 ty_python_semantic::types::enums::enum_metadata runs 214 significant 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 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/enums.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43b3bfc9b774de5fd3e04585aba7bcc77a33500b44ec13cafdfd7a4efc973cf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Signature: TooManyMethods \u2014 64 methods, declared across 2 files: types/signatures.rs (62), types/display.rs (2). The bar is 30 methods; this is 34 over it, 2.13\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"610f1fa4113da22cb3d6cc9dc5e577e97e68f0542a19bcbf0d8caf31efdacc06"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClassType: ClassTooLong \u2014 852 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 55 methods, 4 blocks, lines 1178-2621. The bar is 400 significant lines; this is 452 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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"086d7b3ebf20d65031ef55996bfc87f98b0c7255de2bbbb86bd55a0112abf7f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_python_ast::helpers::any_over_stmt: FunctionTooLong \u2014 ruff_python_ast::helpers::any_over_stmt runs 212 significant 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 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/helpers.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeac94e153b699a627e2ef012f1454f5d0fbe39b39bbe613e25c729de6a19e55"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CallInference: ClassTooLong \u2014 835 significant 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, 3 blocks, lines 6180-7730. The bar is 400 significant lines; this is 435 over it, 2.09\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6180}}}],"partialFingerprints":{"codehealthFindingId/v1":"11970a275fdde0883a76b819294c53ae04abca19d7e87e1bafe9b0f60686eccb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/enums.rs: FileTooLong \u2014 1042 significant 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 542 over it, 2.08\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/ty_python_semantic/src/types/enums.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14afe8e4e691f4a6cfe2ff0b5c6756b49a0f97fa77bc297089e6bfd20cf5e62a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.known_class_literal_bindings: MethodTooLong \u2014 known_class_literal_bindings runs 207 significant 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 107 over it, 2.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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":7730}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cd4e9fdd7b2c627aa4a081e7739541ba6e5eb9f4baefcfcbfd73fe00031519"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/set_theoretic.rs: FileTooLong \u2014 1031 significant 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 531 over it, 2.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":"crates/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e04ffb823d177956fc5b8c167cfed9e008f584285cc112444084a58bdd8f9ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.try_bool_impl: MethodTooLong \u2014 try_bool_impl 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":"crates/ty_python_semantic/src/types/bool.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b0eb6b2052daede5798ec26e61b6967e0fbff27a4ddac8c067fb5900de2194"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.validate_typevar_default: MethodTooLong \u2014 validate_typevar_default 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":"crates/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0ad6b48a80fe546f6512a3f727403844151545be5a6641835aed5f511e64f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: post_inference/static_class.rs: FileTooLong \u2014 1023 significant 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 523 over it, 2.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":"crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2604b2f0242284c5f93135c8b189e73d099f27d75baf5e9ca6d9c1f6a946b1d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AllMembers.extend_with_type: MethodTooLong \u2014 extend_with_type runs 204 significant 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 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/list_members.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64a9461f8d8f2c65f5e81730920ac2960cd1de4d6e3fe05144ac40bcf454130"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dedicated/pydantic.rs: FileTooLong \u2014 1016 significant 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 32 free functions. The bar is 500 significant lines; this is 516 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/dedicated/pydantic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9b7efd98c1963a77d8a7d25ec5d1210ae4960964802aa49902cabdb2eba7b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_subscript_load_impl: MethodTooLong \u2014 infer_subscript_load_impl runs 203 significant 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 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b2a23c5d85be642cbcc35eac088f3d30272d0ed0615974be4b64e2bc9b3050"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Binding: ClassTooLong \u2014 810 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 2 blocks, lines 8629-9906. The bar is 400 significant lines; this is 410 over it, 2.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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8629}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5b4faeccb0e42b9049b27422690684719fcc49f1bbce922179030f8fb48867"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallableBinding.check_types: MethodTooLong \u2014 check_types runs 202 significant 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 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3931}}}],"partialFingerprints":{"codehealthFindingId/v1":"1631a960640c8e72efbd19aceb0570fc10e8a5eab22ddc43decda5ff130ce17d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/resolve.rs: FileTooLong \u2014 995 significant 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 495 over it, 1.99\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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92f2827720d00d804003f8e91151d7e6465462ad6518e29fb9b97cda5869137"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rule-filters.document$.subscribe(): FunctionTooLong \u2014 document$.subscribe() runs 199 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/rule-filters.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aab20333713abc1596488eb1f7b9c8f772284f0dd50508bf342cd45c2940372"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/args.rs: FileTooLong \u2014 992 significant 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 492 over it, 1.98\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/ruff/src/args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"152accea5eee9a7985dd6adb4c4489a11138826df1ddffc2bbda26bc2783d9a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContextManagerError.report_diagnostic: MethodTooLong \u2014 report_diagnostic runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/context_manager.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf553a6c43e2b471f811846877f2853dcba0f4ca77e696ec19a42c95463577f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownBoundMethodType.callables: MethodTooLong \u2014 callables runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/method.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c75adbae7f51dcae0b0d301c0b4dab208800b8b566cd466fa3e61bfceb5bb09"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DisjointnessChecker: ClassTooLong \u2014 777 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 2 blocks, lines 3516-4827. The bar is 400 significant lines; this is 377 over it, 1.94\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":3516}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30289cc75594b8854ce082cee2472398b3f7a51a96e9b493a8eaff249141358"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatSuite.fmt: MethodTooLong \u2014 fmt runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/statement/suite.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3812dcfc5c915c238b85f77d5c2e5e4803ed44aaca6dd14dc5fb2563cf0bb9c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LintConfiguration.as_rule_table: MethodTooLong \u2014 as_rule_table runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_workspace/src/configuration.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f55e937580f5049ba2d5876dae145e17d068f89ca90e4d4f0ac6777937c957"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.map_type: MethodTooLong \u2014 map_type runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":10118}}}],"partialFingerprints":{"codehealthFindingId/v1":"744c558c2e677d3b0bb8d8c066d308ac630c21b3ebf49cdc9a187e27a0c21912"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/mod.rs: FileTooLong \u2014 968 significant 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 468 over it, 1.94\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/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c944a4c910ba853c213a2efeb0b8a2d7971e3db3776e68c2889a7fdd4a31a976"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Bindings: TooManyMethods \u2014 58 methods, declared across 2 files: call/bind.rs (57), bind/property.rs (1). The bar is 30 methods; this is 28 over it, 1.93\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"7803735a09400b2997826c4b8d662ef9f6c0b0c4ae5d85d1fcb9eff2d79eba4f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_legacy_typevartuple: MethodTooLong \u2014 infer_legacy_typevartuple runs 193 significant 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 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb46d164636353237f3c7b7a2fb0cb92cb5de3cf372c12eaae5275b00d9547a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: printer/mod.rs: FileTooLong \u2014 953 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 453 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_formatter/src/printer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0c39554adcb1f39f62ae301a633b0a653bc8461655f694a9be794c10dcc9d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff::check: FunctionTooLong \u2014 ruff::check runs 190 significant 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 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/lib.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8660a6866f60119adc7c04a5917f4c87625f7b274b032474920651cc24a948f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.constructor_bindings: MethodTooLong \u2014 constructor_bindings runs 190 significant 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 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":8107}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b1ceac6160a78ff570368246960b8bc4556e65ae8559f484eba4fe971ea29e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FunctionType: TooManyMethods \u2014 56 methods, declared across 2 files: types/function.rs (55), types/display.rs (1). The bar is 30 methods; this is 26 over it, 1.87\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/ty_python_semantic/src/types/function.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a530d98e62157f79d6f281c777d49e573b64900810a7387c15b419e2068bd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lexer.rs: FileTooLong \u2014 925 significant 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 425 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/lexer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5863db4e76b9703ace506dcfd14d9e0fd1f5000b70332f822a29d4353b1b7621"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::checkers::noqa::check_noqa: FunctionTooLong \u2014 ruff_linter::checkers::noqa::check_noqa 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/ruff_linter/src/checkers/noqa.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ce7389588d7c1ede6c99dbd349a7546d9ffec7a0d90854c361a5cbab0caf71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::isort::order::order_imports: FunctionTooLong \u2014 ruff_linter::rules::isort::order::order_imports 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/ruff_linter/src/rules/isort/order.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbe1a17cde596daf7cecf50e344a186cd1f0dccd4e43b2448129dd0379a214a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResolvedPythonType.from: MethodTooLong \u2014 from 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/ruff_python_semantic/src/analyze/type_inference.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee1d4140ea0d445e4e033d6225dd9fbc5deebdc02be6dac2752b6129b7d7b08"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.in_type_expression_impl: MethodTooLong \u2014 in_type_expression_impl 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/ty_python_semantic/src/types.rs"},"region":{"startLine":9184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9700733973e361a239447c152cce94226a37cbe1ccf0317e13c0140bb24a12d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SolutionWalker.validate_constrained: MethodTooLong \u2014 validate_constrained 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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0436d316d6d946cdde0a6c6e08d431e9123e3a55aeb8b6259d7a775afc4112b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Printer.print_element: MethodTooLong \u2014 print_element 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":"crates/ruff_formatter/src/printer/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"568a45bbf665bb730e33db98bf670e6217c03bc714117db5603ea4a629d74554"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClassType: TooManyMethods \u2014 55 methods, declared across 4 files: types/class.rs (52), types/abstract_methods.rs (1), types/mro.rs (1), types/protocol_class.rs (1). The bar is 30 methods; this is 25 over it, 1.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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ab6a5a59913dbee6a991c9ee8533914143492bd8e3645f9ccc45ecab66a251"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: 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/ty_server/src/session.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1417a352027cf66df77a8b1eeef7c6579ee18ce12ec713a7b3e0f9d744e9a6cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rules/moved_to_provider_in_3.rs: FileTooLong \u2014 916 significant 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 416 over it, 1.83\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/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de39830502d941daff4a43651fe297ca3e8597d41039d974ae2fff052641884"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::diagnostic::register_lints: FunctionTooLong \u2014 ty_python_semantic::types::diagnostic::register_lints runs 182 significant 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 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2119cceb96af968a36eb16c8063fb7504f25a85dce5543ce6860b467ffbdfb6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AssignmentAttributeWriteEvaluator: ClassTooLong \u2014 721 significant 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, 2 blocks, lines 205-1206. The bar is 400 significant lines; this is 321 over it, 1.80\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/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aed26d0721fb903a4df7e2d3d6650b5a54484ef190a8e39da23cc169f110333"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::checkers::ast::analyze::deferred_scopes::deferred_scopes: FunctionTooLong \u2014 ruff_linter::checkers::ast::analyze::deferred_scopes::deferred_scopes runs 180 significant 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 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/ruff_linter/src/checkers/ast/analyze/deferred_scopes.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68d27ef43a6f4379c02523c518f03968593261e69288c96b07aca0ac1ce5d56"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.try_upcast_to_callable_impl: MethodTooLong \u2014 try_upcast_to_callable_impl runs 180 significant 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 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/ty_python_semantic/src/types/callable.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b92c3ba0ba3f58ffd3d6de3f5648960a26cfbf21d3ab959b3f15b264689bcb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/match_pattern.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 34 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/ty_python_semantic/src/types/match_pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25109ee27af87df82545fe59c54f33497c3712b1aad7226760443500aaed8c33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: comments/placement.rs: FileTooLong \u2014 898 significant 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 41 free functions. The bar is 500 significant lines; this is 398 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/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0688d524deeb504cfa779aab6cfa9346c831513d3e5e0c7fe3c61ecf1146632b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/goto.rs: FileTooLong \u2014 898 significant 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: GotoTarget (3 blocks, 33-1376). The bar is 500 significant lines; this is 398 over it, 1.80\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/goto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c12963bb1b47c1c12cb9d0c4f39eaf645362fd45a95f23d63f8260977a2b3ac"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PathAssignments: ClassTooLong \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), 22 methods, 3 blocks, lines 58-1212. The bar is 400 significant lines; this is 317 over it, 1.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":"crates/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eec7e23dff924b16597d39f249a214c6510d40b2ce5721de0a797adea4340dc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Session: ClassTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 55 methods, 2 blocks, lines 61-1492. The bar is 400 significant lines; this is 316 over it, 1.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":"crates/ty_server/src/session.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f336ea3e166089599566f3ba8f294f5a8fa7de3adc1bd317eda0b8b25eaa89fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_bandit::rules::suspicious_function_call::suspicious_function: FunctionTooLong \u2014 ruff_linter::rules::flake8_bandit::rules::suspicious_function_call::suspicious_function runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bandit/rules/suspicious_function_call.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dd47c8879d3ad0dc133b9d29c2503dfd6066e71e152b1dad205d73b0a8f06d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_python_ast::visitor::walk_stmt: FunctionTooLong \u2014 ruff_python_ast::visitor::walk_stmt 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":"crates/ruff_python_ast/src/visitor.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d010282164c946a13c8407b392383b332294c95d05e8942822f642e58b7e433"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_python_ast::visitor::transformer::walk_stmt: FunctionTooLong \u2014 ruff_python_ast::visitor::transformer::walk_stmt 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":"crates/ruff_python_ast/src/visitor/transformer.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"08feeda71fe1dc85330b85a21af816f977a94277a3e1d7479bbe134b6a458d5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeRelationChecker.check_variable_length_vs_tuple_spec: MethodTooLong \u2014 check_variable_length_vs_tuple_spec 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":"crates/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bc4671341652e308d0d573a0c937f88277d72a08b2c1bcbb252e095f45c83b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: constraints/variables.rs: FileTooLong \u2014 888 significant 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 388 over it, 1.78\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/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ce81d0d7766e1739262cab157feaa2ee93de37ea293d2b002b6510ea4f370e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_annotation_expression_impl: MethodTooLong \u2014 infer_annotation_expression_impl runs 177 significant 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 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/ty_python_semantic/src/types/infer/builder/annotation_expression.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd74bd2df0a458aae1d3f1c202daa36f8fa1011942281f64cf7628f480e13971"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::equality::evaluate_structural_comparison: FunctionTooLong \u2014 ty_python_semantic::types::equality::evaluate_structural_comparison runs 175 significant 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 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/equality.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de7c64fbcddeb27c6b8e8a7b077d9b00aabda5b6be56bf8de34035cd9b0f931"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FitsMeasurer.fits_element: MethodTooLong \u2014 fits_element 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":"crates/ruff_formatter/src/printer/mod.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3b9333752cdec3c1580fd13a2bfc97b5209655b8ed08cabbfe7db1878fa6bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_legacy_paramspec: MethodTooLong \u2014 infer_legacy_paramspec 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":"crates/ty_python_semantic/src/types/infer/builder/typevar.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc1649ad8669e5052fca8031b6dc48b516e8c4a3ed649dcd12fa8d6045fe198"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/attribute_assignment.rs: FileTooLong \u2014 866 significant 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 83% of them inside a single declaration: AssignmentAttributeWriteEvaluator (2 blocks, 205-1206). The bar is 500 significant lines; this is 366 over it, 1.73\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/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f998289ffeb854f4d9c0540caae7e7383009ccb7cb1bb80a63ed6244fee59a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassBase.try_from_type: MethodTooLong \u2014 try_from_type 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/ty_python_semantic/src/types/class_base.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbc7dfd5f11a001502799f4ba7fd280c1a6c5f8753a4f56149a8dc51e519304"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/symbols.rs: FileTooLong \u2014 852 significant 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 352 over it, 1.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/symbols.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c01e92ceef3deb65fa0f17ed402fe599a66e787ee2b18523e390fd46122e7a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UseDefMapBuilder: 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/ty_python_core/src/use_def.rs"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e456e9c3d9fde60d993465c4819544ed08b951dc72662660e12a54836ad47fec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LinterSettings: TooManyFields \u2014 51 stored fields beside 7 methods. The bar is 30 stored fields; this is 21 over it, 1.70\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/ruff_linter/src/settings/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"af854c784d7da03a3d8772d47338622df05aba51c169b4458ecacc804e06fc41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_builtins_type_call: MethodTooLong \u2014 infer_builtins_type_call 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":"crates/ty_python_semantic/src/types/infer/builder/type_call.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"61473d5d884da30fcccba3223490543c76f95af704c568a956ee50b86fe0cbe2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DisjointnessChecker.check_typeddict_pair: MethodTooLong \u2014 check_typeddict_pair 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":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2178328812c96efac0292990fac6a832350d47a36266a08157d674365208df2d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LintOptionsWire: TooManyFields \u2014 51 stored fields. The bar is 30 stored fields; this is 21 over it, 1.70\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/ruff_workspace/src/options.rs"},"region":{"startLine":4417}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75f4de76a6b9e962cf6e1c23fe5b30f753f8e89d060df488b06593ba7992de2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/binary_expressions.rs: FileTooLong \u2014 844 significant 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 87% of them inside a single declaration: TypeInferenceBuilder (158-1256). The bar is 500 significant lines; this is 344 over it, 1.69\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a455ba32ebe37bd5b07f890340b18460030d9e7236f169cd3c50775de3a5fb1f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GotoTarget.definitions: MethodTooLong \u2014 definitions runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/goto.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"607e2d67979aa7d5cd64289edbd89b2ed7a71dced14b5412e8885200b982793b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassType.own_class_member: MethodTooLong \u2014 own_class_member runs 167 significant 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 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"0951cb43516eb3b03425b8f9acbfac7040d4667a817bd97bcaf8890cdde0e05a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::infer::builder::post_inference::overloaded_function::check_overloaded_function: FunctionTooLong \u2014 ty_python_semantic::types::infer::builder::post_inference::overloaded_function::check_overloaded_function runs 167 significant 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 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/post_inference/overloaded_function.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b8beb37dbcf317a64843b7733bfa56ab1208c11ba3f5fe1f8c03e583d3f04f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/noqa.rs: FileTooLong \u2014 831 significant 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 331 over it, 1.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":"crates/ruff_linter/src/noqa.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be014cf4744e541f34ce896f22dba0ae2e6445457ee99d93e9035809dabe6cec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/semantic_tokens.rs: FileTooLong \u2014 831 significant 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: SemanticTokenVisitor (3 blocks, 308-1390). The bar is 500 significant lines; this is 331 over it, 1.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/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad02ad980320fc65b12c806949df2d0f2d1e8608c09a0c9d425e17da1b88ec5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SimpleTokenizer.next_token_inner: MethodTooLong \u2014 next_token_inner runs 166 significant 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 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_trivia/src/tokenizer.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c559098e344e5e2c50c298763b3daae9f2d7b66b9c7d1ef4a78adf7dd8c1eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DisplayKnownInstanceRepr.fmt_detailed: MethodTooLong \u2014 fmt_detailed runs 166 significant 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 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":3892}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e35cb93c9805a947a88f1e422c53b55415a7785c6870539927ebc155647804"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImportStatement.detect: MethodTooLong \u2014 detect 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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b0e03887389eedec532d08114e567eaaa516f8d9617cc6100f3f836e7141bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SemanticIndexBuilder.visit_expr_with_context: MethodTooLong \u2014 visit_expr_with_context 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":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c139b32e31c36d20f17493c89f6855e9bd567741ac265d5e3821b9265f33525"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_unary_expression_type: MethodTooLong \u2014 infer_unary_expression_type 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":11708}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d057ce52fc3b8c55c906dd1dff0702ecf9a6dbead0536ccb6b3a79b22b6eab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/iteration.rs: FileTooLong \u2014 820 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 320 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"995e9dc2e104d500664e3548349c8d4aa2fce4012153eb3b8c8492c61af3b851"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssignmentAttributeWriteEvaluator.evaluate: MethodTooLong \u2014 evaluate 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":"crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc60c877a02ceac70108512388c8018988fee456534e78b07ef35f8e2983e35"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: equality/enums.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). The bar is 500 significant lines; this is 318 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/equality/enums.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c00c9a87b1ed31f2557b0f18ac169121f7f626ae334514da82906f20611697"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_typeddict_call_expression: MethodTooLong \u2014 infer_typeddict_call_expression runs 163 significant 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 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bf9c00cc2e8bdcac94cf572b4f263da6d16ef9e957ff045c368e9b631a1d17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::airflow::rules::suggested_to_move_to_provider_in_3::check_names_moved_to_provider: FunctionTooLong \u2014 ruff_linter::rules::airflow::rules::suggested_to_move_to_provider_in_3::check_names_moved_to_provider 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":"crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcdb1a34c629238c3ca20df87563814d1d9cb320264e104796d0eff321c6fd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::pydocstyle::rules::sections::blanks_and_section_underline: FunctionTooLong \u2014 ruff_linter::rules::pydocstyle::rules::sections::blanks_and_section_underline 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":"crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdfa6c596a4728ca81c4f3fdca98fbfb047b242198af8004edf83b489f274be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_python_ast::helpers::any_over_expr: FunctionTooLong \u2014 ruff_python_ast::helpers::any_over_expr 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":"crates/ruff_python_ast/src/helpers.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b0a6f0ddfc64d4f07aa04cb26c55b1ef2edb74cba2b0e8f7eacd847abbeb5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rules/removal_in_3.rs: FileTooLong \u2014 807 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 307 over it, 1.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f9fde498fa53ae04b2b97f51269806e82eb5af1a193ddc9567fd617a6fac19"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SemanticTokenVisitor: ClassTooLong \u2014 645 significant 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, 3 blocks, lines 308-1390. The bar is 400 significant lines; this is 245 over it, 1.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e51bf6d5c7da9cb894ccdb170bacb3055f0bc2706f65c3764ef105cca49b64"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BindingError: ClassTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 3 blocks, lines 10340-11342. The bar is 400 significant lines; this is 243 over it, 1.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":10340}}}],"partialFingerprints":{"codehealthFindingId/v1":"876cc3cf175e35cdcc3c7d1bd0524cfd6d7a74f4b0e016556c1c4f7a9ba9871e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class/typed_dict.rs: FileTooLong \u2014 803 significant 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 303 over it, 1.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class/typed_dict.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41666877ad87215498ce4ca83be6f9312735c6d6d77c4da1845a58a98b79aee1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/suppression.rs: FileTooLong \u2014 802 significant 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 302 over it, 1.60\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/ruff_linter/src/suppression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0432a083124803b31333e9e8026ea04fb0429d1a016673af48e02179d41d80e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Diagnostic: 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":"crates/ruff_db/src/diagnostic/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fb3c3dd028f6d3e1c3eb9e1a07b8b1c713590d67453d5ebfe657b2412bb4b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NarrowingConstraintsBuilder: 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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"6461d5acc2fc027d2465cbfbec468416ebf103613ed6359f2d13c001a179de02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnittestAssert.generate_assert: MethodTooLong \u2014 generate_assert runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb06042cecf4444cd4010168e80824b9bfca81bb2c32f0b519ca2614361a0eec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/format.rs: FileTooLong \u2014 798 significant 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 298 over it, 1.60\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/ruff/src/commands/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34bdeb77fe7e4edb813100782a74d47f75b7a2c0a6fef166beb77a0796c71fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::linter::check_path: FunctionTooLong \u2014 ruff_linter::linter::check_path runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/linter.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f63eb080cd1ee4be4d0ab95a6117036f4cf2042f37f6d03165ec6b20092e398"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_and_check_argument_types: MethodTooLong \u2014 infer_and_check_argument_types runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":6060}}}],"partialFingerprints":{"codehealthFindingId/v1":"f755d866b922abcf4574d50c99e81ddff8148c767788083e9de2a5ddf1e59215"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::isort::normalize::normalize_imports: FunctionTooLong \u2014 ruff_linter::rules::isort::normalize::normalize_imports 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":"crates/ruff_linter/src/rules/isort/normalize.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"22858c6df5818024933858b6aaa594374af29b75527e0fddf62493f1f2acfbb3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VariableLengthTuple: ClassTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 45 methods, 4 blocks, lines 1127-2365. The bar is 400 significant lines; this is 230 over it, 1.58\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"949f849ca982622c7fd8e8066e6a32de358aba6685e15d8b67589200c86f9f86"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BinaryLike.flatten: MethodTooLong \u2014 flatten runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/expression/binary_like.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aa5dad1f34dbf9fda00018ea780544e0ced5c02b17305fb73fdaf4a924682a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: constraints/paths.rs: FileTooLong \u2014 784 significant 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: PathAssignments (3 blocks, 58-1212). The bar is 500 significant lines; this is 284 over it, 1.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e87c5f4b57b74e62ac770f54bd0cb3dfb51771e3e7c99b1a8e0af3e2b08607"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_workspace::configuration::warn_about_deprecated_top_level_lint_options: FunctionTooLong \u2014 ruff_workspace::configuration::warn_about_deprecated_top_level_lint_options 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":"crates/ruff_workspace/src/configuration.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"918df2ae9cdc9b81ad52fd76a33216ecd90b5ba58e2c997ca91b8e1f72d72913"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: string/docstring.rs: FileTooLong \u2014 779 significant 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 279 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/string/docstring.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fd1de65acbdfefb3d50426b74fd01b3fe851d68ffcc10efb65fc29207dd4b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/relation_error.rs: FileTooLong \u2014 777 significant 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: ErrorContext (2 blocks, 71-709). The bar is 500 significant lines; this is 277 over it, 1.55\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/ty_python_semantic/src/types/relation_error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2ac6c5f552b9d2f951b15e81f75f9fa941fe6325ab281396a238da423c6c73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InnerIntersectionBuilder.add_positive: MethodTooLong \u2014 add_positive runs 155 significant 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 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f95eddd5408664d7549cc2a91f41b31d652752bf5330ced708099c37ae34b6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/method.rs: FileTooLong \u2014 772 significant 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 272 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ee6875814998b144ae27eb8f8d278e84bd62ab64ff31f16e2ffd8d22272922"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CheckCommand: TooManyFields \u2014 46 stored fields beside 1 method. The bar is 30 stored fields; this is 16 over it, 1.53\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/ruff/src/args.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfa0f052700a7d39322345f6a8312f813578a6c949ccaf826de8d0bc74eda22"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SemanticModel.resolve_load: MethodTooLong \u2014 resolve_load 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/ruff_python_semantic/src/model.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fee2eca1cf97ca042915eee094b104237eadca1e56452580d44ac91a2d86b1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GotoTarget: ClassTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 3 blocks, lines 33-1376. The bar is 400 significant lines; this is 209 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":"crates/ty_ide/src/goto.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffec72b513a487bdd14ddb08ee4d677db70d9feb058482573f0c54621ee37a8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SpecialFormType: ClassTooLong \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), 16 methods, 5 blocks, lines 33-1126. The bar is 400 significant lines; this is 208 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":"crates/ty_python_semantic/src/types/special_form.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d897a1c8eb29a0cc3a9abb1c411c5a936cdb01f8402b22a286b84d872755305d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expression/mod.rs: FileTooLong \u2014 760 significant 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 260 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":"crates/ruff_python_formatter/src/expression/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5078d0e7403615c9208443a310d40e1bea37d1fa05906af5dc55155ca607d951"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UvMetadata.dependency_metadata: MethodTooLong \u2014 dependency_metadata 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":"crates/ty_project/src/uv/metadata/dependencies.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59d064752b03f8018f047335ba46dbd8b4fc2d89093d3130a640d81b8cd7129"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IsortOptions.try_into_settings: MethodTooLong \u2014 try_into_settings 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":"crates/ruff_workspace/src/options.rs"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cf81cd801469709ede16f86aac688af2c1f64b2b1f9faa09249011b1cea790"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mro.ancestors_of_static_class: MethodTooLong \u2014 ancestors_of_static_class 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":"crates/ty_python_semantic/src/types/mro.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a7741d662db142000637f81839c5c9d633151bd46d9b4c6aa186152366d8cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/bound_super.rs: FileTooLong \u2014 751 significant 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 60% of them inside a single declaration: BoundSuperType (3 blocks, 383-1022). The bar is 500 significant lines; this is 251 over it, 1.50\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/bound_super.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"138c51469865edd15a397f747b9dd1961d41a9c002b52a4c3debf01bde7829b6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VariableLengthTuple: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"16eed32a49a2a73ac94fa9236351b779a5ace0d388d9c1e7d7cfaa38833c4f98"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::pycodestyle::rules::compound_statements::compound_statements: FunctionTooLong \u2014 ruff_linter::rules::pycodestyle::rules::compound_statements::compound_statements 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":"crates/ruff_linter/src/rules/pycodestyle/rules/compound_statements.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7891bd321e70d71f89524efc5740589fc79f826a7a01217a66ee45d570a1a9c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LintCommonOptions: TooManyFields \u2014 45 stored fields. The bar is 30 stored fields; this is 15 over it, 1.50\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_workspace/src/options.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"7068b599df78d34b20dcc6800974cdb646a8df6f7fa3d555de9d437b020b6d3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_python_parser::parser::recovery::pattern_to_expr: FunctionTooLong \u2014 ruff_python_parser::parser::recovery::pattern_to_expr runs 149 significant 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 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/parser/recovery.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8691143d491e25b1353647559dca8eef6b482310031518d42d5d7ced3aef50e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainLoop.main_loop: MethodTooLong \u2014 main_loop 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":"crates/ty/src/lib.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fc88169262b34f36d2b8e40e4cc12785ffd7e0a5657d9b9c9c648ce50a8031"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.validate_subscript_deletion_impl: MethodTooLong \u2014 validate_subscript_deletion_impl 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":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b871edab522bfb2814fe774f424763f27986c90929905fa79bb27ef9876768"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::typed_dict::extract_unpacked_typed_dict_from_value_type: FunctionTooLong \u2014 ty_python_semantic::types::typed_dict::extract_unpacked_typed_dict_from_value_type 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":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e2b7d7c8047d1defc6a96c0f35a7f0ab69d75d0fcf8e4dd0e75bc90e15b7dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/special_form.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 83% of them inside a single declaration: SpecialFormType (5 blocks, 33-1126). 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":"crates/ty_python_semantic/src/types/special_form.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b799af94e1946237a9b8fa2e2f8747cf4f1cc7e12ec7fa24ba65effeeaeacf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticIndex: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/lib.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"15775171bb0e8b8b66c642271c5f73e796c5b2984f8d973eab9a76d50fa61884"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClassLiteral: TooManyMethods \u2014 44 methods, declared across 3 files: types/class.rs (42), types/display.rs (1), types/enums.rs (1). The bar is 30 methods; this is 14 over it, 1.47\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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"133b9620b875d52d007346d99215afae42e9b2d14f571b47bb7bb5b77385cb51"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LintConfiguration: TooManyFields \u2014 44 stored fields beside 3 methods. 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/ruff_workspace/src/configuration.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b70f921e02bff526742b24bd2082c5771f5a46128694d6d491905040dc4f776"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SemanticTokenVisitor.visit_stmt: MethodTooLong \u2014 visit_stmt 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":"crates/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d23ec418c3d4dcaeea838a1a3fe3010bb08e354fb44efa16f272f2aab49a368"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/semantic_model.rs: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: SemanticModel (2 blocks, 49-926). The bar is 500 significant lines; this is 228 over it, 1.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":"crates/ty_python_semantic/src/semantic_model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad73ea56a3855fca76393c040b46fac8cdb419d32e4b657c31b4b61b8847314"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/place_load.rs: FileTooLong \u2014 725 significant 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 225 over it, 1.45\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/ty_python_semantic/src/place_load.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f022063e25c7f60d5f67c3fdeb302a4fefd67a6557b7f906920506c487d7be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefinitionNodeRef.into_owned: MethodTooLong \u2014 into_owned runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/definition.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"c797d3ccdef38762817e6f7f19758cf79d1b4311c2f7d04eee803da1a1c753cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssignmentAttributeWriteEvaluator.report: MethodTooLong \u2014 report runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c00f27e276c4055bb187b93b4204049cf30696c79a66e57fb9606c6781f4c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_function_body: MethodTooLong \u2014 infer_function_body runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0731bab257959be99506675c364b963d37102b6b2931bf4fd9478148934ba980"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analyze/typing.rs: FileTooLong \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), declaring 36 free functions. The bar is 500 significant lines; this is 224 over it, 1.45\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/ruff_python_semantic/src/analyze/typing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19809bfe807ad0df3fef4d11ac1bac784f9a063f57282d9ea982132ce4ddc20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/cyclic.rs: FileTooLong \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). The bar is 500 significant lines; this is 224 over it, 1.45\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/ty_python_semantic/src/types/cyclic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4eb200059582c06b4cb2217ad58e78bb010a3661677ecf86575230a4165cdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/mod.rs: FileTooLong \u2014 722 significant 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 222 over it, 1.44\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/ruff_linter/src/settings/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6b8aa94c9b7cf8325fb2e18e2a6220ea823c4fd810338b7f6470ac0bc3daee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlankLinesChecker.check_line: MethodTooLong \u2014 check_line 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":"crates/ruff_linter/src/rules/pycodestyle/rules/blank_lines.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"511cbfad2d71cf2fa3704555a01541c823b073c28073aadba530b277b8721bcb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallableBinding.report_diagnostics: MethodTooLong \u2014 report_diagnostics 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4813}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3630da6ff32471a675434b2eb696475e5cc96b352225154010019f1e2b00b3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Binding: TooManyMethods \u2014 43 methods, declared across 2 files: call/bind.rs (38), bind/constructor.rs (5). The bar is 30 methods; this is 13 over it, 1.43\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8629}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ee5f87fad66fdaaa80b4e1085479373b9fc708065ae9c793ecdafd2a1785c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/visitor.rs: FileTooLong \u2014 715 significant 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 215 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d5607d9e1793dff0c5d83843c64909254a639723a02760d3d7c44231c4eb02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_bandit::rules::suspicious_imports::suspicious_imports: FunctionTooLong \u2014 ruff_linter::rules::flake8_bandit::rules::suspicious_imports::suspicious_imports 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":"crates/ruff_linter/src/rules/flake8_bandit/rules/suspicious_imports.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"937f30f58465cb13957bb64173daeb42c59111a440cc804ee59f51f892efad7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rules/sections.rs: FileTooLong \u2014 713 significant 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 213 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cede5eef8c9500d696a74194ed173b7ae6bfb647d54a86967d853acabf837ff7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::airflow::rules::runtime_value_in_dag_or_task::find_runtime_varying_call: FunctionTooLong \u2014 ruff_linter::rules::airflow::rules::runtime_value_in_dag_or_task::find_runtime_varying_call 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":"crates/ruff_linter/src/rules/airflow/rules/runtime_value_in_dag_or_task.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e927a679d3a8ad6c0af4919dd2bc2b38e3134535e6c234f99632ad9a9dd20e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticClassLiteral.own_fields_inner: MethodTooLong \u2014 own_fields_inner 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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":2823}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d04dfc2ffedcab63b563c9de7ed73c9a4bab077f6fdeda3188916b5a23258a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/subscript.rs: FileTooLong \u2014 706 significant 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 206 over it, 1.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/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f187d951bb17e47e41f776d17dc2cc634775b37adef3bb17020e324d94d78d87"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::airflow::rules::suggested_to_update_3_0::check_name: FunctionTooLong \u2014 ruff_linter::rules::airflow::rules::suggested_to_update_3_0::check_name runs 141 significant 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 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad9274815ee7023dd6db65bd7f0ecd2562392cb3ca8a946c76eb00379e22bc4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.try_call_dunder_get_on_attribute: MethodTooLong \u2014 try_call_dunder_get_on_attribute runs 141 significant 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 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":5389}}}],"partialFingerprints":{"codehealthFindingId/v1":"db139edcfb5edc66eb973c82384a23257a5d55d6519bb875922a3cd68c2d7bf1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: overrides/attributes.rs: FileTooLong \u2014 704 significant 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 204 over it, 1.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/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dec3e6a24e3ec138831b6d572ed6e35764e5939da7cde38ca7cda3b8f93b0d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SemanticIndexBuilder: TooManyFields \u2014 42 stored fields beside 127 methods. The bar is 30 stored fields; this is 12 over it, 1.40\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/ty_python_core/src/builder.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dceecc544978b817b761c777f7ffa7fc9676e8f6d09f72799cf46bc4d02617f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UseDefMap: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/use_def.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f0072834a8d57d000f80fb44c84f12b67285b0cab96ef941c0d66ae211184e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff::diagnostics::lint_path: FunctionTooLong \u2014 ruff::diagnostics::lint_path 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":"crates/ruff/src/diagnostics.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"28df4c804340729801c0fc4d910a23e3a33c6aef8124511384b2ababb7563a14"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpecializationBuilder.common_typed_dict_protocol_constraints: MethodTooLong \u2014 common_typed_dict_protocol_constraints 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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c195becacf1f1abc40e07c82f53f3e6a2422a75b791fd1cde2754be56139d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostic/mod.rs: FileTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 197 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_db/src/diagnostic/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe613114c003941da1122e24ee447e927477454989df3d6354fe0eac67dcfd9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResolvedClientCapabilities.new: MethodTooLong \u2014 new 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":"crates/ty_server/src/capabilities.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d6df27442a2b5311911e0df61ed93611c57db9313af651ae5c9b4d6ab8fa2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuffSettingsIndex.new: MethodTooLong \u2014 new 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":"crates/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"239313cfa56cd6f65fb012b23bd4ed9bbd71bca4d316d2684259761824dab346"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseDefMapBuilder.finish: MethodTooLong \u2014 finish 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":"crates/ty_python_core/src/use_def.rs"},"region":{"startLine":3328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9f3835c73037f6dbbe4c471c75d96e13cd43c1d556a9bd170f37071d8a756f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.to_meta_type_with_recursion: MethodTooLong \u2014 to_meta_type_with_recursion 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":9464}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0e086183ad78bd9f35bb258d70dafd4169334f5dbf3cfa69055843f4f3bcec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeRelationChecker.check_protocol_member_read: MethodTooLong \u2014 check_protocol_member_read 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":"crates/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a55345a752218ef6ec697628261250d06db3a46f760ebab7a5b489d8277148"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionType: ClassTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 56 methods, 3 blocks, lines 1214-2172. The bar is 400 significant lines; this is 149 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/ty_python_semantic/src/types/function.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fd897f12e02cee093836298c28f5e9b86366470afbec8647d70d94a367b567"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::perflint::rules::manual_list_comprehension::manual_list_comprehension: FunctionTooLong \u2014 ruff_linter::rules::perflint::rules::manual_list_comprehension::manual_list_comprehension 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/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"669e11c531cdf1aebb2176e108127075c1abd3a7877fb14ae1d56377e2fcfcc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::fixes::fix_all: FunctionTooLong \u2014 ty_python_semantic::fixes::fix_all 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/ty_python_semantic/src/fixes.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1906f642c1f0040f1046a5877ec74411adacf2413df1d83b232a4d1bc249f115"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PatternSuccessAnalyzer: 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/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7330717de65d7457a891bad15739fee97a8c150b2bd4411112fe9e98a31e61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_parameters: MethodTooLong \u2014 parse_parameters 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/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":3326}}}],"partialFingerprints":{"codehealthFindingId/v1":"587c508fad08200abd0544348aedd6f0137fe6b15afc464213f4265f07d27d5d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolVisitor.visit_stmt_impl: MethodTooLong \u2014 visit_stmt_impl 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/ty_ide/src/symbols.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb262bbbc23dba8964ec7aabf172e0089c15c96065f9622f3b0fc310070f0a4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SemanticModel: ClassTooLong \u2014 542 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 2 blocks, lines 49-926. The bar is 400 significant lines; this is 142 over it, 1.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/semantic_model.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b21ee7d094eb93791ef7fb7fb188c1a86d2554d8899f2249165ecd9b0471deb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArgumentTypeChecker: ClassTooLong \u2014 542 significant 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, 4 blocks, lines 5772-8340. The bar is 400 significant lines; this is 142 over it, 1.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":5772}}}],"partialFingerprints":{"codehealthFindingId/v1":"57123d971e1736f22fa128be701fd42e965db3a3346734ef45ccfabb30d31d81"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parameters: ClassTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 40 methods, 4 blocks, lines 5051-6004. The bar is 400 significant lines; this is 140 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae00f32ffa7cde59c2202dc25bd03aa33d8f52165ccad422e081134a9988b69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_simplify::rules::needless_bool::needless_bool: FunctionTooLong \u2014 ruff_linter::rules::flake8_simplify::rules::needless_bool::needless_bool 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":"crates/ruff_linter/src/rules/flake8_simplify/rules/needless_bool.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5146b0283033e8e9814fd8e402d7740674dae65b516efb72a60b40803e832a06"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff::commands::analyze_graph::analyze_graph: FunctionTooLong \u2014 ruff::commands::analyze_graph::analyze_graph 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/ruff/src/commands/analyze_graph.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d1115e32256d73695cf2f0a7631ff90d82d413f266895366552cfa0daf0472"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassType.into_callable_with_receiver: MethodTooLong \u2014 into_callable_with_receiver 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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9b4948ae4d8ceee8c9308184cea833291471946405fee6cd860c6429ee23cc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parameters: TooManyMethods \u2014 40 methods, declared across 2 files: types/signatures.rs (39), types/display.rs (1). The bar is 30 methods; this is 10 over it, 1.33\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bb6b1c8408533146db8b0d6f5ebb2ac53f47a47ff1de81e30642fc35eaf2bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::diagnostic::report_incompatible_method_override: FunctionTooLong \u2014 ty_python_semantic::types::diagnostic::report_incompatible_method_override runs 133 significant 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 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62ead1b08375b7303639b70979ed2abf6c48120f32be5054caed741f7a7c5ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenericContext.remove_callable_only_typevars: MethodTooLong \u2014 remove_callable_only_typevars runs 133 significant 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 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"d901754071a5b1058d04d37fbf2586780206324b1086f06b5cc4b9dca180c8fd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DisplayRepresentation: ClassTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 3 blocks, lines 1161-1841. The bar is 400 significant lines; this is 131 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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aecdec45e64c3445884620bb08f48a3543d611e2b1c7a44b5ae549a2f2eafc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::pycodestyle::rules::literal_comparisons::literal_comparisons: FunctionTooLong \u2014 ruff_linter::rules::pycodestyle::rules::literal_comparisons::literal_comparisons 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/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1f7db4cdf6e298e9d796648a63611df470d8145ec5cb3f39208a042e1d7dc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::place::place_from_bindings_impl: FunctionTooLong \u2014 ty_python_semantic::place::place_from_bindings_impl 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/ty_python_semantic/src/place.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ff07415445b8d7f5ac55b2f5181c75defd567a12d324450faa8dc62038a3e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.canonical_module: MethodTooLong \u2014 canonical_module 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/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d955594760302296ea24d18073dd49c62475cc3cf4853d98dc3503ae7bd2a49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_tuple_type_expression: MethodTooLong \u2014 infer_tuple_type_expression 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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb94a290df89fea907360661f4e8b2faa274ca30b045a88d6df16565d2611a8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flake8_comprehensions/fixes.rs: FileTooLong \u2014 659 significant 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 159 over it, 1.32\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/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"253049240c612080282f85b8bf41db7c7203c6cb9e454e5c53cdf76acc2817d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/type_alias.rs: FileTooLong \u2014 659 significant 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 159 over it, 1.32\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/ty_python_semantic/src/types/type_alias.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d3d61e36a499da2f9a7ab9207d4da15a82ba57b0a2d2272da70fc8e913f18e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::instance::protocol_materialization_is_noop_with_type_parameters: FunctionTooLong \u2014 ty_python_semantic::types::instance::protocol_materialization_is_noop_with_type_parameters 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":"crates/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"55929b90aa6d1c571b8bcd9a28486d17eab024ec2e7964981b274ef8cb22667e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Generator: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_codegen/src/generator.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"879fe4d5f67014583d39687293ee19169b34fc341aba385bac237b667bb81337"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parameter: TooManyMethods \u2014 39 methods, declared across 2 files: types/signatures.rs (38), types/display.rs (1). The bar is 30 methods; this is 9 over it, 1.30\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":6046}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3bcf3c01f65aba849515ac98abfbe4e5cb3b583190f44d130c7d5418248512"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builders.rs: FileTooLong \u2014 649 significant 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 31 free functions. The bar is 500 significant lines; this is 149 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/ruff_formatter/src/builders.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d832433ed842ebfc9f2752af2340a9e150c3845b0744069b9547a5ace3bb5c6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 649 significant 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 63% of them inside a single declaration: Project (2 blocks, 67-874). The bar is 500 significant lines; this is 149 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_project/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79536756aad45198015a4eef3ced1ec2b30126d293638cd676424b293a7b40b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: statement/stmt_assign.rs: FileTooLong \u2014 647 significant 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 147 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/statement/stmt_assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f4d320bb82b853b13dc44cce4402e39ed832bd5d0fabb0803f46f5c778eac4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rules/check_docstring.rs: FileTooLong \u2014 645 significant 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 145 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be01dd6e268b0bd365c28183884636cf08d53a7768ebb70b88088c7ba0551579"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_impl: MethodTooLong \u2014 parse_impl 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/mdtest/src/parser.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"da00cd5035ee11a6b88c53e589f6510fbe546e5e34e0201d5d570461ab2c528b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticClassLiteral.implicit_attribute_impl: MethodTooLong \u2014 implicit_attribute_impl 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/ty_python_semantic/src/types/class/implicit_attributes.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09929a14033c1211cb637aa13759691b71b7cee5ca3f78a820fbdbd8b3b8666"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_annotated_assignment_statement: MethodTooLong \u2014 infer_annotated_assignment_statement 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4488}}}],"partialFingerprints":{"codehealthFindingId/v1":"686a08375229860e7e3c80377e5952f6af7463bebce1e1d335c964887ce7d7f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::infer::builder::post_inference::typed_dict::validate_typed_dict_openness: FunctionTooLong \u2014 ty_python_semantic::types::infer::builder::post_inference::typed_dict::validate_typed_dict_openness 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/ty_python_semantic/src/types/infer/builder/post_inference/typed_dict.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc95cb391c94ecdd141d74039f430592b4da694a371a8f838e561e05cff7525"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: call/arguments.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 144 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/arguments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bdee0760fc99c9a3a729e3b27ba6086f51e3be338c61988c3c2b79ef81f42b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff::diagnostics::lint_stdin: FunctionTooLong \u2014 ruff::diagnostics::lint_stdin 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":"crates/ruff/src/diagnostics.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"1307521d0a3719c5ae650e64d85850842cce2b36d733d5036e18c87dd6f8f5fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::perflint::rules::manual_dict_comprehension::manual_dict_comprehension: FunctionTooLong \u2014 ruff_linter::rules::perflint::rules::manual_dict_comprehension::manual_dict_comprehension 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":"crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f172f92f0afe76e199781d45cabcfc1806a57c7b574259db1ee2e26224b271"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InteriorNode.abstract_inner: MethodTooLong \u2014 abstract_inner 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":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":4598}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d31c301d590f339ccd17a6f62be0fb04afd1a86d3b0d39abb22b6c05926aa1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/format_dev.rs: FileTooLong \u2014 638 significant 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 138 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":"crates/ruff_dev/src/format_dev.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7946dd292e478b83c0064e0a6c369203e640c36b66ce1c3177221d11333850f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 637 significant 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 137 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/mdtest/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0629d11bb260f4290f2ade14350edfaa7f307e72cbf2a0c9a1856d73fe38da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeRelationChecker.check_known_bound_method_pair: MethodTooLong \u2014 check_known_bound_method_pair 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":"crates/ty_python_semantic/src/types/method.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"171fb7aa537b4fe38356759ebd522f7b86c207702302595bd04d006e94379c02"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticModel: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/semantic_model.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2150ea33a925ce66ecbda930d9d7b8980ec76c60785c1ccf34b668d8d7199fae"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CallableBinding: TooManyMethods \u2014 38 methods, declared across 2 files: call/bind.rs (36), bind/constructor.rs (2). The bar is 30 methods; this is 8 over it, 1.27\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3505}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b91f731514f2942c216ef5ff4417e63de6d8c55d6dbdab216dcb3f0f8eb536f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/transformer.rs: FileTooLong \u2014 633 significant 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 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/ruff_python_ast/src/visitor/transformer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6844c8469e2ebe6b4d881606f8df337d23cb7484684ccac07599e03dfa4427f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NodeId: 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), 26 methods, 5 blocks, lines 2194-3062. 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":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":2178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a886002f184d15bbb264c5c7c6e00df1cdef51ac8470b1bc98fe04fde296543b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/callable.rs: FileTooLong \u2014 630 significant 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 130 over it, 1.26\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/ty_python_semantic/src/types/callable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"506b7b43e3fdf4f3cbbd8b161fc7dc695d021356e4ec8e5f75e31a8220b0df83"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubscriptErrorKind.report_diagnostic: MethodTooLong \u2014 report_diagnostic 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":"crates/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e03c96aa4b877adcb777a6bbf01638f053a182fa4799024ba11b82f397a3d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolve/search.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/ty_module_resolver/src/resolve/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3c39ee1951b293921d61737683bc6b7fe062d3f7755ac0b80e155718c28a6b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DunderAllNamesCollector.visit_stmt: MethodTooLong \u2014 visit_stmt 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":"crates/ty_python_semantic/src/dunder_all.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3e955946b8db4601023cb763419eeceb0f0438322a69864288ab1cc47eeed2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallInference.infer_legacy: MethodTooLong \u2014 infer_legacy 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6970}}}],"partialFingerprints":{"codehealthFindingId/v1":"749743fe730739b34e35b5586535092a1cd44d7a50af317ab0eaa43c7026b980"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnionBuilder.push_type: MethodTooLong \u2014 push_type 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":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"89335769fc70333f05689d7c8003d5f4c7bfa29f2c009cd524d665df4865c57e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ErrorContext: ClassTooLong \u2014 499 significant 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, 2 blocks, lines 71-709. The bar is 400 significant lines; this is 99 over it, 1.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/relation_error.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4019a42bcbfbbfe84396a50ae3750a2cae544a888949b55d884649025f5539"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Workspace: ClassTooLong \u2014 497 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 2 blocks, lines 110-822. The bar is 400 significant lines; this is 97 over it, 1.24\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/ty_wasm/src/lib.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e165433ec31f9a0f8953e94ea71e3d7a2da02d38f4277a7c4e9cecb3899c6e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceMap.splice_lines: MethodTooLong \u2014 splice_lines 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":"crates/ruff_annotate_snippets/src/renderer/source_map.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa57367815a4daadae34cde1bb7c5361cde7b8e8ba0d9bb9fa469f04b1180a8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_pytest_style::rules::parametrize::check_names: FunctionTooLong \u2014 ruff_linter::rules::flake8_pytest_style::rules::parametrize::check_names 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":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e679ec5309e71e285cb268b89d7f9e9d7610428130c7234eb9d66179e8fd6a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.check_module: MethodTooLong \u2014 check_module 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"225dff6cfafbadaf1971a6be98e0bee8fe072bf796838b652e524e6c03a4169e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeRelationChecker.check_callable_signature_pair_inner: MethodTooLong \u2014 check_callable_signature_pair_inner 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":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":2706}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf7e37dc45602b119bbb769071fe3036455955e4b71fb052a7ac3473f0d59ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_server::server::api::request: FunctionTooLong \u2014 ty_server::server::api::request 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":"crates/ty_server/src/server/api.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5498a504529a93374f40972e0357b08b7a415bd3175aadfd5768dda9625e73c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/visitor.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/ruff_python_ast/src/visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79365bce59c8166f2edb60d208486c96bd623cd105d73a1e3e64c28424292022"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SymbolVisitor: ClassTooLong \u2014 494 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 3 blocks, lines 694-1618. The bar is 400 significant lines; this is 94 over it, 1.24\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/ty_ide/src/symbols.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d3125c25d3dc344d2dff1438b300d2d77a5383661bd6c80b29ceb0d1fd17a1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Project: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_project/src/lib.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa8190fde6e5ee1668ec1478fec1eec3740a619d8afb11b7fb0a1c6baf15fa8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AtomicConstraint: TooManyMethods \u2014 37 methods, declared across 2 files: constraints/variables.rs (19), constraints/sequents.rs (18). The bar is 30 methods; this is 7 over it, 1.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/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e0f8636881c85ffad645c92ecc52f2830dccad51da224e1ebb9bee1f646991"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GenericContext: ClassTooLong \u2014 493 significant 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 354-1149. The bar is 400 significant lines; this is 93 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"9288a3145271be27d77f5f8611181d9360b08e0404868eebd0c248b35029c158"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/types.rs: FileTooLong \u2014 616 significant 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 116 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/settings/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad31c789c602f4b6dd0cbb00e74c8784a1e411333f7ce41bf1bbcd996c8c535e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/references.rs: FileTooLong \u2014 615 significant 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 115 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/references.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a7e3c4b3d81b944123af10d293f6310d16b56a1bf8fda5e2fab95fea4db57a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_dev::generate_rules_table::generate_table: FunctionTooLong \u2014 ruff_dev::generate_rules_table::generate_table 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":"crates/ruff_dev/src/generate_rules_table.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e1543a3b3ef85be9d7ff8b6c6a6cad967a005419316f137568a24521186986"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_type_checking::rules::typing_only_runtime_import::typing_only_runtime_import: FunctionTooLong \u2014 ruff_linter::rules::flake8_type_checking::rules::typing_only_runtime_import::typing_only_runtime_import 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":"crates/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"9304f76e05da6a6d2ee9e90457e6850d70835230401f74b190acb77d40102feb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallableBinding.filter_overloads_using_any_or_unknown: MethodTooLong \u2014 filter_overloads_using_any_or_unknown 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3d0a8663c9f1d2fc398706a8ee2afbe81666942037eb0dedf266e677a288ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.name: MethodTooLong \u2014 name 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a247f798ef3e9a0e7b105e1daf60fb7ee066d2a34016b6dbf24555f20dd59c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.try_from_file_and_name: MethodTooLong \u2014 try_from_file_and_name 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e1ff1d8dfd5205aac5100d04d83c24294b142cb1bc50eac220c562d8de7b41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DisplayUnionType.fmt_detailed: MethodTooLong \u2014 fmt_detailed 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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"929e8f0f8935dcecb4c9a3affb2995eb2cf51a42593e3086d036f8e9e332c965"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpecialFormType.candidates_from_name: MethodTooLong \u2014 candidates_from_name 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":"crates/ty_python_semantic/src/types/special_form.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b94b53c95c1a0775fc06c83e4fb52f4391ccf847c81e8e3dfbd3002ecf21609"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 614 significant 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 114 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5af207bf93526a04978aa8e4c4a91c049e7ba3a658a65c9a83bf29bfd9c9f89"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::checkers::tokens::check_tokens: FunctionTooLong \u2014 ruff_linter::checkers::tokens::check_tokens runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/tokens.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44201ebd08229a77956fa9b6b54b957f5ac48094afd47af038ca5c4f572216d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InvalidTypeExpression.reason: MethodTooLong \u2014 reason runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":12271}}}],"partialFingerprints":{"codehealthFindingId/v1":"33145a52c16c3cc7e90ae2c3e2ae9d8e7903982d593de5cc701e94d765e7de5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_assignment_definition_impl: MethodTooLong \u2014 infer_assignment_definition_impl runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":3617}}}],"partialFingerprints":{"codehealthFindingId/v1":"0930fc4e9bb4ebdee96e8547f7960c78f25a438a2c03764add4edbc3e807b901"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_pie::rules::multiple_starts_ends_with::multiple_starts_ends_with: FunctionTooLong \u2014 ruff_linter::rules::flake8_pie::rules::multiple_starts_ends_with::multiple_starts_ends_with 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/ruff_linter/src/rules/flake8_pie/rules/multiple_starts_ends_with.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"953b536c5546b36eb14e64ed4fc11c86f4eda33d25ff9ec4598297ada2498313"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.apply_type_mapping_impl: MethodTooLong \u2014 apply_type_mapping_impl 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/ty_python_semantic/src/types.rs"},"region":{"startLine":9931}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb8d88c5c0f85eae7765c4a5564f06232bef8c2c06b57cc782764b10ac22049"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::diagnostic::report_overridden_final_method: FunctionTooLong \u2014 ty_python_semantic::types::diagnostic::report_overridden_final_method 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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5540}}}],"partialFingerprints":{"codehealthFindingId/v1":"20700f01dc14db9b84c67a5d0f4f263f67e7a5e244182bfd76e1a95d656d7963"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssignmentAttributeWriteEvaluator.evaluate_instance: MethodTooLong \u2014 evaluate_instance 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/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"b136990c5c2d0f93f61c3f514ce321b1eec48b647f81c681a05a7a738600b409"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Printer: ClassTooLong \u2014 482 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 2 blocks, lines 35-855. The bar is 400 significant lines; this is 82 over it, 1.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":"crates/ruff_formatter/src/printer/mod.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"946a4f10c0ca88809240d5516beed7de1bf01e070a5a420ead3b570fa568e699"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/known_instance.rs: FileTooLong \u2014 601 significant 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 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/known_instance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8c72b9d978de6ca96907a5c2838d87c0fd9b1b9050faafb22493a85ed90c08"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GenericContext: TooManyMethods \u2014 36 methods, declared across 2 files: types/generics.rs (34), types/display.rs (2). The bar is 30 methods; this is 6 over it, 1.20\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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"061fb10ee5dcd30467f716bbc35c88484d25b171e4b7b2eef03c5ab3a414a447"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SpecializationBuilder: 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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c61b8d0126e92f6a2b223491e9620759ff18015d4d950f9691e513e659c698a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.has_known_type_metaclass: MethodTooLong \u2014 has_known_type_metaclass 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7437768f2311879a585d951e1b9b91cb42dcf5d99168b50e22e416c3454d537c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.bool: MethodTooLong \u2014 bool 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d30463ade6a8436d79cd03b7b14571eb1a5af864b0efdf688ad604c5824637"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.is_enum_subclass_with_members: MethodTooLong \u2014 is_enum_subclass_with_members 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9085975c705cc1adfac421bf5ae40c52b1df74fcedf1538009aa73576d2228"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.is_protocol: MethodTooLong \u2014 is_protocol 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39826bb0f054b74c2e2f6829bde87d95da0930fcf332ede9a3d344c936b2b06"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.is_fallback_class: MethodTooLong \u2014 is_fallback_class 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"79df8ae0f12b861dc89a30e861a516812cdcfff26ec3cb63e1c1916766b812ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.is_singleton: MethodTooLong \u2014 is_singleton 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba426b920fefb5dd1e0625ec8862f7c953aec76f53e35648dccc3b88224046b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PathAssignments.add_sequents: MethodTooLong \u2014 add_sequents 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":"crates/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"730a2e87830b3c8d2a86b0176e94d19c9c85701334f4526db8f8405b24ec9659"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.finish_inferred_definition: MethodTooLong \u2014 finish_inferred_definition 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":12463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73cd5447f0c04c5639d2fc3c20b3f67b1248847f626d75e8c2f87c9b0cec67a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_import_from_definition: MethodTooLong \u2014 infer_import_from_definition 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":"crates/ty_python_semantic/src/types/infer/builder/imports.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d6bce15c901a306fa2534d06ae8da353facc3fb8fb00265230557997943846"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/resolver.rs: FileTooLong \u2014 597 significant 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 97 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":"crates/ruff_workspace/src/resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"451b9b87a0c088e4d94e83b7ae9ef2cd72149d602b6c33dfcc494782ef61334b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.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":"crates/ty_python_core/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84388a3ae1dfb5b6ba6350ba18db382a13ca540e2e7d02e2cb9d0443ae95838c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.resolve_descriptor_access: MethodTooLong \u2014 resolve_descriptor_access 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":5727}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21a72492a55c9a230ba2ad3fb3ceb2fbd1960c4921066e6439c40132d8a83fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::attribute_write::attribute_write_requirement: FunctionTooLong \u2014 ty_python_semantic::types::attribute_write::attribute_write_requirement 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":"crates/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e6ec24d4ac2c67219079added0c579609e97570976f5ef32ae4ad6b3508497"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.is_typed_dict_subclass: MethodTooLong \u2014 is_typed_dict_subclass 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f67f7c5564d26d7749a525c836c530c2cc1b8fed015dbbfacd7dbd945fda8b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnownClass.is_tuple_subclass: MethodTooLong \u2014 is_tuple_subclass 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":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09b1c886f757345ff1aa71f621882a5e71e2cce9a96709e7c51946b19812b01"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InstanceDictionary.for_known_class: MethodTooLong \u2014 for_known_class 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":"crates/ty_python_semantic/src/types/class/slots.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4177a75aecb887b95ce22153710c57f84aa4e0061e92f79d350de41749a6bae6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_enum_call_expression: MethodTooLong \u2014 infer_enum_call_expression 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":"crates/ty_python_semantic/src/types/infer/builder/enum_call.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"266ed2e2d97509d97c05c6dcf60dcd9e782ee712e660f529b06ffa9208aefbff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/db.rs: FileTooLong \u2014 593 significant 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 93 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":"crates/ty_project/src/db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af32d62e7c62ed24d840aa4d8a1526f40a7f3d43bced8b885b400af6270cafc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/enum_call.rs: FileTooLong \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), about 71% of them inside a single declaration: TypeInferenceBuilder (294-913). The bar is 500 significant lines; this is 91 over it, 1.18\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/ty_python_semantic/src/types/infer/builder/enum_call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed9b948094381f75a05511a9cdc1db7a942729eb77bbca0c0d8b059df579a9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/list_members.rs: FileTooLong \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). The bar is 500 significant lines; this is 91 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":"crates/ty_python_semantic/src/types/list_members.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4861b8a5a31c39dd3b73cbecb8d6680d0426ea997d5ad115a11de2bacd8f2279"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::pyflakes::rules::redefined_while_unused::redefined_while_unused: FunctionTooLong \u2014 ruff_linter::rules::pyflakes::rules::redefined_while_unused::redefined_while_unused 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":"crates/ruff_linter/src/rules/pyflakes/rules/redefined_while_unused.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f364872cef25f61edd45396406a70fd2633f531d3f4598204cdc8fa2b828ffa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticClassLiteral.try_metaclass: MethodTooLong \u2014 try_metaclass 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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd18e2b62557e3caf55252135dd9690acb755deff9b4bff7d27a262c646e019a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 468 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 184 methods, 4 blocks, lines 61-995. The bar is 400 significant lines; this is 68 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ed5fa06b4554c0ccf1281b685845af0cbe0596f43343fe83c18f3b89acf91f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostic/render.rs: FileTooLong \u2014 585 significant 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 85 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_db/src/diagnostic/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e9adb95365356158c024345c8f4a2b7ec76d8387e6d9a9644b6720cd5b76b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::reachability::analyze_single_pattern_predicate_kind: FunctionTooLong \u2014 ty_python_semantic::reachability::analyze_single_pattern_predicate_kind 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":"crates/ty_python_semantic/src/reachability.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f48e60f269a76733855bab10701632b30f50ac11109618dc419b48fe27e573b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UnionBuilder: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 2 blocks, lines 659-1500. The bar is 400 significant lines; this is 67 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":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"484af51b68551b5dcd7f4d5f278df3518d91779ce24b41e9d70591a142f11604"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConstraintSetStorage: TooManyMethods \u2014 35 methods, declared across 2 files: types/constraints.rs (34), constraints/sequents.rs (1). The bar is 30 methods; this is 5 over it, 1.17\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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7d7b95746bdb0836bb123061e91056e925024b9ab4570eda3e421b7b5fe563"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::pyflakes::rules::unused_import::unused_import: FunctionTooLong \u2014 ruff_linter::rules::pyflakes::rules::unused_import::unused_import 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":"crates/ruff_linter/src/rules/pyflakes/rules/unused_import.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c009ff4f78d327fb198fdcc50f366e499260f61e6de065bab7b931c4d8168e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_ide::hover::hover: FunctionTooLong \u2014 ty_ide::hover::hover 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":"crates/ty_ide/src/hover.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fbb128e2ede39f3777eedd348bc2afb9a734343cff8aff4f3295ea364abb17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_subclass_of_type_expression: MethodTooLong \u2014 infer_subclass_of_type_expression 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":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"2059f69275f05034a1d98755a1db9d463dd67768643c299ccd7d0b9497c98942"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tokenizer.rs: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_trivia/src/tokenizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69ecd4dbeab23adc973e64e2fb2b9b6ce6ef380211819334c566603a49cdc75"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/member.rs: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/member.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8f047b60197ad7514a4d38f18d9d9b3e8b3090dee8abd74255ee91239a5c73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NarrowingProjector.project: MethodTooLong \u2014 project 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":"crates/ty_python_semantic/src/reachability.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e60c59acbcf636dbd3990a4349337e3a69cc1fdb5a414887e75c17481fdb981"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::suppression::unused::check_unused_suppressions: FunctionTooLong \u2014 ty_python_semantic::suppression::unused::check_unused_suppressions 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":"crates/ty_python_semantic/src/suppression/unused.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f917a02d022061d849f31fb699425035b78c51951af536652b0f7d93a12484c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::dedicated::pydantic::lax_input_type_impl: FunctionTooLong \u2014 ty_python_semantic::types::dedicated::pydantic::lax_input_type_impl 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":"crates/ty_python_semantic/src/types/dedicated/pydantic.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9ebe14ce198bbd9887744c8ca409f568d7771638e4f6ebe51b0636a2dbfac6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_typealiastype_assignment_deferred: MethodTooLong \u2014 infer_typealiastype_assignment_deferred 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4311}}}],"partialFingerprints":{"codehealthFindingId/v1":"024fbddcc4a59aa5703a1a067d345607cb3ae27967a8b57373efd86ac9358153"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Configuration: ClassTooLong \u2014 458 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 2 blocks, lines 175-724. The bar is 400 significant lines; this is 58 over it, 1.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_workspace/src/configuration.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd06470ea0afb1a43370271af1fe41ae6c4918b54ef179b48830eccf5ae0755"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expression/binary_like.rs: FileTooLong \u2014 571 significant 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 71 over it, 1.14\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/ruff_python_formatter/src/expression/binary_like.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"140831696a2d64fcb72a2f33fd940f63357de50994c3dd4f0ce0d5ec0f888b4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: string/normalize.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). The bar is 500 significant lines; this is 70 over it, 1.14\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/ruff_python_formatter/src/string/normalize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53d2b429f9363326f4231394f616db2494c1e7514c1c71645a5364614f29d77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_comprehension_in_call: FunctionTooLong \u2014 ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_comprehension_in_call runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa16d446b2b56d1a27ae3e97fcde44ddd071da5497cd9dfafb0298bdfc7e6b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatParameters.fmt_fields: MethodTooLong \u2014 fmt_fields runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/other/parameters.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66f730dfe868ef8eebfed712d30cc4e80c60f0d741abbaa5b7461ac04883d24"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AbstractMethods.annotate_diagnostic: MethodTooLong \u2014 annotate_diagnostic runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/abstract_methods.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5de38a059a94bfcb1677de160c036491168dbaa789f414e97b9f933ad1badd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::infer::builder::paramspec_validation::validate_paramspec_components: FunctionTooLong \u2014 ty_python_semantic::types::infer::builder::paramspec_validation::validate_paramspec_components runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/paramspec_validation.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce03714c390c4428d4543f441f419a7ea798a8fc85949b6514c63711ee5fb69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Unpacker.unpack_inner: MethodTooLong \u2014 unpack_inner runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/unpacker.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a812fea40bb91b9d4bb79c3f226adb3c3e7e284c94e233282579c0c30da3a09"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UnionType: ClassTooLong \u2014 455 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 2 blocks, lines 26-744. The bar is 400 significant lines; this is 55 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c983917345d7658e8f91f3a3da48d7b434c570ee70da0c29da686f3c91a09752"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeVarInstance: ClassTooLong \u2014 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 4 blocks, lines 203-2538. The bar is 400 significant lines; this is 54 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"967d887fe22db5a37ac3ca4287d154df28afac9e435a4f008953121209e885d9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BoundSuperType: ClassTooLong \u2014 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 3 blocks, lines 383-1022. The bar is 400 significant lines; this is 54 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/bound_super.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f99f816f47d1e0711a90085eb1a88fbd5de997c1cc7bf1343b87986a9c75324"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: ruff_python_ast::visitor::source_order: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/visitor/source_order.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb0db83a5e7b055168d145910d4196817483e82cebdf3aa6859a65f0f4b101c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CallableType: TooManyMethods \u2014 34 methods, declared across 2 files: types/callable.rs (33), types/display.rs (1). The bar is 30 methods; this is 4 over it, 1.13\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/ty_python_semantic/src/types/callable.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ccc99b9ad0e14f80f3e83eb4c797a4ed8cee128833707e63129114e8b3cd53"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConstraintSet: TooManyMethods \u2014 34 methods, declared across 2 files: types/constraints.rs (31), constraints/projection.rs (3). The bar is 30 methods; this is 4 over it, 1.13\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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"be59e23ca5f691d6e14cd3ea9123295c98993ec185c625660b7517abd33ec529"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff::commands::format::format: FunctionTooLong \u2014 ruff::commands::format::format 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/ruff/src/commands/format.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f109bf7182bb44c34b1e41b1dca1e9654e8e43895856c575f48fe1fc779cec0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoopMutationsVisitor.visit_stmt: MethodTooLong \u2014 visit_stmt 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/ruff_linter/src/rules/flake8_bugbear/rules/loop_iterator_mutation.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"426955ec1e1eab0c3da71225ab159c9be8d0060a01be09f549f48c5168238250"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::pyupgrade::rules::super_call_with_parameters::super_call_with_parameters: FunctionTooLong \u2014 ruff_linter::rules::pyupgrade::rules::super_call_with_parameters::super_call_with_parameters 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/ruff_linter/src/rules/pyupgrade/rules/super_call_with_parameters.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73e7dfda9e4deb6161ab638ac69246f8d699ca249de0c5afc6224f0406ceff1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeRelationChecker.check_target_union: MethodTooLong \u2014 check_target_union 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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f00af94e21e220fa8ae0d4749fb83f2b10a0b321688a0db03c5560ddff4d5e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallableSignature.apply_type_mapping_impl: MethodTooLong \u2014 apply_type_mapping_impl 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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"47279d7515ba03901c596694ca7ddd6474aef557188052d84d83615d147d1683"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/token.rs: FileTooLong \u2014 562 significant 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 62 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/token.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb921663d8b1325fcc971dfa87b7cd82f8959037f903a65423626d6d93d753a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rules/numpy_2_0_deprecation.rs: FileTooLong \u2014 561 significant 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 61 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27592dbf451d67a88d5118c332cbfe0ed18a056a094b050334d950294fd7354d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: suspicious_conditions/mod.rs: FileTooLong \u2014 560 significant 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: TypeInferenceBuilder (386-1179). The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baddf1c5d9bd7bf2d3104d7148cc4a386ce54688ab4c8fbbbf394172c24b3385"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MroLookup.instance_member: MethodTooLong \u2014 instance_member 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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":3131}}}],"partialFingerprints":{"codehealthFindingId/v1":"db71dee4e18072fcf85af7d1b56461cb0534a0990d7bc4aef560adcac78f752c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticClassLiteral.own_class_member: MethodTooLong \u2014 own_class_member 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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75a7b76431197a5d570a7ef2afd5c479867a4bf413e6d7029afbb9fee2ce4fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticClassLiteral.variance_equation: MethodTooLong \u2014 variance_equation 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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"983e3495b9a8880e2ef0f6d378c34e20191077b34c2ac295ad2dcc58bb7af351"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_subscript_expression_types: MethodTooLong \u2014 infer_subscript_expression_types 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":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"5637fdc7fe45c50e4ae9964f72f8b14e24e037acdacd483d3012b4c51ad2271e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_pyi::rules::unnecessary_type_union::unnecessary_type_union: FunctionTooLong \u2014 ruff_linter::rules::flake8_pyi::rules::unnecessary_type_union::unnecessary_type_union 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":"crates/ruff_linter/src/rules/flake8_pyi/rules/unnecessary_type_union.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ac586ef4960098d797b45d8a3cf55fdfd52eaf33d04222d2572994dfd92a8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_mdtest::run_test: FunctionTooLong \u2014 ruff_mdtest::run_test 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":"crates/ruff_mdtest/src/lib.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2065cfdf2fe0e251184544dc70ac7aa543625feb858bcc1c211e2743d74e4e58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SolutionWalker.pending_candidate_solution: MethodTooLong \u2014 pending_candidate_solution 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":"crates/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77eefad31fc664d4c5e3aa8d8d3de96ea4341274f64de2002c570daf7739e6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/recursive.rs: FileTooLong \u2014 554 significant 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 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/recursive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1233c34569a0cb245908f571ebe5087e054fbc4d7fabe2ef0b07a5c30c66efe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_type_checking::rules::runtime_import_in_type_checking_block::runtime_import_in_type_checking_block: FunctionTooLong \u2014 ruff_linter::rules::flake8_type_checking::rules::runtime_import_in_type_checking_block::runtime_import_in_type_checking_block 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/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"41530cd9050a8c052e003f06550941b2e045eedbdaca13b0ca7fcf4d2b4d5605"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.try_call_dunder_get: MethodTooLong \u2014 try_call_dunder_get 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/ty_python_semantic/src/types.rs"},"region":{"startLine":5200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec406d86c679917616e1e340318c8b4c97ba75d0668a69492863a0af2fd5f1b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binding.argument_type_context: MethodTooLong \u2014 argument_type_context 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8996}}}],"partialFingerprints":{"codehealthFindingId/v1":"638a0c6c06565f916b6abd6b5f948d053642022ca35226cadc6d900b44ae137b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_region_definition: MethodTooLong \u2014 infer_region_definition 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59647388f8e8f08d7e3eb4f65a48594f99ff7fbfea732c4b245538738d14a87"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeRelationChecker.check_type_satisfies_protocol: MethodTooLong \u2014 check_type_satisfies_protocol 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/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2f75b98b679bfd49a8642831bab3726e8bb5784d4bf1cb6028472058b34260"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassInfoConstraint.generate_impl: MethodTooLong \u2014 generate_impl 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/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dc2c8042089a3d3aa8104c172826e6d67adeb8f60cd966c59fd93e498aead0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/path.rs: FileTooLong \u2014 549 significant 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 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_module_resolver/src/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"877cd7342d1d36d22658d78913ae463761252508438fe80f04462520c96f5d62"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff::commands::check::check: FunctionTooLong \u2014 ruff::commands::check::check runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/check.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"79688eb08cf25be4e55ad8a68995f55ff1dfa77f985df714512a8c2c53bbf1d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Diff.write: MethodTooLong \u2014 write runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_db/src/diagnostic/render/full.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c35405f5c1b8cc08f7030ee86026a86f25b3caa035c0e2fe8080c8e862576dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_dict_get::if_else_block_instead_of_dict_get: FunctionTooLong \u2014 ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_dict_get::if_else_block_instead_of_dict_get runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1086103186f4f303b6372dc0d6963a5dddd7e9ded5a26c22a9421641636ab5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_macros::map_codes::map_codes: FunctionTooLong \u2014 ruff_macros::map_codes::map_codes runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_macros/src/map_codes.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04ec814e0572b1df80fa1cc99645ce5d2e03f1a553748dfd6876888a7ad6d88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClauseHeader.visit: MethodTooLong \u2014 visit runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/statement/clause.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"422f69994820865c0f1523d65090e581872598c5051916b8a38363fd6ff74a6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_server::lint::to_lsp_diagnostic: FunctionTooLong \u2014 ruff_server::lint::to_lsp_diagnostic runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/lint.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8b71c8de27a23ec60f2a9fa8174a443a840beb3aeacb6cc06bcd563d1d932a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OverloadLiteral.raw_signature: MethodTooLong \u2014 raw_signature runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/function.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e05f4d6b19bf680cb254715570ef66d80165aa0fa14554a073c0ddf3e64a96"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::visitor::dynamic_content_impl: FunctionTooLong \u2014 ty_python_semantic::types::visitor::dynamic_content_impl runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/visitor.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f07fde4119951ba749bfaba4631cc6a0362062a7826f86f7171ee373deb3e7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArgumentMatcher: ClassTooLong \u2014 434 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 2 blocks, lines 5092-5770. The bar is 400 significant lines; this is 34 over it, 1.09\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":5092}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ec42e511fcebba3e86c8a702700f92a9ae0e1a4f571a3533bd6e216bf18641"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/source_map.rs: FileTooLong \u2014 541 significant 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: SourceMap (2 blocks, 11-600). The bar is 500 significant lines; this is 41 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/renderer/source_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"694201094c2a941dd67e446b7a98e13630cf87a9c569abd36275a4e7a6ab922e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_python_stdlib::typing::is_standard_library_generic: FunctionTooLong \u2014 ruff_python_stdlib::typing::is_standard_library_generic 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":"crates/ruff_python_stdlib/src/typing.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a904cbd5d589f3014d2d3f7972a47a3bdaa801e0b72e8598af67ebc55a16394"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LintOptions.from: MethodTooLong \u2014 from 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":"crates/ruff_workspace/src/options.rs"},"region":{"startLine":4474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de111e71a0aa30bf7ddaeeed15d49f8a5c7f978032f231e197c2af046994fbb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_typing_namedtuple_fields: MethodTooLong \u2014 infer_typing_namedtuple_fields 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":"crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"833af0e99692310119636eacd7b877db6c126b6dd537b0693237044ff91ef30e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_dev::generate_ty_cli_reference::generate_command: FunctionTooLong \u2014 ruff_dev::generate_ty_cli_reference::generate_command 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":"crates/ruff_dev/src/generate_ty_cli_reference.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe6df909337d0b4f5b5c4c666f0045d5bcd3ce146691c93981f82bc060f7e1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::pydoclint::rules::check_docstring::check_docstring: FunctionTooLong \u2014 ruff_linter::rules::pydoclint::rules::check_docstring::check_docstring 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":"crates/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d865209064a1ed2285a296188b7fc2686a52f13ca7fb0b161e99fb2eb3e40b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::pylint::rules::unnecessary_lambda::unnecessary_lambda: FunctionTooLong \u2014 ruff_linter::rules::pylint::rules::unnecessary_lambda::unnecessary_lambda 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":"crates/ruff_linter/src/rules/pylint/rules/unnecessary_lambda.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"45db2fa7eab72770ace86b0c31b8c483dbd8cee7ba60380094d03eedead20553"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::visitor::may_contain_typevar_from: FunctionTooLong \u2014 ty_python_semantic::types::visitor::may_contain_typevar_from 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":"crates/ty_python_semantic/src/types/visitor.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c369874d99f48f633d4827e7ccdcf8b66e25adee299b562abf9d908662aa999"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lexer: 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":"crates/ruff_python_parser/src/lexer.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e676cca0331cfbfcec02c70b2bf76582258eb1d3d5bed391b9b072822237d210"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/typed_dict.rs: FileTooLong \u2014 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), about 92% of them inside a single declaration: TypeInferenceBuilder (68-852). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cba094023d7783b10cf4d0609ff62502c7910a2f37ef0c79cf31e300161e1fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/mro.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 32 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":"crates/ty_python_semantic/src/types/mro.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1dbe90be00901bd19f293d2dadf569e4ec4c3533fc7fe9c8b0e82c1b4b29e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/suppression.rs: FileTooLong \u2014 531 significant 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 31 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":"crates/ty_python_semantic/src/suppression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0724fba55a55a105b4ad0c665a6cda83bf402045f27df4710c0d41621824dfd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: statement/clause.rs: FileTooLong \u2014 530 significant 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 30 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":"crates/ruff_python_formatter/src/statement/clause.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"881e41f15c8081b5dc25c2e308e4dd2b438ecc6b4929ba3cb025233759378e9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/will_rename.rs: FileTooLong \u2014 530 significant 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 30 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":"crates/ty_ide/src/will_rename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af2c6afc027c96da9f67bdfca7b87581ff49c1c47d2a3395f77b589176f4b37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::airflow::rules::moved_in_3_1::check_name: FunctionTooLong \u2014 ruff_linter::rules::airflow::rules::moved_in_3_1::check_name 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/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cd70c47c9f5e86d29661a7100152b0675f893ec34b91e330a9f1cca1048939"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_map: FunctionTooLong \u2014 ruff_linter::rules::flake8_comprehensions::fixes::fix_unnecessary_map 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/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"10912f991250071377eb35e8fb12c08364cec8a5b0066f0642567ff59983ed46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rules/blank_lines.rs: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/blank_lines.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f8ada1cf26e8edda2c9912e9d90784338c8f9581ff76b6feb77ea578fd90bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceMap.annotated_lines: MethodTooLong \u2014 annotated_lines runs 105 significant 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 5 over it, 1.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":"crates/ruff_annotate_snippets/src/renderer/source_map.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74fad5ad4eed05e22c2975fc2e167e42a73076cde928329fddfef1c5f074791"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_python_formatter::verbatim::write_suppressed_statements: FunctionTooLong \u2014 ruff_python_formatter::verbatim::write_suppressed_statements runs 105 significant 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 5 over it, 1.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":"crates/ruff_python_formatter/src/verbatim.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"da38f3be349a9ffcad796e2e87cd2a8404a9f20bb6266194b649e0ff6776e127"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticClassLiteral.own_instance_member: MethodTooLong \u2014 own_instance_member runs 105 significant 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 5 over it, 1.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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5619de70204acc344dc2a90196a1c35667f32d6a48d88f604eb03c839795206e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_region_scope: MethodTooLong \u2014 infer_region_scope runs 105 significant 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 5 over it, 1.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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bc57591db2f5664f08d7168c01981a44f908e6603b7acbd108a27d353f9752"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_paramspec_explicit_specialization_value: MethodTooLong \u2014 infer_paramspec_explicit_specialization_value runs 105 significant 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 5 over it, 1.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":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fd4342fb74d0b5312a0c294a1bb11831fdfdea9248bb48b388d3a37e2cf9ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PatternSuccessAnalyzer.class_pattern_arguments_for_arm: MethodTooLong \u2014 class_pattern_arguments_for_arm runs 105 significant 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 5 over it, 1.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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3f0c42eac0f76ce77e9a0e9303f58c95e91e655e045274697b5a090e239ab7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InnerIntersectionBuilder.add_negative: MethodTooLong \u2014 add_negative runs 105 significant 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 5 over it, 1.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":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9b7ec7041a35e5bedbd49c687713ae2fe480683d97ece5ae18e80c81bfc74d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::pycodestyle::rules::logical_lines::extraneous_whitespace::extraneous_whitespace: FunctionTooLong \u2014 ruff_linter::rules::pycodestyle::rules::logical_lines::extraneous_whitespace::extraneous_whitespace 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":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed859ba60ee6652653f421fb418458d67da27f9b56779f4d880ebe1099e6090"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty::run_check: FunctionTooLong \u2014 ty::run_check 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":"crates/ty/src/lib.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec3838223714675476fda03bf05a18f13320261f4f8c6ae9cc4014f961295b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.recursive_type_normalized_impl: MethodTooLong \u2014 recursive_type_normalized_impl 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":3949}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6b20c05911ac01c1f7ffa859d91f0f91f92be4d8bb8077c8ec3629b82817cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::diagnostic::report_dynamic_function_decorator_return: FunctionTooLong \u2014 ty_python_semantic::types::diagnostic::report_dynamic_function_decorator_return 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":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9412bf43d8f84be87abba85ed9fd217c01eee9749f4371e26eae4878a1147d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.apply_decorator: MethodTooLong \u2014 apply_decorator 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":5777}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b73f6de0d0be2cfe1148b76bb694d05d9dfa7a33d2864456391f9fded7d6e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_lambda_expression: MethodTooLong \u2014 infer_lambda_expression 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":9191}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadad769306d451d56edb5f1c9143d6c4a8fef3563994c5c982599aec12829ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_new_class_call: MethodTooLong \u2014 infer_new_class_call 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":"crates/ty_python_semantic/src/types/infer/builder/new_class.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f84bf9be888753ef857a7e235a5e00984a1b8172f84ef59e75dffcee3266bb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bind/constructor.rs: FileTooLong \u2014 518 significant 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: ConstructorBinding (2 blocks, 50-731). The bar is 500 significant lines; this is 18 over it, 1.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":"crates/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d00c303e475ebdf60b0a047c4023d05f09cff1141dc9c92f26d66cbb6fadfa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: IsortOptions: TooManyFields \u2014 31 stored fields beside 1 method. The bar is 30 stored fields; this is 1 over it, 1.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/ruff_workspace/src/options.rs"},"region":{"startLine":2575}}}],"partialFingerprints":{"codehealthFindingId/v1":"9515a2443496f7dec2588f842a4ab3af284b915e9964707d74d3939dcee99459"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConstraintSet: ClassTooLong \u2014 413 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 34 methods, 3 blocks, lines 398-1033. The bar is 400 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc92370daa8d591394f8b5bd4af2c5bc233f77a9ec39b9e65eab3989515f5818"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CandidateSolutions: ClassTooLong \u2014 413 significant 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, 2 blocks, lines 3664-4409. The bar is 400 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":3664}}}],"partialFingerprints":{"codehealthFindingId/v1":"0222ea9ca652cf9a975ede2827a376e49f6ab3a70dec7fd5b9816dfaf3353ed1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IterationError: ClassTooLong \u2014 413 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 2 blocks, lines 620-1223. The bar is 400 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabfa9f7e3abf796bea93166a1b59186878a41ac8b5bfd882dfa14713e012c4a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LintConfiguration: 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), 3 methods, 2 blocks, lines 727-1308. 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":"crates/ruff_workspace/src/configuration.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"4769f5f6660ab90c1e7f81bfb5c0c1f9cb57845c1f32261e717c511ddf6ce6b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff::commands::format::warn_incompatible_formatter_settings: FunctionTooLong \u2014 ruff::commands::format::warn_incompatible_formatter_settings 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":"crates/ruff/src/commands/format.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6ddb261493f59fb79a3f55647071f0cec34f9af3bf3f6d8de456b0cb9d5c26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::checkers::logical_lines::check_logical_lines: FunctionTooLong \u2014 ruff_linter::checkers::logical_lines::check_logical_lines 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":"crates/ruff_linter/src/checkers/logical_lines.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae505816c977d5ab8656f9d4669d5f726ad19dfee84598b385509c47c4273eed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Workspace.check: MethodTooLong \u2014 check 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":"crates/ruff_wasm/src/lib.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5829feb5762d3343a49899d1c3da66c665e25768e8aaf0997e206aa823f3a5a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Configuration.from_options: MethodTooLong \u2014 from_options 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":"crates/ruff_workspace/src/configuration.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"64117d11d55f26106633a58610c8dbe91824b9917f4419b3208e0408c617b57c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LintConfiguration.from_options: MethodTooLong \u2014 from_options 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":"crates/ruff_workspace/src/configuration.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb10786c9394911d42af8076f1fafd139699c1fbf9bf28d04cdf359ed5726ef4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Options.to_program_settings: MethodTooLong \u2014 to_program_settings 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":"crates/ty_project/src/metadata/options.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8a68b91444194ca48bc339f9f7e38b6426d2d9c79869ac068c80b575aadd2e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProjectFilesWalker.collect_vec: MethodTooLong \u2014 collect_vec 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":"crates/ty_project/src/walk.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ee5c9cea7cd4dbf3f547493459efa1ce405f3523539a7310364f9bc80744bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.find_name_in_mro_with_policy: MethodTooLong \u2014 find_name_in_mro_with_policy 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":4292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4035c8daf553b490f5c4fb4158acb038ae549fda43b5e7b52f7d8372c6684a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.add_binding: MethodTooLong \u2014 add_binding 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f823cf99b2c94de1dd1b1067b5ab5891382623eb8fb2fad0d5de732aa54ec2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeInferenceBuilder.infer_augmented_op: MethodTooLong \u2014 infer_augmented_op 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":5201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f367150ebaed46797652813bd7c6558e2c5c72bbc6ff7668df9c7710e4177e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::infer::comparisons::infer_binary_intersection_type_comparison: FunctionTooLong \u2014 ty_python_semantic::types::infer::comparisons::infer_binary_intersection_type_comparison 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":"crates/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce15807ac723b9dd582ed44093ad774016058147cd51bdd3aa0609fdb01cbc3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rules/deprecated_import.rs: FileTooLong \u2014 512 significant 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 12 over it, 1.02\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/ruff_linter/src/rules/pyupgrade/rules/deprecated_import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec8e9a9959fa7d828298aecb1137485650a2857bdf3f7b499eecfe088bed14"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Project: ClassTooLong \u2014 409 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 37 methods, 2 blocks, lines 67-874. The bar is 400 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_project/src/lib.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6600b0f61ba2b0dbc6b17032eef4945ed1e615f1455d5394f941b2145cf79963"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Rule.lint_source: MethodTooLong \u2014 lint_source 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":"crates/ruff_linter/src/registry.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5de3fed895b0ac53b91921970361e6fdfc0d47cc1fcc010678da448e94d96fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruff_linter::rules::perflint::rules::manual_dict_comprehension::convert_to_dict_comprehension: FunctionTooLong \u2014 ruff_linter::rules::perflint::rules::manual_dict_comprehension::convert_to_dict_comprehension 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":"crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"925a72a64d1b8728ab7675033e24e325483eeb6f1c69a69ef9e61dd46c13c24c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SearchPaths.from_settings: MethodTooLong \u2014 from_settings 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":"crates/ty_module_resolver/src/resolve.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d207c4fe13a99ffbf56ed4bb39f7fff95f2c035fdfcab26ad67e3db123f201b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::place::place_by_id: FunctionTooLong \u2014 ty_python_semantic::place::place_by_id 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":"crates/ty_python_semantic/src/place.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e63ee642793b4fcd08d7451d6674074c5ea18eb6e7e37089d2cb666bf21348"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type.generator_types: MethodTooLong \u2014 generator_types 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":8860}}}],"partialFingerprints":{"codehealthFindingId/v1":"b100f439df6a67b93f827d8b8ecd069ecb7dac898ef2a5b7dd54c4e590d60dc2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConstructorBinding.instance_return_specialization: MethodTooLong \u2014 instance_return_specialization 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":"crates/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"e501c4b8861961cc6b9cb91f1597302f78cc38b84d681c05824fc7bb9d4bd3a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompletionRequestHandler.run_with_snapshot: MethodTooLong \u2014 run_with_snapshot 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":"crates/ty_server/src/server/api/requests/completion.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"741c4784cfd74f3d209ec9daeb1eaece0f0c9c5997db36a3d492bad30d5b3a0e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContextCursor: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 2 blocks, lines 886-1601. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/completion.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3515828f90b92f688ef7d21b259a77c972f5d02b2848707aefbc30c9ec359d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ty_python_semantic::types::class::typed_dict::synthesize_typed_dict_get: FunctionTooLong \u2014 ty_python_semantic::types::class::typed_dict::synthesize_typed_dict_get 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/ty_python_semantic/src/types/class/typed_dict.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"780d518d738b46e7ea8764a54aeba8c90b043645b5e2b13f81a3a206d0df6b4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Session.initialize_workspace_folder: MethodTooLong \u2014 initialize_workspace_folder 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/ty_server/src/session.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"308eacd8216a5e9a4d6cd9191bd7e6f92a62295ee0643069680327571d43e31f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/linter.rs: FileTooLong \u2014 503 significant 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 3 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/ruff_linter/src/linter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee536dd30cc6fbd756604cefaa2ec87695d88170c099c4bff33b30455f9b413"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConstructorBinding: ClassTooLong \u2014 402 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 2 blocks, lines 50-731. The bar is 400 significant lines; this is 2 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"884145bb07c5365d43ea5288e15e9a70c8bf1e1b693c26b34ece8e58ff4f5e1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/verbatim.rs: FileTooLong \u2014 502 significant 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 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/verbatim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d42181bc7bb988bf142555bc29d17d9e4875a4f64218454ba35d2ae7b76bdca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inlay_hints.rs: FileTooLong \u2014 501 significant 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 1 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/inlay_hints.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3c63f50452c230e0c60905e724e3cd89e7d5674ecbeadbdf888f21cc5ed1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 32 shared lines): crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs:50-97 | crates/ruff_linter/src/rules/pylint/rules/invalid_bytes_return.rs:50-96 | crates/ruff_linter/src/rules/pylint/rules/invalid_hash_return.rs:54-101 | crates/ruff_linter/src/rules/pylint/rules/invalid_index_return.rs:56-103 | crates/ruff_linter/src/rules/pylint/rules/invalid_length_return.rs:55-104 | crates/ruff_linter/src/rules/pylint/rules/invalid_str_return.rs:50-96 \u2014 These 6 members are variants of one another: a block of 32 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 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":"crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"992c8f6d458b6817a59664bffbe71668de098f59dde695444ca82cf30d1b628d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (239 shared lines): crates/ruff_python_ast/src/visitor.rs:362-631 | crates/ruff_python_ast/src/visitor/transformer.rs:349-627 \u2014 These two members are variants of one another: 239 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/ruff_python_ast/src/visitor.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4a032b8429755278af768c7cee2a800622a29618610dc05482f5e32df493a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (68 shared lines): crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:87-312 | crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:99-367 \u2014 These two members are variants of one another: 68 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/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"316d268b1ec00dad48a7ab988791ec20b8af7df65debc326d8ef0ab2e5449b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (58 shared lines): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs:71-161 | crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_set.rs:72-166 \u2014 These two members are variants of one another: 58 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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"64416541d7cd268a0d1248b407719cb6fc6fa92347c2bfbc6842e964026abda3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (58 shared lines): crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:522-638 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:806-893 \u2014 These two members are variants of one another: 58 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/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c31ccf22d36be1ca6d964bbc0e51ddfdfccad44c488fd2f108dbed991103ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): crates/ruff_server/src/server/schedule/thread/pool.rs:48-109 | crates/ty_server/src/server/schedule/thread/pool.rs:47-112 \u2014 These two members are variants of one another: 57 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/ruff_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e6a892a3860e6c2fda9e7463f97ba56e5623dfb5040c6e3a467e40c4863640"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (52 shared lines): crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:322-471 | crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:376-505 \u2014 These two members are variants of one another: 52 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/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ce24fea17122c96860b12bd80a593d8cc711458a89528f248ce688bd31d6cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:99-160 | crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs:125-182 \u2014 These two members are variants of one another: 33 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/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a4fe9a99dbcf75cbf0f111420ba856cd8a401a252df6e9f71dfa8390e82323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ty_python_semantic/src/types/constraints/paths.rs:1101-1121 | crates/ty_python_semantic/src/types/constraints/paths.rs:1131-1155 \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/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8566b65ce7ccabf3ccc774fff66f07552197ea769a64aa7c8e14b2830d3dcfca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruff_linter/src/rules/flake8_django/rules/all_with_model_form.rs:53-98 | crates/ruff_linter/src/rules/flake8_django/rules/exclude_with_model_form.rs:51-82 \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/ruff_linter/src/rules/flake8_django/rules/all_with_model_form.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27d1ba2cb49498479349bc9e3cab5c8c9fe0a1ac5b5e002ddd0e53fbb081829"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (13 members, 50\u002B identical tokens): crates/ty_server/src/server/api/requests/completion.rs:42-171 | crates/ty_server/src/server/api/requests/doc_highlights.rs:31-75 | crates/ty_server/src/server/api/requests/goto_declaration.rs:30-74 | crates/ty_server/src/server/api/requests/goto_definition.rs:31-75 | crates/ty_server/src/server/api/requests/goto_implementation.rs:30-74 | crates/ty_server/src/server/api/requests/goto_type_definition.rs:31-75 | crates/ty_server/src/server/api/requests/hover.rs:30-77 | crates/ty_server/src/server/api/requests/prepare_call_hierarchy.rs:39-74 | crates/ty_server/src/server/api/requests/prepare_rename.rs:30-63 | crates/ty_server/src/server/api/requests/prepare_type_hierarchy.rs:40-70 | crates/ty_server/src/server/api/requests/references.rs:31-66 | crates/ty_server/src/server/api/requests/rename.rs:32-74 | crates/ty_server/src/server/api/requests/signature_help.rs:33-150 \u2014 These 13 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 13 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 13 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api/requests/completion.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8d041610eea24b7e32329bd0ec440f46387340e3690e61037d224fce23cc1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): crates/ty_python_semantic/src/types.rs:9815-9886 | crates/ty_python_semantic/src/types.rs:10124-10409 | crates/ty_python_semantic/src/types.rs:10437-10776 | crates/ty_python_semantic/src/types/infer/comparisons.rs:84-550 | crates/ty_python_semantic/src/types/method.rs:426-468 | crates/ty_python_semantic/src/types/method.rs:477-534 | crates/ty_python_semantic/src/types/method.rs:537-566 | crates/ty_python_semantic/src/types/method.rs:878-1032 | crates/ty_python_semantic/src/types/relation.rs:323-395 \u2014 These 9 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 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":9815}}}],"partialFingerprints":{"codehealthFindingId/v1":"9006f86b92cb06662097fbf4b481be70486d7f684ff80827d545b0968c205026"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/ty_python_semantic/src/types/infer/builder.rs:5783-5921 | crates/ty_python_semantic/src/types/infer/builder.rs:11713-11939 | crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs:478-1214 | crates/ty_python_semantic/src/types/infer/comparisons.rs:84-550 | crates/ty_python_semantic/src/types/narrow.rs:5564-5614 | crates/ty_python_semantic/src/types/typed_dict.rs:1928-2121 \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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":5783}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efa6d5c5e379f4a32d502e681f5e7b6a72fe87a7a57919a0a370abb3a7b7cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs:110-273 | crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:112-1210 | crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:655-1106 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs:128-336 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs:190-396 \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":"crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a6f5939ca126befdb77a53a673a2803d4b11d2773d17289bca462f05890295"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/ty_python_semantic/src/types/infer/builder.rs:654-733 | crates/ty_python_semantic/src/types/infer/builder.rs:735-776 | crates/ty_python_semantic/src/types/infer/builder.rs:812-844 | crates/ty_python_semantic/src/types/infer/builder.rs:846-895 | crates/ty_python_semantic/src/types/infer/builder.rs:897-925 \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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae253b44e78705ce98c9a4168d27cb4df237bf4d6fbd3ce1771c6414cc6db881"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruff_linter/src/rules/flake8_pyi/rules/prefix_type_params.rs:64-112 | crates/ruff_linter/src/rules/pylint/rules/type_bivariance.rs:78-137 | crates/ruff_linter/src/rules/pylint/rules/type_name_incorrect_variance.rs:71-142 | crates/ruff_linter/src/rules/pylint/rules/type_param_name_mismatch.rs:63-132 \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/ruff_linter/src/rules/flake8_pyi/rules/prefix_type_params.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3391a30a99eea0e9821dafb8a0cde9b68ca308abc4811cf1c3e61b9d2dfecd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_getcwd.rs:71-109 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_makedirs.rs:71-162 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_mkdir.rs:72-138 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_symlink.rs:69-149 \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/ruff_linter/src/rules/flake8_use_pathlib/rules/os_getcwd.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59eb81425838c00c1c87b8fb93184fe07d9464273c2a33be87145a925cc8ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruff_python_ast/src/nodes.rs:1327-1334 | crates/ruff_python_ast/src/nodes.rs:1371-1378 | crates/ruff_python_ast/src/nodes.rs:1882-1889 | crates/ruff_python_ast/src/nodes.rs:2299-2306 \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/ruff_python_ast/src/nodes.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce73100ba92b2f21292fa6a265958903b2a2fc7d9502175691ff5a892e84c0da"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruff_server/src/server/api/requests/code_action.rs:193-226 | crates/ruff_server/src/server/api/requests/code_action.rs:228-261 | crates/ruff_server/src/server/api/requests/code_action.rs:263-296 | crates/ruff_server/src/server/api/requests/code_action.rs:298-331 \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/ruff_server/src/server/api/requests/code_action.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64dae2bc59029996790cb551e6dc87f9b8dbc8ee7e71e7da5f55f4204c8fee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ty_python_core/src/narrowing_constraints.rs:299-312 | crates/ty_python_core/src/narrowing_constraints.rs:366-379 | crates/ty_python_core/src/reachability_constraints.rs:433-448 | crates/ty_python_core/src/reachability_constraints.rs:514-529 \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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b59eb2c9880c33ea47b37efe019e8b76137d8e9d491e7112a3c1ffd999fd9c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ty_python_core/src/use_def.rs:2486-2510 | crates/ty_python_core/src/use_def.rs:2518-2542 | crates/ty_python_core/src/use_def.rs:2835-2884 | crates/ty_python_core/src/use_def.rs:2886-2906 \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/ty_python_core/src/use_def.rs"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"caca80714bf09a67df6bf43ea94f2de852a917d35ec8d0af3fb81cd5d36fdb7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ty_python_semantic/src/types/typevar.rs:1780-1792 | crates/ty_python_semantic/src/types/typevar.rs:1802-1814 | crates/ty_python_semantic/src/types/typevar.rs:1823-1835 | crates/ty_python_semantic/src/types/typevar.rs:2208-2220 \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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"732a7d238aeee885cfe2a8c900d5185a812786259508eb9d33e26fb532f1b208"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/ty_python_core/src/definition.rs:1032-1079 | crates/ty_python_core/src/definition.rs:1082-1134 \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/ty_python_core/src/definition.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"305ee6d9ccf2d9c9ed9456818e3d4e7d6c70dad3abee72aa5934bc6fc5430e9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (85 corresponding lines): crates/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs:72-156 | crates/ruff_linter/src/rules/flake8_async/rules/long_sleep_not_forever.rs:65-150 \u2014 These two members are one piece of code written twice and then edited apart: 85 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f27b0975b8a7558f0cebcaed8e55a4a814191159746aa7c5b5862418ccabe69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs:206-270 | crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/whitespace_around_keywords.rs:131-197 \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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"896c6bdd341648852df6dd4f738648367ed10e2ad4d95ec6920dd7817e4d895f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (85 corresponding lines): crates/ruff_linter/src/rules/flake8_use_pathlib/rules/builtin_open.rs:71-193 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_chmod.rs:72-156 \u2014 These two members are one piece of code written twice and then edited apart: 85 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/flake8_use_pathlib/rules/builtin_open.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea08df35cb2012862164f5ab2307e7fd7b791947248940c43544d74092c7546e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/ty_python_semantic/src/types/class/typed_dict.rs:273-324 | crates/ty_python_semantic/src/types/class/typed_dict.rs:332-377 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ty_python_semantic/src/types/class/typed_dict.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4fabaf6d55123933550c5f20a135be610ccbe7fcfdc88004e79efe25d6d25e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (85 corresponding lines): crates/ruff_linter/src/rules/refurb/rules/for_loop_set_mutations.rs:66-152 | crates/ruff_linter/src/rules/refurb/rules/for_loop_writes.rs:144-228 \u2014 These two members are one piece of code written twice and then edited apart: 85 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/refurb/rules/for_loop_set_mutations.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b4e2442d41b034995aa34dcd49e1c16264eb3d369f6087c6d27b03327c5105"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): crates/ruff_python_parser/src/string.rs:371-439 | crates/ruff_python_parser/src/string.rs:441-498 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/string.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"27784303aaa73c87a971d900cadf7876a39904df8093072a2b322d32885529aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/ty_python_core/src/reachability_constraints.rs:456-506 | crates/ty_python_core/src/reachability_constraints.rs:537-587 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/reachability_constraints.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6c7645bff4a20949cb4046e449c0f1d5be7a12738c725e300646fbf1a233a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): crates/ty_python_semantic/src/types/infer/builder.rs:3804-3884 | crates/ty_python_semantic/src/types/infer/builder.rs:4221-4308 \u2014 These two members are one piece of code written twice and then edited apart: 81 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":3804}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be69755caa72090e1d04684916644f4f5ba65ac65553e9205aa94de2afeda77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): crates/ruff_linter/src/fix/mod.rs:57-128 | crates/ty_python_semantic/src/fixes.rs:509-578 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/fix/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afd445ebc620109521155a3bb75532b9a1eac8a618dc87dd1ea0dfc3e3b13e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): crates/ty_python_semantic/src/types/constraints/variables.rs:220-296 | crates/ty_python_semantic/src/types/constraints/variables.rs:309-372 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b637b2001fa978422803da6f4f92cad8b12f59d52e3ffed40ac0f1ae8d2ee4f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/ruff_dev/src/generate_options.rs:23-73 | crates/ruff_dev/src/generate_ty_options.rs:66-116 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/generate_options.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20befde8d84cbeda94a1afd601e06d47fb34915a705e67339833ed2bed50b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:35-90 | crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:97-153 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1947ee1329e791e465d48404563347b5add30162f1baed3fe1ad6ccf992e1f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): crates/ruff_linter/src/rules/pylint/rules/too_many_arguments.rs:76-146 | crates/ruff_linter/src/rules/pylint/rules/too_many_positional_arguments.rs:77-150 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/pylint/rules/too_many_arguments.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59aa41218823e7cc459daa5d50c7b496b7bab83b4a89e69980ce8e91c6522ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): crates/ruff_linter/src/rules/mccabe/rules/function_is_too_complex.rs:79-165 | crates/ruff_linter/src/rules/pylint/helpers.rs:332-403 \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":"crates/ruff_linter/src/rules/mccabe/rules/function_is_too_complex.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fbd72edb36bc8a56a8c242ce4139f754ad20b93a045197de2901c5c3779f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): crates/ruff_linter/src/rules/flake8_pyi/rules/duplicate_literal_member.rs:61-119 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_nested_literal.rs:80-141 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pyi/rules/duplicate_literal_member.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"527673c8616e4836070b578783847f106866553078a509410ebe434d3acbada2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/ty_python_semantic/src/types/constraints/sequents.rs:1456-1503 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1732-1788 \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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a29b4eafe64b8a0a42792b03f553c2f43a1e37fc57dc0bea297344c1e2785b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): crates/ruff_python_formatter/src/other/arguments.rs:17-114 | crates/ruff_python_formatter/src/pattern/pattern_arguments.rs:13-72 \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/ruff_python_formatter/src/other/arguments.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bbcd93dddda8aea19cf5e29aad0a2cc3892763d3acc8eca6ba001fef6680c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): crates/ruff_python_formatter/src/statement/stmt_for.rs:31-94 | crates/ruff_python_formatter/src/statement/stmt_while.rs:15-70 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_python_formatter/src/statement/stmt_for.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2654ba667a2f854f46fcd8f0bf55f1b9ae84b7c99937a25d210e5e0f2a2425"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): crates/ruff_linter/src/rules/pydocstyle/rules/ends_with_period.rs:73-127 | crates/ruff_linter/src/rules/pydocstyle/rules/ends_with_punctuation.rs:67-121 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/pydocstyle/rules/ends_with_period.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2151efb0e6f7e74c664dff48b4371717cf64cd8f93739c4180f8607c1977310"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/ruff_linter/src/rules/airflow/helpers.rs:85-131 | crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs:758-804 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/airflow/helpers.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13685ded261d7f76b7b31acf2c8374f65494e35635a90a931a3e28b93aa49e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/ruff_dev/src/generate_ty_cli_reference.rs:22-69 | crates/ruff_dev/src/generate_ty_env_vars_reference.rs:19-87 \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/ruff_dev/src/generate_ty_cli_reference.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f96153a71553be6656ba7595d2c70aa7ae9b8666f25f03699f61415e12ebcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/ruff_server/src/logging.rs:17-69 | crates/ty_server/src/logging.rs:19-64 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_server/src/logging.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd49dbfef7bcd3bdda6a1bf67a934487e4e089b15445c6a273b4ae37bbbb7b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ty_python_semantic/src/types/constraints/sequents.rs:1571-1608 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1797-1834 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d08073b06ac0169c9cd4cf36fd132a4f42b3de55bd8ef99e685051f6b5632f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:151-191 | crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:199-239 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"819772795aea79050a340bff156829612cdd888e860979d93d97f74defa6b935"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs:595-650 | crates/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs:653-708 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee58acd5af4a65f8870036713f52fcb902ce2c41065d2866508e7f271aec658"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs:72-123 | crates/ruff_linter/src/rules/pylint/rules/singledispatchmethod_function.rs:62-109 \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/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c13374c62cf7e847241e1b0151559570a91f1c2b1deea4a02360be537a9bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/ruff_linter/src/rules/pylint/rules/unnecessary_dict_index_lookup.rs:72-112 | crates/ruff_linter/src/rules/pylint/rules/unnecessary_list_index_lookup.rs:75-114 \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":"crates/ruff_linter/src/rules/pylint/rules/unnecessary_dict_index_lookup.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f66a9bde8c7aa54e304c70faa07edcde0b6ab69162e49a75442bf0f23f7d3d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruff_server/src/server/api.rs:100-144 | crates/ty_server/src/server/api.rs:189-242 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddad9a7f78c0324c145f7d0f6232cb7c2d7c1eba87941179945a8e21f12b2e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/ty_python_semantic/src/types/diagnostic.rs:2512-2561 | crates/ty_python_semantic/src/types/diagnostic.rs:2651-2694 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6e1b0e30b3adfe5bf6abff06324b4cdbe6f3801325e901a5056a9ec0399f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/ty_python_semantic/src/types/infer/builder/post_inference/final_variable.rs:14-61 | crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs:1560-1617 \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/ty_python_semantic/src/types/infer/builder/post_inference/final_variable.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7292154e39cb5a5129bfbb5ffc4271c51a96cd53c05e2a4a5ba3d9ada28ac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ruff/src/commands/rule.rs:60-99 | crates/ruff_server/src/server/api/requests/hover.rs:113-150 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/rule.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7275ab578e1c90f65aea442f99bccd08a7a5ea54b4a70af6853b09bc795be1d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs:628-669 | crates/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs:681-732 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a9d4ffc5fcf7fa49c21183c5e4591e6a2a46d2bda9afeaa9d82ccc8b07a830"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/ruff_server/src/lib.rs:50-80 | crates/ty_server/src/lib.rs:29-74 \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":"crates/ruff_server/src/lib.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"df719549959cb59a939b3b9a9cbd1b505da83004aea501427ce2446c6d2e7447"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ty_python_semantic/src/types/class/typed_dict.rs:232-265 | crates/ty_python_semantic/src/types/class/typed_dict.rs:672-714 \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":"crates/ty_python_semantic/src/types/class/typed_dict.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4631f1275e79b78a7c057c5a4765f4c4b0fae2826961c9ae8275ce38fedfc460"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ruff_python_ast/src/helpers.rs:152-189 | crates/ruff_python_formatter/src/expression/mod.rs:1267-1305 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/helpers.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6338226fa09fb58423024d8cf42802483139ca8e3e3d09886ade4f977befedd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/ruff_server/src/edit/text_document.rs:89-132 | crates/ty_server/src/document/text_document.rs:98-141 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/edit/text_document.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd056821b0c9faba97abd718d67f75f98818bfa826bdcba6079ea8f8a8db63d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruff_linter/src/rules/flake8_pytest_style/rules/raises.rs:232-263 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/warns.rs:200-231 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/raises.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c865fd08b7e17497cc182163bed107b9646f03a10916caa0a471d5fe8a86475b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs:380-418 | crates/ruff_linter/src/rules/refurb/helpers.rs:15-50 | crates/ruff_linter/src/rules/refurb/rules/check_and_remove_from_set.rs:176-206 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"135091549d01cfdda9a1ffbf3ff3963c438c4a0cb76f93cc58e2525d275df19a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/ruff_server/src/server/api.rs:248-288 | crates/ty_server/src/server/api.rs:445-486 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_server/src/server/api.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0968fcdedf773f5788651dbbff20375d7a71721b22c47f018e2678f546be0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ruff_python_formatter/src/statement/stmt_global.rs:10-47 | crates/ruff_python_formatter/src/statement/stmt_nonlocal.rs:10-47 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/statement/stmt_global.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1cc328b614a281193b16d619a5dc032c00b1760d39441f883b1866df472122"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ty_server/src/server/api/requests/call_hierarchy_incoming_calls.rs:29-66 | crates/ty_server/src/server/api/requests/call_hierarchy_outgoing_calls.rs:29-62 \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":"crates/ty_server/src/server/api/requests/call_hierarchy_incoming_calls.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2f7d99467161b6870ade3c6f5a123ba9c8aaddf416883993b4d88ce3c0e607"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/ty_module_resolver/src/resolve.rs:584-633 | crates/ty_module_resolver/src/resolve.rs:653-687 \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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa75eb09880ffeb385fc983360ea8c801749a364836f71baaf4ac7db4bb66bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/ruff_linter/src/rules/flake8_use_pathlib/helpers.rs:60-103 | crates/ruff_linter/src/rules/flake8_use_pathlib/helpers.rs:155-196 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/flake8_use_pathlib/helpers.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"581b1e524b4ea096d27e5c6dccb50cf70f5376858295aa219d7fbd5d9afaa74b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs:264-289 | crates/ruff_linter/src/rules/pylint/rules/redefined_slots_in_subclass.rs:170-214 \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/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4014c535a3da32fc4eaa3b8c6b4a333735309f5aabf4327206086512dabccec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruff_python_literal/src/escape.rs:169-213 | crates/ruff_python_literal/src/escape.rs:517-561 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_literal/src/escape.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"28732f4eb39848c89c03672e057f36d23426ffb904ebf17fcfc76d16b8c9a484"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ty_python_semantic/src/types/constraints/variables.rs:1170-1198 | crates/ty_python_semantic/src/types/constraints/variables.rs:1323-1356 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9c0ef2e026aeec2dfd3701a61389e1717fe4def8b7f6b04cd164f42f082402"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/mdtest/src/lib.rs:475-506 | crates/ruff_linter/src/source_kind.rs:316-351 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mdtest/src/lib.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"045e7113c68d5da31dfb96ddb97ba664e994278f21e9ab7d248bc41340088c5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/ty_python_semantic/src/types/list_members.rs:37-86 | crates/ty_python_semantic/src/types/list_members.rs:93-144 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/list_members.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86e7beae3fba8b1f9d49fb56a7b8c34fca1a502efe129dc707b34c23cbf1618"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/ty_python_semantic/src/types/constraints/sequents.rs:2031-2054 | crates/ty_python_semantic/src/types/constraints/sequents.rs:2063-2091 | crates/ty_python_semantic/src/types/constraints/sequents.rs:2114-2142 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3501fc0ea8c1036543c6037d8f74bd612cd759a8cb81fb8aee6ca19065ddeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/ruff_python_formatter/src/comments/map.rs:75-106 | crates/ruff_python_formatter/src/comments/map.rs:112-143 | crates/ruff_python_formatter/src/comments/map.rs:149-178 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/comments/map.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a624d48ea59f04a38f67f289622b39effb51f4f44ff993f97ff9608ccaac73b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/ruff_linter/src/linter.rs:366-424 | crates/ruff_linter/src/linter.rs:435-482 \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/ruff_linter/src/linter.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ab3afefce7a59b90852526fcaeeee3186ba7717014be5cf6d97f8a2ec064a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/ty_python_semantic/src/types/constraints/sequents.rs:1637-1661 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1863-1885 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1982-2008 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52cdd89e3c7cf1191990f11812c3622f37dd56fba0ce3b83899fd76d8d6cb33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:124-152 | crates/ruff_linter/src/rules/refurb/rules/write_whole_file.rs:135-166 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"916e1c5f1349f70d54141d3e862acdac5d13dc1fba12f7049d7e3839cd97293c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ty_python_core/src/definition.rs:121-152 | crates/ty_python_core/src/definition.rs:157-184 \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":"crates/ty_python_core/src/definition.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf3005b5bc883675378e1c7a1f63792d08f3668865e22588aa5859c456cfae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/ruff_linter/src/suppression.rs:1313-1352 | crates/ty_python_semantic/src/suppression/parser.rs:90-126 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/suppression.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6eb550e2688853d6c42c7ff9f160ffa196a44963683b086fb9246195e3659c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 46\u002B corresponding lines): crates/ty_python_semantic/src/types/set_theoretic.rs:569-618 | crates/ty_python_semantic/src/types/set_theoretic.rs:625-681 | crates/ty_python_semantic/src/types/set_theoretic.rs:1378-1423 | crates/ty_python_semantic/src/types/set_theoretic.rs:1430-1483 | crates/ty_python_semantic/src/types/typevar.rs:2334-2385 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 46 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/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"b553d91cbe1b3722d0da39e5ecedaa5aa74caa448af41e4e13e4179908a8b671"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ruff_linter/src/rules/refurb/rules/slice_to_remove_prefix_or_suffix.rs:77-109 | crates/ruff_linter/src/rules/refurb/rules/slice_to_remove_prefix_or_suffix.rs:112-147 \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":"crates/ruff_linter/src/rules/refurb/rules/slice_to_remove_prefix_or_suffix.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4b171cb6857d5bba0ccfaa3e4b05225f3a10689f9622713145c3cf4101ab0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): crates/ty_python_semantic/src/types/relation.rs:638-679 | crates/ty_python_semantic/src/types/relation.rs:718-757 | crates/ty_python_semantic/src/types/relation.rs:1016-1050 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 35 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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d276fe1196bef6ca56849e82bbb6fff3fd802cba26ec3be0e88e382194e10a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/ruff_linter/src/rules/pyupgrade/rules/useless_class_metaclass_type.rs:53-89 | crates/ruff_linter/src/rules/pyupgrade/rules/useless_object_inheritance.rs:54-90 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyupgrade/rules/useless_class_metaclass_type.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b721c16981363f1d1e513fbfd093dff27efa821bfb7856fc6b8058c4878d075"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): crates/ty_python_semantic/src/types/class/known.rs:1247-1277 | crates/ty_python_semantic/src/types/set_theoretic.rs:145-163 | crates/ty_python_semantic/src/types/set_theoretic.rs:1165-1182 | crates/ty_python_semantic/src/types/set_theoretic.rs:1191-1209 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebde87f43a8e8ca2a1e1cb2e1cfceb064f6f9df4638a5ccfb74d90df7a2de71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/ruff_linter/src/suppression.rs:1069-1117 | crates/ty_python_semantic/src/suppression.rs:761-818 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/suppression.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb75bff648bcc91f48da47456ef4e11df5479bdf0f559da51819cae470df1e38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:163-188 | crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs:185-212 \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/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7293e4ada4c1740b6d67fd100fabda8c7f70d704249e0a5fcf161ab00af678e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruff_python_formatter/src/comments/format.rs:561-581 | crates/ruff_python_formatter/src/comments/format.rs:609-641 \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/ruff_python_formatter/src/comments/format.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf9274af4755d008c82ef5bfc7cfc14bd17884ed4009a13a75364e660160fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruff_linter/src/rules/flake8_simplify/rules/open_file_with_context_handler.rs:50-83 | crates/ruff_linter/src/rules/flake8_simplify/rules/open_file_with_context_handler.rs:87-112 \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/ruff_linter/src/rules/flake8_simplify/rules/open_file_with_context_handler.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaf04956377f561f94e207daba124b3fd79149993da7db7b15888aa845db4fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): crates/ruff_dev/src/generate_json_schema.rs:18-51 | crates/ruff_dev/src/generate_ty_rules.rs:28-58 | crates/ruff_dev/src/generate_ty_schema.rs:18-51 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/generate_json_schema.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ccb15110511ca7d246a81457b2c053e9ccbd861deaa9aab8c9ff7bce91c59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/ruff_server/src/server/api/requests/code_action.rs:130-160 | crates/ruff_server/src/server/api/requests/code_action.rs:162-191 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/requests/code_action.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c7b0cdf70762c2cc54807b3b5b7502678483bbafb360950fec436a9643734f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/ruff_linter/src/rules/pandas_vet/rules/call.rs:170-207 | crates/ruff_linter/src/rules/pandas_vet/rules/subscript.rs:149-185 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pandas_vet/rules/call.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ceba62eb9842bfe519961fd2f2195a7d191af9c933a7f5bd0197e43d357c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ruff_server/src/server.rs:384-419 | crates/ty_server/src/server.rs:212-245 \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":"crates/ruff_server/src/server.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"323e1da7a596119c7de7840a6ea8525e46308d87aa8bfdfec239c8ec1e770416"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ty_python_semantic/src/types/class.rs:2200-2231 | crates/ty_python_semantic/src/types/class.rs:2270-2296 \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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a12a948a5d2897e9891bd7a71abfddfe408cfac8fac75ae110f77f7d6297b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ty_python_semantic/src/types/relation.rs:3370-3396 | crates/ty_python_semantic/src/types/relation.rs:4812-4826 \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":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":3370}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e55ed8f5bcc35caf47d963e3311bf00d3a4b075984d32fe8de4498c8b15386"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/ty_ide/src/docstring/document/google.rs:249-289 | crates/ty_ide/src/docstring/document/numpy.rs:159-194 \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":"crates/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e515731e67138611da089b1798fb6524c50b804cc00d8386471a0d2b108d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ty_python_semantic/src/types/constraints/sequents.rs:1029-1055 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1125-1152 \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":"crates/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c8030e5cdcf28fb7a0693330d7b1f831bb80d751d468527caa20276c0ff23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruff_linter/src/rules/flake8_boolean_trap/rules/boolean_default_value_positional_argument.rs:119-150 | crates/ruff_linter/src/rules/flake8_boolean_trap/rules/boolean_type_hint_positional_argument.rs:118-160 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_boolean_trap/rules/boolean_default_value_positional_argument.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff9d0ff04e02d3a6ef453142b3c966a333fd10614087f2a8c957041aa2027a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ruff_linter/src/rules/refurb/helpers.rs:260-304 | crates/ruff_linter/src/rules/refurb/helpers.rs:312-349 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/helpers.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7dbab4ff5d504cf65aefd27ab5066d202458c1f135ceb66bc4368ea9ee8ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): crates/ty_python_semantic/src/types/infer/builder.rs:8715-8748 | crates/ty_python_semantic/src/types/infer/builder.rs:8754-8787 | crates/ty_python_semantic/src/types/infer/builder.rs:8793-8827 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":8715}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3aecf7a88aacca8aa4ecaa11971b8e891189b16369495bce1f6f22e42fb6ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/suppression_comment_visitor.rs:70-108 | crates/ruff_python_formatter/src/comments/visitor.rs:73-112 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/ruff/rules/suppression_comment_visitor.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"563f8f97100575c645f0d2a0f6a992a3e83bdeaaa9645f2d4e6ca370fcdb79b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (9 members, 28\u002B corresponding lines): crates/ty_python_semantic/src/types/constraints/sequents.rs:953-983 | crates/ty_python_semantic/src/types/constraints/sequents.rs:991-1021 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1160-1187 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1195-1222 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1230-1257 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1265-1292 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1300-1327 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1335-1362 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1370-1397 \u2014 These 9 members are one piece of code written 9 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 9 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d747e419f0ee9a1daaa54a3dfd3ae100c8ce2a6fe9a473fd1054f3c99b1694"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ruff_python_semantic/src/analyze/function_type.rs:85-118 | crates/ruff_python_semantic/src/analyze/function_type.rs:126-159 \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":"crates/ruff_python_semantic/src/analyze/function_type.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecec16de1189ea90a7d0c21eebb9b0c164e642bea7b37e88b09ff24443d2a8e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ty_python_semantic/src/types/infer/builder.rs:7739-7766 | crates/ty_python_semantic/src/types/infer/builder.rs:7768-7797 \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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":7739}}}],"partialFingerprints":{"codehealthFindingId/v1":"9392d469291eb82f4e79743991c988b04fe24dff575bd8c88df5bb31617f9916"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ty_python_semantic/src/types/signatures.rs:2362-2391 | crates/ty_python_semantic/src/types/signatures.rs:2400-2427 \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":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e146ea4dbaeb1a3e33e1694cd9c3dbc89744d6923dd9d9a91f271dec34e6b1e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:62-90 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs:58-86 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dec83817c3b4a0d373a7d0dced7a46b278e665e38c9a7101a96d70505e8300"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_python_semantic/src/types/display.rs:936-953 | crates/ty_python_semantic/src/types/display.rs:1064-1088 \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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f030e618ffaeda8a1a964aea35e08601d96c12697954cdf5a6e4efb45f0894"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/needless_else.rs:134-159 | crates/ruff_linter/src/rules/ruff/rules/useless_finally.rs:204-229 \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/ruff_linter/src/rules/ruff/rules/needless_else.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ef437b3a9339988892fc92cb36304afef2193d7658a721836c7bced9d04f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruff_linter/src/rules/flake8_bandit/rules/hardcoded_bind_all_interfaces.rs:42-73 | crates/ruff_linter/src/rules/flake8_bandit/rules/hardcoded_tmp_directory.rs:61-85 \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/ruff_linter/src/rules/flake8_bandit/rules/hardcoded_bind_all_interfaces.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce3643a158153ca6a7f51aacd8ed9d901c27c6208337687c943354e7b375f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruff_linter/src/rules/flake8_logging/rules/direct_logger_instantiation.rs:63-84 | crates/ruff_linter/src/rules/flake8_logging/rules/undocumented_warn.rs:54-74 \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/ruff_linter/src/rules/flake8_logging/rules/direct_logger_instantiation.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"31442b8a6fefce0016238942654d50c0e84d0864895743eef7c3ba82b5c5b41e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruff_linter/src/rules/flake8_type_checking/rules/empty_type_checking_block.rs:52-76 | crates/ruff_linter/src/rules/pyupgrade/rules/useless_metaclass_type.rs:53-74 \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/ruff_linter/src/rules/flake8_type_checking/rules/empty_type_checking_block.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e367b5f3a7c33754dee8f2ff8d3e8bdfc771ba76162f547b7c013f9ab45de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/needless_else.rs:174-203 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_if.rs:192-221 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/needless_else.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6804ded272805200934c02cdfbc2361f0fe8883916cf9ddf190f040f7972b0b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruff_linter/src/rules/pylint/rules/useless_import_alias.rs:72-103 | crates/ruff_linter/src/rules/pylint/rules/useless_import_alias.rs:111-145 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/useless_import_alias.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6802ae55223d72bf770571460f3c9b4cdd2777637ed22acd7311c2d4ad76594b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruff_python_formatter/src/comments/placement.rs:1321-1349 | crates/ruff_python_formatter/src/comments/placement.rs:1719-1751 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4250c6c4a83dd8972bac519fe90fc780e210c2c77dccd40d80ade2399bad0336"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/ty_python_semantic/src/types.rs:8544-8579 | crates/ty_python_semantic/src/types/infer/builder.rs:5967-6006 \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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":8544}}}],"partialFingerprints":{"codehealthFindingId/v1":"153a2fca71fda3a86abbf450b76cb964d7ab02e84705bca3409aabb11f4ea6c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_wasm/src/lib.rs:637-654 | crates/ty_wasm/src/lib.rs:661-681 \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":"crates/ty_wasm/src/lib.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"6981cb4a6164fa7f83216364c01854179afaa4c4e5fb59387c0fb0152665b263"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/mod.rs:301-332 | crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/mod.rs:334-366 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/mod.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b1306680279cd16a97cb545a9480537a0b61672a9fac8611d17f834652f663"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruff_db/src/diagnostic/render/grouped.rs:103-131 | crates/ruff_db/src/diagnostic/render/junit.rs:131-160 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_db/src/diagnostic/render/grouped.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"372a946b1be502114c5382ec0974ef643969817a59ab74c2b348a2af83f78612"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:1152-1177 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs:125-150 \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/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6589ad73bf606ff0bc93b26473ea64366ab81a7d0cd2e3cae9bf2509dd8aa135"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/ruff_linter/src/rules/flake8_async/rules/blocking_open_call.rs:74-113 | crates/ruff_linter/src/rules/ruff/rules/non_octal_permissions.rs:212-248 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_async/rules/blocking_open_call.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ec69d4ff4cc002feb21efa2441229ae15e9b4714c524930fcc6ee4527be5c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruff_linter/src/rules/flake8_bugbear/rules/map_without_explicit_strict.rs:65-84 | crates/ruff_linter/src/rules/flake8_bugbear/rules/zip_without_explicit_strict.rs:58-75 \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":"crates/ruff_linter/src/rules/flake8_bugbear/rules/map_without_explicit_strict.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afd68ef1fb1a3d71b4613249ef353c53fe3b79877096f6447e7066216c4629a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_dict.rs:57-78 | crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_list_comprehension_dict.rs:54-76 \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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_dict.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8387f104a7ecd7988d240a731d7ccd09daa587eac79e6772f87cfb1fc3247295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/ruff_python_formatter/src/expression/expr_generator.rs:37-78 | crates/ruff_python_formatter/src/expression/expr_set_comp.rs:12-42 \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":"crates/ruff_python_formatter/src/expression/expr_generator.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2399ba9b953034fc234cc8f2a1cec9f254fc47dd7b2036347ae53232b09b8b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruff_python_ast/src/nodes.rs:3445-3467 | crates/ruff_python_ast/src/nodes.rs:3505-3527 \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/ruff_python_ast/src/nodes.rs"},"region":{"startLine":3445}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1c259ef54e4d268ace89cde3fa683515f056db7beb7416da508cde34599136"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/ty_server/src/server/api/requests/semantic_tokens.rs:30-72 | crates/ty_server/src/server/api/requests/semantic_tokens_range.rs:30-65 \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":"crates/ty_server/src/server/api/requests/semantic_tokens.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a32dc3db2266e0e12c0ad91e7283684c4bfe30efef5161fc751919011d7935"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruff_linter/src/rules/pylint/rules/unnecessary_dict_index_lookup.rs:50-69 | crates/ruff_linter/src/rules/pylint/rules/unnecessary_list_index_lookup.rs:51-72 \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/ruff_linter/src/rules/pylint/rules/unnecessary_dict_index_lookup.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e8908c2e675b77d90af2d1ddd7cae20f73ca7475a4a19743d47d7c5819307b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/ruff_linter/src/rules/flake8_pyi/rules/unused_private_type_definition.rs:288-317 | crates/ruff_linter/src/rules/flake8_pyi/rules/unused_private_type_definition.rs:340-372 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pyi/rules/unused_private_type_definition.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ad49d2d34ed9034d1816a381ffcc859a259335cd7c19ebf2bc397dd448f595"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ty_ide/src/symbols.rs:1055-1087 | crates/ty_python_semantic/src/dunder_all.rs:123-158 \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":"crates/ty_ide/src/symbols.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fcc28a30b6d46dc142dc3cbd42bd8e6799997a4c2d33377416360e07b07ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruff_python_formatter/src/comments/placement.rs:1602-1627 | crates/ruff_python_formatter/src/comments/placement.rs:1773-1794 \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/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2a6a268e977ce3ff41eee4d98ff06c0f090d5bda594e28c596dc1555b9a86b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:172-191 | crates/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs:313-331 | crates/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs:334-352 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"81097212f9f0c22c786f63086c43fdf50781739f7727196b04077bc41b37b089"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs:564-589 | crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs:597-622 \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/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c66a9c5ba4322acd77e6eb5aa4a69c24165f83ed28722ab15fc36d64eb3005"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/ty_python_semantic/src/types/diagnostic.rs:3805-3834 | crates/ty_python_semantic/src/types/diagnostic.rs:3840-3870 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":3805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a4613d570d2a58d2df9e47a51db53a1710e4c6d85f177a6336d92ebb7eadee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ty_python_semantic/src/types/literal.rs:140-150 | crates/ty_python_semantic/src/types/literal.rs:155-165 \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/ty_python_semantic/src/types/literal.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcc3d582f212b121620aa1624f3757d97627af738b835f0636bb0a145997f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruff_python_parser/src/parser/expression.rs:2372-2399 | crates/ruff_python_parser/src/parser/expression.rs:2404-2427 \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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1b351fb1a84d7b98be5fd44a81b76e00da3b7d21c796b8aba8945f1cd1068b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ty_python_core/src/use_def.rs:1837-1861 | crates/ty_python_core/src/use_def.rs:1868-1890 \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/ty_python_core/src/use_def.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"471023ba674db4db4bb7f65c57b50ca153a8c2383fd99e003b1bac3a158ffe86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_python_semantic/src/types/match_pattern.rs:1046-1070 | crates/ty_python_semantic/src/types/match_pattern.rs:1081-1098 \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":"crates/ty_python_semantic/src/types/match_pattern.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"9500334889704338ca0421096c13ce267389a1bf3dfeb59eb18747ab0c1d29e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruff_linter/src/rules/pyupgrade/rules/datetime_utc_alias.rs:59-86 | crates/ruff_linter/src/rules/pyupgrade/rules/open_alias.rs:55-78 \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/ruff_linter/src/rules/pyupgrade/rules/datetime_utc_alias.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4e9c297b260ca55ba142c46d6bfc041a8406ea1c2dae58a34d0ec640c65fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/ty_python_semantic/src/types/diagnostic.rs:3458-3490 | crates/ty_python_semantic/src/types/diagnostic.rs:3496-3514 | crates/ty_python_semantic/src/types/diagnostic.rs:3516-3539 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":3458}}}],"partialFingerprints":{"codehealthFindingId/v1":"59973bf09e9c8aba05b1159d8da4f82bf3ab43e6db11d91709a677f1cf34c436"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_fromtimestamp.rs:81-104 | crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_now_without_tzinfo.rs:79-99 | crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_without_tzinfo.rs:78-98 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_fromtimestamp.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"308d70dcc21cc9648ed7bf11f1a0951685d5357fe9df045d513419f2b634fe53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ty_python_semantic/src/types/constraints/paths.rs:187-206 | crates/ty_python_semantic/src/types/constraints/paths.rs:277-300 \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/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e85c47360deb106275468558ce95b0fa1e971f3e849752b2eaf2662e8efcf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 26\u002B corresponding lines): crates/ty_python_semantic/src/types/infer.rs:427-453 | crates/ty_python_semantic/src/types/infer.rs:547-572 | crates/ty_python_semantic/src/types/infer.rs:652-680 | crates/ty_python_semantic/src/types/infer.rs:775-801 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 26 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":"crates/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1ae57b1628b210cd79ee08f4d0d4001618c144ceeaad5cdbb91524a43362b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/unraw_re_pattern.rs:181-199 | crates/ruff_linter/src/rules/ruff/rules/unraw_re_pattern.rs:231-249 \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/ruff_linter/src/rules/ruff/rules/unraw_re_pattern.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1269ab99662bcedd9403de4b1016da75f07f2b32faa200be383bb4473c6e7c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/ruff_python_parser/src/parser/statement.rs:924-965 | crates/ruff_python_parser/src/parser/statement.rs:2802-2863 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c74f48a99ebb9301f25ff9a639b8c26856ad4080be3432b7299dfd966f3e51b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ty_python_semantic/src/types/class/static_literal.rs:427-438 | crates/ty_python_semantic/src/types/type_alias.rs:289-305 \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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"948c29055f26e5dcf0a1169187dd4d18fafdccdf2dc9a2de6706011428477bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruff_linter/src/rules/flake8_type_checking/helpers.rs:159-184 | crates/ruff_linter/src/rules/flake8_type_checking/helpers.rs:190-233 \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/ruff_linter/src/rules/flake8_type_checking/helpers.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c948a2ef06d18e5b55ea584e4cba8bf87cfdf638d4540edeb14b7250d3eeec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs:2082-2108 | crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs:2115-2135 \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/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbbbf1a1cfa9f9874a1d791147b384936e3d418a6a2aa1b51b9beb0cd639997"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruff_python_codegen/src/generator.rs:185-206 | crates/ruff_python_codegen/src/generator.rs:208-226 \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/ruff_python_codegen/src/generator.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fba6ed26d3f50bf59e523a46e9f27c53827d487ac4bfca696276d7e50e540e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs:236-252 | crates/ruff_linter/src/rules/pyupgrade/rules/convert_typed_dict_functional_to_class.rs:176-192 \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/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"04526c2f96e7466784097bd42d2cc21dd01b178d7d43458da47f3dbda35f2b9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ty_python_core/src/member.rs:623-642 | crates/ty_python_core/src/symbol.rs:286-305 \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/ty_python_core/src/member.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e95c870ba9d60490e5bf09caf4e44ad00704a1d67c3a3de4231aebd3ded17f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ty_python_semantic/src/types/equality/enums.rs:859-871 | crates/ty_python_semantic/src/types/equality/enums.rs:880-893 \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/ty_python_semantic/src/types/equality/enums.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ff483f2d03cbfabb6be5a2ded221d45fb66d912c80a7e5145acb8ff4b4b6e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_rename.rs:72-113 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_replace.rs:75-116 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_linter/src/rules/flake8_use_pathlib/rules/os_rename.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbfcde50ae17a8e9372532f25807a6b33d90a087b2162463f7a53a532230ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs:514-536 | crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs:539-561 \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/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"14abbf08892b88e50fa63ce97d68c2979574ed359fd264c20d8bcf13cfbe43e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs:95-120 | crates/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs:127-155 \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/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"980045c5324553bdc8dd21c4eadf81a1d1e2da24bec8b4a5b52bb23ab942bf80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ty_python_semantic/src/reachability.rs:598-610 | crates/ty_python_semantic/src/types/narrow.rs:3528-3543 \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/ty_python_semantic/src/reachability.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecefffb4d9f7e125eda96b3d5fb0f15c71e8c6734a2113611ae56b87e2976cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruff_db/src/diagnostic/render.rs:869-890 | crates/ruff_db/src/diagnostic/render.rs:906-928 \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/ruff_db/src/diagnostic/render.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"c945de699d40653d8e10fc8e1ed01f28d3fac9d20d3afe92a3c009cc2f84c3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruff_linter/src/rules/flake8_bugbear/rules/delattr_with_constant.rs:116-129 | crates/ruff_linter/src/rules/flake8_bugbear/rules/setattr_with_constant.rs:78-92 \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/ruff_linter/src/rules/flake8_bugbear/rules/delattr_with_constant.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae01a3362b5a3299269e7263ed37dbd7c7fe60c94bc4cd2f6355be2681260e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): crates/ty_wasm/src/lib.rs:325-344 | crates/ty_wasm/src/lib.rs:351-369 | crates/ty_wasm/src/lib.rs:376-394 | crates/ty_wasm/src/lib.rs:782-805 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_wasm/src/lib.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"827ba75d795ed90a3baa95c38132d898ec2643b3e2e420f95a4243d832586d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:78-96 | crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs:96-122 \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/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e0f6ac77d14100912be01c0de044355e05fce425b3710f1b2e9274c7797543"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ty_wasm/src/lib.rs:442-458 | crates/ty_wasm/src/lib.rs:496-519 \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/ty_wasm/src/lib.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c039c86db82750a62b22703279471efcbd0cdefe3a3d9a39548b3f46855a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ty_module_resolver/src/resolve.rs:259-274 | crates/ty_module_resolver/src/resolve.rs:293-317 \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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e98cb7f52147f4d8c31ed13981a3e1d803bd40861f7d838cd8946b2f78573e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruff_linter/src/rules/airflow/helpers.rs:313-334 | crates/ruff_linter/src/rules/airflow/rules/task_implicit_multiple_outputs.rs:125-160 \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/ruff_linter/src/rules/airflow/helpers.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd37437076fd11335fd193249b7ed875921539b1230fd1adf085549097e9a24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruff_linter/src/rules/flake8_pytest_style/rules/raises.rs:266-294 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/warns.rs:234-263 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/raises.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52b936a849b6a8ed1e9d932824f656a5f9ba4a23cb7058c8eedd11f97798973"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/ty_ide/src/call_hierarchy/incoming_calls.rs:174-195 | crates/ty_ide/src/references.rs:253-281 | crates/ty_ide/src/references.rs:315-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 22 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/ty_ide/src/call_hierarchy/incoming_calls.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"120a9210c538dc4dab1893672362527bea70c37387c3cba530f73e248ee89265"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ty_python_semantic/src/types/constraints/variables.rs:605-624 | crates/ty_python_semantic/src/types/constraints/variables.rs:630-646 \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/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"521bba60736a4b58f30bee0d18194de4bd1235b3f14d6008951a158e92e6aeb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs:307-334 | crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs:347-377 \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":"crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a395aa34cf34cd593029cb473c769d97b0589caa3527738537736ecdb75c6e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ty_python_semantic/src/types/call/bind.rs:1180-1196 | crates/ty_python_semantic/src/types/call/bind.rs:1208-1224 \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"882cd1ef425f253c674faa0e4f9cb284faca7d30f815b038f3b84528bfbbcf75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ty_python_semantic/src/types/infer/builder/post_inference/typed_dict.rs:529-544 | crates/ty_python_semantic/src/types/typed_dict.rs:1756-1770 \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":"crates/ty_python_semantic/src/types/infer/builder/post_inference/typed_dict.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d86073c378073bd0356029f59faee1e943ee8655da8b277d1df50ce442924a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/ty_ide/src/goto_declaration.rs:18-32 | crates/ty_ide/src/goto_definition.rs:19-32 | crates/ty_ide/src/goto_type_definition.rs:13-29 \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":"crates/ty_ide/src/goto_declaration.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"774038b6a99d1c68df3e3de06355b83032ec7174c6c477d5c65e3e9c4e65a0e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ty_python_semantic/src/types/infer/builder.rs:2042-2078 | crates/ty_python_semantic/src/types/infer/builder.rs:10591-10619 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fdb2ee1e73a3bf334906c0e301e3dac07c7a78c72f6903e4e161f6dfba87e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ty_server/src/server/api/requests/prepare_call_hierarchy.rs:83-102 | crates/ty_server/src/server/api/type_hierarchy.rs:54-69 \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/ty_server/src/server/api/requests/prepare_call_hierarchy.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff6762e1efbe6145518993c028ba0ec391b99062bb9744fc01d893f7a264f41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruff_annotate_snippets/src/renderer/source_map.rs:362-382 | crates/ruff_annotate_snippets/src/renderer/source_map.rs:384-404 \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/ruff_annotate_snippets/src/renderer/source_map.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"699df680e778095a9ffd0d931425102ad5cdda8bc07765d5e40d378541938de5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruff_linter/src/checkers/ast/analyze/deferred_lambdas.rs:8-29 | crates/ruff_linter/src/checkers/ast/analyze/deferred_with_statements.rs:6-23 \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":"crates/ruff_linter/src/checkers/ast/analyze/deferred_lambdas.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe1a98115b3c2d030840c42e896566eead724a916b65f01a13213184246aeb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/ty_python_semantic/src/types/infer/builder.rs:8862-8884 | crates/ty_python_semantic/src/types/infer/builder.rs:8890-8912 | crates/ty_python_semantic/src/types/infer/builder.rs:8918-8948 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":8862}}}],"partialFingerprints":{"codehealthFindingId/v1":"144c30761d836d181854d50f00c10c879c234a9a99d6009cdc639624cfa20832"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ty_python_semantic/src/types/recursive.rs:331-346 | crates/ty_python_semantic/src/types/type_alias.rs:541-556 \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/ty_python_semantic/src/types/recursive.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f13dd85ac133355e2a079d4e5348c34a2a659febe125b8bf55ae17fcbbebe2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruff_linter/src/rules/pep8_naming/rules/camelcase_imported_as_acronym.rs:67-94 | crates/ruff_linter/src/rules/pep8_naming/rules/camelcase_imported_as_constant.rs:77-101 \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/ruff_linter/src/rules/pep8_naming/rules/camelcase_imported_as_acronym.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afea229d2fecbdbc821d04cf1379c1fcbe0c8612e5383f6b21f2e38667a5d6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruff_linter/src/rules/pylint/rules/invalid_envvar_default.rs:53-76 | crates/ruff_linter/src/rules/pylint/rules/invalid_envvar_value.rs:50-70 \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/ruff_linter/src/rules/pylint/rules/invalid_envvar_default.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e175be1552a99812d9061120786e8efc9492aef8ce3c93bb92b6e67aa8b86c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruff_python_ast/src/nodes.rs:3196-3211 | crates/ruff_python_ast/src/nodes.rs:3850-3865 \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/ruff_python_ast/src/nodes.rs"},"region":{"startLine":3196}}}],"partialFingerprints":{"codehealthFindingId/v1":"72644c00e44f449b81190b7d4400c93d8a115b01e16e10f7e0edeb7283ea7936"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ty_python_semantic/src/types/constraints/sequents.rs:1617-1628 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1843-1854 \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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"d385416a534703ecf698f6288dd3d87090b7da9c53463f40c33195211592fcb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs:294-317 | crates/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs:320-344 \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/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9348f2ea77428c8d121fb1fedf8d3923c5be2214a5711e48626653f194ef5e9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruff_linter/src/settings/types.rs:395-406 | crates/ruff_linter/src/settings/types.rs:474-488 \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/ruff_linter/src/settings/types.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52ea45c84c89d9e6c16ee5b850cda267344b65639a4cc5bbd3998a962dcef36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruff_linter/src/source_kind.rs:113-134 | crates/ruff_linter/src/source_kind.rs:141-156 \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/ruff_linter/src/source_kind.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e032e87cbd50987c829b6618c68a6e195e8374eb44e4c859857ccf72f21376"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ty_python_core/src/narrowing_constraints.rs:147-166 | crates/ty_python_core/src/reachability_constraints.rs:203-222 \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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80471997b1e7d2039030d527a00a8fe9ff876f564f4fe3183e468a8a3601b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ty_python_semantic/src/types/call/bind.rs:3775-3796 | crates/ty_python_semantic/src/types/call/bind.rs:4666-4682 \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3775}}}],"partialFingerprints":{"codehealthFindingId/v1":"66873c4018de44bff00683063caf3b6801a3bda2cf9c3cf357bf72f496db5785"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_if_exp.rs:270-285 | crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_if_exp.rs:287-301 \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":"crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_if_exp.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f08e99867b50193bb35c9eacfefd4394245350c6c4147108a70a173747c73d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ty_python_semantic/src/types/class.rs:640-656 | crates/ty_python_semantic/src/types/instance.rs:2131-2149 \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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1a7d8b1c18f1a4d30ff6af9ba2e44a1cb670684960f396f15f73f8eaa522f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_python_semantic/src/types/class/implicit_attributes.rs:535-555 | crates/ty_python_semantic/src/types/overrides.rs:317-334 \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":"crates/ty_python_semantic/src/types/class/implicit_attributes.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5802e7a9004caa7587bc23c93e2ac9d209cee3e62fac00edc46430bc0412e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_python_semantic/src/types/class/static_literal.rs:512-529 | crates/ty_python_semantic/src/types/function.rs:408-426 \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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a43165e8468b0f7c32189a67640856c01742cebe4d841e88708141fd561301c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_python_semantic/src/types/display.rs:3194-3213 | crates/ty_python_semantic/src/types/set_theoretic.rs:726-743 \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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":3194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f48fef344d54cc4614ddea2255650ddf8994342b84ac21d9efa2d1c61e6d32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruff_python_formatter/src/statement/stmt_raise.rs:12-44 | crates/ruff_python_formatter/src/type_param/type_param_type_var.rs:10-26 \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/ruff_python_formatter/src/statement/stmt_raise.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"36434046ea5cb77c584b6a0ccb9104788e4f9ab9ed0cd4b53b28b2e73ba335c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ty_python_semantic/src/types/infer.rs:136-150 | crates/ty_python_semantic/src/types/infer.rs:176-186 \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/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a435df9a78d8eaf4828be19833605c9d57726694c2642cbc07d8be204a7a3b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruff_linter/src/rules/pylint/settings.rs:107-120 | crates/ruff_linter/src/rules/pyupgrade/types.rs:15-27 \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/ruff_linter/src/rules/pylint/settings.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"809ddc701847890e9cb152dfebd58b142af5a68ddebd983889f2ca5c7a3998f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/ruff_python_parser/src/parser/expression.rs:2759-2799 | crates/ruff_python_parser/src/parser/statement.rs:454-494 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":2759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be046ce4c94e73738e42b4ff6f20f6db5ec9cb8fae6f657ba0992a89a958e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruff_python_formatter/src/expression/expr_bin_op.rs:25-44 | crates/ruff_python_formatter/src/expression/expr_compare.rs:26-44 \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/ruff_python_formatter/src/expression/expr_bin_op.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ed1d664ae6f947237e2e502fbccab4a7a1acb439ac885db2e5d9d6304b446c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruff_python_formatter/src/expression/expr_bytes_literal.rs:15-30 | crates/ruff_python_formatter/src/expression/expr_f_string.rs:17-32 | crates/ruff_python_formatter/src/expression/expr_t_string.rs:17-32 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/expression/expr_bytes_literal.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f92217a8e10837f8d168d64de71cd8c6e2a390a974ab1d62ccf0d6843e26ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruff_server/src/session/client.rs:206-227 | crates/ty_server/src/session/client.rs:260-285 \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/ruff_server/src/session/client.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d8762203cc146c30e726fb66f1a244014279101ff53a0f862452a2f0741fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ty_python_semantic/src/types/constraints/sequents.rs:688-736 | crates/ty_python_semantic/src/types/constraints/sequents.rs:744-763 \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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd406e1c8d91c061010ee6b2d5fdf63a733ca998c936670f8dadd15cc3846d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruff_linter/src/rules/pyflakes/fixes.rs:22-38 | crates/ruff_linter/src/rules/pyflakes/fixes.rs:46-66 \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/ruff_linter/src/rules/pyflakes/fixes.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af36029f18bb8fc692139aa9e38a01d8bc6ac2f17ffb7a9606cc551b8d3e238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs:165-183 | crates/ruff_linter/src/rules/pyupgrade/rules/convert_typed_dict_functional_to_class.rs:150-168 \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/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd54734f6bed046d0267d5f83daed592b411f3bdc9b443c626f2ce17ddb72cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_python_semantic/src/types/instance.rs:393-413 | crates/ty_python_semantic/src/types/instance.rs:442-459 \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":"crates/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"256e999d04b75efca1f0e1f73544b02ef0710fba867576c09cfc15177259c507"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruff_server/src/server/api.rs:149-156 | crates/ty_server/src/server/api.rs:247-254 \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/ruff_server/src/server/api.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"611e87eeb5cbe0a10a745c699ef58aca030bd64ad4f9faa18ed00494071984b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_python_semantic/src/types/diagnostic.rs:3950-3968 | crates/ty_python_semantic/src/types/diagnostic.rs:4053-4070 \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":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":3950}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79cd4d6666261a513a80803020a79dd5022eff90f5ad1091580bb079a01e691"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ty_python_semantic/src/types/infer/builder.rs:5536-5554 | crates/ty_python_semantic/src/types/infer/builder.rs:5556-5572 \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":5536}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae02b43eab5a3366f9b6a7ed38a0fd4d08005e40e56d52938c94cbac52e15b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruff_python_semantic/src/model.rs:1906-1924 | crates/ruff_python_semantic/src/model.rs:1946-1966 \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/ruff_python_semantic/src/model.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f3b9e6453df9ec21f3f6f93e350d7012a1479c14e870c7bc389afb23f2a01d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruff_server/src/server/api.rs:228-238 | crates/ty_server/src/server/api.rs:417-435 \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/ruff_server/src/server/api.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77923615314a0baee0c1f9a07aa1e709bbbfed0a0ecbfc34e4e73db5650ed43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ty_python_semantic/src/types/class/enum_literal.rs:78-94 | crates/ty_python_semantic/src/types/class/named_tuple.rs:554-571 \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/ty_python_semantic/src/types/class/enum_literal.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2938e81dbb35a6e89a9b92fba4e874e850cb79b88516745de6ee162f4436a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_python_semantic/src/types/infer.rs:324-342 | crates/ty_python_semantic/src/types/infer.rs:473-490 \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":"crates/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"480bb782669b1ba5106ed94cc0275584e0ad1f447c1584e0726766ca8737ef43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruff_linter/src/rules/flake8_slots/helpers.rs:4-27 | crates/ruff_python_ast/src/helpers.rs:792-812 \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/ruff_linter/src/rules/flake8_slots/helpers.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"922e18212b1bc281954f78c88dd4def9c5c91a1ad2970f0481db15306ef8cdd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ty_python_semantic/src/types/diagnostic.rs:4112-4131 | crates/ty_python_semantic/src/types/diagnostic.rs:4138-4156 \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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":4112}}}],"partialFingerprints":{"codehealthFindingId/v1":"69053e1dfe177d43f2f896c95a35a2f9a64ed12203a3710546240783ad62fbfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ty_python_semantic/src/types/tuple.rs:270-284 | crates/ty_python_semantic/src/types/tuple.rs:892-905 \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/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad0d70fb6aa8a74f9a2a375114f6ed56ed21e1b516b70a9ea10aa359812f600"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_server/src/document/location.rs:32-56 | crates/ty_server/src/document/location.rs:71-88 \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":"crates/ty_server/src/document/location.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e01da1d625710b9b29dc305046ca66ca29783951822a80fca927864cac982b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs:831-846 | crates/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs:849-864 \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/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"8119165e1e4a0af061dacfb671eae7a74c1e66e486ec7ea6013c869f22c097e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ty_python_semantic/src/types/attribute_write.rs:1123-1132 | crates/ty_python_semantic/src/types/infer/builder.rs:3146-3157 \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/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0158dcc45c86ee9b2ed727c135a2d7d1bdd298326ed9ad733502283632ecc15e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruff_python_semantic/src/analyze/typing.rs:1053-1071 | crates/ruff_python_semantic/src/analyze/typing.rs:1106-1124 \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/ruff_python_semantic/src/analyze/typing.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"0544a33a50986b7b4a51cc54cbeb6af7a225d1a0bc43dd065eef16114372da86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ty_python_semantic/src/types/equality.rs:1222-1236 | crates/ty_python_semantic/src/types/equality.rs:1331-1351 \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":"crates/ty_python_semantic/src/types/equality.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a23fd9168e12e51b20fe834508a42484d42987bf3f1ff098e260b60b67bdc4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ty_python_semantic/src/types/type_alias.rs:687-707 | crates/ty_python_semantic/src/types/type_alias.rs:720-744 \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/ty_python_semantic/src/types/type_alias.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f271814a9a94d7b579878db3d7535eaae31b8c616569afdbbedb9e4dee988a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruff_linter/src/rules/pep8_naming/rules/constant_imported_as_non_constant.rs:75-104 | crates/ruff_linter/src/rules/pep8_naming/rules/lowercase_imported_as_non_lowercase.rs:61-77 \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/ruff_linter/src/rules/pep8_naming/rules/constant_imported_as_non_constant.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf4d53c9f272882969278d21279167647974640df03e16d42f423961e27d036"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs:145-162 | crates/ruff_linter/src/rules/pyupgrade/rules/convert_typed_dict_functional_to_class.rs:130-147 \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":"crates/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b13310b25a06140f9b9d86ba6373f59df3d2a4a418f14c44761971024a7d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruff_macros/src/rust_doc.rs:43-62 | crates/ruff_macros/src/violation_metadata.rs:136-155 \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/ruff_macros/src/rust_doc.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f1cae907de1a3cce40e87fb03a9d539df540443327eb53b4c2ce3529129566"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruff_python_ast/src/expression.rs:338-347 | crates/ruff_python_ast/src/expression.rs:360-369 \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/ruff_python_ast/src/expression.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d70e03bfcb575ccf9ab4625e650db8332422dfbba56b4bb4c6f7052690117e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruff_server/src/session/client.rs:137-148 | crates/ty_server/src/session/client.rs:177-188 \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/ruff_server/src/session/client.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"31347dcf1ded7b087d451571a0a4cad9290179aac5ddfc6225e7984d12f285d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ty_python_semantic/src/types/infer.rs:1412-1422 | crates/ty_python_semantic/src/types/infer.rs:1427-1435 \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/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"4204e6b3e0f2bc3ac56e74d879689cf28b2eb6ffd0d0e1842db06cfdf8877614"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ty_python_semantic/src/types/protocol_class.rs:657-670 | crates/ty_python_semantic/src/types/protocol_class.rs:682-695 \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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d7ec673e834962b45f84b27ae0a30339065166a2cd5bf2fa3581041f651979"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruff_dev/src/print_ast.rs:18-31 | crates/ruff_dev/src/print_tokens.rs:18-32 \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/ruff_dev/src/print_ast.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c280a788829ba3ae0881aa1977ae5e08332b0c0507bc8636a62345bb061bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruff_python_ast/src/nodes.rs:2816-2832 | crates/ruff_python_formatter/src/expression/operator.rs:25-43 \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/ruff_python_ast/src/nodes.rs"},"region":{"startLine":2816}}}],"partialFingerprints":{"codehealthFindingId/v1":"9845b59a39dc32404ad6befcf4bc1f2a2378d613fa8064406e531fea3caeb326"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruff_python_parser/src/parser/statement.rs:3856-3867 | crates/ruff_python_parser/src/parser/statement.rs:3897-3907 \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/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":3856}}}],"partialFingerprints":{"codehealthFindingId/v1":"c582dbb72fc2e4c6b27acc2e44793985fa562f9a56e9661c246917534eee43ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs:772-790 | crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs:792-808 \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/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce737372ec6a2b3f30f4913c4b9c2caa2d11073c92f86978d43f296e3047b66e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruff_db/src/files.rs:407-425 | crates/ruff_db/src/files.rs:431-452 \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/ruff_db/src/files.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0512db97c97c01b26299bf6fc3a4401114e809cd0b044ad954482a444fd03918"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruff_linter/src/rules/flake8_slots/rules/no_slots_in_str_subclass.rs:54-79 | crates/ruff_linter/src/rules/flake8_slots/rules/no_slots_in_tuple_subclass.rs:55-74 \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/ruff_linter/src/rules/flake8_slots/rules/no_slots_in_str_subclass.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae9bbe0bff923ebf6d82cb4a27d087d7420923ccb692b11db23e04746534eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruff_linter/src/rules/pep8_naming/rules/mixed_case_variable_in_class_scope.rs:64-87 | crates/ruff_linter/src/rules/pep8_naming/rules/mixed_case_variable_in_global_scope.rs:68-88 \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/ruff_linter/src/rules/pep8_naming/rules/mixed_case_variable_in_class_scope.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7647091c34181e7668000ab848b0f92448934ad123623e610b1625efd2458b31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/needless_else.rs:93-119 | crates/ruff_linter/src/rules/ruff/rules/useless_finally.rs:180-196 \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/ruff_linter/src/rules/ruff/rules/needless_else.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6105ec79e422b61b4b125b262db50c465fea584962d67926ad6105c3ee4d047"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruff_python_ast/src/name.rs:762-776 | crates/ruff_python_ast/src/name.rs:790-802 \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/ruff_python_ast/src/name.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"738e1baaf02633bb1ca305274529bcb38439812a105180cf65b19945a7e8de07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruff_python_semantic/src/model.rs:1845-1867 | crates/ruff_python_semantic/src/model.rs:1883-1900 \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":"crates/ruff_python_semantic/src/model.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0dce09cfdf540be715b61be5b22a252b16c639e6df9be2563f1afc60da616d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ty_ide/src/docstring/document/google.rs:191-211 | crates/ty_ide/src/docstring/document/numpy.rs:62-86 \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/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fcf23b9fba532fe8f824ec40c29795996c28de19e859d2ba2e0a9b0770e940"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ty_python_semantic/src/types/signatures.rs:1340-1358 | crates/ty_python_semantic/src/types/tuple.rs:2306-2327 \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c0be9aeaeebd9dca921ef09d33b43dc301395ef790e856132c5064477edd8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruff_linter/src/rules/pep8_naming/helpers.rs:27-40 | crates/ruff_linter/src/rules/pep8_naming/helpers.rs:58-75 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pep8_naming/helpers.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aaf08940ff3f650039c14629d2b67554eded08e07b7d4a0c49f212e9165f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruff_linter/src/rules/pycodestyle/rules/doc_line_too_long.rs:93-114 | crates/ruff_linter/src/rules/pycodestyle/rules/line_too_long.rs:91-110 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/doc_line_too_long.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f72fcad4e0b42a9a444a8a9c26b7a037335e82742f650d6af34eaef6153b0c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/sequence_sorting.rs:226-243 | crates/ruff_linter/src/rules/ruff/rules/sort_dunder_slots.rs:388-406 \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":"crates/ruff_linter/src/rules/ruff/rules/sequence_sorting.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff80fe6ef30286b2f09d7394659d6233a7646e8ce348648fa963d4f7a7477e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruff_python_formatter/src/expression/parentheses.rs:321-336 | crates/ruff_python_formatter/src/expression/parentheses.rs:338-351 \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/ruff_python_formatter/src/expression/parentheses.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aea1861a7b98972b4fe3c95b3e51c85aceeae1418bc6fc735f9a0203c11b9ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ty_python_semantic/src/types/attribute_write.rs:1513-1523 | crates/ty_python_semantic/src/types/protocol_class.rs:2525-2538 \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/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6c06f51507d2f68561fb661ae68bea6dbd9e74c134817e1482fba48bb4c800"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruff_linter/src/rules/flake8_gettext/rules/f_string_in_gettext_func_call.rs:68-83 | crates/ruff_linter/src/rules/flake8_gettext/rules/format_in_gettext_func_call.rs:69-84 | crates/ruff_linter/src/rules/flake8_gettext/rules/printf_in_gettext_func_call.rs:67-82 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_gettext/rules/f_string_in_gettext_func_call.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6edea7f8bcc9d7f12ae00384a4241e968c85223fe40fbd3a751f96779545d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruff_python_stdlib/src/str.rs:21-36 | crates/ruff_python_stdlib/src/str.rs:58-73 \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/ruff_python_stdlib/src/str.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e73dc8e37de6c0e081f9ead9e8af729490b1bf7fe76de3638855019cc894abe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruff_linter/src/cst/matchers.rs:27-36 | crates/ruff_linter/src/cst/matchers.rs:44-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":"crates/ruff_linter/src/cst/matchers.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"808af22b01023cf96f6005625b978f9409fe1dc0df7b88eef83b1c9b4aca49b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_dict_comprehension_for_iterable.rs:182-201 | crates/ruff_linter/src/rules/ruff/rules/default_factory_kwarg.rs:116-128 \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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_dict_comprehension_for_iterable.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d069a34a3cb373294df18a9874592be2457d5bdce6b65e004660060bca7cc0a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ty_python_core/src/use_def.rs:1247-1257 | crates/ty_python_core/src/use_def.rs:1390-1400 \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/ty_python_core/src/use_def.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d46f2a812b41755d44d119caeb3642f91e803840301ba2c17d987721a5edf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruff_linter/src/rules/pyflakes/rules/raise_not_implemented.rs:73-89 | crates/ruff_linter/src/rules/refurb/rules/hardcoded_string_charset.rs:99-113 \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":"crates/ruff_linter/src/rules/pyflakes/rules/raise_not_implemented.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5399fd25acb2f54f46469e09aa38cadad36eb7d94b5d8eed4374fe96b8a77fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs:110-129 | crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs:131-150 \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/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f2b5bd006e645b5a480eb6511f4a0e3b7bae33fd476abae2e00a4e86f80876"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:156-170 | crates/ruff_linter/src/rules/refurb/rules/write_whole_file.rs:170-185 \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":"crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb5ddbc3c94c0fc0827c91ab93d974004004f634269adb6a6a6c8f2af6e1ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/ruff_python_parser/src/parser/statement.rs:974-1004 | crates/ruff_python_parser/src/parser/statement.rs:1013-1050 | crates/ruff_python_parser/src/parser/statement.rs:3636-3660 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 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/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"0241d83b7eef82f4d8275e299fe3b1cbbc71fbd74e310e3f9f10af1d7c264568"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ty_python_semantic/src/types/call/bind.rs:11363-11381 | crates/ty_python_semantic/src/types/call/bind.rs:11397-11415 \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":11363}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5df77e1e7c3a7242ba4906409d619aed7f89e6d6606b7b3d8b03603276e42b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ty_python_semantic/src/types/constraints.rs:2612-2621 | crates/ty_python_semantic/src/types/constraints.rs:2727-2739 \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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c86b0d48a92c4ec42acb8d47308eb3b8582b5983d174aead11b9df3c734d8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ty_python_semantic/src/types/dedicated/pytest/collection.rs:269-282 | crates/ty_python_semantic/src/types/dedicated/pytest/fixtures.rs:1784-1792 \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/ty_python_semantic/src/types/dedicated/pytest/collection.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0969539df2ee7f1655c877c88438a3ac7b6dad30f60d2229c55c781a40790a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ty_python_semantic/src/types/infer/builder.rs:1148-1157 | crates/ty_python_semantic/src/types/infer/builder.rs:1160-1171 \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1916c0d8d2e216a94423c4e9a1fcd411c842fd1d6e4e135ca430576027d5684"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ty_python_semantic/src/types/instance.rs:2029-2047 | crates/ty_python_semantic/src/types/subclass_of.rs:248-267 \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/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac90d20f69b4abea739663d136060dd4121073ed0f33f9e700e226e7946a5b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/ruff_python_ast/src/comparable.rs:485-502 | crates/ruff_python_ast/src/comparable.rs:1647-1668 | crates/ruff_python_ast/src/comparable.rs:1679-1696 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/comparable.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8b388d10eb8aa6e4d9af7f4bb3227fa36d9617b4da15a09c86f06f5f38cf17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruff_python_trivia/src/tokenizer.rs:41-64 | crates/ruff_python_trivia/src/tokenizer.rs:67-90 \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/ruff_python_trivia/src/tokenizer.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd346688c71d6ceb10ac2c4a4ac6d59635a59d8df5b65dc88b7774ad97baac3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruff_linter/src/rules/airflow/helpers.rs:141-153 | crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs:813-833 \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/ruff_linter/src/rules/airflow/helpers.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86f47c404977b90d8751b7967d3a799494dccd1daa80d826716336c3afbee72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs:259-275 | crates/ruff_linter/src/rules/ruff/rules/unused_unpacked_variable.rs:91-107 \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/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee96f329ca0ac38ea85879b3ed65a5d8c2562f7920d43721d160690f7f2fbf77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/suppression_comment_visitor.rs:177-197 | crates/ruff_python_formatter/src/comments/visitor.rs:150-168 \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/ruff_linter/src/rules/ruff/rules/suppression_comment_visitor.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"426856df660430c7b852a784b60b861518df0b910eaf931b75b06366cab17247"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruff_python_ast/src/expression.rs:182-190 | crates/ruff_python_ast/src/expression.rs:196-204 \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/ruff_python_ast/src/expression.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0bed51126187559a7d1609dfd290ee7343441384a2c3c153f62b6b498e38a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruff_python_ast/src/int.rs:13-27 | crates/ruff_python_ast/src/int.rs:52-66 \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":"crates/ruff_python_ast/src/int.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a8802e75395dd55e01ca3a1bd26bdda285f5c8c03f0fa0559122a7a17fecf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ty_ide/src/docstring/markdown/structured/google.rs:12-24 | crates/ty_ide/src/docstring/markdown/structured/numpy.rs:13-28 \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/ty_ide/src/docstring/markdown/structured/google.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ff05137e0f4568144522da12d0ec43af278b2ae5103fcf5818c9d031b72560"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ty_python_core/src/narrowing_constraints.rs:168-176 | crates/ty_python_core/src/reachability_constraints.rs:227-235 \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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df0867f9dc197efc0ddcb3e378b91038e969995b14e33bb589653c450ba319f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ty_python_semantic/src/types.rs:9904-9919 | crates/ty_python_semantic/src/types/type_alias.rs:461-477 \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/ty_python_semantic/src/types.rs"},"region":{"startLine":9904}}}],"partialFingerprints":{"codehealthFindingId/v1":"559f83b672551fdaaafc124357fa5d71fa7793f568a62380d2c11cabcdce605f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/ty_python_semantic/src/types/class.rs:1260-1271 | crates/ty_python_semantic/src/types/class.rs:1279-1300 | crates/ty_python_semantic/src/types/class.rs:2609-2620 \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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed5a3bb46d799e7c1b48d5251c5672b0b0f63dfbdd8d9ff1232b47c552bc44f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ty_python_semantic/src/types/definition.rs:25-40 | crates/ty_python_semantic/src/types/definition.rs:63-75 | crates/ty_python_semantic/src/types/definition.rs:79-91 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/definition.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9031aef70979182a436a0a378bb86d727c18228bf6b3bd465269db563c9393f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ty_python_semantic/src/types/diagnostic.rs:2745-2766 | crates/ty_python_semantic/src/types/diagnostic.rs:4568-4581 \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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8fa4fd97919ccf7e32b7f34d6bba0de694b5d412bea26f2088fb96bcc7ff3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ty_python_semantic/src/types/narrow.rs:3777-3792 | crates/ty_python_semantic/src/types/narrow.rs:4857-4867 \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/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":3777}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9834cdfd4ca72d29aa058436e8ab52b98a87596e2fdce1f5e84d31ba107b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ty_python_semantic/src/types/protocol_class.rs:991-1005 | crates/ty_python_semantic/src/types/protocol_class.rs:1013-1027 \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":"crates/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"42df1176a44dcb02af056715e6555b2b8f45eb9a8bee9b99b95566e673836d74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruff_graph/src/resolver.rs:111-122 | crates/ruff_graph/src/resolver.rs:125-136 \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/ruff_graph/src/resolver.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"123e3ce80c52ca3371a6e18f8155a7710d6f1af225a4f95623bb63032a1c2968"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ty_ide/src/docstring/markdown/general/inline.rs:624-636 | crates/ty_ide/src/docstring/markdown/structured.rs:501-516 \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/ty_ide/src/docstring/markdown/general/inline.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5b9250b30ce30ff12bbc3ebc39cb1899fc5ae1b48a104105d8a4154171061a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/duplicate_entry_in_dunder_all.rs:96-106 | crates/ruff_linter/src/rules/ruff/rules/sort_dunder_all.rs:145-160 \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/ruff_linter/src/rules/ruff/rules/duplicate_entry_in_dunder_all.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c94a26ca891455f3eb5e8d2a9a40c17086201e421109ab8fd8c1ff131b155a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruff_python_formatter/src/statement/stmt_assert.rs:13-42 | crates/ruff_python_formatter/src/type_param/type_param_type_var_tuple.rs:10-22 \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/ruff_python_formatter/src/statement/stmt_assert.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bdb561f5670b2ef382fbb9a4ce47b5cd31829b21934b2dab744a4c2e7544ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ty_python_semantic/src/types/ide_support.rs:471-487 | crates/ty_python_semantic/src/types/ide_support.rs:509-532 \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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefcbf5edb50cb0a570851b85eab99a358dc6effee77fc3aef96b8863431dcfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruff_linter/src/rules/flake8_bandit/rules/django_raw_sql.rs:40-57 | crates/ruff_linter/src/rules/flake8_django/rules/locals_in_render_function.rs:49-66 \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":"crates/ruff_linter/src/rules/flake8_bandit/rules/django_raw_sql.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eea5e83e420c08525300494dcfc91721c26e190f4d5c893a3f6d1b974ddfb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/unnecessary_regular_expression.rs:397-411 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_regular_expression.rs:417-431 \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":"crates/ruff_linter/src/rules/ruff/rules/unnecessary_regular_expression.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"5534aca8d461f45d72c15b34fb059d2401257124ac60d37931c407d8b039d6f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ty_ide/src/symbols.rs:546-557 | crates/ty_ide/src/symbols.rs:560-583 \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/ty_ide/src/symbols.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"3254794f3788ba0df4c283ebd39abea2ac174a0d1955e0ba54038bbcb6e96bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ty_python_core/src/narrowing_constraints.rs:117-129 | crates/ty_python_core/src/reachability_constraints.rs:156-169 \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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1920eb40fd4e19f64f70257a180a03c6e89aaa0252fdff21701315eb90904270"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_python_semantic/src/types/constraints.rs:551-568 | crates/ty_python_semantic/src/types/constraints.rs:633-650 \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":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db4b6fb4519fba8fb814d2e6d225f5e3d519012f4f15aef7228dabee9705c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ty_python_semantic/src/types/constraints/variables.rs:1064-1078 | crates/ty_python_semantic/src/types/constraints/variables.rs:1358-1372 \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":"crates/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6f2b9d1f629a6a5802bb496123432ef4f0646a1adb863066e26cec90e72611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 15\u002B corresponding lines): crates/ty_python_semantic/src/types/generics.rs:1650-1665 | crates/ty_python_semantic/src/types/relation.rs:904-924 | crates/ty_python_semantic/src/types/relation.rs:1124-1142 | crates/ty_python_semantic/src/types/relation.rs:1179-1197 | crates/ty_python_semantic/src/types/signatures.rs:643-657 | crates/ty_python_semantic/src/types/signatures.rs:2491-2505 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"5046db889329a764e772a78d67e5647e277cb8dfae249724ebe62b5485a7f8ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ty_python_semantic/src/types/narrow.rs:139-146 | crates/ty_python_semantic/src/types/narrow.rs:185-192 | crates/ty_python_semantic/src/types/narrow.rs:203-216 \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/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0657f4378c76f20027390d503f89a30a694139dd06fb932319796f73cbefe7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:80-100 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:102-120 \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/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c743d766be1593c4935f6b1ea3e94de08d396cf22ddbe2951532c851a9fa3d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:85-100 | crates/ruff_linter/src/rules/refurb/rules/write_whole_file.rs:84-99 \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/ruff_linter/src/rules/refurb/rules/read_whole_file.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dea0bef1d8bc4d938715162238cc39277b791f0dde6246223c8245e35d50341"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruff_python_literal/src/escape.rs:132-140 | crates/ruff_python_literal/src/escape.rs:617-627 \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/ruff_python_literal/src/escape.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c613f59e269246b6c1c686356621080ac74c72d5b6c86f6d4e1ff49cfee29a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ty_python_core/src/builder.rs:5904-5919 | crates/ty_python_core/src/builder.rs:5921-5939 | crates/ty_python_core/src/builder.rs:5941-5951 \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/ty_python_core/src/builder.rs"},"region":{"startLine":5904}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fb271c08f6b4dcfafe99df11b3f4e9ca4b5d02914157083745f2d38ca5f2b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruff_linter/src/rules/flake8_builtins/rules/builtin_import_shadowing.rs:59-74 | crates/ruff_linter/src/rules/flake8_builtins/rules/builtin_lambda_argument_shadowing.rs:39-59 \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/ruff_linter/src/rules/flake8_builtins/rules/builtin_import_shadowing.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c97e33da0d16fa16afd7e89eec45613bfed3bf29c90290025b1522a3b45cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ty_python_semantic/src/types/protocol_class.rs:810-821 | crates/ty_python_semantic/src/types/protocol_class.rs:831-842 \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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"06addd05b19059891f31d82068c927ea59994118adaf18470e4628b33d713816"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruff_db/src/display.rs:26-36 | crates/ty_python_semantic/src/types/display.rs:501-511 \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/ruff_db/src/display.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cb125544ec13516a2acf834358d4dc1193f8e9c574d7c487eed080156d2363"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): crates/ruff_server/src/server/api.rs:303-319 | crates/ruff_server/src/server/api.rs:356-375 | crates/ty_server/src/server/api.rs:501-517 | crates/ty_server/src/server/api.rs:551-570 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf9b1d662bf703677552701fa269c4fa9168d89cc284cc147dc35bd9a81349e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ty/src/printer.rs:44-53 | crates/ty/src/printer.rs:58-67 \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/ty/src/printer.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"743ec0ab78a49c13c69b897e09d5510166f365e34fece3658bfac9dc2c88ece5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ty_python_semantic/src/types/diagnostic.rs:6086-6102 | crates/ty_python_semantic/src/types/diagnostic.rs:6110-6127 \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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":6086}}}],"partialFingerprints":{"codehealthFindingId/v1":"545635053b1cba604319590fd34357d324f3a9baed71fa227aad8cbf872ba14d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ty_server/src/server/api/diagnostics.rs:582-593 | crates/ty_server/src/server/api/diagnostics.rs:600-611 \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/ty_server/src/server/api/diagnostics.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca3781b0cef169c9b5117d150bb7aaf06364ccfe61591a1c0a17b210078de95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruff/src/commands/version.rs:8-21 | crates/ty/src/lib.rs:80-93 \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/ruff/src/commands/version.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2580d9e28b8e0699d5ed1e4d3b68e1a9ff041d1045535d8e060e67661d7dce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruff_python_semantic/src/analyze/imports.rs:94-107 | crates/ruff_python_semantic/src/analyze/imports.rs:115-124 \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/ruff_python_semantic/src/analyze/imports.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b111a8d65c7df8654a4417bbeaa127b1bc1b2d7b62a698d9bf7c2f0d31df50d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ty_ide/src/docstring/document/google.rs:50-66 | crates/ty_ide/src/docstring/document/numpy.rs:41-56 \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/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a494153c1d136c5d04f6a336b8f586efa42dd333b0dca34baf3fbbb042e34a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ty_python_semantic/src/types/narrow.rs:1435-1452 | crates/ty_python_semantic/src/types/narrow.rs:1464-1483 \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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f8fb9101ab44b2a47d6456b37c444b24779835acf78ccb58814148427f2027"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/ruff_diagnostics/src/fix.rs:68-76 | crates/ruff_diagnostics/src/fix.rs:88-96 | crates/ruff_diagnostics/src/fix.rs:109-117 | crates/ruff_diagnostics/src/fix.rs:133-141 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_diagnostics/src/fix.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80f806af8372c79f73ac785f2eb4f0fc9d78672a101a4f594f1e75f675069bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruff_linter/src/checkers/ast/mod.rs:923-939 | crates/ruff_python_semantic/src/model.rs:1829-1841 \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/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea96dcc3a13bfd0020d0d5fcf605f93924d02f0716028ca7f85e1014eae2d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruff_python_ast/src/nodes.rs:2942-2955 | crates/ruff_python_formatter/src/expression/expr_compare.rs:67-82 \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/ruff_python_ast/src/nodes.rs"},"region":{"startLine":2942}}}],"partialFingerprints":{"codehealthFindingId/v1":"df99c903b839fdc37d91a30a8a3650394b418c3182192d50561c617fdfc366d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ty_ide/src/completion.rs:3227-3235 | crates/ty_ide/src/completion.rs:3244-3252 \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/ty_ide/src/completion.rs"},"region":{"startLine":3227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a18c882eb93189ff21a65103504ab51bb42618aa09f026f666236b62b86ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ty_ide/src/docstring/markdown/structured/google.rs:26-36 | crates/ty_ide/src/docstring/markdown/structured/numpy.rs:30-40 \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/ty_ide/src/docstring/markdown/structured/google.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5739053aae7eda88da777511ea5782da4e88f2341b956483b8a3d51f0ca91d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): crates/ty_python_semantic/src/types/constraints.rs:1401-1412 | crates/ty_python_semantic/src/types/constraints.rs:1439-1450 | crates/ty_python_semantic/src/types/constraints.rs:1493-1503 | crates/ty_python_semantic/src/types/constraints.rs:1535-1545 | crates/ty_python_semantic/src/types/constraints.rs:1547-1558 | crates/ty_python_semantic/src/types/constraints.rs:1560-1571 \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":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"6820d7375d499aebe0b7a1af9ac024d446ca29e20b240e8c7e86d9e8b4948c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/ty_python_semantic/src/types/constraints/variables.rs:824-838 | crates/ty_python_semantic/src/types/constraints/variables.rs:943-957 | crates/ty_python_semantic/src/types/constraints/variables.rs:1200-1214 \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/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc99da018f34341b0f8b9c1cb1f1550893a149b0714caa7c5bc3a37d822b731"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ty_python_semantic/src/types/tuple.rs:2132-2142 | crates/ty_python_semantic/src/types/tuple.rs:2168-2176 \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/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"470079a4d98ef4ddeb1f39b2f2cbdff8af02225acc55427f31886639d4da4018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ty_server/src/server/api/traits.rs:112-124 | crates/ty_server/src/server/api/traits.rs:159-171 \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/ty_server/src/server/api/traits.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"07859efeb0611a714362605406b077b26e74610ad742327f9eefa8662f2b45bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruff_linter/src/rules/flake8_bandit/rules/logging_config_insecure_listen.rs:40-55 | crates/ruff_linter/src/rules/pylint/rules/subprocess_popen_preexec_fn.rs:55-72 \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/ruff_linter/src/rules/flake8_bandit/rules/logging_config_insecure_listen.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11c2bac54338b1343f9d00116b4136bbe8564493ad6a542d479433e03324492"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruff_python_ast/src/nodes.rs:1168-1187 | crates/ruff_python_ast/src/nodes.rs:1271-1290 \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/ruff_python_ast/src/nodes.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ad08af66e6416c006be44cb8009e666eb48bf40032356fdf33774f93c204c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/ruff_python_ast/src/nodes.rs:2609-2621 | crates/ruff_python_ast/src/nodes.rs:2631-2643 | crates/ruff_python_ast/src/nodes.rs:2653-2665 | crates/ruff_python_ast/src/nodes.rs:2675-2687 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/nodes.rs"},"region":{"startLine":2609}}}],"partialFingerprints":{"codehealthFindingId/v1":"183bacd69e521055c471efdbb92de33d2fa7447c6604be06e7436d63a86dfc53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruff_python_formatter/src/comments/placement.rs:1256-1273 | crates/ruff_python_formatter/src/comments/placement.rs:1288-1306 \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":"crates/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad494127736f03a706e033107f1da5ccba99b5fc524f386e5cb224fe27037f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruff_python_formatter/src/expression/expr_f_string.rs:40-58 | crates/ruff_python_formatter/src/expression/expr_t_string.rs:40-58 \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/ruff_python_formatter/src/expression/expr_f_string.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e545d8851ec7665c6ccd856f4bb908d597926bdb90251a2d77a8818c938a630"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ruff_python_index/src/multiline_ranges.rs:12-24 | crates/ruff_python_index/src/multiline_ranges.rs:27-39 | crates/ruff_python_trivia/src/comment_ranges.rs:79-91 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_index/src/multiline_ranges.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b90e5dc8b631f6199de31413b7e77a4bc9caa2d1b73c1bb233e8617279e4d37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ty_python_semantic/src/types/typevar.rs:75-83 | crates/ty_python_semantic/src/types/typevar.rs:105-113 \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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea2a1731d0ee961dd3a83577b52a9f507ef412dc8518434133179f833677247"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/unused_async.rs:113-135 | crates/ruff_linter/src/rules/ruff/rules/unused_async.rs:142-161 \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/ruff_linter/src/rules/ruff/rules/unused_async.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e29a8b10b6b7777a7aeab38d5fd415548a12e9396cd4a4873293b1188edbe82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruff_linter/src/rules/flake8_bugbear/rules/return_in_generator.rs:130-145 | crates/ruff_python_parser/src/semantic_errors.rs:2245-2259 \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":"crates/ruff_linter/src/rules/flake8_bugbear/rules/return_in_generator.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b991e0f7b932f5eb85ca4f9493686e9290afa2f08c0ea05b3c356b4ddfcd4159"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:359-372 | crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:380-393 \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/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b710967440bc253c6ccf5656c0b646c064bc0eb878efd41e289ed7e8a90d197"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruff_linter/src/rules/isort/categorize.rs:416-427 | crates/ruff_linter/src/settings/types.rs:890-901 \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/ruff_linter/src/rules/isort/categorize.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"624b568d08a12a94cc230a3dddc10e63fec83a9918e1fd1d5c86cfacd1375efb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruff_python_parser/src/parser/expression.rs:1108-1120 | crates/ruff_python_parser/src/parser/expression.rs:2736-2750 \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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e73b3d40afefd28d07f233939f00ca7f5d2b9d40038371d700845bce130a27b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ty_python_core/src/definition.rs:1320-1326 | crates/ty_python_core/src/definition.rs:1328-1334 \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/ty_python_core/src/definition.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"98344c95af427a54c55434c2f3fa94f29859008d213c7a3e4cbfd32ee57af182"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ty_python_semantic/src/types/call.rs:386-398 | crates/ty_python_semantic/src/types/call.rs:404-416 | crates/ty_python_semantic/src/types/call.rs:422-434 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b24f9d86bd204420946da3796ee164a44b15e0a74b5875989512d53b8653ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ty_python_semantic/src/types/relation.rs:3412-3425 | crates/ty_python_semantic/src/types/relation.rs:3563-3578 \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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":3412}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01be10cb2d02d6ad5a13f279446f209bd5b0c765a3e40cf7787b781a0879e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_today.rs:73-87 | crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_utcfromtimestamp.rs:70-87 | crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_utcnow.rs:69-86 \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/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_today.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00347a1f3503c69b02526bf14e7f9738f0bca6ac58de0b3c3b56e6bc70782b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruff_python_ast/src/expression.rs:117-124 | crates/ruff_python_ast/src/expression.rs:152-159 \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/ruff_python_ast/src/expression.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"409a121b470d63bede1ef6249b74beb43992c02227376d74da1347a1094a9640"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruff_python_ast/src/nodes.rs:1151-1166 | crates/ruff_python_ast/src/nodes.rs:1254-1269 \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/ruff_python_ast/src/nodes.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca349fc5fe8ea44511a5161a8b5c5a7456af4859471be5a3743a1f566daa12af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/ruff_python_formatter/src/comments/map.rs:220-226 | crates/ruff_python_formatter/src/comments/map.rs:229-235 | crates/ruff_python_formatter/src/comments/map.rs:238-244 \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":"crates/ruff_python_formatter/src/comments/map.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1a74a3c6bfe051d133697a6b27b931d6ef369b70ba10854a819ca6dbd7e92a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ty_python_core/src/use_def.rs:1406-1414 | crates/ty_python_core/src/use_def.rs:1420-1428 \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/ty_python_core/src/use_def.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3c76e8949ed47cc6ece7bbb0f1e0a3d6e1c0f218aa521f845bc2790231b512"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/ty_python_semantic/src/types/constraints.rs:481-486 | crates/ty_python_semantic/src/types/constraints.rs:496-501 | crates/ty_python_semantic/src/types/constraints.rs:511-521 \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":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57696c92109cebc4768792c0fe5c46683e8253fc3da91ef5010332c001950b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ty_server/src/session/client.rs:67-75 | crates/ty_server/src/session/client.rs:87-95 \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/ty_server/src/session/client.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de7fab351b9e9763694ff99e94f8c3ea247e67507c48ea59b0c585554baa107"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ty_python_core/src/place.rs:292-301 | crates/ty_python_core/src/place.rs:331-338 \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/ty_python_core/src/place.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"28538b28612789031addef5fd2d3a4e2b7e72e44e847f95229c0a9869f12e77a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ty_python_semantic/src/reachability.rs:585-592 | crates/ty_python_semantic/src/types/context_manager.rs:315-322 \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/ty_python_semantic/src/reachability.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7d6bffb2a7fc44600e29838ad07a5a2e92f4f4dfd0f862f351038b7f5325c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ty_python_semantic/src/types/constraints/sequents.rs:341-349 | crates/ty_python_semantic/src/types/constraints/sequents.rs:356-364 \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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"013e61aa2a46ef254214df270f1567475402dd059b4df5178b350a6ba08bff1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ty_python_semantic/src/types/set_theoretic/builder.rs:2067-2076 | crates/ty_python_semantic/src/types/set_theoretic/builder.rs:2078-2087 \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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec273296cebea470214e449329430333c7fed5f7c062fab7bf1698a88568e2c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ty_python_semantic/src/types/signatures.rs:5439-5449 | crates/ty_python_semantic/src/types/signatures.rs:5497-5507 \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2347fa6dff3346212c03eec0668bb6660b4d2ddf13e07877e7158514c38cb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruff_linter/src/registry/rule_set.rs:295-306 | crates/ruff_linter/src/settings/types.rs:289-300 \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/ruff_linter/src/registry/rule_set.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"7294461b8149730f7aebba8b51cada0633e99d5140d42411716485d67c6fd6bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruff_python_ast/src/visitor/source_order.rs:191-201 | crates/ruff_python_ast/src/visitor/source_order.rs:513-524 \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/ruff_python_ast/src/visitor/source_order.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd02d9eb4928c7236cb11830c23f759ce2468a3f2d89615f9afcff930cb3017"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ty_python_semantic/src/types/diagnostic.rs:4092-4106 | crates/ty_python_semantic/src/types/diagnostic.rs:4353-4368 \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":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":4092}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaecf4b30d1ae764bf747fb8ab27cc097e3f666b079bf0f8ff1f7e3645627624"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ty_python_semantic/src/types/protocol_class.rs:617-627 | crates/ty_python_semantic/src/types/protocol_class.rs:639-650 \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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"f534faff942685a0f677bb9995821ba09805a0b15cc28a8f29883ea998712462"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ty_python_semantic/src/types/set_theoretic.rs:1053-1062 | crates/ty_python_semantic/src/types/set_theoretic.rs:1321-1330 \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/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f8bc6e1e27f8028a398a3aa5d8cf8fe1a108852b3917c21e27557598ee29bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ty_python_semantic/src/types/subclass_of.rs:318-325 | crates/ty_python_semantic/src/types/subclass_of.rs:697-704 \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/ty_python_semantic/src/types/subclass_of.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b475dba717c886259696b6e8c632ddd1ac9cddfccbad67293220537a4d577f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruff_linter/src/rules/flake8_async/rules/yield_in_context_manager_in_async_generator.rs:130-144 | crates/ruff_linter/src/rules/ruff/rules/fallible_context_manager.rs:73-85 \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/ruff_linter/src/rules/flake8_async/rules/yield_in_context_manager_in_async_generator.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37a6006ef04ecdfccc869d1266b662a8414a40a6b32dfedd7d095577325b066"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruff_python_ast/src/comparable.rs:1813-1830 | crates/ruff_python_ast/src/comparable.rs:1945-1962 \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":"crates/ruff_python_ast/src/comparable.rs"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9e27c3b92dd18beb18382871c18979ebaac760b2a30d8512232ed83a2d674a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruff_server/src/server/api/notifications/cancel.rs:16-25 | crates/ty_server/src/server/api/notifications/cancel.rs:17-26 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/notifications/cancel.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e28b4eec62a6eafa0dcf5d8eca0abc9d4ee07cb483364264bfe1ca3e0800d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/ty_python_core/src/use_def.rs:512-520 | crates/ty_python_core/src/use_def.rs:541-549 | crates/ty_python_core/src/use_def.rs:580-588 | crates/ty_python_core/src/use_def.rs:607-615 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/use_def.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"772f1eaa08080f515d2190a54dd0227e49c5183d5dc85368f2b91a99fb0f7d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ty_python_semantic/src/types/class.rs:1212-1221 | crates/ty_python_semantic/src/types/tuple.rs:2687-2696 \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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cbb2a12f5b46de6ece322336ffe3832241dca04a7297f5565d2f9d752c9afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/ty_python_semantic/src/types/class/dynamic_literal.rs:245-255 | crates/ty_python_semantic/src/types/class/enum_literal.rs:172-182 | crates/ty_python_semantic/src/types/class/named_tuple.rs:220-231 | crates/ty_python_semantic/src/types/class/typed_dict.rs:949-959 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/class/dynamic_literal.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc240e8fa55ba637538a9356f2fa371af8a8dc48df2c6195d6920ec65ae3b04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/ty_python_semantic/src/types/diagnostic.rs:3888-3899 | crates/ty_python_semantic/src/types/diagnostic.rs:3922-3933 | crates/ty_python_semantic/src/types/diagnostic.rs:4831-4840 | crates/ty_python_semantic/src/types/diagnostic.rs:4847-4856 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":3888}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a06f93d8731f88cf1154930306e0daad48e1575178339cc6a2d1f2cbbcfda3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruff_formatter/src/builders.rs:1727-1735 | crates/ruff_formatter/src/builders.rs:2251-2259 \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/ruff_formatter/src/builders.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbc1b998cfad78504a58b5a7bebd7367425d3c777c4f3faa5ffc90678d490fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruff_linter/src/rules/pyupgrade/rules/convert_typed_dict_functional_to_class.rs:305-319 | crates/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs:262-274 \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/ruff_linter/src/rules/pyupgrade/rules/convert_typed_dict_functional_to_class.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"83df705d1e5f4435f38b61042fb945961432aadf099d60b67903d82695947e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/non_octal_permissions.rs:173-183 | crates/ruff_linter/src/rules/ruff/rules/non_octal_permissions.rs:197-207 \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/ruff_linter/src/rules/ruff/rules/non_octal_permissions.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54e3329721ad39d35f296aa3a155b10bfb61a5cc0212587266c4022b12e5f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ty_python_semantic/src/types/display.rs:331-338 | crates/ty_python_semantic/src/types/display.rs:2675-2683 \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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0415cb2c0527439600856b6bbf01a86fc7205b0334e680971bcd70c552176ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ty_python_semantic/src/types/infer.rs:924-932 | crates/ty_python_semantic/src/types/infer.rs:971-979 \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/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db3b511e8a4fbc23ffa424ed29c979e17665822170bc6c931b03c8ff71f7a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs:173-180 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_regular_expression.rs:334-341 \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/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"602ab54728b7b0762c8ece294e53cf0c9104da6c016a842b2a88a5c243b84d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:56-69 | crates/ruff_linter/src/rules/refurb/rules/write_whole_file.rs:56-69 \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/ruff_linter/src/rules/refurb/rules/read_whole_file.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"17aeedad4a0730d223a6aa7a4fb9ff5295cf0a7c4d688d55376bea722a6a2ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ty_module_resolver/src/resolve/search.rs:964-974 | crates/ty_module_resolver/src/resolve/search.rs:980-990 \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/ty_module_resolver/src/resolve/search.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c838329a5c42d9afae88b69732b36b20d37cf5d02be2fd5090eac8a5dbd54cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruff_python_ast/src/token/tokens.rs:148-162 | crates/ruff_python_ast/src/token/tokens.rs:204-215 \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/ruff_python_ast/src/token/tokens.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"916dba59998d59755d71d1acdc55008cb021790257dfb4facbb43393ccb1f819"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruff_server/src/server/api/requests/format.rs:77-92 | crates/ruff_server/src/server/api/requests/format_range.rs:43-52 \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/ruff_server/src/server/api/requests/format.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"955f7fc985752ed8068d97dcfafe8615b9f58a6a8d899e0af54537de61eeaeec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ty_python_semantic/src/types/diagnostic.rs:4036-4047 | crates/ty_python_semantic/src/types/diagnostic.rs:4076-4086 \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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":4036}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6505bb8b002a16c647abb93db4d1ce7b1ab8be74f061cd5f2104310ac1b2df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ty_python_semantic/src/types.rs:2372-2384 | crates/ty_python_semantic/src/types/protocol_class.rs:1436-1446 \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/ty_python_semantic/src/types.rs"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"564b14ba38ad72446914d833b944c1aad5cd63e9ada3562361718bba0e05a09a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ty_python_semantic/src/types/function.rs:2191-2199 | crates/ruff_python_ast/src/helpers.rs:1266-1273 \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/ty_python_semantic/src/types/function.rs"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c111f6b52c9f540da7de203281a72bdce5e289c476419c091b98682524576f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/ruff_linter/src/rules/flake8_bugbear/rules/duplicate_exceptions.rs:102-110 | crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs:1258-1267 | crates/ruff_linter/src/rules/pyupgrade/rules/unnecessary_builtin_import.rs:52-61 \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/ruff_linter/src/rules/flake8_bugbear/rules/duplicate_exceptions.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7f7923e8222cfa18fd7870d3acc13714487338f2f88a0f8dc20df383bdb74c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruff_linter/src/rules/flake8_bugbear/rules/loop_iterator_mutation.rs:255-271 | crates/ruff_linter/src/rules/flake8_bugbear/rules/loop_iterator_mutation.rs:305-321 \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/ruff_linter/src/rules/flake8_bugbear/rules/loop_iterator_mutation.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7455b03ccec713100db4924c5182b09bfb925d16ef15ed1dde0059b3b3d53b98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruff_linter/src/rules/flake8_pyi/rules/numeric_literal_too_long.rs:50-60 | crates/ruff_linter/src/rules/flake8_pyi/rules/pass_statement_stub_body.rs:44-54 \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/ruff_linter/src/rules/flake8_pyi/rules/numeric_literal_too_long.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"78599f16d3bb7df76dd15fca2a7d3de86253119e11b82248381d97e24ea8d558"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs:453-468 | crates/ruff_python_semantic/src/analyze/typing.rs:1012-1027 \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/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1c57a4e6aefc58639b3903b7988890ccc9a69c430e16f5f4ab363ed9fca033"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruff_linter/src/rules/pylint/rules/stop_iteration_return.rs:97-106 | crates/ruff_linter/src/rules/pyupgrade/rules/context_manager_iterator.rs:240-249 \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/ruff_linter/src/rules/pylint/rules/stop_iteration_return.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b9f40dbdd928665529ddb22607d5cafbfa9a67bced250cc1af881678b22636"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/ruff_python_ast/src/comparable.rs:293-306 | crates/ruff_python_ast/src/comparable.rs:1551-1564 | crates/ruff_python_ast/src/comparable.rs:1787-1802 \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":"crates/ruff_python_ast/src/comparable.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adad02c14b3d59fedf596e2d441fd56458f339d6a411189b4bd216860a7dcbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ty_python_semantic/src/types/cyclic.rs:899-908 | crates/ty_python_semantic/src/types/cyclic.rs:1071-1080 \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/ty_python_semantic/src/types/cyclic.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"3396c12eab9c22d781f7a264550869966e404c2dd713c816190ee3b48d8cc91f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/mdtest/src/lib.rs:276-286 | crates/ty_server/src/server/api/requests/execute_command.rs:104-114 \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/mdtest/src/lib.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0478c99cb963976c188025cc7ccc306c1105b96ee1602202aa7480a282af8db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_expr.rs:69-76 | crates/ruff_linter/src/rules/flake8_simplify/rules/zip_dict_keys_and_values.rs:58-65 \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/ruff_linter/src/rules/flake8_simplify/rules/ast_expr.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42397c0405ff0b007f9cf1b9ffad369499586d7dba0ef866bcf5cb676feadd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_expr.rs:112-119 | crates/ruff_linter/src/rules/flake8_simplify/rules/zip_dict_keys_and_values.rs:49-56 \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/ruff_linter/src/rules/flake8_simplify/rules/ast_expr.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e2604473a499c8308ffbeaed3f0c7a66fb2107feb46aff8b1f02c90c11c2e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ty_python_semantic/src/types/class/slots.rs:195-201 | crates/ruff_python_ast/src/helpers.rs:65-71 \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/ty_python_semantic/src/types/class/slots.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"85341cf272531e00df7268f9a8eda62dcaec7591fe1a2ee85c23e3af8b02700d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ty_python_semantic/src/types/infer/builder.rs:2153-2158 | crates/ty_python_semantic/src/types/infer/builder.rs:2194-2204 \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e82a7ec86f85bd9313f7d79fb8628f825ff6d43b611c7cc915bf5441c9fe16a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_remove.rs:67-91 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_rmdir.rs:67-91 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_unlink.rs:67-91 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 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/ruff_linter/src/rules/flake8_use_pathlib/rules/os_remove.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dae6d42a02c59ac275ec7ad3d83a59085054690790ccc928bedf71796b59ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ty_python_core/src/frozen.rs:219-226 | crates/ty_python_core/src/frozen.rs:251-259 \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/ty_python_core/src/frozen.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e910f357dbb7dee78523dd0a844467c95608d97e0eb1e13e449210a2245d21eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/sort_dunder_slots.rs:367-371 | crates/ruff_linter/src/rules/ruff/rules/sequence_sorting.rs:209-213 \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/ruff_linter/src/rules/ruff/rules/sort_dunder_slots.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab1578624da865381046dd7bea40494b480ae1a3297b537501ed54c8db41f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ty_python_semantic/src/types/display.rs:2685-2693 | crates/ty_python_semantic/src/types/signatures.rs:1141-1146 \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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2685}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45524a3c9448c8ea53342bdb0d1795067d0819b82b739a4484e5772f5e8ab89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ty_python_semantic/src/types/protocol_class.rs:1243-1258 | crates/ty_python_semantic/src/types.rs:2619-2630 \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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2d21104fedde16ed9d0463b397b77547fab53a476dc3489250aa11932d7207"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruff_linter/src/rules/flake8_annotations/helpers.rs:123-129 | crates/ruff_python_ast/src/helpers.rs:1157-1165 \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/ruff_linter/src/rules/flake8_annotations/helpers.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53ea929c8776123b38223047cd2fecee1cae2fca04df91b665ef301255174a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruff_linter/src/rules/flake8_type_checking/helpers.rs:283-294 | crates/ruff_python_semantic/src/analyze/visibility.rs:44-61 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_type_checking/helpers.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dc177baebfd29fd80df297ee5a0707114facf66783772c9885d47343b6b958"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruff_linter/src/rules/flake8_datetimez/rules/call_date_fromtimestamp.rs:68-79 | crates/ruff_linter/src/rules/flake8_datetimez/rules/call_date_today.rs:68-76 \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/ruff_linter/src/rules/flake8_datetimez/rules/call_date_fromtimestamp.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d119e296c065a1341b0938cd93c7918b221577769f373989850171bab7174189"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/ruff_python_ast/src/node.rs:100-113 | crates/ruff_python_ast/src/visitor.rs:819-833 | crates/ruff_python_ast/src/visitor/transformer.rs:833-847 \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":"crates/ruff_python_ast/src/node.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6991db85beaea9603c4b42e650b61f39afa1ed8a837d90c154e69c143cffaf07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruff_linter/src/rules/pylint/rules/if_stmt_min_max.rs:72-82 | crates/ruff_linter/src/rules/refurb/rules/if_expr_min_max.rs:74-85 \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/ruff_linter/src/rules/pylint/rules/if_stmt_min_max.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"feac963ac680544347bcdb5c750872c9b7e90b8055cdbef98fdf4dd0e6f669fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ty_python_core/src/narrowing_constraints.rs:238-251 | crates/ty_python_core/src/reachability_constraints.rs:377-390 \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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e00f019e25a2306f8556c1229e6f541deb848df63be13156b3281d6e6fcc6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ty_server/src/document/range.rs:105-110 | crates/ty_wasm/src/lib.rs:1139-1148 \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/ty_server/src/document/range.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec980bb35b9f3b18e6342dbc414f525c0e0c67d97dee860d338ae05ac5ea6790"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruff_server/src/edit/range.rs:119-125 | crates/ty_server/src/document/range.rs:349-355 \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/ruff_server/src/edit/range.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e18f36a87ba2ef1d26e3f23ba1ebd1ac1c8cab3d34daa3e6f8f71ccf19d112"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:198-204 | crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs:226-232 \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/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b7dac402439a49b175fa03e1277b8f0c2ba072b375fc84fa0e7dd4f998b0f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruff_server/src/server/schedule.rs:21-31 | crates/ty_server/src/server/schedule.rs:23-31 \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/ruff_server/src/server/schedule.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1468076155979b7b5cd87017eaddf8451c152c0b79a746a1945525e797e3d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruff_linter/src/rules/flake8_simplify/rules/enumerate_for_loop.rs:204-212 | crates/ruff_linter/src/rules/perflint/rules/try_except_in_loop.rs:127-135 \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/ruff_linter/src/rules/flake8_simplify/rules/enumerate_for_loop.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3fa4ee9df3aad3bc1b3232e13159d147acddf86d6429654938b110255c5b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruff_python_formatter/src/other/comprehension.rs:155-163 | crates/ruff_python_formatter/src/statement/stmt_for.rs:16-24 \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/ruff_python_formatter/src/other/comprehension.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3136e0448ba96dae650da74c93e7ca65e872245e65a400f7f617be50e08af091"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruff_server/src/session/index.rs:380-385 | crates/ruff_server/src/session/index/ruff_settings.rs:391-398 \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/ruff_server/src/session/index.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"da18d8951773d7d816c8224992b662f90e821212ca49ea236a63f0eb84d4a52b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruff_linter/src/rules/ruff/rules/renamed_rule.rs:70-85 | crates/ruff_linter/src/rules/ruff/rules/rule_codes_in_selectors.rs:67-81 \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":"crates/ruff_linter/src/rules/ruff/rules/renamed_rule.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6063718cf672aad959488131a1aea6de1a34825a60edf8009cf39bffa223f66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ty_ide/src/docstring/document/google.rs:340-349 | crates/ty_ide/src/docstring/document/numpy.rs:241-250 \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/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6b557f591789e461c656b295b4005f4db776414d78d0ae7dd0b59e5d3d9402"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ty_python_semantic/src/types.rs:2048-2053 | crates/ty_python_semantic/src/types/function.rs:245-250 \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/ty_python_semantic/src/types.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"34494d7bd616d848f856358faf658f9cc984ca1af616c94bd2b9b2347d835dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ruff_server/src/server/api/requests/format.rs:29-41 | crates/ruff_server/src/server/api/requests/format_range.rs:24-36 | crates/ruff_server/src/server/api/requests/hover.rs:31-43 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/requests/format.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dbb847f520ebe696a15440747aaa2881005dfcb1d29e13676c9e892b134a6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruff_linter/src/rules/flake8_simplify/rules/suppressible_exception.rs:69-81 | crates/ruff_linter/src/rules/ruff/rules/needless_else.rs:81-87 \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/ruff_linter/src/rules/flake8_simplify/rules/suppressible_exception.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce66c5b3971ae90f7b68cf80b6137bebaaaab5508cc76fbd1ac8c93d36060adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruff_linter/src/rules/pylint/rules/global_statement.rs:58-69 | crates/ruff_linter/src/rules/pylint/rules/nonlocal_and_global.rs:59-72 \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/ruff_linter/src/rules/pylint/rules/global_statement.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9175aa7336ada4c68ae781c9fbbfb202194aef7ec309e98e8e17727556f6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ty_server/src/server/api/requests/diagnostic.rs:82-91 | crates/ty_server/src/server/api/requests/workspace_diagnostic.rs:213-221 \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/ty_server/src/server/api/requests/diagnostic.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6046755c269b957fbb9494b6cfd5a9c49079e18cce26b55d550ae27b9c332b1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruff_linter/src/rules/flake8_pyi/rules/prefix_type_params.rs:19-25 | crates/ruff_linter/src/rules/pylint/rules/type_param_name_mismatch.rs:143-150 \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/ruff_linter/src/rules/flake8_pyi/rules/prefix_type_params.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82b7e1f4a749ef29005cbb3c9d8c7cd6c081ec586687c0bccbd855aaf10ebc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ty_python_semantic/src/types/function.rs:1197-1208 | crates/ty_python_semantic/src/types/signatures.rs:741-750 \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/ty_python_semantic/src/types/function.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b73d8ed3579f2871a284cdb84eaacab24b94e67236031394e1c72ee6ce5d80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruff_python_semantic/src/analyze/class.rs:493-498 | crates/ruff_python_semantic/src/analyze/typing.rs:50-56 \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/ruff_python_semantic/src/analyze/class.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda7048f68189a472e151784c76ce0d673ee3b82aff1ef1b15513c0d18165427"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ty_python_semantic/src/types/class/named_tuple.rs:184-191 | crates/ty_python_semantic/src/types/class/typed_dict.rs:919-927 \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/ty_python_semantic/src/types/class/named_tuple.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83a7be35ddf08c49f834a02439ba759144990953ac48ac7b244b48e7edff503"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruff_linter/src/rules/flake8_pyi/rules/redundant_literal_union.rs:55-65 | crates/ruff_linter/src/rules/pylint/rules/if_stmt_min_max.rs:60-70 \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/ruff_linter/src/rules/flake8_pyi/rules/redundant_literal_union.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cce622a548987b978380e702f327dd52614cef4021ccc4b3058e77ef5b9f7fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ty_ide/src/docstring/document/google.rs:585-591 | crates/ty_ide/src/docstring/document/numpy.rs:509-515 \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/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bbb29dfa1f8744fcc98bcfd6dcd9999282524c8d88db371bc00ad46181d3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ty_ide/src/docstring/document/google.rs:661-667 | crates/ty_ide/src/docstring/document/numpy.rs:729-735 \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/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec0a1e070ec858e27d84e116b572dee1ec546a068638af5979f77604cfc7440"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ty_ide/src/semantic_tokens.rs:1380-1389 | crates/ty_ide/src/symbols.rs:1584-1591 \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/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65ee6b87fe66a6f2e45a2d6937c1259b0401f893eba529ff2630f052c135f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ty_python_semantic/src/types/class.rs:3412-3418 | crates/ty_python_semantic/src/types/type_alias.rs:1015-1021 \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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":3412}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b2add827227a619c4fddf75463456f15fff0ac565448ae65a92a3da6df65a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruff_linter/src/rules/flynt/rules/static_join_to_fstring.rs:50-57 | crates/ruff_linter/src/rules/refurb/rules/bit_count.rs:57-64 \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/ruff_linter/src/rules/flynt/rules/static_join_to_fstring.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7e2bb00468fad01021a997d9c40afe710cbcc5115f6af555f0a58bd0f733f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruff_server/src/edit/text_document.rs:152-156 | crates/ty_server/src/document/text_document.rs:150-154 \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/ruff_server/src/edit/text_document.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"30174bd00e99a25358c4b7e6985851a7662bb0c6bedfd022cdfe820d24199276"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ty_python_core/src/builder.rs:412-421 | crates/ty_python_core/src/lib.rs:720-729 \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/ty_python_core/src/builder.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da78bd650667be6858fdb314313cbd13dfcdc4037a78657a7e2a3c3f28a0767"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruff_linter/src/rules/airflow/helpers.rs:303-308 | crates/ruff_linter/src/rules/airflow/rules/variable_get_outside_task.rs:138-146 \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/ruff_linter/src/rules/airflow/helpers.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"222991e2e937592455be25b4afaed15df69a08d3e689cd85ea42b7e2891d7c43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruff_linter/src/rules/flake8_django/rules/locals_in_render_function.rs:68-73 | crates/ruff_python_semantic/src/analyze/typing.rs:782-787 \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/ruff_linter/src/rules/flake8_django/rules/locals_in_render_function.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa208791ec78f1d2bb48e42cef80f5b37d2faea8bb6b9766b2acce4c6faf5387"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/ty_python_semantic/src/types/dedicated/django.rs:20-26 | crates/ty_python_semantic/src/types/dedicated/pydantic.rs:619-624 | crates/ty_python_semantic/src/types/dedicated/pytest/collection.rs:436-441 \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":"crates/ty_python_semantic/src/types/dedicated/django.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59ccc3b4c0d90582ee54459439e42d4bbf0cd486d5464e9ece0962f353bf4e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/mdtest/src/matcher.rs:77-81 | crates/ruff_db/src/system/command.rs:74-79 \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/mdtest/src/matcher.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a033fcff23a38b52fee33a46de4e35df8c036b6914509d0617cd089883cb5cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruff_server/src/session/client.rs:175-180 | crates/ty_server/src/session/client.rs:207-214 \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/ruff_server/src/session/client.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec2d716a8253be0b0f7236038358a2de83ef91b94880250492ad517f26b2bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruff_linter/src/rules/flake8_pyi/rules/unrecognized_version_info.rs:251-259 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_iterable_allocation_for_first_element.rs:134-142 \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/ruff_linter/src/rules/flake8_pyi/rules/unrecognized_version_info.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"082bd4fa8caf03cba9e8b1549ebcd3827a8aaf0ab4c30910a2d94cdc762215f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/ty_python_semantic/src/types/class.rs:1612-1615 | crates/ty_python_semantic/src/types/class/dynamic_literal.rs:263-266 | crates/ty_python_semantic/src/types/class/static_literal.rs:1294-1297 \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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fe250f84255b016898292a836e65843e26eaf01267af90876f115a6bce5f92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ty_python_semantic/src/types/class.rs:1349-1353 | crates/ty_python_semantic/src/types/ide_support.rs:539-544 \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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f3c39db3445c6647fde0d30f08730ce730a19a157be27b251d09ee8a9592dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (217 lines \u00D7 2): crates/ruff_python_ast/src/visitor.rs:136-352 | crates/ruff_python_ast/src/visitor/transformer.rs:123-339 \u2014 before extracting anything, compare \u0060crates/ruff_python_ast/src/visitor.rs\u0060 and \u0060crates/ruff_python_ast/src/visitor/transformer.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 538 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/visitor.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e13ad7fd4d80903a4149e2bb7ba5138d3810aed67fd303b4a18c42edab7963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (152 lines \u00D7 2): crates/ruff_python_ast/src/visitor.rs:363-514 | crates/ruff_python_ast/src/visitor/transformer.rs:350-501 \u2014 before extracting anything, compare \u0060crates/ruff_python_ast/src/visitor.rs\u0060 and \u0060crates/ruff_python_ast/src/visitor/transformer.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 538 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 \u0060crates/ruff_python_ast/src/visitor.rs:363\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/ruff_python_ast/src/visitor.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a244180cb41313f893f00ef86ea87dc6c71c890c98914d3c0f4601be7129d0cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (77 lines \u00D7 2): crates/ruff_python_ast/src/visitor.rs:555-631 | crates/ruff_python_ast/src/visitor/transformer.rs:551-627 \u2014 before extracting anything, compare \u0060crates/ruff_python_ast/src/visitor.rs\u0060 and \u0060crates/ruff_python_ast/src/visitor/transformer.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 538 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 \u0060crates/ruff_python_ast/src/visitor.rs:555\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/ruff_python_ast/src/visitor.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"126d8fae4b0a3e93821a399621906a2f829813e69698daad2f6caae755576acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): crates/ruff_server/src/server/schedule/thread/priority.rs:179-223 | crates/ty_server/src/server/schedule/thread/priority.rs:179-223 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/schedule/thread/priority.rs\u0060 and \u0060crates/ty_server/src/server/schedule/thread/priority.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/schedule/thread/priority.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b25ae2a0c87903ab970543d1f689ee5728b5f1362c002f3dd738a9006c1b52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): crates/ruff_server/src/server/schedule/thread/priority.rs:226-270 | crates/ty_server/src/server/schedule/thread/priority.rs:226-270 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/schedule/thread/priority.rs\u0060 and \u0060crates/ty_server/src/server/schedule/thread/priority.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/schedule/thread/priority.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7485b58d2133bac9b0d76183ce4990280ab00ccf7f3c90b0fb9b22029a2cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs:598-637 | crates/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs:656-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs:598\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/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"2822d97cf9fb5c4807568c6f8a385fdf2675c6d5404a02819437913c29768d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201340 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/unnecessary_encode_utf8.rs:186-222 | crates/ruff_linter/src/rules/pyupgrade/rules/unnecessary_encode_utf8.rs:226-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pyupgrade/rules/unnecessary_encode_utf8.rs:186\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/ruff_linter/src/rules/pyupgrade/rules/unnecessary_encode_utf8.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"068b0290414be63b046e0da8be62802f0069bbb67983e91c8493ea08f026c827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/subscript.rs:843-881 | crates/ty_python_semantic/src/types/infer/builder/subscript.rs:931-969 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f776fc0357ca76806b5dce4cd395ed62e1efcd7f913a637b28ab4b59b41d3def"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201338 lines \u00D7 2): crates/ruff_python_semantic/src/analyze/terminal.rs:193-230 | crates/ruff_python_semantic/src/analyze/terminal.rs:251-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_semantic/src/analyze/terminal.rs:193\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/ruff_python_semantic/src/analyze/terminal.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"da295f682e2f31e34e6c1dd7fb73a3c8401160c4734a92d6b74585f61f706036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): crates/ruff_python_ast/src/visitor.rs:708-744 | crates/ruff_python_ast/src/visitor/transformer.rs:722-758 \u2014 before extracting anything, compare \u0060crates/ruff_python_ast/src/visitor.rs\u0060 and \u0060crates/ruff_python_ast/src/visitor/transformer.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 538 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/visitor.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"406b183ddf295541e4600e9313863c8493003e5e9be1ee391b17372a0acea7d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201337 lines \u00D7 2): crates/ruff_python_formatter/src/verbatim.rs:284-319 | crates/ruff_python_formatter/src/verbatim.rs:363-399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/verbatim.rs:284\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":"crates/ruff_python_formatter/src/verbatim.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"936ce994b80862bddc62c73ddfa26d095348200e514a400b397e8470f4a5d3ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): crates/ruff_linter/src/rules/ruff/rules/invalid_formatter_suppression_comment.rs:290-325 | crates/ruff_python_formatter/src/range.rs:670-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruff_python_formatter/src/range.rs:706\u0060 calls \u0060FString\u0060, \u0060StringLiteral\u0060, \u0060TString\u0060 and \u0060crates/ruff_linter/src/rules/ruff/rules/invalid_formatter_suppression_comment.rs:326\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/ruff_linter/src/rules/ruff/rules/invalid_formatter_suppression_comment.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed22646fc7759ec8ddf88cfc9f2b1fdd0c111efa89c4f68887f7b4f1dba3f149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 4): crates/ty_python_semantic/src/types/set_theoretic/builder.rs:880-914 | crates/ty_python_semantic/src/types/set_theoretic/builder.rs:937-971 | crates/ty_python_semantic/src/types/set_theoretic/builder.rs:996-1030 | crates/ty_python_semantic/src/types/set_theoretic/builder.rs:1075-1109 \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/ty_python_semantic/src/types/set_theoretic/builder.rs:880\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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdbd49b7dfece317eaafdbe5cec53343378f57cf35abad6dbb16806b82cdd76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/ruff_python_ast/src/visitor.rs:755-789 | crates/ruff_python_ast/src/visitor/transformer.rs:769-803 \u2014 before extracting anything, compare \u0060crates/ruff_python_ast/src/visitor.rs\u0060 and \u0060crates/ruff_python_ast/src/visitor/transformer.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 538 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/visitor.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eec482e7b25eabb5f0ffb4bd124b5a4ffb45c1759393d11cd9df369392e25bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201334 lines \u00D7 3): crates/ty_python_semantic/src/types/signatures.rs:3571-3603 | crates/ty_python_semantic/src/types/signatures.rs:3764-3796 | crates/ty_python_semantic/src/types/signatures.rs:3936-3969 \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/ty_python_semantic/src/types/signatures.rs:3571\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3571}}}],"partialFingerprints":{"codehealthFindingId/v1":"50862f2f6d715d724dd8e18d33f708e99b8155c364347c0d4a25fac3a0db1654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201333 lines \u00D7 2): crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs:1594-1610 | crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs:1677-1709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pydocstyle/rules/sections.rs:1594\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/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb94472f2d43d72b721e1bb7cc12907dc5019cbde6f406d8a402b8b99dce3b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): crates/ty_ide/src/goto.rs:550-582 | crates/ty_ide/src/goto.rs:821-853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_ide/src/goto.rs:550\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/ty_ide/src/goto.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba9bff8dd2d0c93471a8ea90969242670a699a51652e2c7cdf1d61743f06b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201332 lines \u00D7 2): crates/ty_python_semantic/src/types.rs:8548-8579 | crates/ty_python_semantic/src/types.rs:8597-8626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types.rs:8548\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/ty_python_semantic/src/types.rs"},"region":{"startLine":8548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef00143d6477366cbb34f6f63273823ebb0f77bf6d937aea07d9692f703785e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs:73-103 | crates/ruff_linter/src/rules/flake8_async/rules/long_sleep_not_forever.rs:66-96 \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":"crates/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"75566fa634888e92800d9ce647b9d2b908d2c1cb11475d96c46fd79e6fcbd8bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201331 lines \u00D7 2): crates/ruff_linter/src/rules/isort/order.rs:59-84 | crates/ruff_linter/src/rules/isort/order.rs:197-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/isort/order.rs:197\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":"crates/ruff_linter/src/rules/isort/order.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed80a2971e2ab400c083852fb86a8ad0c7f5f403eec3fbef5aeb27f11fd3a6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201331 lines \u00D7 2): crates/ruff_python_formatter/src/statement/stmt_assign.rs:387-414 | crates/ruff_python_formatter/src/statement/stmt_assign.rs:473-503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/statement/stmt_assign.rs:387\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/ruff_python_formatter/src/statement/stmt_assign.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"102d417e52b9dbae279559dd5d3d94855a2b6ac28ac17cd3a5b39cb3519d6f65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): crates/ruff_python_formatter/src/statement/stmt_assign.rs:816-846 | crates/ruff_python_formatter/src/statement/stmt_assign.rs:957-986 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/statement/stmt_assign.rs:816\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/ruff_python_formatter/src/statement/stmt_assign.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d4ca717e3338d95dc47faf4cdc1a17fceecfb76b25d9a5de3c575fd14fff9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:179-208 | crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:281-310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:179\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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8e4f14d1a1e31faf0cb4b61a680391403bfd500587377d4faa3c05bbfccbe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/ruff_python_formatter/src/other/f_string.rs:18-47 | crates/ruff_python_formatter/src/other/t_string.rs:18-47 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026FString\u0060 in one and \u0060\u0026TString\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":"crates/ruff_python_formatter/src/other/f_string.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"15688bb3d4e1127cff3a7bb99d42ead7231e767806f45b5ec8f3aca064da79ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): crates/ruff_linter/src/linter.rs:372-400 | crates/ruff_linter/src/linter.rs:441-469 | crates/ruff_linter/src/linter.rs:551-579 \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/ruff_linter/src/linter.rs: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":"crates/ruff_linter/src/linter.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f97def45092c8ce6394834187ddf13e38da8b8a345a7c21b486d5716e061ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/ruff_workspace/src/configuration.rs:1499-1527 | crates/ruff_workspace/src/options.rs:4499-4527 \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 \u0060crates/ruff_workspace/src/configuration.rs:1499\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/ruff_workspace/src/configuration.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"82587a2adea0169800c104d1932ff81328625afad56f50cc6a8089e8609373ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:3591-3619 | crates/ty_python_semantic/src/types/signatures.rs:4481-4509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/signatures.rs:3591\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3591}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85b117149437c20f3c38123ec360c678acc8278fcc984b3ad51b4db9fab32d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruff_annotate_snippets/src/renderer/render.rs:2220-2247 | crates/ruff_annotate_snippets/src/renderer/render.rs:2250-2277 \u2014 both copies are in the same file, so extract the block 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/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd30fd53726105b0a44984ddee7022d3409ed255586013f99f1a95c386d3f1f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): crates/ruff_linter/src/suppression.rs:1092-1117 | crates/ty_python_semantic/src/suppression.rs:791-818 \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/ruff_linter/src/suppression.rs:1092\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/ruff_linter/src/suppression.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"09431090c033b7cc0d8b581e0721220e59bc509673d50b379fcf2faa044ba3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruff_server/src/server/main_loop.rs:58-85 | crates/ty_server/src/server/main_loop.rs:60-87 \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/ruff_server/src/server/main_loop.rs:58\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/ruff_server/src/server/main_loop.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"af21942de0cfc970054c47b6648abba49123c4788152a9ab19ae9a0e9bfb85d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs:1155-1182 | crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs:1183-1210 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b77bb418292cd4855f363cfc8b58ccf79b17a0ed178e9859e0c71f4036cbd8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:255-279 | crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:314-340 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs\u0060 and \u0060crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 125 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 \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:255\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/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d9a75b1f0f6bb387db5522f90b1d5d773e9085bc674ca200857dbd660fca1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:139-165 | crates/ruff_linter/src/rules/perflint/rules/manual_list_copy.rs:66-92 \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 \u0060crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:139\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/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c980a56f96f8f863b4b0f8817dcdfe6f5094f66a30d25b335ff63a6936b5abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:3807-3833 | crates/ty_python_semantic/src/types/signatures.rs:4516-4542 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/signatures.rs:3807\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3807}}}],"partialFingerprints":{"codehealthFindingId/v1":"e200634fad58b98c24d5189079430bfb1991d19a51eb7b00414fde3c7f98c50e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201326 lines \u00D7 3): crates/ruff_python_parser/src/parser/statement.rs:3288-3313 | crates/ruff_python_parser/src/parser/statement.rs:3732-3753 | crates/ruff_python_parser/src/parser/statement.rs:3795-3818 \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":"crates/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":3288}}}],"partialFingerprints":{"codehealthFindingId/v1":"071e633d3861c03212083c5e0c9cffb753f9772e598489ed54b89987f25fcaa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/ruff_linter/src/rules/isort/normalize.rs:115-140 | crates/ruff_linter/src/rules/isort/normalize.rs:168-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/isort/normalize.rs:115\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/ruff_linter/src/rules/isort/normalize.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ddbd331f83f2c80a5cca2bdac510cc664b2a242a99987b483381204d3947ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/ruff_linter/src/rules/pydocstyle/rules/ends_with_period.rs:74-99 | crates/ruff_linter/src/rules/pydocstyle/rules/ends_with_punctuation.rs:68-93 \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 \u0060crates/ruff_linter/src/rules/pydocstyle/rules/ends_with_period.rs:74\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/ruff_linter/src/rules/pydocstyle/rules/ends_with_period.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"662408e9214601043a138e52fb318ab475733b490a74acc192882e034c397eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/ruff_python_literal/src/escape.rs:185-210 | crates/ruff_python_literal/src/escape.rs:533-558 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_literal/src/escape.rs:185\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/ruff_python_literal/src/escape.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a2b0d5cbd240ceca8bb9be94a6b169647caa26cbe9a1ab82b961afb967b6d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): crates/ty_project/src/db.rs:421-446 | crates/ty_project/src/db.rs:501-525 \u2014 both copies are in the same file, so extract the block 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/ty_project/src/db.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"280c216797f1ae330e3c81d9edd398e7b9cbd026577af2111a057ba3ec0a024f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:12206-12231 | crates/ty_python_semantic/src/types/infer/builder.rs:12834-12859 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":12206}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f9c62c3ba516d5c8d6d0b38c1be99e23276dad6f2d3bdca61ee64eb794578f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201326 lines \u00D7 2): crates/ty_server/src/server/api/requests/folding_range.rs:32-54 | crates/ty_server/src/server/api/requests/semantic_tokens.rs:31-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 both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api/requests/folding_range.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ff962b1e6c2f01e944f003f3ba2b7d823e3cea4a63d3f880676537edcad838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/analyze/expression.rs:282-306 | crates/ruff_linter/src/checkers/ast/analyze/expression.rs:408-432 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca44ed507621ec111ffc70a0ff7e3c84f38e9391181215b1076b852d32c9f2ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/useless_class_metaclass_type.rs:63-87 | crates/ruff_linter/src/rules/pyupgrade/rules/useless_object_inheritance.rs:66-90 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pyupgrade/rules/useless_class_metaclass_type.rs:63\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060class_def\u0060 to \u0060\u0026StmtClassDef\u0060 in one and \u0060\u0026ast::StmtClassDef\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":"crates/ruff_linter/src/rules/pyupgrade/rules/useless_class_metaclass_type.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6a87812ee1dd92fdbceac0e41b029838ce12187914598b3bb0d5fcccf0f35c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruff_linter/src/rules/ruff/rules/needless_else.rs:179-203 | crates/ruff_linter/src/rules/ruff/rules/useless_finally.rs:240-264 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/ruff/rules/needless_else.rs\u0060 and \u0060crates/ruff_linter/src/rules/ruff/rules/useless_finally.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/ruff/rules/needless_else.rs:179\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/ruff_linter/src/rules/ruff/rules/needless_else.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"88838d7703ac3421cdea759c4166e45e6697e2ffb73ddea344831550a8c58189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruff_python_formatter/src/statement/stmt_assign.rs:874-898 | crates/ruff_python_formatter/src/statement/stmt_assign.rs:1007-1031 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/statement/stmt_assign.rs:874\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/ruff_python_formatter/src/statement/stmt_assign.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"af75f14966bd963e766bde2d6104de9f622725d4eeb83cb98f37bd6e96cc8a9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruff_server/src/server/api/requests/code_action.rs:196-220 | crates/ruff_server/src/server/api/requests/code_action.rs:231-255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_server/src/server/api/requests/code_action.rs:196\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/ruff_server/src/server/api/requests/code_action.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed40af8f4b57a51c22ca318c3801918696f2d84919019ee42168fdc8ad591e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruff_server/src/server/api/requests/code_action.rs:266-290 | crates/ruff_server/src/server/api/requests/code_action.rs:301-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_server/src/server/api/requests/code_action.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/requests/code_action.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd840cc10ab78d7330c6873dc6d76d0f0d82d3b828307787cc8a6b0a5ec3548d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4): crates/ty_python_semantic/src/types/signatures.rs:3586-3609 | crates/ty_python_semantic/src/types/signatures.rs:3779-3802 | crates/ty_python_semantic/src/types/signatures.rs:3952-3975 | crates/ty_python_semantic/src/types/signatures.rs:4476-4499 \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/ty_python_semantic/src/types/signatures.rs:3586\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3586}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bfa7d05bbe370eefb10bac9db4b0301b5d8a431134de2341e14c27904690b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/ruff/src/commands/rule.rs:61-84 | crates/ruff_server/src/server/api/requests/hover.rs:114-137 \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/ruff/src/commands/rule.rs:61\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/ruff/src/commands/rule.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1915e0b5a684c3f5a22bfe2491b144128409b7dbf616ee244719731b10ff2700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): crates/ruff_dev/src/generate_options.rs:38-73 | crates/ruff_dev/src/generate_ty_options.rs:81-116 \u2014 before extracting anything, compare \u0060crates/ruff_dev/src/generate_options.rs\u0060 and \u0060crates/ruff_dev/src/generate_ty_options.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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 \u0060crates/ruff_dev/src/generate_options.rs:38\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/ruff_dev/src/generate_options.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"690c6cf5ecafc740b1af20cd52c2c5cafaeb107d8dac91fc63406e57a65e7e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pyi/rules/duplicate_union_member.rs:174-197 | crates/ruff_linter/src/rules/flake8_pyi/rules/redundant_numeric_union.rs:341-364 \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":"crates/ruff_linter/src/rules/flake8_pyi/rules/duplicate_union_member.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"104292bbc6ee93129ca2a5b5909a4931ba7c90cb040ff6838426a9eed068b669"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:101-124 | crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:116-136 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs\u0060 and \u0060crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 125 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 \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:101\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/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b615e803e5085eb3529e290160c803eead5b94745bdf4d07d9db08552f2e02b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:323-346 | crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:378-400 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs\u0060 and \u0060crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 125 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":"crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b90e1afeed65765a37c6d9afddea8715dd3314d1c98687e971c2098e1e6917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs:73-96 | crates/ruff_linter/src/rules/pylint/rules/singledispatchmethod_function.rs:63-84 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs\u0060 and \u0060crates/ruff_linter/src/rules/pylint/rules/singledispatchmethod_function.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 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 \u0060crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs:73\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":"crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f727055e6005d791dbf8b79fc694550fdbe77d870ef9b275e0368eb7074ea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/ruff_python_semantic/src/analyze/function_type.rs:95-118 | crates/ruff_python_semantic/src/analyze/function_type.rs:136-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_semantic/src/analyze/function_type.rs:95\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/ruff_python_semantic/src/analyze/function_type.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f5eea434792034d99630f59afa2e0ef8cce43541a725dd7502c1b392c71c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/ruff_server/src/server/schedule.rs:50-73 | crates/ty_server/src/server/schedule.rs:50-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060task\u0060 to \u0060Task\u0060 in one and \u0060task::Task\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":"crates/ruff_server/src/server/schedule.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"187c7dedfc3dd5d2f402ecb1824a34dd6993c0ede93091e68df0e6900e03f0e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/helpers.rs:104-126 | crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs:777-799 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/helpers.rs\u0060 and \u0060crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 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":"crates/ruff_linter/src/rules/airflow/helpers.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5e7e67ec0a979beb2f82ddde2e454a1ccb88b22b04938a1b3acdf253927bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:68-90 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs:64-86 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 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 \u0060crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:68\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/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e71f5d9bd6dcfcceb2c35be59b09dbe839b84ee375b770a728479db965c984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_bugbear/rules/loop_iterator_mutation.rs:372-394 | crates/ruff_linter/src/rules/flake8_bugbear/rules/loop_iterator_mutation.rs:400-419 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_bugbear/rules/loop_iterator_mutation.rs:372\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/ruff_linter/src/rules/flake8_bugbear/rules/loop_iterator_mutation.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b860a911bc833dca2e5bea994d7b912cb595d33d2a33ba30bbaba38a03fa53c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs:143-161 | crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_set.rs:144-166 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_set.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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 \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs:143\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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf00dd10a97719072763e2d583e84a4d1dac87ae9ebdaa57abd6f6f363ee0519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs:108-130 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:558-580 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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 \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs:108\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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d73c311c158d836a0bcf4f9745669dfa550ae2568f9138c11bed3fd248fcb93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/too_many_arguments.rs:98-120 | crates/ruff_linter/src/rules/pylint/rules/too_many_positional_arguments.rs:102-124 \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 \u0060crates/ruff_linter/src/rules/pylint/rules/too_many_arguments.rs:98\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/ruff_linter/src/rules/pylint/rules/too_many_arguments.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"501e9857d7d3401f90f27a0a6a466484a0797452db46da0ecbdd57bd8df23400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): crates/ruff_linter/src/rules/ruff/rules/never_union.rs:93-115 | crates/ruff_linter/src/rules/ruff/rules/never_union.rs:118-135 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/rules/ruff/rules/never_union.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"693d79d03ec4c6fb52ef5701bad386a1095d34599154be40dfd5b58d44442d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): crates/ruff_python_formatter/src/other/arguments.rs:118-140 | crates/ruff_python_formatter/src/pattern/pattern_arguments.rs:82-101 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/ruff_python_formatter/src/other/arguments.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4141a5940d3a51dec49e1b4141d9ebb496a11a9ee644d0e7cdaf578955cbee46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/ruff_server/src/server.rs:385-407 | crates/ty_server/src/server.rs:213-234 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server.rs\u0060 and \u0060crates/ty_server/src/server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 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 \u0060crates/ruff_server/src/server.rs:385\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":"crates/ruff_server/src/server.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"8549ddaee1a8648987fcf79eb50255f2152ab16c4818855e23a7129a8626ce62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs:582-604 | crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs:613-633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/named_tuple.rs:582\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/ty_python_semantic/src/types/infer/builder/named_tuple.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"495ce87e71c302ca34a6fc5dbcbb7b4b9e94ab6cb96764b54c46d2b4101845ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/comparisons.rs:1215-1237 | crates/ty_python_semantic/src/types/infer/comparisons.rs:1248-1269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/comparisons.rs:1215\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/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8d780f62dae1c3687af643567ecd5a574fe6a5f26fc5d7e26515fdb46d15ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:3825-3847 | crates/ty_python_semantic/src/types/signatures.rs:4210-4232 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3825}}}],"partialFingerprints":{"codehealthFindingId/v1":"2317fd50d524222ec6738309ba6f69e2ba2e5f64725cb18db6e01509277dbf0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): crates/ruff_dev/src/generate_json_schema.rs:30-51 | crates/ruff_dev/src/generate_ty_rules.rs:37-58 | crates/ruff_dev/src/generate_ty_schema.rs:30-51 \u2014 before extracting anything, compare \u0060crates/ruff_dev/src/generate_json_schema.rs\u0060 and \u0060crates/ruff_dev/src/generate_ty_schema.rs\u0060 as WHOLE FILES: 88% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_dev/src/generate_json_schema.rs:30\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/ruff_dev/src/generate_json_schema.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e31846e50807bb961fb7181c87c5852fb0e7581ae1e75dc693bcf91cc0d46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/analyze/expression.rs:1539-1560 | crates/ruff_linter/src/checkers/ast/analyze/expression.rs:1570-1591 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/checkers/ast/analyze/expression.rs:1539\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/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb215a4f451eaa740255a984a4141d554e69b14be169113b651cbd0ecea24b05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201322 lines \u00D7 2): crates/ruff_linter/src/noqa.rs:441-456 | crates/ruff_linter/src/noqa.rs:471-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/noqa.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":"crates/ruff_linter/src/noqa.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1253b816175ca4c2ef10120f4d89bcb776b71435a9760cccf1216033dbea64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:321-342 | crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:618-639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:321\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/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9aa75529203732604ff742c01670357ad6bcf4274f87abee556bf2a85c08c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:595-616 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:817-837 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:595\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":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2568ae1b65da44d9b2d2b7f65a0c21ee0c0253470dbffc6fd3ec9ca68bb98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruff_linter/src/rules/ruff/rules/invalid_formatter_suppression_comment.rs:326-347 | crates/ruff_python_formatter/src/range.rs:709-730 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruff_python_formatter/src/range.rs:706\u0060 calls \u0060FString\u0060, \u0060StringLiteral\u0060, \u0060TString\u0060 and \u0060crates/ruff_linter/src/rules/ruff/rules/invalid_formatter_suppression_comment.rs:325\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/ruff_linter/src/rules/ruff/rules/invalid_formatter_suppression_comment.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffab093c6934905e30e29bcf77197bc449f60822b14d5ea2663e53781fa323a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruff_python_semantic/src/model.rs:558-579 | crates/ruff_python_semantic/src/model.rs:710-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_semantic/src/model.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc7d6e82a6cf5d5e8b9382d09aaab84e6db66869e263397ae0656e5cd38813c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruff_server/src/server/schedule/thread/pool.rs:88-109 | crates/ty_server/src/server/schedule/thread/pool.rs:90-112 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/schedule/thread/pool.rs\u0060 and \u0060crates/ty_server/src/server/schedule/thread/pool.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 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 \u0060crates/ruff_server/src/server/schedule/thread/pool.rs:88\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/ruff_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69c71039b8906b98a30db640ed00135bd70f2d0971f80a90638038e4bf6bcc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ty_python_semantic/src/types/context_manager.rs:560-581 | crates/ty_python_semantic/src/types/context_manager.rs:596-617 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/context_manager.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b550202521e31001b8c49b41b7796c62b5ae0141044f9663697712fe3c5395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ty_python_semantic/src/types/infer.rs:2101-2122 | crates/ty_python_semantic/src/types/infer.rs:2349-2370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer.rs:2101\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/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ab2933e10922cc54ba33ad61ac2c7f9a76402ccbd1d4b67c4adb0bf95b092e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2711-2732 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2737-2758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:2711\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cf603956ef26231ac53866e6dd20d6355023ae920ea478cc4ad30fdccb9199"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ty_python_semantic/src/types/set_theoretic.rs:578-599 | crates/ty_python_semantic/src/types/set_theoretic.rs:639-660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/set_theoretic.rs:578\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/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cc5ad4d1d345dc8e01c200f666c545520eafe3d8e4177ac228ae24de636732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:3744-3762 | crates/ty_python_semantic/src/types/signatures.rs:4165-4186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/signatures.rs:3744\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3744}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1f0c8ff0f6f25fe853b99b0a2f5c905872d7f05ca68a55da5030500fa4d3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 6): crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs:52-72 | crates/ruff_linter/src/rules/pylint/rules/invalid_bytes_return.rs:52-72 | crates/ruff_linter/src/rules/pylint/rules/invalid_hash_return.rs:56-76 | crates/ruff_linter/src/rules/pylint/rules/invalid_index_return.rs:58-78 | crates/ruff_linter/src/rules/pylint/rules/invalid_length_return.rs:57-77 | crates/ruff_linter/src/rules/pylint/rules/invalid_str_return.rs:52-72 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs\u0060 and \u0060crates/ruff_linter/src/rules/pylint/rules/invalid_bytes_return.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs:52\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/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae93f12ecfd89e64839c58537e96687d9470877e224a29480fd098670e535ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruff_dev/src/generate_options.rs:113-133 | crates/ruff_dev/src/generate_ty_options.rs:145-165 \u2014 before extracting anything, compare \u0060crates/ruff_dev/src/generate_options.rs\u0060 and \u0060crates/ruff_dev/src/generate_ty_options.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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":"crates/ruff_dev/src/generate_options.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"615889be0fc56c4d92b999070c76683e546f49e96f9a1ac9a9f7d0d56a44a671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruff_linter/src/fix/mod.rs:73-93 | crates/ty_python_semantic/src/fixes.rs:525-545 \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/ruff_linter/src/fix/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ee04013394b5d746d06d60ff49428a1d88270d3aaf7ec6ce0f15e080e83cfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs:288-308 | crates/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs:685-705 \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":"crates/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6644ab3e70e44790b707afebf37d4682a80ce4d53cd99fbf5cc28df8a580c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/unnecessary_dict_index_lookup.rs:136-156 | crates/ruff_linter/src/rules/pylint/rules/unnecessary_list_index_lookup.rs:125-145 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/unnecessary_dict_index_lookup.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0982f421cd2e0af030cdba5b1dd62e8302b6e287aa1d572635921843ad137001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruff_server/src/server/schedule/thread/pool.rs:64-86 | crates/ty_server/src/server/schedule/thread/pool.rs:60-82 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/schedule/thread/pool.rs\u0060 and \u0060crates/ty_server/src/server/schedule/thread/pool.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 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 \u0060crates/ruff_server/src/server/schedule/thread/pool.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":"crates/ruff_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb121b5b79d7eb10a3892ef8438c7d5272bc2390ed07cfaf2b1c1219e80c7b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ty_python_core/src/re_exports.rs:346-366 | crates/ty_python_core/src/re_exports.rs:413-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_core/src/re_exports.rs:346\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/ty_python_core/src/re_exports.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f313af8777438bd4004baccef81903fb8a515c1578db1d5b97619454185a6385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:1883-1903 | crates/ty_python_semantic/src/types/call/bind.rs:1926-1946 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/call/bind.rs:1883\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"203075aec34db7858e24a5512f855f5e188b11a0252cc8af99862c697e7c7147"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pyi/rules/duplicate_literal_member.rs:95-114 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_nested_literal.rs:119-138 \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/ruff_linter/src/rules/flake8_pyi/rules/duplicate_literal_member.rs:95\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/ruff_linter/src/rules/flake8_pyi/rules/duplicate_literal_member.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0b8821a8c81bb9980732090274c727d74178a93a50367f3b7eef25aeb246df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:451-470 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:497-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:451\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/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea475fbe6c0046ec9ad8ec8693bb9c5c75a732fac7da66469d5d086a0c86e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 2): crates/ty_ide/src/docstring/document/google.rs:262-281 | crates/ty_ide/src/docstring/document/numpy.rs:169-183 \u2014 before extracting anything, compare \u0060crates/ty_ide/src/docstring/document/google.rs\u0060 and \u0060crates/ty_ide/src/docstring/document/numpy.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 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 \u0060crates/ty_ide/src/docstring/document/google.rs:262\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. 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/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d85f5ed4cf777c95af7a7eb6594a43b7ecc3f1048152e4c07753d78b5ed1d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ty_python_semantic/src/types/class/implicit_attributes.rs:395-414 | crates/ty_python_semantic/src/types/class/implicit_attributes.rs:436-455 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/class/implicit_attributes.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a654d38fb5c8f47a944bdf73c76ec8f6875dfd8c5c16b16ba4bc3b7f7956f2d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/ty_python_semantic/src/types/class/typed_dict.rs:421-440 | crates/ty_python_semantic/src/types/class/typed_dict.rs:616-633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/class/typed_dict.rs:421\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/ty_python_semantic/src/types/class/typed_dict.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b05443a2025035ce056559eb526d37616548c98115929351a47b8d12f3f2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201320 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints.rs:4442-4450 | crates/ty_python_semantic/src/types/constraints.rs:4498-4517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints.rs:4442\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":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":4442}}}],"partialFingerprints":{"codehealthFindingId/v1":"761a14e56253e52ba1475e0c129e58b3ca3285dbbc8219105aa888bb63b9c541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2672-2691 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2771-2790 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:2672\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2672}}}],"partialFingerprints":{"codehealthFindingId/v1":"da93ab574061e0f8c7348b4a8977257b64757e97f189273de53cfdacf7f90ec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ty_python_semantic/src/types/set_theoretic.rs:1387-1406 | crates/ty_python_semantic/src/types/set_theoretic.rs:1444-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/ty_python_semantic/src/types/set_theoretic.rs:1387\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/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9465279db626dd7fbc703cf71e9277b9763c3efa3eb2f6b51b7a3ebc34f873c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 2): crates/ty_python_semantic/src/types/visitor.rs:615-634 | crates/ty_python_semantic/src/types/visitor.rs:921-935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/visitor.rs:615\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/ty_python_semantic/src/types/visitor.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ab3fa50d23d25c7ed4fa01b140b5ac2ebae9d3d26dd14d1098cc73f024c933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 13): crates/ty_server/src/server/api/requests/completion.rs:45-63 | crates/ty_server/src/server/api/requests/doc_highlights.rs:32-50 | crates/ty_server/src/server/api/requests/goto_declaration.rs:31-49 | crates/ty_server/src/server/api/requests/goto_definition.rs:32-50 | crates/ty_server/src/server/api/requests/goto_implementation.rs:31-49 | crates/ty_server/src/server/api/requests/goto_type_definition.rs:32-50 | crates/ty_server/src/server/api/requests/hover.rs:31-49 | crates/ty_server/src/server/api/requests/prepare_call_hierarchy.rs:40-58 | crates/ty_server/src/server/api/requests/prepare_rename.rs:31-49 | crates/ty_server/src/server/api/requests/prepare_type_hierarchy.rs:41-59 | crates/ty_server/src/server/api/requests/references.rs:32-50 | crates/ty_server/src/server/api/requests/rename.rs:33-51 | crates/ty_server/src/server/api/requests/signature_help.rs:34-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 13 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060\u0026CompletionParams\u0060 in one and \u0060\u0026DocumentHighlightParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ty_server/src/server/api/requests/completion.rs:43\u0060 calls \u0060now\u0060 and \u0060crates/ty_server/src/server/api/requests/goto_declaration.rs:30\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/ty_server/src/server/api/requests/completion.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c676bf9838d19cda7aa376f7f90e1511f9037ec090d9a577978bf21f9e587058"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/ty_python_semantic/src/types/constraints/sequents.rs:957-975 | crates/ty_python_semantic/src/types/constraints/sequents.rs:995-1013 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1033-1051 \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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7431272da1e117ce052079dbc08daa4b418a06d89131b9b1fa21568558a99b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/ty_python_semantic/src/types/signatures.rs:4469-4487 | crates/ty_python_semantic/src/types/signatures.rs:4509-4527 | crates/ty_python_semantic/src/types/signatures.rs:4852-4870 \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/ty_python_semantic/src/types/signatures.rs:4509\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":4469}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a7b89bfb638cf1a0dc5c20ec848396a096a1e22f6d5382d945730414ae57af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): crates/ruff_annotate_snippets/src/renderer/render.rs:819-837 | crates/ruff_annotate_snippets/src/renderer/render.rs:873-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 \u0060crates/ruff_annotate_snippets/src/renderer/render.rs:819\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/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb97ec06f1d558521ae168988be138f661c75f933b1c8705b00f98135d834ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/ruff_linter/src/noqa.rs:452-468 | crates/ruff_linter/src/noqa.rs:510-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/noqa.rs:452\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/noqa.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae11000d908c6f8d9978ff04400874cd5831eec492e6d9768883e9f30979616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/collapsible_if.rs:339-357 | crates/ruff_linter/src/rules/flake8_simplify/rules/fix_with.rs:36-53 \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 \u0060crates/ruff_linter/src/rules/flake8_simplify/rules/collapsible_if.rs:339\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/ruff_linter/src/rules/flake8_simplify/rules/collapsible_if.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd175cef4e336786a057faf55d74cbf780509761c3cc6d0b8f276f1f5054fdcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_chmod.rs:110-128 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_stat.rs:157-174 \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 \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_chmod.rs:110\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/ruff_linter/src/rules/flake8_use_pathlib/rules/os_chmod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac8619e7e40ef302ff14a8f7882ba876c116e9d1fd4cc12b4fb4f4f669a4d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs:1656-1674 | crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs:1733-1751 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pydocstyle/rules/sections.rs:1656\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/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee53c1b5888b467be3dacf7d821efe650ff66e14449674a334361684cc151f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/type_bivariance.rs:109-127 | crates/ruff_linter/src/rules/pylint/rules/type_name_incorrect_variance.rs:102-120 \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 \u0060crates/ruff_linter/src/rules/pylint/rules/type_bivariance.rs:109\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/ruff_linter/src/rules/pylint/rules/type_bivariance.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"838b9a9845f5fb7e5e2806d89bf551e2c3cb1f8c9ad5ccfcf979fac40fa46459"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/unnecessary_lambda.rs:145-163 | crates/ruff_linter/src/rules/pylint/rules/unnecessary_lambda.rs:167-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pylint/rules/unnecessary_lambda.rs:145\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/ruff_linter/src/rules/pylint/rules/unnecessary_lambda.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4bc470f14c137968fe515a8dd7893d0dd425d88458768eece1e022b509a057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/rules/for_loop_set_mutations.rs:126-144 | crates/ruff_linter/src/rules/refurb/rules/for_loop_writes.rs:203-221 \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 \u0060crates/ruff_linter/src/rules/refurb/rules/for_loop_set_mutations.rs:126\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/ruff_linter/src/rules/refurb/rules/for_loop_set_mutations.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f75d11273c96f34f51b5e411d19d48b6c79d110d7f8df55bb868fa6c49bc75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/ruff_python_parser/src/lexer.rs:893-909 | crates/ruff_python_parser/src/lexer.rs:930-948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_parser/src/lexer.rs:893\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/ruff_python_parser/src/lexer.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"2675997a0535df530971332879ebe4817eef30bf95b1d7b2bfc218f6114b7ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruff_server/src/lint.rs:479-497 | crates/ty_server/src/server/api/diagnostics.rs:534-552 \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/ruff_server/src/lint.rs:479\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/ruff_server/src/lint.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bda54e931a05ce25569d590a4af05ca8cd71b96430ce5dc4faaf1036a08952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): crates/ruff_server/src/logging.rs:42-60 | crates/ty_server/src/logging.rs:43-58 \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/ruff_server/src/logging.rs:42\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060log_file\u0060 to \u0060Option\u003C\u0026std::path::Path\u003E\u0060 in one and \u0060Option\u003C\u0026SystemPath\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruff_server/src/logging.rs:61\u0060 calls \u0060with_span_events\u0060 and \u0060crates/ty_server/src/logging.rs:59\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/ruff_server/src/logging.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ceadde781f0b6dabc12f0e3d2d65ea124c07d7b778c5de4f64a94dbcfa57919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 3): crates/ty_python_semantic/src/types/constraints/paths.rs:336-354 | crates/ty_python_semantic/src/types/constraints/paths.rs:362-380 | crates/ty_python_semantic/src/types/constraints/paths.rs:387-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 \u0060crates/ty_python_semantic/src/types/constraints/paths.rs:336\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":"crates/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b632557bd4ec99db5b2bed56600cb28c6a8cdb8f64550c4ad83578904eb8183c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs:1217-1234 | crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs:1284-1302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs:1217\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/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19869ae9a391486e9348181bb4e75d9545802dd27ca835689fcc5fad934c9bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201319 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:3395-3413 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:3543-3555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:3395\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":3395}}}],"partialFingerprints":{"codehealthFindingId/v1":"1949e87470a3792211e13988593085e69adffb0e71fad23860f6cd9e66cf1aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ty_python_semantic/src/types/narrow.rs:5583-5601 | crates/ty_python_semantic/src/types/typed_dict.rs:2090-2108 \u2014 before extracting anything, compare \u0060crates/ty_python_semantic/src/types/narrow.rs\u0060 and \u0060crates/ty_python_semantic/src/types/typed_dict.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":5583}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b63d5c3e2296f86be1a35035c10aa0bed80f80d4e9b44c065d68236ac61a1fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:3642-3660 | crates/ty_python_semantic/src/types/signatures.rs:3671-3688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/signatures.rs:3642\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3642}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46aa7b15f30bbf3472c215747da2b13974a65e3b9a16685a5fa90b786abeea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs:103-117 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:550-567 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:860-875 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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 \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs:103\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs:101\u0060 calls \u0060List\u0060, \u0060Tuple\u0060 and \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:549\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":"crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"63444bf46dca0c979b38ce1cec9339b5870e981af8137a4a881120010d0031cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 3): crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs:583-600 | crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs:614-629 | crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs:662-678 \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/ty_python_semantic/src/types/infer/builder/named_tuple.rs:583\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":"crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb829bd8e65f7a33ada301bcf51a37f7ae27cb3d9667b4145977446f7c67bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2673-2689 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2772-2788 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2802-2819 \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/ty_python_semantic/src/types/infer/builder/type_expression.rs:2673\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2673}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a599a0a49f4f30351f6ba74c0c1c74da73efeaccfa055695c325166c53db308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/analyze/statement.rs:584-601 | crates/ruff_linter/src/checkers/ast/analyze/statement.rs:761-778 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/checkers/ast/analyze/statement.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"445cbf5fc1ee155855fbe938fea9614da32c5d2fa2a1637562b66e2c493bfb4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/mod.rs:1414-1431 | crates/ruff_linter/src/checkers/ast/mod.rs:1435-1452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/checkers/ast/mod.rs:1414\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/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07c65040d0b92402ae529a64f93da88335b5b19311d16e315ed6ede8343b49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pyi/rules/duplicate_union_member.rs:113-130 | crates/ruff_linter/src/rules/flake8_pyi/rules/redundant_numeric_union.rs:171-187 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_pyi/rules/duplicate_union_member.rs:113\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/ruff_linter/src/rules/flake8_pyi/rules/duplicate_union_member.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"703237e9649aee6d88da5eac663925c7ac719c01bad21fef4c3517460187ba74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/unnecessary_dict_index_lookup.rs:73-89 | crates/ruff_linter/src/rules/pylint/rules/unnecessary_list_index_lookup.rs:76-93 \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 \u0060crates/ruff_linter/src/rules/pylint/rules/unnecessary_dict_index_lookup.rs:73\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":"crates/ruff_linter/src/rules/pylint/rules/unnecessary_dict_index_lookup.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3308c6833f274ad5d74b019586f56f7e7eea92a7a2aaa8a5d4d0988d3d35c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruff_python_formatter/src/expression/expr_list_comp.rs:14-31 | crates/ruff_python_formatter/src/expression/expr_set_comp.rs:14-31 \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 \u0060crates/ruff_python_formatter/src/expression/expr_list_comp.rs:14\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026ExprListComp\u0060 in one and \u0060\u0026ExprSetComp\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":"crates/ruff_python_formatter/src/expression/expr_list_comp.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc9f08aaa7fdde1f64d5f0602006d8de950389cf4afb17db7dfd0848ada3f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ty_python_core/src/use_def.rs:2487-2504 | crates/ty_python_core/src/use_def.rs:2519-2536 \u2014 both copies are in the same file, so extract the block 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/ty_python_core/src/use_def.rs"},"region":{"startLine":2487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0ad74b22c8bc11d7d9a34031e5abeb69747ee3292f06abfd3f0857af5f98ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ty_python_semantic/src/dunder_all.rs:283-300 | crates/ty_python_semantic/src/dunder_all.rs:325-342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/dunder_all.rs:283\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/ty_python_semantic/src/dunder_all.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b89db3f51055861256b44f2f8f1c0efd7e28051b1cfd813cf17eec90c22822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/ty_python_semantic/src/types.rs:12970-12987 | crates/ty_python_semantic/src/types/generics.rs:1458-1474 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":12970}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9b9e0daf28f936f0ecc842bfe2b99185d229000480c67b68ba9ae82b3cc546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:1200-1217 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1235-1252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/sequents.rs:1200\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"159bf106fd2ae56a544172f00812ca2e4aae841e731c3af8b6266218d82f31e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:1270-1287 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1340-1357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/sequents.rs:1270\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e33f50d4223c3699fe7b98a824015192a852f969868db9742a0faad3134cca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs:654-671 | crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs:676-693 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"68487b828785415fbda268032fa85100f226a830dbe5edd9c0afd588043995e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ty_python_semantic/src/types/iteration.rs:802-826 | crates/ty_python_semantic/src/types/iteration.rs:832-856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/iteration.rs:802\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/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"1614249cb73553d1b3ad9c19bf949675868bb0d41fa4319201a36798d45bd179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ty_python_semantic/src/types/typed_dict.rs:1015-1032 | crates/ty_python_semantic/src/types/typed_dict.rs:1036-1053 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/typed_dict.rs:1015\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/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d5d1cf2d6ce74de32c5d12d2168615da35ac2d3a1f9f4e0741c24bbd7fda82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 4): crates/ty_python_semantic/src/types/signatures.rs:3570-3585 | crates/ty_python_semantic/src/types/signatures.rs:3763-3778 | crates/ty_python_semantic/src/types/signatures.rs:3935-3951 | crates/ty_python_semantic/src/types/signatures.rs:4454-4469 \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/ty_python_semantic/src/types/signatures.rs:3570\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":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d05420acb0c94bad8ef38c92c63218dc1147b47ab69394a8c1041d63456045f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): crates/ruff/src/commands/rule.rs:74-90 | crates/ruff_dev/src/generate_docs.rs:141-157 | crates/ruff_server/src/server/api/requests/hover.rs:127-142 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff/src/commands/rule.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. 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/ruff/src/commands/rule.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6222fa04195eec866bc008c318d91ec73b403ed60e500930da9e29f1671d849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs:229-244 | crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:1061-1077 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs:354-370 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 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 \u0060crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs:229\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs:352\u0060 calls \u0060to_string\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:1059\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":"crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4ec5fe0cf728d9d12c3a134d87269679634b3de75a3ecf976abeafd02b6df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/ruff_linter/src/rules/pylint/rules/bad_staticmethod_argument.rs:67-83 | crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs:78-94 | crates/ruff_linter/src/rules/pylint/rules/singledispatchmethod_function.rs:68-84 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs\u0060 and \u0060crates/ruff_linter/src/rules/pylint/rules/singledispatchmethod_function.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 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 \u0060crates/ruff_linter/src/rules/pylint/rules/bad_staticmethod_argument.rs:67\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/ruff_linter/src/rules/pylint/rules/bad_staticmethod_argument.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"956163ba782eb5992a6d50da2f22754eb8da11b6482fe9c27eb237a90e13655c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): crates/ty_python_semantic/src/types/signatures.rs:3616-3631 | crates/ty_python_semantic/src/types/signatures.rs:3803-3818 | crates/ty_python_semantic/src/types/signatures.rs:3976-3992 \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/ty_python_semantic/src/types/signatures.rs:3616\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3616}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce48f1ba672bc3182bb77558ad4f2944ba051f2c40b79bb222a99739185e08f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruff_linter/src/fix/codemods.rs:63-79 | crates/ruff_linter/src/fix/codemods.rs:155-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 \u0060crates/ruff_linter/src/fix/codemods.rs:63\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/ruff_linter/src/fix/codemods.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2507a4659ddf440a22891db6a3995c3406c15c93514d5fc921715bfba82c677a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/ruff_linter/src/message/mod.rs:52-68 | crates/ty_project/src/lib.rs:1152-1167 \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/ruff_linter/src/message/mod.rs:52\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/ruff_linter/src/message/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6261766a1def609593089f6d1534499349466697be8a2fbe649273c627a24a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:1181-1197 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs:309-323 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 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 \u0060crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:1181\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/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa475b7d3db50e61487d6781e2523c684309d6d82bdb4702f82d8e7b753b2c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pyi/rules/prefix_type_params.rs:86-102 | crates/ruff_linter/src/rules/pylint/rules/type_param_name_mismatch.rs:94-110 \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/ruff_linter/src/rules/flake8_pyi/rules/prefix_type_params.rs:86\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/ruff_linter/src/rules/flake8_pyi/rules/prefix_type_params.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8c375c106eb8693fd43ddb956d74a4e94aead67a55ae0cd763077ceb004be2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:267-282 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_key_check.rs:78-94 \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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:267\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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"7471bf0985727382ab5b217a558d909f8f85f16adc485fbf2a2cd5de5b279b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs:491-507 | crates/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs:522-538 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs:491\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/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"198c8f73820ede37ff6e2465eeefedfff0b4522dce432e3de8c87ac52489bcf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:447-463 | crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:480-496 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs\u0060 and \u0060crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:445\u0060 calls \u0060statement_deletion_range\u0060 and \u0060crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:478\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":"crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"730793e9ef09fd24a895069bc2c8aabef8b3440d07ee8d5a766566ca03365501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs:322-338 | crates/ruff_python_ast/src/token.rs:413-429 \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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f54016f06ffb2c04fbbb63487f71194b6644816c60d0b1c4a8dda9706057630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/too_many_arguments.rs:130-146 | crates/ruff_linter/src/rules/pylint/rules/too_many_positional_arguments.rs:134-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pylint/rules/too_many_arguments.rs:130\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/ruff_linter/src/rules/pylint/rules/too_many_arguments.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ccb1545c2e88f1106b99f2dbb765fbd8f8011c9857aa92a82884d29bd4c9b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruff_linter/src/rules/ruff/rules/unnecessary_iterable_allocation_for_first_element.rs:190-206 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_iterable_allocation_for_first_element.rs:220-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/unnecessary_iterable_allocation_for_first_element.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5eaf012676c8fad520a54aa2ab9e7cd9e7256d077bec1a54d96d62e27587470"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/ruff_server/src/server/api.rs:70-83 | crates/ty_server/src/server/api.rs:152-168 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/api.rs\u0060 and \u0060crates/ty_server/src/server/api.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 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 \u0060crates/ruff_server/src/server/api.rs:70\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/ruff_server/src/server/api.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf85749c98c85cc3b6a9fe214e62fec1aa6c1e71cbd6455273f9a76f5f2f018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ty_python_core/src/builder.rs:4684-4700 | crates/ty_python_core/src/builder.rs:4887-4903 \u2014 both copies are in the same file, so extract the block 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/ty_python_core/src/builder.rs"},"region":{"startLine":4684}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adc78b195916754fca7dcde6b5a4845374b4b07f4f033fefdb7c93b1b2aa70b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:3207-3223 | crates/ty_python_semantic/src/types/call/bind.rs:3299-3315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/call/bind.rs:3207\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0038911812404af8edd9b0f6a4908f490b85383e9fc5653ba8a2148280e248a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ty_python_semantic/src/types/definition_resolution.rs:402-418 | crates/ty_python_semantic/src/types/definition_resolution.rs:426-442 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/definition_resolution.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"6961cbe87cfdc4598ca7129c7e7d393785a310b7c26bc319d412a4e2b009a71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:5513-5529 | crates/ty_python_semantic/src/types/infer/builder.rs:9058-9074 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:5513\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":5513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0342760fbfce7c410b8589b70c05981fb78a3875bf36a10ecbd5d3a4e80dfa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/subscript.rs:2452-2468 | crates/ty_python_semantic/src/types/infer/builder/subscript.rs:2469-2485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/subscript.rs:2452\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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fefa7c28c98f4cfc1b82ca4e512a702251f439632b1812f61b5b84d2312d3c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ty_python_semantic/src/types/method.rs:982-998 | crates/ty_python_semantic/src/types/method.rs:1006-1022 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/method.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a79beae108a2fca55a35dc89e464af8eb37ce18823cfba25348de5b9190bcdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ty_python_semantic/src/types/narrow.rs:4557-4573 | crates/ty_python_semantic/src/types/narrow.rs:4585-4601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/narrow.rs:4557\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/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":4557}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0baf871545e8cabe9de09f1ef0ae169187339077613bb24b5d297a68493350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/ty_python_semantic/src/types/set_theoretic.rs:601-617 | crates/ty_python_semantic/src/types/set_theoretic.rs:663-677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/set_theoretic.rs:663\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/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72a162e8ff3c6712c8b1f640f809e97c6095d3efe0eb6b3510a5e88166925f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ty_server/src/server/api.rs:280-296 | crates/ty_server/src/server/api.rs:348-364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_server/src/server/api.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a0bc57ba3520541155743d83e3a81c47df9b2e441b731dc5b34db9a096b95b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 10): crates/ty_python_semantic/src/types.rs:9864-9879 | crates/ty_python_semantic/src/types.rs:10382-10396 | crates/ty_python_semantic/src/types.rs:10751-10765 | crates/ty_python_semantic/src/types/infer/comparisons.rs:384-398 | crates/ty_python_semantic/src/types/method.rs:450-465 | crates/ty_python_semantic/src/types/method.rs:517-531 | crates/ty_python_semantic/src/types/method.rs:546-561 | crates/ty_python_semantic/src/types/method.rs:990-1004 | crates/ty_python_semantic/src/types/method.rs:1014-1028 | crates/ty_python_semantic/src/types/relation.rs:332-346 \u2014 there are 10 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 10 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":9864}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe574dd117f0e2adce90eb2a127ebc0ee0366c3690b67179d22600fa6a631f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): crates/ruff_server/src/server/api/requests/code_action.rs:194-209 | crates/ruff_server/src/server/api/requests/code_action.rs:229-244 | crates/ruff_server/src/server/api/requests/code_action.rs:264-279 | crates/ruff_server/src/server/api/requests/code_action.rs:299-314 \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/ruff_server/src/server/api/requests/code_action.rs:194\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/ruff_server/src/server/api/requests/code_action.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e142ecf4ad9ecd143fa111f628a71356d65378bb92366e290db32e6791de51c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): crates/ty_python_semantic/src/types/infer/builder.rs:716-731 | crates/ty_python_semantic/src/types/infer/builder.rs:830-844 | crates/ty_python_semantic/src/types/infer/builder.rs:911-925 \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/ty_python_semantic/src/types/infer/builder.rs:716\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, \u0060crates/ty_python_semantic/src/types/infer/builder.rs:715\u0060 calls \u0060extend\u0060, \u0060iter\u0060, \u0060copied\u0060 and \u0060crates/ty_python_semantic/src/types/infer/builder.rs:829\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d82318a1a6497a56947ff86d237c5762794a6e5335a4afa6765a42cecd80635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/ty_python_semantic/src/types/infer/builder.rs:5820-5835 | crates/ty_python_semantic/src/types/narrow.rs:5596-5611 | crates/ty_python_semantic/src/types/typed_dict.rs:2103-2118 \u2014 before extracting anything, compare \u0060crates/ty_python_semantic/src/types/narrow.rs\u0060 and \u0060crates/ty_python_semantic/src/types/typed_dict.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":5820}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa9ccf29289d8bfe3dceba257071491b07222dd69fa61ae94f4ac7acc477856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:460-475 | crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:476-491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:460\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/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d3decc41283fb04907e23514d871505558ebba991999b6a29e5225ba9ee9d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:1162-1177 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs:135-150 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 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 \u0060crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:1162\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/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2635b9454958d8e19faaf208dd34a66f40cbf1163242903464415e8525617b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:46-68 | crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:108-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:46\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, \u0060crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:132\u0060 calls \u0060default\u0060, \u0060space\u0060 and \u0060crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:69\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":"crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f9dee7f885cd12d6c299356519beab4167bf0249954608d42bcd4f37cf27be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs:74-98 | crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_set.rs:75-98 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_set.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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 \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs:74\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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d155a973c03af309b3d4b0a40e3ac741b07f9864e979679a62f9d7cbc58f9b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_django/rules/all_with_model_form.rs:54-69 | crates/ruff_linter/src/rules/flake8_django/rules/exclude_with_model_form.rs:52-67 \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 \u0060crates/ruff_linter/src/rules/flake8_django/rules/all_with_model_form.rs:54\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/ruff_linter/src/rules/flake8_django/rules/all_with_model_form.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3a6f9fde2e4405267a7416d17ae60b057b91d2da361732b388bed3de6c9fb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs:387-402 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs:436-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs:387\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/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f8b24737d46331226a1dabde6a123f3bfbb6346d5cfb387a52e42bb0ca6e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:159-174 | crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:207-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:159\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/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"345ef445ad48bf29b944cf35206d363a1cc66c10e58be271cfb466c3d9bda98e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:229-244 | crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:314-329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:229\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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1f61c0d5a4649b36d9b70d0e4f5966cf6faeecacaf30fd4384923c4c765a54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_lookup.rs:72-87 | crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_lookup.rs:120-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_lookup.rs:116\u0060 calls \u0060as_ref\u0060 and \u0060crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_lookup.rs:71\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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_lookup.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d7d2ab27b0824c6bfef4a32952adce9ffa4274ccaf0858e562549e61e49fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs:320-335 | crates/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs:628-643 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs:645\u0060 calls \u0060iter\u0060, \u0060any\u0060 and \u0060crates/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs:338\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/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"802aa4929e7735dc570e07c672a81872ccc6a05f069056dbbaed60502641cc4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs:302-317 | crates/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs:329-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs:302\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, \u0060crates/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs:327\u0060 calls \u0060skip\u0060 and \u0060crates/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs:300\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":"crates/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dd077c0d5bc48b58865a8f73eb2539e7165df4892c4566c4e673770c23fb4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/ruff_linter/src/rules/isort/annotate.rs:33-48 | crates/ruff_linter/src/rules/isort/annotate.rs:103-117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/isort/annotate.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2578e512178d8151203c67e1f744567efb1746152e0e4ffad57f3b9bc251740c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/incorrect_dict_iterator.rs:101-116 | crates/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs:114-129 \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/ruff_linter/src/rules/perflint/rules/incorrect_dict_iterator.rs:101\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/ruff_linter/src/rules/perflint/rules/incorrect_dict_iterator.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ebf25a90a428033a8ed99846dea8b8e492b2f33516a5034fcc5e715b6a4afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs:131-146 | crates/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs:150-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs:131\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/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a63ff44a3dca2ac1e5ef208c1d6380cd181d6a129efe6f97b583127e04bccff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/outdated_version_block.rs:326-341 | crates/ruff_linter/src/rules/pyupgrade/rules/outdated_version_block.rs:401-416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pyupgrade/rules/outdated_version_block.rs:326\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/ruff_linter/src/rules/pyupgrade/rules/outdated_version_block.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b145602f1e0cca04e8ca5d10818654575cefc1f2c27971e16a2540e6c0e70c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_linter/src/rules/ruff/rules/needless_else.rs:144-159 | crates/ruff_linter/src/rules/ruff/rules/useless_finally.rs:214-229 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/ruff/rules/needless_else.rs\u0060 and \u0060crates/ruff_linter/src/rules/ruff/rules/useless_finally.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/ruff/rules/needless_else.rs:144\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/needless_else.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c38d8d1e8e38cac2455d3e8d3219192ec726a00dd645354e2d6e591078aeb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_macros/src/rust_doc.rs:23-38 | crates/ruff_macros/src/violation_metadata.rs:64-79 \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":"crates/ruff_macros/src/rust_doc.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4b8e9725a517728ad8444f7ee603cd65011a0c0c9e18d43914cd1cc2f8b23f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): crates/ruff_python_ast/src/node.rs:694-705 | crates/ruff_python_ast/src/node.rs:731-746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_ast/src/node.rs:731\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":"crates/ruff_python_ast/src/node.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d2b56bcebfd6882a05f883f5156e61138d85f49b81101a8a26307ab60ef791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruff_python_formatter/src/comments/placement.rs:135-150 | crates/ruff_python_formatter/src/comments/placement.rs:166-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_formatter/src/comments/placement.rs:135\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/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1f22a866c5f34d8f1a824ef9858c3b3103b62320b57264a8cc91583ec0f8d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:4883-4898 | crates/ty_python_semantic/src/types/call/bind.rs:4904-4919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/call/bind.rs:4883\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"60413c30d1660f7304ea0f9f9699503bf7b3709db64b81e79794aa4235354350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/variables.rs:1042-1057 | crates/ty_python_semantic/src/types/constraints/variables.rs:1341-1356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/variables.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":"crates/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c62a3bdc1d10c35a2aa847f7e1e00f00250cdce29ba77815b8ee25909993341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/post_inference/final_variable.rs:32-47 | crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs:1581-1596 \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 \u0060crates/ty_python_semantic/src/types/infer/builder/post_inference/final_variable.rs:32\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 before the matched lines, \u0060crates/ty_python_semantic/src/types/infer/builder/post_inference/final_variable.rs:28\u0060 calls \u0060use_def_map\u0060, \u0060place_table\u0060, \u0060program_environment\u0060 and \u0060crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs:1579\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/ty_python_semantic/src/types/infer/builder/post_inference/final_variable.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98ef7bdf504116162b397098bd972a3b4c474cb97fb3a3cc5e50ccd287da4ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/post_inference/final_variable.rs:46-61 | crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs:1602-1617 \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 \u0060crates/ty_python_semantic/src/types/infer/builder/post_inference/final_variable.rs:46\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/ty_python_semantic/src/types/infer/builder/post_inference/final_variable.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7795f4bf73239ed02dbe25a57bef80dbed6dc79201566470927091a46a93adf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): crates/ruff_linter/src/rules/flake8_pyi/rules/prefix_type_params.rs:84-97 | crates/ruff_linter/src/rules/pylint/rules/type_bivariance.rs:106-120 | crates/ruff_linter/src/rules/pylint/rules/type_name_incorrect_variance.rs:100-113 | crates/ruff_linter/src/rules/pylint/rules/type_param_name_mismatch.rs:92-105 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_pyi/rules/prefix_type_params.rs:84\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/ruff_linter/src/rules/flake8_pyi/rules/prefix_type_params.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8134dd52ff7f69d1db59720ffc7d157523766ae6779ffd6e2b93510aaab0b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_expr.rs:314-328 | crates/ruff_linter/src/rules/flake8_simplify/rules/zip_dict_keys_and_values.rs:127-141 | crates/ruff_linter/src/rules/refurb/rules/verbose_decimal_constructor.rs:157-171 | crates/ruff_linter/src/rules/refurb/rules/verbose_decimal_constructor.rs:203-217 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_simplify/rules/ast_expr.rs:314\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060expr\u0060 to \u0060\u0026Expr\u0060 in one and \u0060\u0026ast::ExprCall\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":"crates/ruff_linter/src/rules/flake8_simplify/rules/ast_expr.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"f666b1205bffe7d899e3cf0372cd694942abb673927cc04d2574463b40d3967a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/ruff_linter/src/fix/codemods.rs:122-136 | crates/ruff_linter/src/fix/codemods.rs:189-203 | crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.rs:112-126 \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":"crates/ruff_linter/src/fix/codemods.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc01cf05777a971452d284a2a1ddba2e17bfbc485113b3dcf6936b80e57f57a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs:52-66 | crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:64-78 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs:60-74 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 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 \u0060crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs:52\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/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baadb1816b66d592f69136c2280effb6b73d7cddb9993bd558ffdd72bbeb8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/ruff_linter/src/rules/refurb/helpers.rs:36-50 | crates/ruff_linter/src/rules/refurb/rules/check_and_remove_from_set.rs:192-206 | crates/ruff_linter/src/rules/refurb/rules/repeated_append.rs:364-378 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/refurb/helpers.rs\u0060 and \u0060crates/ruff_linter/src/rules/refurb/rules/check_and_remove_from_set.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 \u0060crates/ruff_linter/src/rules/refurb/helpers.rs:36\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/ruff_linter/src/rules/refurb/helpers.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bc2abc6301de263b276cde4e0e82dff12811f2b34ed1da5110bbd12b060314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 3): crates/ruff_python_semantic/src/analyze/type_inference.rs:191-205 | crates/ruff_python_semantic/src/analyze/type_inference.rs:241-254 | crates/ruff_python_semantic/src/analyze/type_inference.rs:269-280 \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/ruff_python_semantic/src/analyze/type_inference.rs:191\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":"crates/ruff_python_semantic/src/analyze/type_inference.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7afa9cbb87f9e16ca6cd6e6013671695bb0ec5333be14ac22712b2d4b8bbe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_db/src/diagnostic/render.rs:177-191 | crates/ruff_db/src/diagnostic/render.rs:229-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060diag\u0060 to \u0060\u0026\u0027a Diagnostic\u0060 in one and \u0060\u0026\u0027a SubDiagnostic\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":"crates/ruff_db/src/diagnostic/render.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedf134c6d6a5676bf7dafa2e39599c05b9008e9bd8767e09b101f9967eafd9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/analyze/expression.rs:262-276 | crates/ruff_linter/src/checkers/ast/analyze/expression.rs:519-533 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dba830227852501528a959648468a09d19e8ba59f7ba1b61ab0ed7ebd7bb8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/analyze/expression.rs:309-323 | crates/ruff_linter/src/checkers/ast/analyze/expression.rs:436-447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/checkers/ast/analyze/expression.rs:309\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":"crates/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c037d5eae52f15ced3a3f79783d864d97b217411a39bc85b6d532bf60faa2c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/analyze/statement.rs:563-577 | crates/ruff_linter/src/checkers/ast/analyze/statement.rs:725-739 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/checkers/ast/analyze/statement.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3f303abc73205e6a7047a2c803a0103f435e01f0807efd76febcd08f5a57f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/mod.rs:1178-1189 | crates/ruff_linter/src/checkers/ast/mod.rs:1245-1259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7a6e49adbff5f3d49443758b6819dffee6a7f7be0135cb649a0acf53095117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/ruff_linter/src/noqa.rs:47-59 | crates/ruff_linter/src/noqa.rs:832-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/noqa.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ad2dc1f6ab67ae4d548bee4c02c03d32f1080fbdd68827dbc999aba8673df9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/helpers.rs:86-100 | crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs:759-773 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/helpers.rs\u0060 and \u0060crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 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 \u0060crates/ruff_linter/src/rules/airflow/helpers.rs:86\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/ruff_linter/src/rules/airflow/helpers.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cde3e42dff73900b94ff6b974f351a25dbee4c4a6a7f2911af0a71c1b49e3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:906-920 | crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:941-955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:906\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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"da100f70cc7a77115f9239d0f26da235096059f4d4f59ab2a431492f4611f985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_bugbear/rules/cached_instance_method.rs:92-103 | crates/ruff_linter/src/rules/pylint/rules/super_without_brackets.rs:100-114 \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/ruff_linter/src/rules/flake8_bugbear/rules/cached_instance_method.rs:92\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/ruff_linter/src/rules/flake8_bugbear/rules/cached_instance_method.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef290bf7f66d9aba385d993fef06a38ecb6552558b41b3f94ea9c7f9419e9be0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs:125-138 | crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_set.rs:126-140 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_set.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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 \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs:125\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6005c522ff7a2f831a3e66cd78090cef79fcb92b901132ff202fe813020abca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/ruff_linter/src/rules/isort/annotate.rs:30-41 | crates/ruff_linter/src/rules/isort/annotate.rs:69-83 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/isort/annotate.rs:30\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/ruff_linter/src/rules/isort/annotate.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c65b0ff5987ccd54249a20015fe846ac36acc3c9f0ad1a38f9842738ac33fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs:323-337 | crates/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs:342-356 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b551e2321dd136697efad25525636e3903194ae4c34de243b4a41c39c9a43ae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs:256-270 | crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/whitespace_around_keywords.rs:183-197 \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 \u0060crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs:256\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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77bad8e5bd1b0a3b5ae6a668cde0ca18c124e23aa4bc4c75a2cbcf315479deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/rules/slice_to_remove_prefix_or_suffix.rs:97-109 | crates/ruff_linter/src/rules/refurb/rules/slice_to_remove_prefix_or_suffix.rs:133-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/refurb/rules/slice_to_remove_prefix_or_suffix.rs:97\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/ruff_linter/src/rules/refurb/rules/slice_to_remove_prefix_or_suffix.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b705e7c5fefebf16ab8c8f2087e594ebdaaa494593f6cb6548af79b1b49c6bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs:244-258 | crates/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs:264-278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs:244\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/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0b44d7aafc093a22c361b725af248e41fb99ae5517f2868128a3bba966dc81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/ruff_python_formatter/src/statement/stmt_for.rs:40-53 | crates/ruff_python_formatter/src/statement/stmt_while.rs:22-36 \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 \u0060crates/ruff_python_formatter/src/statement/stmt_for.rs:40\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026StmtFor\u0060 in one and \u0060\u0026StmtWhile\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":"crates/ruff_python_formatter/src/statement/stmt_for.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b0264caf1f28011cec6e3b46df341081690354df37f6e85b5f980c72a0e2fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_python_formatter/src/statement/stmt_global.rs:22-36 | crates/ruff_python_formatter/src/statement/stmt_nonlocal.rs:22-36 \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 \u0060crates/ruff_python_formatter/src/statement/stmt_global.rs:22\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026StmtGlobal\u0060 in one and \u0060\u0026StmtNonlocal\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":"crates/ruff_python_formatter/src/statement/stmt_global.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"527786ef5fc61b38bf8e9e58063deed3d1ab2d31829d9a26143a5463b3457012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/ruff_python_parser/src/lexer.rs:776-789 | crates/ruff_python_parser/src/lexer.rs:795-809 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_parser/src/lexer.rs:776\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/ruff_python_parser/src/lexer.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5090a42e61237f84ff5064d0c2ec44036c8d430f879c80beb8ef63697fa43c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/ruff_server/src/server/api.rs:123-136 | crates/ty_server/src/server/api.rs:218-232 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/api.rs\u0060 and \u0060crates/ty_server/src/server/api.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 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 \u0060crates/ruff_server/src/server/api.rs:123\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/ruff_server/src/server/api.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bd8946b6713d9d0ea22e4738e2b9f3d009d155e406b3202d252ec68ab7ae32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_server/src/server/api.rs:357-371 | crates/ty_server/src/server/api.rs:552-566 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/api.rs\u0060 and \u0060crates/ty_server/src/server/api.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 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 \u0060crates/ruff_server/src/server/api.rs:357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14deaa50a6d170608000e04c5caf82b69a25323073912326f94d41e077ef1df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_server/src/server/api/requests/format.rs:101-115 | crates/ruff_server/src/server/api/requests/format_range.rs:62-76 \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":"crates/ruff_server/src/server/api/requests/format.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3134afa871c6f545565abce55d1c811520a166aed256bee1d86e36cef0ec8cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_ide/src/symbols.rs:1313-1327 | crates/ty_ide/src/symbols.rs:1356-1370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_ide/src/symbols.rs:1313\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/ty_ide/src/symbols.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"142e0784ff043a838c4898dd335361d3d831c676fcb670dd08283c2b3411c1fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/ty_python_core/src/narrowing_constraints.rs:179-191 | crates/ty_python_core/src/reachability_constraints.rs:331-345 \u2014 before extracting anything, compare \u0060crates/ty_python_core/src/narrowing_constraints.rs\u0060 and \u0060crates/ty_python_core/src/reachability_constraints.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060ScopedNarrowingConstraint\u0060 in one and \u0060ScopedReachabilityConstraintId\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":"crates/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c886aef8cda9df63b19d28c02fab37e60611bef873a931c6b1fb22844413aaee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_python_semantic/src/types/attribute_write.rs:463-477 | crates/ty_python_semantic/src/types/infer/builder.rs:3255-3269 \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/ty_python_semantic/src/types/attribute_write.rs:463\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/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bed222ee720d5f48a50254e8ca68b6b00b7608e4edb514c1d62aece8c2a2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:3782-3796 | crates/ty_python_semantic/src/types/call/bind.rs:4668-4682 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/call/bind.rs:3782\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdea0d2c7ef49bcf0d646e460e6557277712eb85ede118b69659227aa64d2143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:1069-1083 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1095-1109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/sequents.rs:1069\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03e665b107d802debc83a535c71cf9a530fb23d4793c4d48f4a6a94229c614b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_python_semantic/src/types/generics.rs:1488-1502 | crates/ty_python_semantic/src/types/generics.rs:1627-1641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/generics.rs:1488\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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7c86c57240df462c83a2356644b4ab407fb2b1478ce47ea8caf8b86a46bd05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_python_semantic/src/types/infer.rs:2130-2144 | crates/ty_python_semantic/src/types/infer.rs:2378-2392 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d55f8d522b8e051f064b30fce095663c1347d450883cc3ed0c6054d43568a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:4546-4560 | crates/ty_python_semantic/src/types/infer/builder.rs:4821-4835 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:4546\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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4546}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33b78470a7804909f15515ecb027011dc3313252d5c14fe44832fc4b0acc4fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/imports.rs:271-285 | crates/ty_python_semantic/src/types/infer/builder/imports.rs:484-498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/imports.rs:271\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn infer_import_definition( \u0026mut\u0060 in one and \u0060\u0026mut\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":"crates/ty_python_semantic/src/types/infer/builder/imports.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf5ca9507c6400a43f012026d342ac86b75a8f31c9988b253416c891d200eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:3723-3737 | crates/ty_python_semantic/src/types/signatures.rs:3869-3884 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/signatures.rs:3723\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3723}}}],"partialFingerprints":{"codehealthFindingId/v1":"551abb246a17afc22ab7a34fdab5635e469dd1feb3166a3225c0d32cbd477038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:3896-3910 | crates/ty_python_semantic/src/types/signatures.rs:4012-4027 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/signatures.rs:3896\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed8e160e37bb7ce248bf20dfd86ad83e8d0628cc9dd63386a02c8ec9eea7862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_python_semantic/src/types/tuple.rs:704-718 | crates/ty_python_semantic/src/types/tuple.rs:743-757 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/tuple.rs:704\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/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd18f73b88b399561cdf75b2ba407a083a5c7b4f7b13f1d3b46d131922aba58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/ty_server/src/server/api/requests/inlay_hints.rs:40-53 | crates/ty_server/src/server/api/requests/semantic_tokens_range.rs:35-49 \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 \u0060crates/ty_server/src/server/api/requests/inlay_hints.rs:40\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060\u0026InlayHintParams\u0060 in one and \u0060\u0026SemanticTokensRangeParams\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":"crates/ty_server/src/server/api/requests/inlay_hints.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8657723e2cea1cdd6ef8d23b2a65d2d52aeec2bb6527c59ef1158bb126949e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 5): crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs:74-87 | crates/ruff_linter/src/rules/pylint/rules/invalid_bytes_return.rs:74-86 | crates/ruff_linter/src/rules/pylint/rules/invalid_hash_return.rs:78-91 | crates/ruff_linter/src/rules/pylint/rules/invalid_index_return.rs:80-93 | crates/ruff_linter/src/rules/pylint/rules/invalid_str_return.rs:74-86 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs\u0060 and \u0060crates/ruff_linter/src/rules/pylint/rules/invalid_bytes_return.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.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. 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/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3ce7785aa10f79f776e2cad523454acdc2d63383288e4b2d9ae4bc43dc8714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): crates/ty_python_semantic/src/types/constraints/sequents.rs:1206-1219 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1241-1254 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1276-1289 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1346-1359 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1381-1394 \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 \u0060crates/ty_python_semantic/src/types/constraints/sequents.rs:1206\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a40a8e7abb05d9ef0db10392c53c44c8207ee44b5ca42bf545df362c69eadb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/ty_python_semantic/src/types/call/bind.rs:10854-10867 | crates/ty_python_semantic/src/types/call/bind.rs:10924-10937 | crates/ty_python_semantic/src/types/call/bind.rs:10946-10959 | crates/ty_python_semantic/src/types/call/bind.rs:10973-10986 \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/ty_python_semantic/src/types/call/bind.rs:10854\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":10854}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb81368892b61cb72946274d7ce4fba7dce524f43a4952bebf2447bd156384d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/ty_python_semantic/src/types/constraints/sequents.rs:963-976 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1001-1014 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1039-1052 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1136-1149 \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/ty_python_semantic/src/types/constraints/sequents.rs:963\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"80600597fe845890ade0bbcdd422369cf0ad323ecd2450c96c3811cf9b9d39a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): crates/ruff_linter/src/checkers/ast/analyze/expression.rs:1539-1550 | crates/ruff_linter/src/checkers/ast/analyze/expression.rs:1570-1581 | crates/ruff_linter/src/checkers/ast/analyze/expression.rs:1602-1615 \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/ruff_linter/src/checkers/ast/analyze/expression.rs:1539\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/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c48812ed157ba386905c4672ca80e0a4a5877293434e62a16fe2fc003b5d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs:119-132 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:569-582 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:878-889 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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 \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs:119\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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_tuple_call.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efb7669d28708be4f8d64aee2a0dc82783321a089cad568aae6d6ced8a46659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): crates/ruff_python_ast/src/nodes.rs:2818-2831 | crates/ruff_python_codegen/src/generator.rs:399-411 | crates/ruff_python_formatter/src/expression/operator.rs:27-39 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_ast/src/nodes.rs:2818\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruff_python_formatter/src/expression/operator.rs:42\u0060 calls \u0060token\u0060, \u0060fmt\u0060 and \u0060crates/ruff_python_ast/src/nodes.rs:2831\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/ruff_python_ast/src/nodes.rs"},"region":{"startLine":2818}}}],"partialFingerprints":{"codehealthFindingId/v1":"682ceec6d8d2137e9dfa1227736e42cfd5d308fa6ae7fc233bb43c823346493d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/ruff_python_formatter/src/expression/expr_bytes_literal.rs:17-30 | crates/ruff_python_formatter/src/expression/expr_f_string.rs:19-32 | crates/ruff_python_formatter/src/expression/expr_t_string.rs:19-32 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_formatter/src/expression/expr_bytes_literal.rs:17\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026ExprBytesLiteral\u0060 in one and \u0060\u0026ExprFString\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":"crates/ruff_python_formatter/src/expression/expr_bytes_literal.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4daeec85749e9224b7d9a9b1b1faeb6b61acd6e91670b81f7d3cfd2fdfe363a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/ty_python_semantic/src/types/constraints/paths.rs:1079-1092 | crates/ty_python_semantic/src/types/constraints/paths.rs:1108-1121 | crates/ty_python_semantic/src/types/constraints/paths.rs:1142-1155 \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/ty_python_semantic/src/types/constraints/paths.rs:1079\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, \u0060crates/ty_python_semantic/src/types/constraints/paths.rs:1107\u0060 calls \u0060into_inner\u0060, \u0060display\u0060 and \u0060crates/ty_python_semantic/src/types/constraints/paths.rs:1078\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/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1406c5f273a567ba08b1bd872b38050ab433e18c9392516dccf5a587c56b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/ty_python_semantic/src/types/signatures.rs:3655-3669 | crates/ty_python_semantic/src/types/signatures.rs:3722-3735 | crates/ty_python_semantic/src/types/signatures.rs:3868-3881 \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/ty_python_semantic/src/types/signatures.rs:3655\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3655}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27c2b5ab1f0d1f97f98db33aaf7d31123fab8f7d58808457f0e243944a175b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/ty_python_semantic/src/types/signatures.rs:3683-3697 | crates/ty_python_semantic/src/types/signatures.rs:3895-3908 | crates/ty_python_semantic/src/types/signatures.rs:4011-4024 \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/ty_python_semantic/src/types/signatures.rs:3683\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3683}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9671ade4cace9ddd57c438f5f78c6b8a040b48e0c7ce4e117d2957e726b5b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff/src/commands/check.rs:48-61 | crates/ruff/src/commands/show_files.rs:24-37 \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 \u0060crates/ruff/src/commands/check.rs:48\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/ruff/src/commands/check.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73504a3ac27785a2f5d23b6801f072106e9ab52ad8c87115494f963b96e8e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff_annotate_snippets/src/renderer/render.rs:278-291 | crates/ruff_annotate_snippets/src/renderer/render.rs:584-597 \u2014 both copies are in the same file, so extract the block 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/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"996c2583e27a8aa4a3f46e2ada656cf0c333db65c406cd49e53793864324463a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/analyze/expression.rs:331-344 | crates/ruff_linter/src/checkers/ast/analyze/expression.rs:453-466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/checkers/ast/analyze/expression.rs:331\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":"crates/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7967bef87686acc8a10aa4c8ce55adc3f0eae7f35fd9cf99af996104cce41fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/mod.rs:1390-1403 | crates/ruff_linter/src/checkers/ast/mod.rs:3346-3359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/checkers/ast/mod.rs:1390\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/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f84ce8da28113877b106f3f740e63b591e03be43c70b7b24f969fd1b933cfec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs:246-259 | crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:1079-1092 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 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 \u0060crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs:246\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/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f224aa215d6a78cf1ff03342f68bc88ff15d19503010516113a953385152b6aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:595-608 | crates/ruff_linter/src/rules/flake8_bugbear/rules/abstract_base_class.rs:130-143 \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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:595\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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"228ead7a49d86761971d34083f493296d7bcb5afe6de5ed3481183b04806a32c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:208-221 | crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:295-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:208\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/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a903f6b8ccbabbcf12b71dc2992aa75258b491a870f7d37340d6d8737f52826a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:370-383 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:402-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"13dcdd39faff00c6b78a4449cde02f4afb64ada39cf7f333df1c49db5893eea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs:785-798 | crates/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs:808-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs:785\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/ruff_linter/src/rules/flake8_simplify/rules/ast_bool_op.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bcaabdc7ff91ffee3dbfed4f7148128bb68a67fa0ec4f7b72ba0c4f4167801"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_makedirs.rs:109-122 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_symlink.rs:111-123 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_makedirs.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_symlink.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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 \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_makedirs.rs:109\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/ruff_linter/src/rules/flake8_use_pathlib/rules/os_makedirs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9f19f19001d8a620d303203e1c85b05f3e2f0161877e8f3df97fd74e2e4157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ruff_linter/src/rules/pyflakes/rules/invalid_literal_comparisons.rs:153-165 | crates/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs:100-113 \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":"crates/ruff_linter/src/rules/pyflakes/rules/invalid_literal_comparisons.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc7953fd07be5f8a8a3901ac240ed7dad4e02ba5c11c93e8fbf8e79d2873ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:117-130 | crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs:130-143 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs\u0060 and \u0060crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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":"crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d8bae7ddeece98f756cca020bca0a1927de1c8fad03d95de43af7e1a9f9d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/helpers.rs:262-275 | crates/ruff_linter/src/rules/refurb/helpers.rs:313-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/helpers.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce18145a3e143099e50fec7b738bd7513fd7ad0f13078ba0a7c86c0e0a4e3d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/ruff_python_semantic/src/analyze/type_inference.rs:175-188 | crates/ruff_python_semantic/src/analyze/type_inference.rs:273-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_semantic/src/analyze/type_inference.rs:175\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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/ruff_python_semantic/src/analyze/type_inference.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"83708bf5d2e5684c4eaf379cc0b656cddb085d5aefbcde466ca8a05018e2a007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff_python_semantic/src/model.rs:1908-1921 | crates/ruff_python_semantic/src/model.rs:1948-1961 \u2014 both copies are in the same file, so extract the block 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/ruff_python_semantic/src/model.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f691cc12f251137dda203d1c459b71f79c10f6d22b93744d74ba2b88709b7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ruff_server/src/edit/text_document.rs:91-104 | crates/ty_server/src/document/text_document.rs:101-113 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_server/src/edit/text_document.rs:91\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/edit/text_document.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15696484dc96092e1460fccf46e2c93d078d1eb7f690f5dc1f40ae0b9804fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruff_server/src/server/api.rs:304-317 | crates/ty_server/src/server/api.rs:502-515 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/api.rs\u0060 and \u0060crates/ty_server/src/server/api.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 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":"crates/ruff_server/src/server/api.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"13956b0efedd1ca290402149941e3a8ae64467eb0b858f3fd6e063eff739fa1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ty_python_core/src/builder.rs:5435-5450 | crates/ty_python_core/src/builder.rs:5489-5502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_core/src/builder.rs:5435\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/ty_python_core/src/builder.rs"},"region":{"startLine":5435}}}],"partialFingerprints":{"codehealthFindingId/v1":"5311b922967ac08a1f0c4e8e8c7e8e9feb493760c689c4706aae0a30ea520964"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ty_python_semantic/src/types/class/known.rs:2097-2110 | crates/ty_python_semantic/src/types/class/known.rs:2156-2169 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fba9a6c6ddb5e5c8484abd31f9f24b3a3e5f1b643a4a752199d0e0cc53c515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:1171-1184 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1311-1324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/sequents.rs:1171\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb32c638f71c6877ebdcacabea4e4c681d6aa65d23e216313c384114499c6b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ty_python_semantic/src/types/diagnostic.rs:5570-5583 | crates/ty_python_semantic/src/types/diagnostic.rs:5737-5750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/diagnostic.rs:5570\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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5570}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e749983620e3525fc84c1372452e8cb0098329a969c1a52397a6657ffd4862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/ty_python_semantic/src/types/display.rs:1440-1453 | crates/ty_python_semantic/src/types/display.rs:2559-2569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/display.rs:1440\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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0a8ba1ef291d18a2fbf934c6e64bf1681251f5e7a945962cd2e29ac13fb369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:2496-2508 | crates/ty_python_semantic/src/types/infer/builder.rs:5494-5507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:2496\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2668095d1e73ca283a24ddcb6d59632ad9e786438d49818c9eea561daf073a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:9243-9256 | crates/ty_python_semantic/src/types/infer/builder.rs:9261-9273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:9243\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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":9243}}}],"partialFingerprints":{"codehealthFindingId/v1":"26901f5fadbff868e36f6a2e7605e66b07187c6963c990a95ec9d71174ae70d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/subscript.rs:888-898 | crates/ty_python_semantic/src/types/infer/builder/subscript.rs:1026-1039 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf1a6bd490ba2d43cf2e063a8ba11479671a877c9bc06c645a5276d4fbc7fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/ty_python_semantic/src/types/overrides/attributes.rs:642-655 | crates/ty_python_semantic/src/types/overrides/attributes.rs:1105-1115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/overrides/attributes.rs:642\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/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb08330e018188c14242c048f959e767137d31c0479e06c042686ec68818415b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ty_python_semantic/src/types/set_theoretic.rs:633-646 | crates/ty_python_semantic/src/types/typevar.rs:2341-2354 \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 \u0060crates/ty_python_semantic/src/types/set_theoretic.rs:633\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/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"c967b92f4d7f6be8ad874ad8e0e7d60bc27be08bc8fe31cec2447e3e80842cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): crates/ruff_python_ast/src/name.rs:565-575 | crates/ruff_python_ast/src/name.rs:580-591 | crates/ruff_python_ast/src/name.rs:596-608 \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/ruff_python_ast/src/name.rs:565\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/ruff_python_ast/src/name.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"85228c06c9c738fa5ce325a6185cc6240c27cc036ad17c1969cd738b35459a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): crates/ruff_python_semantic/src/model.rs:660-670 | crates/ruff_python_semantic/src/model.rs:740-752 | crates/ruff_python_semantic/src/model.rs:787-797 \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/ruff_python_semantic/src/model.rs:787\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruff_python_semantic/src/model.rs:756\u0060 calls \u0060insert\u0060, \u0060into\u0060, \u0060Resolved\u0060 and \u0060crates/ruff_python_semantic/src/model.rs:671\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/ruff_python_semantic/src/model.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57febefe4d9617a459845bb9a27b7b685b26bf0bcee7e90c6f2c9d69bcd181e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/ty_python_semantic/src/types/call/bind.rs:2963-2975 | crates/ty_python_semantic/src/types/call/bind.rs:2992-3004 | crates/ty_python_semantic/src/types/call/bind.rs:3021-3033 \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/ty_python_semantic/src/types/call/bind.rs:2963\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":2963}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2d0f232c4b1772f826bd8fd5609af2390e361872f2a06bc7241d6e934f1043"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/ruff/src/commands/add_noqa.rs:69-79 | crates/ruff/src/commands/check.rs:87-99 \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 \u0060crates/ruff/src/commands/add_noqa.rs:69\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, \u0060crates/ruff/src/commands/add_noqa.rs:68\u0060 calls \u0060path\u0060 and \u0060crates/ruff/src/commands/check.rs:86\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/ruff/src/commands/add_noqa.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc45c942f5fd62565ded306f187680fc4cbc69e72c6399f76a59b434f04de3c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff/src/printer.rs:226-238 | crates/ruff/src/printer.rs:255-267 \u2014 both copies are in the same file, so extract the block 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/ruff/src/printer.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"481791e547f36896485b0c0c6a89f5ac234778778f51127cae1fe0f756eb9d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_annotate_snippets/src/renderer/render.rs:363-375 | crates/ruff_annotate_snippets/src/renderer/render.rs:393-405 \u2014 both copies are in the same file, so extract the block 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/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d0d3f149a9b705d782f27c31f7dc887669103a0f4f1024cb6342b48d209b54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruff_annotate_snippets/src/renderer/render.rs:1926-1938 | crates/ruff_annotate_snippets/src/renderer/render.rs:1977-1988 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_annotate_snippets/src/renderer/render.rs:1926\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":"crates/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"857cfd1d81fd811578d2713002ab1b0616927424f2f08eb6cb4846a6c2334d8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_linter/src/fix/mod.rs:99-111 | crates/ty_python_semantic/src/fixes.rs:550-562 \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/ruff_linter/src/fix/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4536c81eeaaf701cb8ebe464d9158659e47639c97d0f6733940e216218e0949d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_linter/src/noqa.rs:994-1006 | crates/ruff_linter/src/noqa.rs:1020-1032 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/noqa.rs:994\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, \u0060crates/ruff_linter/src/noqa.rs:1033\u0060 calls \u0060Some\u0060, \u0060Noqa\u0060 and \u0060crates/ruff_linter/src/noqa.rs:1007\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/ruff_linter/src/noqa.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"5523e4fa13246b9b0af3997b5e8fd5e47f71ab7767bf25641e7c07b5fb8094e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:888-900 | crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:923-935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:888\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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"c565207b4010709312e209ecfecd206041c583fb31e99ca926704ec0e87fbdd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_fromtimestamp.rs:89-101 | crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_now_without_tzinfo.rs:85-96 \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 \u0060crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_fromtimestamp.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":"crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_fromtimestamp.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f281ca26fa99f889b5d185afe604962aee25d489b11af8a2459b79afb23a4a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_quotes/rules/avoidable_escaped_quote.rs:188-200 | crates/ruff_linter/src/rules/flake8_quotes/rules/avoidable_escaped_quote.rs:227-239 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/rules/flake8_quotes/rules/avoidable_escaped_quote.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"801967d33bd52010e82549fe26b9bc58e3233e214131bdc2d8288c6972e14ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/ruff_linter/src/rules/isort/format.rs:17-27 | crates/ruff_linter/src/rules/isort/format.rs:205-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/isort/format.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc661ae2640c0c62cd9ff73a546d53fcb042baa33f27a6943fa4425f1b83f7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/ruff_linter/src/rules/pandas_vet/rules/call.rs:171-181 | crates/ruff_linter/src/rules/pandas_vet/rules/subscript.rs:150-162 \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 \u0060crates/ruff_linter/src/rules/pandas_vet/rules/call.rs:171\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":"crates/ruff_linter/src/rules/pandas_vet/rules/call.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc0738941123001b18edcb07c2d0a9537416473cfd126f45b99f8ed90693d61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:392-404 | crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:420-431 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs\u0060 and \u0060crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 125 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 \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:392\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, \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:406\u0060 calls \u0060slice\u0060 and \u0060crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:433\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3985017917179c7ab6b0a05ed663bd3f57044b9c5c6850bffc197bdf33475f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs:245-257 | crates/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs:262-274 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bff2a17b3dfb1a74aa48525bb7db5a93604a5dac79b3bc91f2811a9d4346241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/comparison_with_itself.rs:55-67 | crates/ruff_linter/src/rules/pylint/rules/comparison_with_itself.rs:103-115 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/rules/pylint/rules/comparison_with_itself.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f290d1379592bbaf91853b40b9b7ed025c003751823c895c291ba343f3f07b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs:90-102 | crates/ruff_linter/src/rules/pylint/rules/super_without_brackets.rs:107-119 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs:90\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/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b0bf4f96e7602045c9297dc40f7a89bd9fb1162ef0cbf43f2975155ad7919b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:201-213 | crates/ruff_linter/src/rules/refurb/rules/write_whole_file.rs:220-232 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs\u0060 and \u0060crates/ruff_linter/src/rules/refurb/rules/write_whole_file.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 \u0060crates/ruff_linter/src/rules/refurb/rules/read_whole_file.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ea33ff485a040e5cbf9c21aed3c7b89d2c255776a283e3a4c002e8ee4bdeac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs:139-148 | crates/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs:194-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs:139\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/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e768e37fbf02896953e72b494be5af932eb59a772898e7e9bb5a460f0cacdb67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_python_ast/src/int.rs:15-27 | crates/ruff_python_ast/src/int.rs:54-66 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_ast/src/int.rs:15\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/ruff_python_ast/src/int.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6849ac554bdc3ca755363bffec7d1e9c9d0a5d4724289709be59d21c734a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): crates/ruff_python_formatter/src/other/interpolated_string_element.rs:136-148 | crates/ruff_python_formatter/src/other/interpolated_string_element.rs:217-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_formatter/src/other/interpolated_string_element.rs:136\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/ruff_python_formatter/src/other/interpolated_string_element.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dabe815de96a87a3d7211ebe02e0db1b7bafa424de0f99ceb8309b5924f98dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_python_formatter/src/string/implicit.rs:179-191 | crates/ruff_python_formatter/src/string/implicit.rs:209-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/string/implicit.rs:179\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/ruff_python_formatter/src/string/implicit.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce590ed7ac5c1cc3fbc6dc4accff13193cd690217f3ca7aeadb11d7a9d7c27c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_server/src/server/schedule/thread/pool.rs:115-127 | crates/ty_server/src/server/schedule/thread/pool.rs:118-130 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/schedule/thread/pool.rs\u0060 and \u0060crates/ty_server/src/server/schedule/thread/pool.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d957330b688c657b778ca75eec2707d3deb57dd7702dd872899626c0bc1e4c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_server/src/session/client.rs:61-73 | crates/ty_server/src/session/client.rs:317-329 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/session/client.rs\u0060 and \u0060crates/ty_server/src/session/client.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 \u0060crates/ruff_server/src/session/client.rs:61\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/ruff_server/src/session/client.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e73ead60027be609f02810ab62c7f18056ea3a82b04366fe04e84a75f15d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ty_module_resolver/src/resolve.rs:1716-1728 | crates/ty_module_resolver/src/resolve.rs:1794-1805 \u2014 both copies are in the same file, so extract the block 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b2d101802b423ec6b69705882feb0b6794f42f2e0134bdd8ac2f490dfab882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_core/src/builder.rs:5412-5424 | crates/ty_python_core/src/builder.rs:5466-5478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_core/src/builder.rs:5412\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/ty_python_core/src/builder.rs"},"region":{"startLine":5412}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aee4707b7c4381d9ad8c0f6f79a73014b1b8f05f4061ee644c5d2bbb1b36218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_core/src/builder.rs:5821-5833 | crates/ty_python_core/src/builder.rs:5842-5854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_core/src/builder.rs:5821\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/ty_python_core/src/builder.rs"},"region":{"startLine":5821}}}],"partialFingerprints":{"codehealthFindingId/v1":"e468e0195002af68d231d5e5b2a8e9e1136a2d7a2900ddc3a503e16318f59519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_core/src/narrowing_constraints.rs:334-346 | crates/ty_python_core/src/narrowing_constraints.rs:415-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_core/src/narrowing_constraints.rs:334\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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c54fcef6a4f3049673bdce160da7af73cbd7d12c204fbbf2e8bc8133838ae34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:11398-11410 | crates/ty_python_semantic/src/types/call/bind.rs:11434-11446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/call/bind.rs:11398\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":11398}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aeafae95c55379747f14ea253ad61199f7e8a5c54ce3d4837d483bffbe45ff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/class/static_literal.rs:558-570 | crates/ty_python_semantic/src/types/generics.rs:782-794 \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/ty_python_semantic/src/types/class/static_literal.rs:558\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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"258e7ac09e3a7b8d4ce7bb54d7b5fad4fc65a1a58a7c92893a0227163db728fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:2075-2087 | crates/ty_python_semantic/src/types/constraints/sequents.rs:2126-2138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/sequents.rs:2075\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf19453ca46f972f7ef91b1a10cc27d1cdc1656ab8023568a9e059a6e501d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/infer.rs:660-672 | crates/ty_python_semantic/src/types/infer.rs:781-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 \u0060crates/ty_python_semantic/src/types/infer.rs:660\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/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44ec4d45799b4d49ecacb9ec43df836d3ba34e9c33055947009817d5976815c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:2961-2973 | crates/ty_python_semantic/src/types/infer/builder.rs:3016-3028 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:2961\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1a75d45ccbbc90617be5b85543c48a0c4c31f9731641d38be397027b21487b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:12299-12311 | crates/ty_python_semantic/src/types/infer/builder.rs:12702-12714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:12299\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn finish_statement(mut\u0060 in one and \u0060super) fn finish_scope(mut\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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":12299}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e8be8643f10f3547294aa4454f4f1d90642282cf9235fc890832e789d4507e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/post_inference/function.rs:571-583 | crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs:907-919 \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 \u0060crates/ty_python_semantic/src/types/infer/builder/post_inference/function.rs:571\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/ty_python_semantic/src/types/infer/builder/post_inference/function.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"95280be3256881701ad2c61f6cbdda9b8c460aebf5d2d275ef0673d8251bd596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ty_python_semantic/src/types/set_theoretic/builder.rs:2511-2522 | crates/ty_python_semantic/src/types/set_theoretic/builder.rs:2557-2569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/set_theoretic/builder.rs:2511\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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf83297510e5224b783e8c5a725e3f580e50194ec28a2c7962ba4b4d2431b053"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:3488-3500 | crates/ty_python_semantic/src/types/signatures.rs:3518-3530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/signatures.rs:3488\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3488}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d183479b43532509da72cd4ed377fc04698215fd147ae30bb04eb4bde340c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:3860-3872 | crates/ty_python_semantic/src/types/signatures.rs:4003-4015 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3860}}}],"partialFingerprints":{"codehealthFindingId/v1":"7979ed839d4d865181eb469a08709474e94f10828aeee7dd2f6dc9c97b3ad2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_server/src/server/api/diagnostics.rs:697-709 | crates/ty_server/src/server/api/requests/code_action.rs:140-152 \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/ty_server/src/server/api/diagnostics.rs:697\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/ty_server/src/server/api/diagnostics.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edc08e8bd147bdf7b2f68d04f10b0707e9e788fb319df6513e5841f4d114072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_server/src/server/api/requests/call_hierarchy_incoming_calls.rs:30-42 | crates/ty_server/src/server/api/requests/call_hierarchy_outgoing_calls.rs:30-42 \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 \u0060crates/ty_server/src/server/api/requests/call_hierarchy_incoming_calls.rs:30\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060CallHierarchyIncomingCallsParams\u0060 in one and \u0060CallHierarchyOutgoingCallsParams\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":"crates/ty_server/src/server/api/requests/call_hierarchy_incoming_calls.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c568732e7d8ef9c461a7c8f12ff4bb31a0bff43559aeed8f8b789a93bae1da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/ruff_linter/src/rules/isort/order.rs:71-82 | crates/ruff_linter/src/rules/isort/order.rs:96-107 | crates/ruff_linter/src/rules/isort/order.rs:194-205 | crates/ruff_linter/src/rules/isort/order.rs:219-230 \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/ruff_linter/src/rules/isort/order.rs:71\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/ruff_linter/src/rules/isort/order.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bb1c5ced3d701d816281226218c4c93069746f61af0ce6f939d2cff8061db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/ty_server/src/server/api/requests/goto_declaration.rs:59-70 | crates/ty_server/src/server/api/requests/goto_definition.rs:60-71 | crates/ty_server/src/server/api/requests/goto_implementation.rs:59-70 | crates/ty_server/src/server/api/requests/goto_type_definition.rs:60-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_server/src/server/api/requests/goto_declaration.rs:59\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/ty_server/src/server/api/requests/goto_declaration.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8ef4b7c3a960b045c5f7a7ebedfed25943c50656e7390a3f948958aac33e23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs:207-218 | crates/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs:223-234 | crates/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs:239-250 \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/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs:207\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/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40df0e3a8fb217abe571bd746449c0a1b5f34ce10b385d4af8b56d4e2ee9fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ty_python_semantic/src/types/call/bind.rs:3173-3184 | crates/ty_python_semantic/src/types/call/bind.rs:3206-3217 | crates/ty_python_semantic/src/types/call/bind.rs:3298-3309 \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/ty_python_semantic/src/types/call/bind.rs:3173\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8f90aae93abf4b4df6ee36ee0957ed8ba7fb5e0c9b4e77e071afaf848a301e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/ty_python_semantic/src/types/call/bind.rs:3171-3182 | crates/ty_python_semantic/src/types/call/bind.rs:3244-3255 | crates/ty_python_semantic/src/types/call/bind.rs:3297-3307 \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/ty_python_semantic/src/types/call/bind.rs:3171\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3171}}}],"partialFingerprints":{"codehealthFindingId/v1":"766c7d6bde429b326d74047371e047726daf68f757ed3e192dfabe35c6315bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ty_python_semantic/src/types/infer.rs:1090-1101 | crates/ty_python_semantic/src/types/infer.rs:2101-2112 | crates/ty_python_semantic/src/types/infer.rs:2349-2360 \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/ty_python_semantic/src/types/infer.rs:1090\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/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f4a72acfc31a45b619b7e6945a28857319a3f8452d8e5ca9d4ad17bc4bdff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/analyze/expression.rs:244-255 | crates/ruff_linter/src/checkers/ast/analyze/expression.rs:480-491 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4219a15e35529d4f7795331cb2cc48684b6ae76bca30d3cfc990baebff49659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/helpers.rs:142-153 | crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs:822-833 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/helpers.rs\u0060 and \u0060crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 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 \u0060crates/ruff_linter/src/rules/numpy/rules/numpy_2_0_deprecation.rs:822\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/ruff_linter/src/rules/airflow/helpers.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6749bddb845c271f5119c8c30d0a345ae285357bed1e545a9ebc1c089d8a9f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:99-110 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs:115-126 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eadd631132203302443b95946cce4bfc6466856e572c770dbddbeb4de6b02d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/rules/runtime_value_in_dag_or_task.rs:192-202 | crates/ruff_linter/src/rules/airflow/rules/runtime_value_in_dag_or_task.rs:212-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/airflow/rules/runtime_value_in_dag_or_task.rs:192\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/ruff_linter/src/rules/airflow/rules/runtime_value_in_dag_or_task.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fe0d1afc74043b9b320e26c3f41c054069ebda91a4164627fa9c555cf30195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_bandit/rules/request_with_no_cert_validation.rs:57-68 | crates/ruff_linter/src/rules/flake8_bandit/rules/request_without_timeout.rs:66-77 \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":"crates/ruff_linter/src/rules/flake8_bandit/rules/request_with_no_cert_validation.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef154a722467b053b45aa25725d1fab54e7d6e2bf19fc87829d670b14e32445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_boolean_trap/rules/boolean_default_value_positional_argument.rs:132-143 | crates/ruff_linter/src/rules/flake8_boolean_trap/rules/boolean_type_hint_positional_argument.rs:137-148 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruff_linter/src/rules/flake8_boolean_trap/rules/boolean_default_value_positional_argument.rs:129\u0060 calls \u0060iter\u0060, \u0060chain\u0060, \u0060default\u0060 and \u0060crates/ruff_linter/src/rules/flake8_boolean_trap/rules/boolean_type_hint_positional_argument.rs:134\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/ruff_linter/src/rules/flake8_boolean_trap/rules/boolean_default_value_positional_argument.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced3708ac1ca45cbf1103e64f84b48eae3a90ece7050df760da412257a287c03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs:578-589 | crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs:611-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs:578\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/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a36e498f3137967f81a21b8dd7afba73599fac5b5049ddd5148b70ab413077"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:619-630 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:840-848 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:619\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/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"5232eabe33cbdda0fea4c101288b182eb7e3fa5f495e2b7b595d9444bd48dae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/raises.rs:237-259 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/warns.rs:205-227 \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 \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/raises.rs:237\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/ruff_linter/src/rules/flake8_pytest_style/rules/raises.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a314ba946c927aca5f31ed0fb7e5adb4b66427af11160ffa1f0d6902e6913aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:188-199 | crates/ruff_linter/src/rules/pylint/rules/dict_iter_missing_items.rs:80-92 \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/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:188\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/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5eff8f731523aeea55858008fc62a0f204bd8d3cdb53184c0f5eed89e26f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs:230-240 | crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs:276-287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs:230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"db80cfd999da88c0804b9adfd5b573dc92b923940d6f8b6d05727e1c904720a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs:226-237 | crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs:245-262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs:226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2886cf0a10e5c1b3a103a4dce34dbc4ef892d5b93f1114fe7b33aceaf5a987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/redefined_loop_name.rs:378-389 | crates/ruff_linter/src/rules/pylint/rules/redefined_loop_name.rs:396-407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pylint/rules/redefined_loop_name.rs:378\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/ruff_linter/src/rules/pylint/rules/redefined_loop_name.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec40ce8b161682c31c13072b4c33b448f9821bb5c189dcd4ae025b31656c52a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs:172-183 | crates/ruff_linter/src/rules/pyupgrade/rules/convert_typed_dict_functional_to_class.rs:157-168 \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 \u0060crates/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs:172\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/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7661f06f5a6781c4e27477a7fcb00f11ca5e05ad7ac8c7ab6a94714bb39db84a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/ruff_linter/src/rules/tryceratops/rules/error_instead_of_exception.rs:78-86 | crates/ruff_linter/src/rules/tryceratops/rules/verbose_log_message.rs:54-65 \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 \u0060crates/ruff_linter/src/rules/tryceratops/rules/error_instead_of_exception.rs:78\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/ruff_linter/src/rules/tryceratops/rules/error_instead_of_exception.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd73d804144729b4abb860590af955bfcd74f587596db5e8f3755da5b452bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruff_python_formatter/src/expression/expr_call.rs:38-48 | crates/ruff_python_formatter/src/expression/expr_subscript.rs:43-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_formatter/src/expression/expr_call.rs:38\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/ruff_python_formatter/src/expression/expr_call.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a42fc4a5e6fb7cdeb2ca00ee36e4a4d7cde9d3707383d0ad9f0467de14ae30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ruff_python_formatter/src/expression/expr_slice.rs:93-104 | crates/ruff_python_formatter/src/expression/expr_slice.rs:127-136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/expression/expr_slice.rs:93\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/ruff_python_formatter/src/expression/expr_slice.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f7d5e65ea3b2fc8e4df3aaa6eaead7ef127df71296e86ff78eedf467b4b6a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_server/src/edit/text_document.rs:114-125 | crates/ty_server/src/document/text_document.rs:124-135 \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/ruff_server/src/edit/text_document.rs:114\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/ruff_server/src/edit/text_document.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d70772415dc6eefc83f54d076af2d3d52c231f8c247221a8e18abefc458daf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruff_server/src/lib.rs:61-80 | crates/ty_server/src/lib.rs:55-74 \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/ruff_server/src/lib.rs:61\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/ruff_server/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2c44dfc25940d03d5ff4aaedfbe55c63c1f352326770cdd260732876e64605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_server/src/server.rs:143-154 | crates/ty_server/src/server.rs:189-200 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server.rs\u0060 and \u0060crates/ty_server/src/server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0587b7f6382816692ef136e927bfedf327046f9087a496c729c23b245fcb24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruff_server/src/server/schedule/thread/pool.rs:51-62 | crates/ty_server/src/server/schedule/thread/pool.rs:48-58 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/schedule/thread/pool.rs\u0060 and \u0060crates/ty_server/src/server/schedule/thread/pool.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 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 \u0060crates/ruff_server/src/server/schedule/thread/pool.rs:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d42079afeece341fe64a0079921a4958af126f30062249a529d75e3c247eace"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty/src/python_version.rs:26-37 | crates/ty_project/src/metadata/python_version.rs:55-66 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/python_version.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fec5cec3c781da6982132e5c7004a75c78cec5ebdd82d99f14623aab696455d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ty_ide/src/docstring/markdown/structured/google.rs:13-22 | crates/ty_ide/src/docstring/markdown/structured/numpy.rs:14-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060parsed\u0060 to \u0060google::Section\u0060 in one and \u0060numpy::Section\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":"crates/ty_ide/src/docstring/markdown/structured/google.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2e565dd2cd88ca09e551ca62f280c85794e8e90b031f44011792c69a8f3e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ty_python_core/src/narrowing_constraints.rs:303-312 | crates/ty_python_core/src/reachability_constraints.rs:437-448 \u2014 before extracting anything, compare \u0060crates/ty_python_core/src/narrowing_constraints.rs\u0060 and \u0060crates/ty_python_core/src/reachability_constraints.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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 \u0060crates/ty_python_core/src/narrowing_constraints.rs:303\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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"980e355eec1ca7d4b0ea2c8790078c19413c27b60b4001aa2e9ded759fdcdbd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ty_python_core/src/narrowing_constraints.rs:370-379 | crates/ty_python_core/src/reachability_constraints.rs:518-529 \u2014 before extracting anything, compare \u0060crates/ty_python_core/src/narrowing_constraints.rs\u0060 and \u0060crates/ty_python_core/src/reachability_constraints.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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 \u0060crates/ty_python_core/src/narrowing_constraints.rs:370\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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52baeb07e5cd6257d146cbe753cebf1c82cfdcef99f1faaa76832cd30283a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty_python_semantic/src/types.rs:5824-5835 | crates/ty_python_semantic/src/types.rs:5879-5890 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types.rs:5824\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/ty_python_semantic/src/types.rs"},"region":{"startLine":5824}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2b4b14ae9f4cb7fcfe2790d4ecbcc424e200d840be2f67e78a22e65f4eabd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:1185-1196 | crates/ty_python_semantic/src/types/call/bind.rs:1213-1224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/call/bind.rs:1185\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5130b9dead665964ccebd5b3ccb1f7e0016c8bf36272a379f3569abbafde118b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:3231-3241 | crates/ty_python_semantic/src/types/call/bind.rs:3320-3331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/call/bind.rs:3231\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0052eeb095e71df85aeee14d7b01b8870a93eba4e616b73e7932ca3739442d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:10709-10720 | crates/ty_python_semantic/src/types/call/bind.rs:10789-10800 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/call/bind.rs:10709\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":10709}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0da37b77fa1d5948a5b5d114b46db154be9da57a239bb1c65ea181a28427ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ty_python_semantic/src/types/class/typed_dict.rs:804-815 | crates/ty_python_semantic/src/types/class/typed_dict.rs:817-826 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/class/typed_dict.rs:804\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/ty_python_semantic/src/types/class/typed_dict.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e22486ab806d5f62b518211a7e829e971208408f738ea616b0f4dae144e865e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:706-717 | crates/ty_python_semantic/src/types/infer/builder.rs:763-774 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc88ddec4289a7486287a27f94f1581020e10e517ba4e6d1fab59aa9355aade"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:8864-8875 | crates/ty_python_semantic/src/types/infer/builder.rs:8892-8903 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:8864\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":8864}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a844e359775a519a2ae954d3b09de8a32bb295bafea72cc3dd0f1a0a3f9d955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/annotation_expression.rs:191-202 | crates/ty_python_semantic/src/types/infer/builder/annotation_expression.rs:210-220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/annotation_expression.rs:191\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/ty_python_semantic/src/types/infer/builder/annotation_expression.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"844179d52c6ce72c727ca8f19bdeee65ba5c626a5f2966f189d519894ddf21a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty_python_semantic/src/types/relation.rs:3024-3035 | crates/ty_python_semantic/src/types/relation.rs:3071-3082 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/relation.rs:3024\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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":3024}}}],"partialFingerprints":{"codehealthFindingId/v1":"514716328222fbaeb8348f6ef7a9ae1ba380311783c0dfade0bf45bb9ac3b252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:644-655 | crates/ty_python_semantic/src/types/signatures.rs:2492-2503 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5bd014f43d5b2665dff09ed2c33c26319328982fd4d8f7eaace5b8de3c0a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty_python_semantic/src/types/tuple.rs:2831-2842 | crates/ty_python_semantic/src/types/tuple.rs:2861-2872 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/tuple.rs:2831\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/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":2831}}}],"partialFingerprints":{"codehealthFindingId/v1":"898f15ffa7e90ec9e9f8c10577714296807b9c748796d1dacb88d8e3a5613d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty_site_packages/src/lib.rs:2080-2091 | crates/ty_site_packages/src/lib.rs:2152-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_site_packages/src/lib.rs:2152\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, \u0060crates/ty_site_packages/src/lib.rs:2076\u0060 calls \u0060from_executable_home_path\u0060 and \u0060crates/ty_site_packages/src/lib.rs:2147\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/ty_site_packages/src/lib.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bda97e55c00b52051fb19525098653a42903083122c26e3c422d839ea723f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs:74-84 | crates/ruff_linter/src/rules/pylint/rules/invalid_bytes_return.rs:74-84 | crates/ruff_linter/src/rules/pylint/rules/invalid_hash_return.rs:78-88 | crates/ruff_linter/src/rules/pylint/rules/invalid_index_return.rs:80-90 | crates/ruff_linter/src/rules/pylint/rules/invalid_length_return.rs:79-89 | crates/ruff_linter/src/rules/pylint/rules/invalid_str_return.rs:74-84 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs\u0060 and \u0060crates/ruff_linter/src/rules/pylint/rules/invalid_bytes_return.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/invalid_bool_return.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eed4270e47b33d6671963ffbd985511034096d183d1ae28676208546e24671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): crates/ruff_python_ast/src/name.rs:532-542 | crates/ruff_python_ast/src/name.rs:545-555 | crates/ruff_python_ast/src/name.rs:559-569 | crates/ruff_python_ast/src/name.rs:574-584 | crates/ruff_python_ast/src/name.rs:590-600 \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 \u0060crates/ruff_python_ast/src/name.rs:532\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, \u0060crates/ruff_python_ast/src/name.rs:556\u0060 calls \u0060as_str\u0060 and \u0060crates/ruff_python_ast/src/name.rs:543\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/ruff_python_ast/src/name.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd9f6b48bc36ee486256c443c0087d2ddc9f6c08c1335ab0ac33a8b2dc3ec3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 4): crates/ruff_linter/src/checkers/ast/analyze/expression.rs:1554-1563 | crates/ruff_linter/src/checkers/ast/analyze/expression.rs:1585-1594 | crates/ruff_linter/src/checkers/ast/analyze/expression.rs:1626-1636 | crates/ruff_linter/src/checkers/ast/analyze/expression.rs:1656-1663 \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/ruff_linter/src/checkers/ast/analyze/expression.rs:1554\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, \u0060crates/ruff_linter/src/checkers/ast/analyze/expression.rs:1552\u0060 calls \u0060unnecessary_list_set_comprehension\u0060 and \u0060crates/ruff_linter/src/checkers/ast/analyze/expression.rs:1656\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":"crates/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e17392a499b4fd8c4393de51e4ebd9f9f6ae656a18d2fa6dea5ee9a173c67c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 4): crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:786-792 | crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:813-819 | crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:902-912 | crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:937-947 \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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:786\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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"80730b682d590189e40b8ce72931a46da4eafda95434aec751ba2343bd0f09de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/ruff_linter/src/rules/flake8_errmsg/rules/string_in_exception.rs:210-220 | crates/ruff_linter/src/rules/flake8_errmsg/rules/string_in_exception.rs:227-237 | crates/ruff_linter/src/rules/flake8_errmsg/rules/string_in_exception.rs:241-251 | crates/ruff_linter/src/rules/flake8_errmsg/rules/string_in_exception.rs:260-270 \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/ruff_linter/src/rules/flake8_errmsg/rules/string_in_exception.rs:210\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/ruff_linter/src/rules/flake8_errmsg/rules/string_in_exception.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37137ac400bd2e74fecfee2dceac7e31549aea26479b9fca41f42dd532c6e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs:262-272 | crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:1095-1105 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs:386-395 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 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 \u0060crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs:262\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs:259\u0060 calls \u0060split\u0060, \u0060next\u0060, \u0060unwrap_or\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs:383\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/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"89047092368638685e0da9fabfb0813e64a746210ca17e6596ce8b2fb1f4c39f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_makedirs.rs:108-118 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_mkdir.rs:106-116 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_symlink.rs:110-120 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_makedirs.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_symlink.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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":"crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_makedirs.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1da2ed9cbfa30d0a3af5cd6a27ae577e6f5a9e7a49e7257a6e4dcc0750da09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/ruff_python_formatter/src/expression/expr_generator.rs:44-53 | crates/ruff_python_formatter/src/expression/expr_list_comp.rs:17-27 | crates/ruff_python_formatter/src/expression/expr_set_comp.rs:17-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_formatter/src/expression/expr_generator.rs:44\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026ExprGenerator\u0060 in one and \u0060\u0026ExprListComp\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":"crates/ruff_python_formatter/src/expression/expr_generator.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2fea27c91fcd55a950d7441b23d409e7fb9afa4f67b60544cf09cdc3558b98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ty_python_semantic/src/types/diagnostic.rs:5017-5027 | crates/ty_python_semantic/src/types/diagnostic.rs:5063-5073 | crates/ty_python_semantic/src/types/infer/builder/post_inference/function.rs:643-653 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/diagnostic.rs:5017\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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5017}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9279be96b3c784c77017153ecff7da1e75ed0f1e271a1bbfa6e2f20575eaab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ty_python_semantic/src/types/infer/comparisons.rs:528-538 | crates/ty_python_semantic/src/types/narrow.rs:5590-5600 | crates/ty_python_semantic/src/types/typed_dict.rs:2097-2107 \u2014 before extracting anything, compare \u0060crates/ty_python_semantic/src/types/narrow.rs\u0060 and \u0060crates/ty_python_semantic/src/types/typed_dict.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 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":"crates/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1c0d3217b62a526bd07b5f5a54baaa7bbb8ea90e10cb929eed099875a33d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff/src/args.rs:1031-1041 | crates/ruff/src/commands/completions/config.rs:124-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/args.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f4bfcf69f116ece53c6577b60e61c0c7c7b45d9940bed90a2abac79e8a6649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/ruff/src/diagnostics.rs:264-271 | crates/ruff/src/diagnostics.rs:446-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff/src/diagnostics.rs:264\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/ruff/src/diagnostics.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fd9c5beebd7aeb2f74d7ff2dce2fac73bc3cca25233548ec274fef0094d078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff/src/version.rs:29-39 | crates/ty/src/version.rs:29-39 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/version.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c360eaf9ff31ccb159d7529952f3df0d7406c61b1a84e847d487108e3d5cec7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:1199-1209 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs:325-335 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 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 \u0060crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:1199\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/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b394d6dbb39b5f515bda5dd95c4184d4f5cfe68ed0ab77f54804c4dffa3337b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/fixture.rs:752-762 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/marks.rs:166-176 \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 \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/fixture.rs:752\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, \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/fixture.rs:750\u0060 calls \u0060is_rule_enabled\u0060 and \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/marks.rs:164\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":"crates/ruff_linter/src/rules/flake8_pytest_style/rules/fixture.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"262fe8f9f810ab32804dc54738a71703f522154f9b71318db95f05f05cf4d8c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_quotes/rules/avoidable_escaped_quote.rs:310-320 | crates/ruff_linter/src/rules/flake8_quotes/rules/unnecessary_escaped_quote.rs:131-141 \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":"crates/ruff_linter/src/rules/flake8_quotes/rules/avoidable_escaped_quote.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6464154e6feed63038462261e13fa8afbec0e081d7deee7ad3b426d3a64405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_if_exp.rs:275-285 | crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_if_exp.rs:291-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_if_exp.rs:275\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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_if_exp.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"81071903907522921d46abea0f0f5a619c3fb8ad6c08e26ddc1327577fdf2227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruff_linter/src/rules/pep8_naming/helpers.rs:44-53 | crates/ruff_linter/src/rules/pep8_naming/helpers.rs:59-69 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pep8_naming/helpers.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7459415733139b100f75dde2fc3118e44adc9b5bbaff41a5886766a9d027108b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/ruff_linter/src/rules/pycodestyle/rules/lambda_assignment.rs:107-117 | crates/ruff_linter/src/rules/ruff/rules/legacy_form_pytest_raises.rs:165-172 \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/ruff_linter/src/rules/pycodestyle/rules/lambda_assignment.rs:107\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/ruff_linter/src/rules/pycodestyle/rules/lambda_assignment.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c6f98868448b3b5ee8d9014fa5eb65d8d972d2744b39d33f31fbc8a375cf24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_linter/src/rules/ruff/rules/unnecessary_cast_to_int.rs:81-91 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_round.rs:101-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 both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/unnecessary_cast_to_int.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e38789a536dd857864d6ed3d18bb4f8fa3c3bd63e9c86daaf29dad66b4253a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruff_linter/src/rules/ruff/rules/unnecessary_if.rs:193-203 | crates/ruff_linter/src/rules/ruff/rules/useless_finally.rs:237-246 \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 \u0060crates/ruff_linter/src/rules/ruff/rules/unnecessary_if.rs:193\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/ruff_linter/src/rules/ruff/rules/unnecessary_if.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e209d652620a508f9289f0ce4bcdf579bafbbe4f96a9b6899bb3a23c850a78d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruff_python_ast/src/nodes.rs:2944-2954 | crates/ruff_python_formatter/src/expression/expr_compare.rs:69-78 \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/ruff_python_ast/src/nodes.rs:2944\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruff_python_formatter/src/expression/expr_compare.rs:81\u0060 calls \u0060token\u0060, \u0060fmt\u0060 and \u0060crates/ruff_python_ast/src/nodes.rs:2954\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/ruff_python_ast/src/nodes.rs"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a02e64698baee59ad4903e1270d4b2fb9795e8bbdfddbcaf11fa7ed92f34a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_python_formatter/src/statement/stmt_assign.rs:280-290 | crates/ruff_python_formatter/src/statement/stmt_assign.rs:550-560 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/statement/stmt_assign.rs:550\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, \u0060crates/ruff_python_formatter/src/statement/stmt_assign.rs:561\u0060 calls \u0060should_non_inlineable_use_best_fit\u0060, \u0060context\u0060 and \u0060crates/ruff_python_formatter/src/statement/stmt_assign.rs:291\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":"crates/ruff_python_formatter/src/statement/stmt_assign.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fcf0871701d6c45f6e87dd1bb69bff4e8eda8ece047abb9d1f4ca722839fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_python_index/src/multiline_ranges.rs:29-39 | crates/ruff_python_trivia/src/comment_ranges.rs:81-91 \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/ruff_python_index/src/multiline_ranges.rs:29\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_index/src/multiline_ranges.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbe724ac326a211e416be90404dbb13de1e03222a13909950c349120deb345a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_python_parser/src/semantic_errors.rs:931-941 | crates/ruff_python_parser/src/semantic_errors.rs:951-961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_parser/src/semantic_errors.rs:951\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/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"173521aa119ac6885cf735ce70669b61691ecdec057ad0b1ce03ae16a3f947d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_python_semantic/src/model.rs:524-554 | crates/ruff_python_semantic/src/model.rs:874-884 \u2014 both copies are in the same file, so extract the block 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/ruff_python_semantic/src/model.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b3357d99425a5fcdb2bb429349f7d5a1dc375dc6120405925251a52519ae36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/ty_ide/src/docstring/document.rs:225-233 | crates/ty_ide/src/docstring/document/rst.rs:374-384 \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/ty_ide/src/docstring/document.rs:225\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/ty_ide/src/docstring/document.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"259851e84c977ca059f9ddd4408c3ed69456bf9e17155e14096d4f72aea5191b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ty_python_core/src/builder.rs:3181-3191 | crates/ty_python_core/src/builder.rs:3752-3761 \u2014 both copies are in the same file, so extract the block 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/ty_python_core/src/builder.rs"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd052afb96038dd02e1cf05374584b5e586ccc301bc3a0d54e74446c53acc34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_core/src/narrowing_constraints.rs:150-160 | crates/ty_python_core/src/reachability_constraints.rs:206-216 \u2014 before extracting anything, compare \u0060crates/ty_python_core/src/narrowing_constraints.rs\u0060 and \u0060crates/ty_python_core/src/reachability_constraints.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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 \u0060crates/ty_python_core/src/narrowing_constraints.rs:150\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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c8ce02f540df687374d64fa3532d16501663658eaaba02a582243fb2485143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_core/src/narrowing_constraints.rs:320-330 | crates/ty_python_core/src/narrowing_constraints.rs:387-398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_core/src/narrowing_constraints.rs:320\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3e73a0b4205626b57684b0a619851b0712ed6f8f4fecc55932b167dcb8d7c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:6925-6935 | crates/ty_python_semantic/src/types/call/bind.rs:7148-7158 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6925}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea62b3d23b76fe67c297bdc5e3070fd06aa41503cf51679ac6251d2e4e9ef3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:8569-8578 | crates/ty_python_semantic/src/types/typevar.rs:993-1003 \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/ty_python_semantic/src/types/call/bind.rs:8569\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8569}}}],"partialFingerprints":{"codehealthFindingId/v1":"89855801de56d257c34db94bfae6d812e93e0ea9675a3f2886e6abeff16e673a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:1577-1587 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1803-1813 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/sequents.rs:1577\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a4c0000d04333daca9e4e102469da3d851bd618357f21ed0b12a8a0fd106c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/variables.rs:807-817 | crates/ty_python_semantic/src/types/constraints/variables.rs:1188-1198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/variables.rs:807\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/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6353ff7a69fef4ca84b9dff5b066685c4991b885214c941b21a7fe7116865a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:4527-4537 | crates/ty_python_semantic/src/types/infer/builder.rs:4805-4813 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:4527\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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4527}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef8ac82dd4e3afb4d3ec7f2fe3b892fb186ee569d97dd16d36ce190a5bc1dc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:7568-7578 | crates/ty_python_semantic/src/types/infer/builder.rs:8047-8057 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:7568\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":7568}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4d19db15c1f400234ff3989cfcf421abbff51470c16594e9b2270606fbf77c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs:677-687 | crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs:764-774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs:764\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":"crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"e075126c0fedb81ed8de0f523b7fb15ab7ea5ed91dc927049037aadcc74c9515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/post_inference/overloaded_function.rs:228-238 | crates/ty_python_semantic/src/types/infer/builder/post_inference/overloaded_function.rs:261-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/infer/builder/post_inference/overloaded_function.rs:228\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/ty_python_semantic/src/types/infer/builder/post_inference/overloaded_function.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad9d9d8cf7827f8a90ccc990e42018a1d88294fbd72990cf07a8ea5eec6edaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/subscript.rs:1847-1857 | crates/ty_python_semantic/src/types/infer/builder/subscript.rs:2295-2305 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"b928987a246c6ef2e565857303d23bd97f2f83afaa10c4e6e899e05863df375e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:735-745 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:1029-1039 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:735\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"313eb84c0b5a348d831cfab6f3a13288c42623d15a543324d0ed4cf7383ae78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:1659-1669 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:1755-1766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:1659\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"7268a959ac089731c7cd2120fc8903acfea59c20e5243f179c8208a58a15a5f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/narrow.rs:5484-5494 | crates/ty_python_semantic/src/types/narrow.rs:5531-5541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/narrow.rs:5484\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/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":5484}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfbc8455f2aef18e3584c260edc6c06515ef3608ec637660169dd199640cedb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ty_python_semantic/src/types/relation.rs:3049-3059 | crates/ty_python_semantic/src/types/relation.rs:3096-3105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/relation.rs:3049\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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":3049}}}],"partialFingerprints":{"codehealthFindingId/v1":"a229b5b4ad7fa4d22b29594c5038cc2c87c2d42d5858f3609244ebb92757a872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:3716-3726 | crates/ty_python_semantic/src/types/signatures.rs:3889-3899 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3716}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e9802b39da53a41a30c7a665b2dec440a79e29f98e3386ded14c25b153231f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/typed_dict.rs:2449-2459 | crates/ty_python_semantic/src/types/typed_dict.rs:2468-2478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/typed_dict.rs:2449\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ty_python_semantic/src/types/typed_dict.rs:2461\u0060 calls \u0060is_assignable_to\u0060 and \u0060crates/ty_python_semantic/src/types/typed_dict.rs:2480\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/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af974090a3179d22919806971ce27811e2661fca12c35bdc0552d77b94a451c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/ty_python_semantic/src/types/infer/builder.rs:5818-5827 | crates/ty_python_semantic/src/types/infer/builder.rs:11916-11925 | crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs:1162-1171 | crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs:1190-1199 | crates/ty_python_semantic/src/types/narrow.rs:5594-5603 | crates/ty_python_semantic/src/types/typed_dict.rs:2101-2110 \u2014 before extracting anything, compare \u0060crates/ty_python_semantic/src/types/narrow.rs\u0060 and \u0060crates/ty_python_semantic/src/types/typed_dict.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs:1172\u0060 calls \u0060Intersection\u0060, \u0060EnumComplement\u0060 and \u0060crates/ty_python_semantic/src/types/infer/builder.rs:5828\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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":5818}}}],"partialFingerprints":{"codehealthFindingId/v1":"a710d5e5873fb8d0fdc9f0b523c808c11d5a2c9af56cd25b405731250f96296d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs:263-273 | crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:1200-1210 | crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs:1096-1106 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs:326-336 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs:387-396 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 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 \u0060crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.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":"crates/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e9f25d3c4888c9005c2ef5453f539b1c63deaca811975637da6ebcbad568d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/ty_python_semantic/src/types/infer/builder.rs:719-729 | crates/ty_python_semantic/src/types/infer/builder.rs:833-842 | crates/ty_python_semantic/src/types/infer/builder.rs:874-885 | crates/ty_python_semantic/src/types/infer/builder.rs:914-923 \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/ty_python_semantic/src/types/infer/builder.rs:719\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ty_python_semantic/src/types/infer/builder.rs:715\u0060 calls \u0060extend\u0060, \u0060iter\u0060, \u0060copied\u0060 and \u0060crates/ty_python_semantic/src/types/infer/builder.rs:829\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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b33dbfb0d952879254058de874f9b8e112648d5cf4a9fb2e98dde800a08035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/ty_python_semantic/src/types/set_theoretic/builder.rs:571-580 | crates/ty_python_semantic/src/types/set_theoretic/builder.rs:583-592 | crates/ty_python_semantic/src/types/set_theoretic/builder.rs:595-604 | crates/ty_python_semantic/src/types/set_theoretic/builder.rs:613-622 \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/ty_python_semantic/src/types/set_theoretic/builder.rs:571\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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a67f1733de557275765b8556dca640bfc4d6d830ca557cffaaa2c3519f9db6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:588-608 | crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:610-630 | crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:632-652 \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/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ca150ae267bd3d3ca9b028fc37516886e7bac8953be002d8477dc8817b13af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs:127-136 | crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_set.rs:128-137 | crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_list_comprehension_set.rs:73-82 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_set.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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 \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs:127\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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65ace28554c7fc37f79e0a39d511f4d36cf6fc2372d4cfbb21445b4eef73e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs:245-254 | crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs:280-289 | crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/whitespace_around_keywords.rs:172-181 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs:245\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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/space_around_operator.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af633164eef65d1ac07a05a45800b4c9936537cb622356488fca82aff16310e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ty_python_semantic/src/types/attribute_write.rs:461-470 | crates/ty_python_semantic/src/types/attribute_write.rs:1237-1246 | crates/ty_python_semantic/src/types/infer/builder.rs:3253-3262 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ty_python_semantic/src/types/attribute_write.rs:1247\u0060 calls \u0060EnumComplement\u0060, \u0060TypeVar\u0060 and \u0060crates/ty_python_semantic/src/types/attribute_write.rs:471\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":"crates/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b9d7b63271c543237a257196ab7c462ebe1e9bf106337b9c0e6f3d06039e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/ty_python_semantic/src/types/constraints/variables.rs:798-807 | crates/ty_python_semantic/src/types/constraints/variables.rs:917-926 | crates/ty_python_semantic/src/types/constraints/variables.rs:1033-1041 \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/ty_python_semantic/src/types/constraints/variables.rs:798\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":"crates/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74aa93badae3d1066f889bb726290ac9b2e3570260d1717e18a2d07291d289c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/ty_python_semantic/src/types/infer/builder.rs:2498-2506 | crates/ty_python_semantic/src/types/infer/builder.rs:5496-5505 | crates/ty_python_semantic/src/types/infer/builder.rs:9045-9054 \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/ty_python_semantic/src/types/infer/builder.rs:2498\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"800613ee3804240b226773bc3fa7bd18a3d0e7cb3bf30e53b18bb30ce88100db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_annotate_snippets/src/renderer/render.rs:1416-1425 | crates/ruff_annotate_snippets/src/renderer/render.rs:1433-1443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_annotate_snippets/src/renderer/render.rs:1416\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/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aca350fd1a2e1da57df6322e34dacff221ba45c27aa20ebd797cad92658eb57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_db/src/diagnostic/render/json.rs:154-163 | crates/ruff_db/src/diagnostic/render/json.rs:165-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/ruff_db/src/diagnostic/render/json.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f848417c9e063b8f847d523c1cf24bd80aa15bf9c8154529bdb9e00f9d3b3538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_linter/src/fix/edits.rs:241-250 | crates/ruff_linter/src/fix/edits.rs:302-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":"crates/ruff_linter/src/fix/edits.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c1583c548283a270ce42ba793bb20d3edcd72ad031474e202356ee57a5d8f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:775-784 | crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:802-811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:775\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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80758599b3fca9f41693b629e169b54a9c8004cec03777687bce67322dd680a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs:362-370 | crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs:376-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs:362\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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. 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/ruff_linter/src/rules/flake8_pyi/rules/simple_defaults.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b7dae1e0c969677ff8c1995bacfb8440a6d4b8e350fad91c60450978d3fa5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_linter/src/rules/isort/order.rs:112-121 | crates/ruff_linter/src/rules/isort/order.rs:235-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/ruff_linter/src/rules/isort/order.rs:112\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/ruff_linter/src/rules/isort/order.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"153e7d6fabf368a31504d56367482c3855c16134bda9a081b4cb25b59ebee24b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/incorrect_dict_iterator.rs:123-132 | crates/ruff_linter/src/rules/perflint/rules/incorrect_dict_iterator.rs:142-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/perflint/rules/incorrect_dict_iterator.rs:123\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/ruff_linter/src/rules/perflint/rules/incorrect_dict_iterator.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"051387e08befcf9c3069a5be745c3dd1dfa5cddd045e4bffb50e58f18ebe96ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:224-234 | crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:277-287 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs\u0060 and \u0060crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 125 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 \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:224\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, \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:223\u0060 calls \u0060is_fix_manual_dict_comprehension_enabled\u0060, \u0060settings\u0060 and \u0060crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:275\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/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc10ce48695eebea7fd7f6b8a85b9953ee6c392dacea9c645fa76af48350fcc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs:276-287 | crates/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs:296-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs:276\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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/extraneous_whitespace.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"727888f3a187110fc6dbd2ebf3bb15f45ad1dfc477a09bf3f77a166bfd80504d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs:183-191 | crates/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs:217-226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs:183\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/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7bd594e88d3261a1e14bfb3a0ceed1a661ea040a0ea887c71ec705cb405bdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs:107-116 | crates/ruff_linter/src/rules/pylint/rules/redefined_slots_in_subclass.rs:125-134 \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 \u0060crates/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs:107\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/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"604afef27bf4b72ae55fd8c4e6b99a5a506ae0779c8a95a1b73c1766f12663b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.rs:206-223 | crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.rs:233-250 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9294f8608b7111e81cf627d6f14987d4a914d77260139abe2305a080bbd19393"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:144-153 | crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs:157-166 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs\u0060 and \u0060crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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 \u0060crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:144\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/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"088755ceb630d064ceeda337c48d03aa182fb932002dab82de36f9f5d4de9165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:72-81 | crates/ruff_linter/src/rules/refurb/rules/write_whole_file.rs:71-80 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs\u0060 and \u0060crates/ruff_linter/src/rules/refurb/rules/write_whole_file.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb6a62580ff0a352fc054b55d097dd2a1b159b2bd173874ee9a1e4fc8ff9de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_mdtest/src/lib.rs:141-150 | crates/ty_test/src/lib.rs:331-340 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_mdtest/src/lib.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93bef38544351570ee69325bd548b09046e87ae8d2ed95904f3fdeffd47dad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruff_python_ast/src/helpers.rs:344-353 | crates/ruff_python_ast/src/helpers.rs:364-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 \u0060crates/ruff_python_ast/src/helpers.rs:364\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/ruff_python_ast/src/helpers.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c54b97b3e6ae7010092334459dce6662056303997d661de15de91dff726268"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_ast/src/visitor.rs:524-533 | crates/ruff_python_ast/src/visitor/transformer.rs:518-527 \u2014 before extracting anything, compare \u0060crates/ruff_python_ast/src/visitor.rs\u0060 and \u0060crates/ruff_python_ast/src/visitor/transformer.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 538 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 \u0060crates/ruff_python_ast/src/visitor.rs:524\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/ruff_python_ast/src/visitor.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb6c878b05d995f4985f63331556f1c2163c1117b2af6642315cef03026fefd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_formatter/src/other/parameters.rs:357-366 | crates/ruff_python_formatter/src/other/parameters.rs:390-399 \u2014 both copies are in the same file, so extract the block 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/ruff_python_formatter/src/other/parameters.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2a90bd60226b641a1dc765a6ecc003e9f84fa9da108a61a8bf76c548d7328b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_formatter/src/statement/stmt_ann_assign.rs:84-93 | crates/ruff_python_formatter/src/statement/stmt_aug_assign.rs:49-58 \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 \u0060crates/ruff_python_formatter/src/statement/stmt_ann_assign.rs:84\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026StmtAnnAssign\u0060 in one and \u0060\u0026StmtAugAssign\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":"crates/ruff_python_formatter/src/statement/stmt_ann_assign.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9137cb7454f49bc8e94d369e215dff1ae4ff925a8064e04c7817e46d4653ba75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_formatter/src/statement/stmt_class_def.rs:27-36 | crates/ruff_python_formatter/src/statement/stmt_function_def.rs:22-31 \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 \u0060crates/ruff_python_formatter/src/statement/stmt_class_def.rs:27\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026StmtClassDef\u0060 in one and \u0060\u0026StmtFunctionDef\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":"crates/ruff_python_formatter/src/statement/stmt_class_def.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfd18b15604fd41f643354ec3b9476b9f43e5504bf109dd936e5fc9a1930955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_formatter/src/statement/stmt_class_def.rs:59-68 | crates/ruff_python_formatter/src/statement/stmt_function_def.rs:54-63 \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 \u0060crates/ruff_python_formatter/src/statement/stmt_class_def.rs:59\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 \u0060item\u0060 to \u0060\u0026StmtClassDef\u0060 in one and \u0060\u0026StmtFunctionDef\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":"crates/ruff_python_formatter/src/statement/stmt_class_def.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bcf40303f9ca7f81713d32853bc008ea3d0f74d4eaf86c56acde8c38011c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_parser/src/lexer.rs:601-610 | crates/ruff_python_parser/src/lexer.rs:614-623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_parser/src/lexer.rs:614\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruff_python_parser/src/lexer.rs:612\u0060 calls \u0060eat_char\u0060 and \u0060crates/ruff_python_parser/src/lexer.rs:600\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/ruff_python_parser/src/lexer.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e962846a1b14eeba00d51800ad04f751fe6fa6e54ea614c4aac68eeba6b1af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_parser/src/lexer.rs:724-733 | crates/ruff_python_parser/src/lexer.rs:874-885 \u2014 both copies are in the same file, so extract the block 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/ruff_python_parser/src/lexer.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff22c449f91d0185868199da98d8397cae0b0bec4960d7d9f1500dbfdcd7fac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruff_python_semantic/src/analyze/type_inference.rs:288-296 | crates/ruff_python_semantic/src/analyze/type_inference.rs:316-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_semantic/src/analyze/type_inference.rs:288\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/ruff_python_semantic/src/analyze/type_inference.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b521cc90e8fc2254e442c5cc4b6eecf00be0ae9ecc6bc093e923198aea15f8e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_semantic/src/cfg/graph.rs:231-240 | crates/ruff_python_semantic/src/cfg/graph.rs:244-253 \u2014 both copies are in the same file, so extract the block 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/ruff_python_semantic/src/cfg/graph.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"955aa001d9ab2701265c0e0f211c17928258f0ba513773d78938977e5e11ddc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_server/src/server.rs:228-237 | crates/ty_server/src/capabilities.rs:464-474 \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/ruff_server/src/server.rs:228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e31007da44d1defdca17878fcdecd55468b072ffe1967af15e862664ae72d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_workspace/src/resolver.rs:656-665 | crates/ruff_workspace/src/resolver.rs:840-849 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_workspace/src/resolver.rs:656\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/ruff_workspace/src/resolver.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57f5e122b644d4a4f2bbd7c31a0fb1c17c1fbeb21999ec78b22144b46d7bdba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types.rs:3559-3568 | crates/ty_python_semantic/src/types.rs:3598-3607 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types.rs:3597\u0060 calls \u0060TypeForm\u0060 and \u0060crates/ty_python_semantic/src/types.rs:3558\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/ty_python_semantic/src/types.rs"},"region":{"startLine":3559}}}],"partialFingerprints":{"codehealthFindingId/v1":"1899cf075ed044dc120f1e66e4ab652e571ce71a0f37bf2722133489b96e8294"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types.rs:10714-10723 | crates/ty_python_semantic/src/types/infer/comparisons.rs:446-455 \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/ty_python_semantic/src/types.rs"},"region":{"startLine":10714}}}],"partialFingerprints":{"codehealthFindingId/v1":"1027bfebea41e83f59d05124f8475189f07073f3f3572972659c44339ea41d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types/bound_super.rs:688-697 | crates/ty_python_semantic/src/types/bound_super.rs:794-803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/bound_super.rs:688\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/ty_python_semantic/src/types/bound_super.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f31009f9d905c02f90a9a91a9c80570a93696c975af0ab2ae999f620061fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ty_python_semantic/src/types/diagnostic.rs:2057-2065 | crates/ty_python_semantic/src/types/diagnostic.rs:2117-2126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/diagnostic.rs:2117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ty_python_semantic/src/types/diagnostic.rs:2116\u0060 calls \u0060Parameter\u0060 and \u0060crates/ty_python_semantic/src/types/diagnostic.rs:2056\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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1993fd2c004daea9eb07bff8314ff426dfda7a35a308efcd3a95cff7ba5a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types/diagnostic.rs:5813-5822 | crates/ty_python_semantic/src/types/diagnostic.rs:5976-5985 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/diagnostic.rs:5813\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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5813}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91d2c7633f74592d2d6d97f6c7bcf5d3ac1f2a58d34ef4d50379c1f875a644c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types/display.rs:1405-1414 | crates/ty_python_semantic/src/types/display.rs:2085-2094 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/display.rs:1405\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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"620a632a797a1ef839c0d4862536d34ab6616c2240a95485c39ddfb5339ce6ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ty_python_semantic/src/types/infer.rs:325-334 | crates/ty_python_semantic/src/types/infer.rs:474-482 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer.rs:325\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/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8281dc8afbb6ba2bcc2c03e5994249b1336c47d4bedacf08b8a786fd8de379e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types/relation.rs:1125-1134 | crates/ty_python_semantic/src/types/relation.rs:1180-1189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/relation.rs:1125\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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d281601a08dc5fcf7266689af152a8d3e22601b79ada9d0880a5677bb5b7d0a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ty_python_semantic/src/types/subclass_of.rs:462-469 | crates/ty_python_semantic/src/types/subclass_of.rs:498-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/subclass_of.rs:462\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/ty_python_semantic/src/types/subclass_of.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5e146bbcf94798c304ba6d94e0f24b70d35faed3f19b004cd935273d66f648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types/visitor.rs:614-623 | crates/ty_python_semantic/src/types/visitor.rs:776-785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/visitor.rs:614\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/ty_python_semantic/src/types/visitor.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f3b1a56ce8d8b7e5ee8b607f7e5393b06ee0a90846e6f9e31205e3332fcc82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 4): crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_getcwd.rs:84-92 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_makedirs.rs:107-112 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_mkdir.rs:105-110 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_symlink.rs:109-114 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_makedirs.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_symlink.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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 \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_getcwd.rs:84\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_getcwd.rs:83\u0060 calls \u0060is_fix_os_getcwd_enabled\u0060, \u0060settings\u0060 and \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_makedirs.rs:105\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/ruff_linter/src/rules/flake8_use_pathlib/rules/os_getcwd.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a986e681706354642135291fdef52b6d658299f7b9689c9597d4f4d5a0fb5c6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): crates/ty_python_core/src/narrowing_constraints.rs:300-307 | crates/ty_python_core/src/narrowing_constraints.rs:367-374 | crates/ty_python_core/src/reachability_constraints.rs:434-442 | crates/ty_python_core/src/reachability_constraints.rs:515-523 \u2014 before extracting anything, compare \u0060crates/ty_python_core/src/narrowing_constraints.rs\u0060 and \u0060crates/ty_python_core/src/reachability_constraints.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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":"crates/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac0a99f01e15a9e8602a1970262ed3e79bf55682e60fe3e53aec5b319a5f3c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs:468-476 | crates/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs:482-490 | crates/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs:496-504 \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/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs:468\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/ruff_linter/src/rules/flake8_unused_arguments/rules/unused_arguments.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb2292949baf1dfd295313b293803e9cf7bfaf47d4dcdc8b47634794ded7419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_use_pathlib/rules/builtin_open.rs:139-147 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_chmod.rs:114-122 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_stat.rs:160-168 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/builtin_open.rs:139\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, \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_stat.rs:156\u0060 calls \u0060Some\u0060 and \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/builtin_open.rs:137\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/ruff_linter/src/rules/flake8_use_pathlib/rules/builtin_open.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f273563609b57b2a5aca68de8093263ad5658baf9e2624f6de870946f790e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ty_python_core/src/use_def.rs:2496-2504 | crates/ty_python_core/src/use_def.rs:2528-2536 | crates/ty_python_core/src/use_def.rs:2844-2852 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn record_narrowing_constraint_for_places( \u0026mut\u0060 in one and \u0060super) fn record_declaration( \u0026mut\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":"crates/ty_python_core/src/use_def.rs"},"region":{"startLine":2496}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6659dcd3b011250c22521f8243c1ff3e858e91c2edaed5a6e9f0bd7b090930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ty_python_core/src/use_def.rs:2496-2504 | crates/ty_python_core/src/use_def.rs:2528-2536 | crates/ty_python_core/src/use_def.rs:2888-2896 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn record_narrowing_constraint_for_places( \u0026mut\u0060 in one and \u0060super) fn delete_binding(\u0026mut\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":"crates/ty_python_core/src/use_def.rs"},"region":{"startLine":2496}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a828ac93a2fe48c62013270f54bad158b7c7062eabc36e6cb3f8fc289097075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ty_python_semantic/src/types/class/implicit_attributes.rs:395-403 | crates/ty_python_semantic/src/types/class/implicit_attributes.rs:416-424 | crates/ty_python_semantic/src/types/class/implicit_attributes.rs:436-444 \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/ty_python_semantic/src/types/class/implicit_attributes.rs:395\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/ty_python_semantic/src/types/class/implicit_attributes.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed99fca7bdc4f4eabb8000de3944eb38e1fff669c30b4bee84540b94274ce9a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ty_python_semantic/src/types/constraints.rs:2042-2050 | crates/ty_python_semantic/src/types/constraints/sequents.rs:2161-2169 | crates/ty_python_semantic/src/types/tuple/promotion.rs:38-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/constraints.rs:2042\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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"017f590d68bfdc96196c061407e9aba508ef8c92998f5a9d3189323a2b2dacae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ty_python_semantic/src/types/constraints/sequents.rs:1639-1647 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1865-1873 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1984-1992 \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/ty_python_semantic/src/types/constraints/sequents.rs:1639\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"24efa0cff4a8edf7e5dab66c323776c898262e91f2c8682950ef7452e4590f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruff_dev/src/print_ast.rs:19-27 | crates/ruff_dev/src/print_tokens.rs:19-26 \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/ruff_dev/src/print_ast.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c566b35f8763e0cbd5e4681ee2a0ad4f1086cceca532a7f49ffcc178715e65a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/helpers.rs:315-323 | crates/ruff_linter/src/rules/airflow/rules/task_implicit_multiple_outputs.rs:126-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. 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/ruff_linter/src/rules/airflow/helpers.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9e40e962c8cb96d86806956421c79c1cd5985d886920d12c0652d240b3cb9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/assertion.rs:827-835 | crates/ruff_linter/src/rules/flake8_simplify/rules/fix_with.rs:77-85 \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/ruff_linter/src/rules/flake8_pytest_style/rules/assertion.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d63448c4296794036bbe3a3d31e52c42b7d9d8fb5c16795befb052ac730ce72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:183-191 | crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:231-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:183\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41b270c72bc3db74b7fbaee9565aebe2de08748462b103b6f5a26742279d5d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_linter/src/rules/pep8_naming/helpers.rs:28-36 | crates/ruff_linter/src/rules/pep8_naming/helpers.rs:63-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pep8_naming/helpers.rs:28\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/ruff_linter/src/rules/pep8_naming/helpers.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9245ec4ec162e37f9bcd8ea8618b3dece9a6b774113eb19a97f066cacd97ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/unnecessary_list_index_lookup.rs:52-59 | crates/ruff_linter/src/rules/pylint/rules/unnecessary_list_index_lookup.rs:93-101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pylint/rules/unnecessary_list_index_lookup.rs:52\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":"crates/ruff_linter/src/rules/pylint/rules/unnecessary_list_index_lookup.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38cea2b277154e5c77ef916e9992dcfb5d061482d6d5097d194da657023fed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs:188-196 | crates/ruff_linter/src/rules/pyupgrade/rules/convert_typed_dict_functional_to_class.rs:195-203 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs:188\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/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deb10c8a9d3b6b5de57eab27a1021bf1cceccf1fc8cbb5b6894d42b5a5fcbac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/helpers.rs:27-35 | crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:175-182 \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/ruff_linter/src/rules/refurb/helpers.rs:27\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/ruff_linter/src/rules/refurb/helpers.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa51c36dd6775b9dcb9831182dbefd6657dcae9ff842efcb9f9390037b5f8c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:222-228 | crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:244-252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:244\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":"crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af644eb9a48ba343f30c9ce658a3f495f9c2a25176e1cf68812a4f764671e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs:341-349 | crates/ruff_linter/src/rules/refurb/rules/repeated_append.rs:361-368 \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 \u0060crates/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs:341\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/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"866face32ca27c2333bf589026c050a5154a16af3f143fe52dad9350b161493d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/ruff_python_ast/src/helpers.rs:554-560 | crates/ruff_python_ast/src/helpers.rs:582-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_ast/src/helpers.rs:554\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/ruff_python_ast/src/helpers.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06a8322c0c0553174bb7731cf8ff4e75a96a4dac6bc88b7666f0d3e400fc9cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_python_codegen/src/generator.rs:268-276 | crates/ruff_python_codegen/src/generator.rs:307-315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_codegen/src/generator.rs:268\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, \u0060crates/ruff_python_codegen/src/generator.rs:278\u0060 calls \u0060p\u0060 and \u0060crates/ruff_python_codegen/src/generator.rs:316\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/ruff_python_codegen/src/generator.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fc02d71ff0a678670b6bb89c7d3372d13100a526fdc086ae9724580303ad36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_python_formatter/src/comments/placement.rs:917-927 | crates/ruff_python_formatter/src/comments/placement.rs:1011-1019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/comments/placement.rs:917\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/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bff874faf1c6988abfbbe7dcf1440725425ddb3ab0403e8db147e6ae15d2dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_python_formatter/src/expression/binary_like.rs:888-896 | crates/ruff_python_formatter/src/expression/binary_like.rs:939-947 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/expression/binary_like.rs:888\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/ruff_python_formatter/src/expression/binary_like.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffe831bc86e8d058af352cab753ca11ceecb1fe9cc9020b9de4aeeb09846db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_python_formatter/src/statement/suite.rs:296-304 | crates/ruff_python_formatter/src/statement/suite.rs:388-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/statement/suite.rs:296\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":"crates/ruff_python_formatter/src/statement/suite.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ae90f2b83c788d4720ae4c1e95330ea80f8fdd803abfb5d5a368f6f9d67ceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_parser/src/lexer/cursor.rs:125-134 | crates/ruff_python_trivia/src/cursor.rs:131-140 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn eat_char3(\u0026mut\u0060 in one and \u0060\u0026mut\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":"crates/ruff_python_parser/src/lexer/cursor.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6988aaeb12fe2b8ec1aa33a1cb394ace69d6bd1a3a35f3c2937db17cd5645592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_python_stdlib/src/str.rs:22-30 | crates/ruff_python_stdlib/src/str.rs:59-67 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_stdlib/src/str.rs:22\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/ruff_python_stdlib/src/str.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b476219c364579706100819fc9db50c61eb1e4a926068a915bacdd7cab415c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_server/src/server/main_loop.rs:39-47 | crates/ty_server/src/server/main_loop.rs:40-48 \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/ruff_server/src/server/main_loop.rs:39\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/ruff_server/src/server/main_loop.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b5d4a133eda026a2974ce314859d5eb1475019c7a389fa3a208598ea55fa7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_server/src/session/client.rs:207-215 | crates/ty_server/src/session/client.rs:261-269 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/session/client.rs\u0060 and \u0060crates/ty_server/src/session/client.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 \u0060crates/ruff_server/src/session/client.rs:207\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/ruff_server/src/session/client.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3de160b63816c8823e2a14e9cf22d4aba8f1f93fb16866eeb9bfd9712e68de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_completion_bench/src/main.rs:81-89 | crates/ty_completion_eval/src/main.rs:464-472 \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/ty_completion_bench/src/main.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52e6c790d754a6fcffbbe938e7b622ba15139e09b67de8ec53daec695c9284c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_ide/src/semantic_tokens.rs:1041-1049 | crates/ty_ide/src/semantic_tokens.rs:1284-1295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_ide/src/semantic_tokens.rs:1041\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/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5fde58ed62db7234a6c0d798d6a088fd496ca49fc0968c60316c69218c09f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_core/src/builder.rs:3274-3282 | crates/ty_python_core/src/builder.rs:3293-3301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_core/src/builder.rs:3274\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/ty_python_core/src/builder.rs"},"region":{"startLine":3274}}}],"partialFingerprints":{"codehealthFindingId/v1":"73839ed89f9411375c74cec2156e4e9d3536ce6e3928b394547e81a8a8adf174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types.rs:9848-9856 | crates/ty_python_semantic/src/types/known_instance.rs:675-683 \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/ty_python_semantic/src/types.rs"},"region":{"startLine":9848}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e1ec094e46f1c28049650e6edce42134a9897740958e8afa506baf3fb610bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:2674-2682 | crates/ty_python_semantic/src/types/call/bind.rs:2686-2694 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd7d693f8abef195c7f905a00efe0b2397a8ea299152e2a37a19f5225f18c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/paths.rs:188-196 | crates/ty_python_semantic/src/types/constraints/paths.rs:282-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/constraints/paths.rs:188\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/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b2ee4880e3c2cbb4c9b26e3673f265f3a8a0a902e5ccac5eda3d10e64fc1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:728-736 | crates/ty_python_semantic/src/types/constraints/sequents.rs:754-762 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/sequents.rs:728\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"968854d7b8e866bde3accabb2aad678bab83210537a8ddce54ff2b74bea2875f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:2065-2073 | crates/ty_python_semantic/src/types/constraints/sequents.rs:2116-2124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/sequents.rs:2065\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50e8081ade64a1652044c889aa8b344a3a352615c007029280066f91ff6b8f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/definition.rs:26-34 | crates/ty_python_semantic/src/types/definition.rs:80-88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/definition.rs:26\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/ty_python_semantic/src/types/definition.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7697f97ce5654058176080d2d3c90b8a6569637ab7b252c45b604779d775b0ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/definition.rs:28-36 | crates/ty_python_semantic/src/types/definition.rs:49-57 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/definition.rs:28\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/ty_python_semantic/src/types/definition.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f277e8633f6f28cabc876ba73cca7e52bb4e49e37cd1032d3a767b9d0405ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/diagnostic.rs:2105-2113 | crates/ty_python_semantic/src/types/ide_support/unused_bindings.rs:30-38 \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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3568ff9dc9b9fff5f879e7c7bde9f7d88f224914bb0b30bc0193512098131815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:4532-4540 | crates/ty_python_semantic/src/types/infer/builder/function.rs:1126-1134 \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/ty_python_semantic/src/types/infer/builder.rs:4532\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 \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn infer_parameter_definition( \u0026mut\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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56cad397092157e42452148ae79a10b5b0b773bf6549df85d34e6e45d310e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:5542-5550 | crates/ty_python_semantic/src/types/infer/builder.rs:5561-5569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:5542\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":5542}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e4bda0f3d08b7d697c70c46bc46e368c7ac85dc39f6fd92233e0e1f9c3fc30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs:331-339 | crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs:268-276 \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 \u0060crates/ty_python_semantic/src/types/infer/builder/named_tuple.rs:331\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/ty_python_semantic/src/types/infer/builder/named_tuple.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"17934e0f1e7a3da23a023b62353bc929e2c62c55f3d22636e360efbbd810e29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/paramspec_validation.rs:143-151 | crates/ty_python_semantic/src/types/infer/builder/paramspec_validation.rs:164-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/paramspec_validation.rs:143\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/ty_python_semantic/src/types/infer/builder/paramspec_validation.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bfea76d692b8dbc85d298e2fcb1527809e8fd02bd8d543c6ef820ab0b34487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/comparisons.rs:1435-1443 | crates/ty_python_semantic/src/types/infer/comparisons.rs:1500-1508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/comparisons.rs:1435\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/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f9e0dcac16ec6974add4418256c23c67503c26a457f00dee8f05c2b01ee7e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ty_python_semantic/src/types/relation.rs:561-568 | crates/ty_python_semantic/src/types/relation.rs:1158-1166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/relation.rs:561\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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d25b81a1654de63050ca4b22e831eec747462d07c99441a2f3053ba9378b1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/relation.rs:1617-1625 | crates/ty_python_semantic/src/types/relation.rs:1816-1824 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/relation.rs:1617\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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"615a92885991e65f14edb40bd7e8f7af37f1697246a5586c25612de68f7f53a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/relation.rs:4355-4363 | crates/ty_python_semantic/src/types/relation.rs:4375-4383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/relation.rs:4355\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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":4355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc898cfd092c76ff0280b3a5f7a88dfae2d0744a2601de7bf536bc40acc686b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/typed_dict.rs:1462-1470 | crates/ty_python_semantic/src/types/typed_dict.rs:1527-1535 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72059234b83dee042284437a8d59f73a46295fd3afe9a510a126645d09d8629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/visitor.rs:531-539 | crates/ty_python_semantic/src/types/visitor.rs:879-887 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/visitor.rs:531\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/ty_python_semantic/src/types/visitor.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fe4ac42b234b630044e4f71da907e44195be75d97dc7dbba87493e47dc267c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruff_linter/src/linter.rs:375-382 | crates/ruff_linter/src/linter.rs:444-451 | crates/ruff_linter/src/linter.rs:554-561 | crates/ruff_wasm/src/lib.rs:365-372 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/linter.rs:375\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/ruff_linter/src/linter.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2981ca655016aa0444cb468c0f65cdfda0fc2e863162875457fa4a3dfd8c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ty_python_semantic/src/types/call/bind.rs:2964-2971 | crates/ty_python_semantic/src/types/call/bind.rs:2993-3000 | crates/ty_python_semantic/src/types/call/bind.rs:3022-3029 | crates/ty_python_semantic/src/types/call/bind.rs:3051-3059 \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/ty_python_semantic/src/types/call/bind.rs:2964\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":2964}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee6855da2ab1380f08169961a3bd1a318ad2081abf2fd9848498fb580e6bf81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs:404-410 | crates/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs:344-351 | crates/ruff_linter/src/rules/refurb/rules/repeated_append.rs:363-369 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs:404\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/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"4617eb792287d738f17f4caf6c215f912300deef535913a9e40e2303b9fa27aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruff_linter/src/rules/refurb/helpers.rs:27-34 | crates/ruff_linter/src/rules/refurb/rules/check_and_remove_from_set.rs:183-190 | crates/ruff_linter/src/rules/refurb/rules/repeated_append.rs:355-362 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/refurb/helpers.rs\u0060 and \u0060crates/ruff_linter/src/rules/refurb/rules/check_and_remove_from_set.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 \u0060crates/ruff_linter/src/rules/refurb/helpers.rs:27\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/ruff_linter/src/rules/refurb/helpers.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdeb9be93d5efe1f7fc3cd8031aaacec099609d92b0567ccd40d112e2b6ff621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ty_python_semantic/src/types/call/bind.rs:8569-8577 | crates/ty_python_semantic/src/types/instance.rs:1420-1428 | crates/ty_python_semantic/src/types/typevar.rs:993-1000 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/call/bind.rs:8569\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8569}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9e608088c78757a07fdea6632fe91321f61daae621926bfc73f2278412e987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 3): crates/ty_python_semantic/src/types/constraints/variables.rs:257-262 | crates/ty_python_semantic/src/types/constraints/variables.rs:334-339 | crates/ty_python_semantic/src/types/constraints/variables.rs:421-428 \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/ty_python_semantic/src/types/constraints/variables.rs:257\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/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ad7898bd043ae7da2af6836ba8fe4842049d3999e35cd14647a99f78d58f8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/ty_python_semantic/src/types/dedicated/django.rs:54-60 | crates/ty_python_semantic/src/types/dedicated/pydantic.rs:266-273 | crates/ty_python_semantic/src/types/dedicated/pydantic.rs:841-848 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/dedicated/django.rs:54\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060db\u0060 to \u0060\u0026\u0027db dyn Db\u0060 in one and \u0060\u0026dyn Db\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":"crates/ty_python_semantic/src/types/dedicated/django.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc6af582bf7949681f616a77666ee3e1b84eb0fc28524dc49896b017ca71dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ty_python_semantic/src/types/ide_support.rs:2119-2126 | crates/ty_python_semantic/src/types/ide_support.rs:2131-2138 | crates/ty_python_semantic/src/types/ide_support.rs:2145-2152 \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/ty_python_semantic/src/types/ide_support.rs:2119\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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa4dab371f02fb27662d6b42e92f90f25c749effccb3d8961ccc362a208d650"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2664-2670 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2710-2717 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2736-2743 \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/ty_python_semantic/src/types/infer/builder/type_expression.rs:2664\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":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2664}}}],"partialFingerprints":{"codehealthFindingId/v1":"b978c6a5c419e5707d01c4c73d6f5277e84c881f9fb5365d09613e3f68b3aeeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_use_pathlib/helpers.rs:78-85 | crates/ruff_linter/src/rules/flake8_use_pathlib/helpers.rs:170-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/helpers.rs:78\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/ruff_linter/src/rules/flake8_use_pathlib/helpers.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0d394ac0cd3d4a89dfacfe3cb8b1ddd3846acd75e0cd8530bb2f237bf384b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/use_pep604_annotation.rs:321-328 | crates/ruff_python_formatter/src/expression/mod.rs:1450-1457 \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/ruff_linter/src/rules/pyupgrade/rules/use_pep604_annotation.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bda27bbf93aa6415bfbb405cb36c05813c6327e2bd45768956615916e90ce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs:324-331 | crates/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs:345-352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs:324\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/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbd60b0bbc60ce738cc6d7e81bd8bf0a70daaef9440ab692e425f0ee25a5e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/ruff_linter/src/rules/refurb/rules/slice_to_remove_prefix_or_suffix.rs:369-376 | crates/ruff_linter/src/rules/refurb/rules/slice_to_remove_prefix_or_suffix.rs:416-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/refurb/rules/slice_to_remove_prefix_or_suffix.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d228c444b34516f5160f4a4230f83a45506f0be6fd35b216c5e113bfac5a359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_linter/src/settings/types.rs:396-403 | crates/ruff_linter/src/settings/types.rs:475-482 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/settings/types.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6724467827a3e5fac306fd138148207696cb1422497bf596107f0c4021f5339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_python_ast/src/token/parentheses.rs:43-50 | crates/ty_ide/src/completion.rs:1206-1213 \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/ruff_python_ast/src/token/parentheses.rs:43\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/ruff_python_ast/src/token/parentheses.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c052551dea52b78795baf76e528652ddffdbb336223b5d53490153654b1b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_python_formatter/src/other/arguments.rs:32-39 | crates/ruff_python_formatter/src/pattern/pattern_arguments.rs:21-28 \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/ruff_python_formatter/src/other/arguments.rs:32\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026Arguments\u0060 in one and \u0060\u0026PatternArguments\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":"crates/ruff_python_formatter/src/other/arguments.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ea14ecd8a06fd78a1ea0024ffd8e153ec20061163c1c6324a08e63500f5bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_python_parser/src/semantic_errors.rs:2177-2184 | crates/ruff_python_parser/src/semantic_errors.rs:2210-2217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_parser/src/semantic_errors.rs:2177\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":"crates/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df0769b5a249b3bd200daf89a82cc86a7dca19f140217e0b4313592b5cd680b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_python_parser/src/string.rs:285-292 | crates/ruff_python_parser/src/string.rs:460-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_parser/src/string.rs:285\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/ruff_python_parser/src/string.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a7820951d10b27e8bcb342c22ba4da18fe81d37dc0058558db21770db02b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_python_semantic/src/definition.rs:229-236 | crates/ruff_python_semantic/src/definition.rs:251-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_semantic/src/definition.rs:229\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/ruff_python_semantic/src/definition.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"471d55d06fe225c016b6c721c3c2ff57077080dca47cf49bd943e33f1210d6f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_server/src/server/api.rs:166-173 | crates/ty_server/src/server/api.rs:314-321 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/api.rs\u0060 and \u0060crates/ty_server/src/server/api.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 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 \u0060crates/ruff_server/src/server/api.rs:166\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/ruff_server/src/server/api.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f9f93869a787567ddceb4c3ba49f251ef3f446a2d247570a725b708bfb9464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_completion_bench/src/main.rs:94-101 | crates/ty_completion_eval/src/main.rs:283-290 \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/ty_completion_bench/src/main.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7418bda5d189c959ba31ad87ebb67102e134a4567160a3c3531eb08f23833548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_core/src/reachability_constraints.rs:457-464 | crates/ty_python_core/src/reachability_constraints.rs:538-545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_core/src/reachability_constraints.rs:457\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/ty_python_core/src/reachability_constraints.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"500badf7e870b0d035155dab0159e5f8c6ea64291b20be5834c78f3716f3db9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_core/src/use_def.rs:513-520 | crates/ty_python_core/src/use_def.rs:542-549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/use_def.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"65edf93afa722ea8c6e0b90c18cd8829649499a888796013d3dd37c1164470dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_core/src/use_def.rs:581-588 | crates/ty_python_core/src/use_def.rs:608-615 \u2014 both copies are in the same file, so extract the block 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/ty_python_core/src/use_def.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f1d7f9bd3e401eed6bf2f2ab2f7cf3e021bc1254f5d902ead0a84654739004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:8585-8592 | crates/ty_python_semantic/src/types/typevar.rs:1007-1014 \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/ty_python_semantic/src/types/call/bind.rs:8585\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8585}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4c3839d566acf7277675da96ece51b5f34e2bf2e032e3c9d8f70ce07306f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/class.rs:1261-1268 | crates/ty_python_semantic/src/types/class.rs:1280-1287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/class.rs:1261\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 \u0060self\u0060 to \u0060crate) fn static_class_literal(\u0060 in one and \u0060crate) fn static_class_literal_specialized(\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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"672b772234ff6d481872854dd83a11279e90c652f7aaf92e9b2e2b66079aba17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:1476-1483 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1753-1760 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c73401a098f3f5b9567749307a684c4b2a3c7248e709a39a9d2f7635baa8d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/diagnostic.rs:5803-5810 | crates/ty_python_semantic/src/types/diagnostic.rs:5967-5974 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/diagnostic.rs:5803\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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5803}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ef828fd019f6106d222bbde8ed38de9799c696f265cc4c389c13cf25a68e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/display.rs:1040-1047 | crates/ty_python_semantic/src/types/display.rs:1239-1246 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"846b3468d6c57bc9c8cce1fe566d617cc4821cea2345506214f49d69ab084f15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/ty_python_semantic/src/types/generics.rs:952-958 | crates/ty_python_semantic/src/types/generics.rs:1123-1130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/generics.rs:1123\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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d7730243ce9caf8e14783e829b8fcb9f6a89ad1ced5f299b64b06916b8bc0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/infer.rs:2092-2099 | crates/ty_python_semantic/src/types/infer.rs:2315-2322 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4d8fd420cae36537de39006434a8980f384fec69bfcbb78ea453806d2073d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/post_inference/function.rs:440-447 | crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs:945-952 \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 \u0060crates/ty_python_semantic/src/types/infer/builder/post_inference/function.rs:440\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/ty_python_semantic/src/types/infer/builder/post_inference/function.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23ca3775fbacaee0dd8665ac9e1ff7ffdbd5a3107a47de094fe50cff4aeef38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/typevar.rs:660-667 | crates/ty_python_semantic/src/types/typevar.rs:807-814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/typevar.rs:660\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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eff7c71a890cf66f01853a3bf3caf67bff42964e1a938a017f1d912eed85d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_server/src/server/api/requests/call_hierarchy_incoming_calls.rs:50-57 | crates/ty_server/src/server/api/requests/call_hierarchy_outgoing_calls.rs:46-53 \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 \u0060crates/ty_server/src/server/api/requests/call_hierarchy_incoming_calls.rs:50\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/ty_server/src/server/api/requests/call_hierarchy_incoming_calls.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae1e7c0a7046ae207ea663649b0774bd1c2be5f4d2c0f891b4671b61a8bb057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:202-208 | crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:304-310 | crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs:405-411 | crates/ruff_linter/src/rules/refurb/helpers.rs:36-42 | crates/ruff_linter/src/rules/refurb/rules/check_and_remove_from_set.rs:192-198 | crates/ruff_linter/src/rules/refurb/rules/repeated_append.rs:364-370 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/refurb/helpers.rs\u0060 and \u0060crates/ruff_linter/src/rules/refurb/rules/check_and_remove_from_set.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 \u0060crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:202\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff29611352f21f3ebd04a478cb42607c0fc934fc556d2214ef515cdba7612289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/ruff_python_ast/src/name.rs:523-529 | crates/ruff_python_ast/src/name.rs:532-540 | crates/ruff_python_ast/src/name.rs:545-553 | crates/ruff_python_ast/src/name.rs:559-567 | crates/ruff_python_ast/src/name.rs:574-582 | crates/ruff_python_ast/src/name.rs:590-598 \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 \u0060crates/ruff_python_ast/src/name.rs:523\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruff_python_ast/src/name.rs:556\u0060 calls \u0060as_str\u0060 and \u0060crates/ruff_python_ast/src/name.rs:543\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/ruff_python_ast/src/name.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2958a81f27ffc72a2f7a7a421b08d5a7eac282a56bb2c7af9309cd0f866dce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/ty_python_semantic/src/types/constraints/sequents.rs:1049-1055 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1146-1152 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1251-1257 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1356-1362 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1391-1397 \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 \u0060crates/ty_python_semantic/src/types/constraints/sequents.rs:1049\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"af229b0cee43b5aca04ee8ee9af267ff321f4c8346a74b166a97b15156942cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruff_linter/src/linter.rs:372-378 | crates/ruff_linter/src/linter.rs:441-447 | crates/ruff_linter/src/linter.rs:551-557 | crates/ruff_server/src/lint.rs:196-202 \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":"crates/ruff_linter/src/linter.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2520087b4e0b899334287da996dcc178aac2fd7b548c97fc1e0887685a23727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:775-781 | crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:802-808 | crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:888-895 | crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:923-930 \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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:775\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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87953c63bf93c6fc07aaffa3f652d8374329392163f6654e1ee805c280dc7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:281-287 | crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs:405-411 | crates/ruff_linter/src/rules/refurb/rules/check_and_remove_from_set.rs:192-198 | crates/ruff_linter/src/rules/refurb/rules/repeated_append.rs:364-370 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/refurb/rules/check_and_remove_from_set.rs\u0060 and \u0060crates/ruff_linter/src/rules/refurb/rules/repeated_append.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 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 \u0060crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:281\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/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f05777414cac721d9efcb64928e40b420a2a833e79632355d47f5753a4257cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:36-42 | crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:98-104 | crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs:157-164 \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":"crates/ruff_linter/src/rules/flake8_comprehensions/fixes.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"076741fd5306345e86fbf31febfcdde13eca1c073aeee81783faf9fa82290954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs:436-442 | crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:194-200 | crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs:296-302 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs:436\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/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"1055bb2811761af4379bb1371ced7f4dc2da02b33417141004d72564f7ddc8ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:281-286 | crates/ruff_linter/src/rules/refurb/rules/check_and_remove_from_set.rs:192-197 | crates/ruff_linter/src/rules/refurb/rules/reimplemented_starmap.rs:324-330 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:281\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/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6e0d345bc3bd71529829572e3c7ea1efe5be2deb704fe9aa370aaa8936bd64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_simplify/rules/needless_bool.rs:278-284 | crates/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs:252-258 | crates/ruff_linter/src/rules/refurb/rules/unnecessary_enumerate.rs:272-278 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_simplify/rules/needless_bool.rs:278\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/ruff_linter/src/rules/flake8_simplify/rules/needless_bool.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d377f803d6c4a3cd30b57430047cb616b983053643663a7402b3799e1eb4e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:222-228 | crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs:244-250 | crates/ruff_linter/src/rules/refurb/rules/write_whole_file.rs:234-240 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs\u0060 and \u0060crates/ruff_linter/src/rules/refurb/rules/write_whole_file.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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":"crates/ruff_linter/src/rules/refurb/rules/read_whole_file.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a696b4c190c8dc943649034f781039230266beb80c5695569b62ad9b67c784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruff_linter/src/rules/ruff/rules/needless_else.rs:178-187 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_if.rs:199-205 | crates/ruff_linter/src/rules/ruff/rules/useless_finally.rs:239-248 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/ruff/rules/needless_else.rs\u0060 and \u0060crates/ruff_linter/src/rules/ruff/rules/useless_finally.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/ruff/rules/needless_else.rs:178\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/ruff_linter/src/rules/ruff/rules/needless_else.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"265bb7435d9b27e44470727004f1d60004c8af1606bb210161b40879fb30b19e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruff_python_formatter/src/expression/binary_like.rs:184-190 | crates/ruff_python_formatter/src/expression/binary_like.rs:202-208 | crates/ruff_python_formatter/src/expression/binary_like.rs:220-226 \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":"crates/ruff_python_formatter/src/expression/binary_like.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e55d854c766e24cc3344fe3680c8211fac2d7568493a44b91fdd45c17e65af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ty_python_semantic/src/types.rs:1874-1880 | crates/ty_python_semantic/src/types.rs:1882-1888 | crates/ty_python_semantic/src/types.rs:1890-1896 \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/ty_python_semantic/src/types.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39a865c95409f2ebf992bbe3fcaa5956cea0ca52fe7e4478eb512a70fb41e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ty_python_semantic/src/types/class/dynamic_literal.rs:205-212 | crates/ty_python_semantic/src/types/typed_dict.rs:1461-1467 | crates/ty_python_semantic/src/types/typed_dict.rs:1526-1532 \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":"crates/ty_python_semantic/src/types/class/dynamic_literal.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a3243c0e78efbe71ae37d8ed8cd4b1d8df5709d700e04259f53bde75ecfda2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ty_python_semantic/src/types/class/typed_dict.rs:237-243 | crates/ty_python_semantic/src/types/class/typed_dict.rs:353-359 | crates/ty_python_semantic/src/types/class/typed_dict.rs:406-413 \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":"crates/ty_python_semantic/src/types/class/typed_dict.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"acab0c25f6a1374a9294c764dc0f3380b490c72895f5d8c8a3266ed272500d80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff/src/printer.rs:245-251 | crates/ruff/src/printer.rs:431-437 \u2014 both copies are in the same file, so extract the block 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/ruff/src/printer.rs:243\u0060 calls \u0060try_from\u0060 and \u0060crates/ruff/src/printer.rs:430\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/ruff/src/printer.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdead68d5be7db2506efcdf22b65471f48b3ac2e8819a47d546f8f56d2544e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:381-387 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:487-493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs:381\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/ruff_linter/src/rules/flake8_pytest_style/rules/parametrize.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1978aa59c83ff036bacefad72b21858dd2e7aca0385415476af59f217ce8b151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/unnecessary_list_cast.rs:212-218 | crates/ruff_linter/src/rules/perflint/rules/unnecessary_list_cast.rs:238-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/ruff_linter/src/rules/perflint/rules/unnecessary_list_cast.rs:212\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/ruff_linter/src/rules/perflint/rules/unnecessary_list_cast.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31d89f8c2dc6e5c9efbde7e43636575a042ed3cab671065c824ec04e2c48cc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/unnecessary_dunder_call.rs:162-168 | crates/ruff_linter/src/rules/pylint/rules/unnecessary_dunder_call.rs:182-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pylint/rules/unnecessary_dunder_call.rs:162\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/ruff_linter/src/rules/pylint/rules/unnecessary_dunder_call.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4404f610dc2a2355171b7b29d87457ef583cdfb2ad033b8e925731787689c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/outdated_version_block.rs:309-315 | crates/ruff_linter/src/rules/pyupgrade/rules/outdated_version_block.rs:387-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pyupgrade/rules/outdated_version_block.rs:309\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/ruff_linter/src/rules/pyupgrade/rules/outdated_version_block.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa857120a3771de6d80da0f502ed83e0942ae10109092954cd5c84fc4483aad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/unnecessary_default_type_args.rs:197-203 | crates/ruff_linter/src/rules/pyupgrade/rules/unnecessary_default_type_args.rs:208-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pyupgrade/rules/unnecessary_default_type_args.rs:197\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/ruff_linter/src/rules/pyupgrade/rules/unnecessary_default_type_args.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c1b4985f2ba7c1e5112cdbf3ff98982ca7ddde79b7442851718b7881e9d3a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/ruff/rules/collection_literal_concatenation.rs:111-117 | crates/ruff_linter/src/rules/ruff/rules/collection_literal_concatenation.rs:119-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/ruff/rules/collection_literal_concatenation.rs:111\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/ruff_linter/src/rules/ruff/rules/collection_literal_concatenation.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f0ef45a9fa065b1d53883355aa4c96032713023e340b06141ca92761af294c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_python_parser/src/parser/expression.rs:269-278 | crates/ruff_python_parser/src/parser/expression.rs:1252-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca93f415d2f6e32ad5644881dee64a3797923cb52fa0c0822289258f2af814e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_server/src/session/client.rs:138-145 | crates/ty_server/src/session/client.rs:178-185 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/session/client.rs\u0060 and \u0060crates/ty_server/src/session/client.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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":"crates/ruff_server/src/session/client.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f648ba401781757be770713a64e3fb12cff4d1928e2c2d600dddba90417a36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ty_ide/src/semantic_tokens.rs:1023-1029 | crates/ty_python_core/src/builder/loop_bindings_visitor.rs:93-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_ide/src/semantic_tokens.rs:1023\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/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be0f206b4413367c505d1aec6353b71fdc8bb5068466b42a8686af835187782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/ty_python_core/src/re_exports.rs:324-329 | crates/ty_python_core/src/re_exports.rs:378-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/re_exports.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d4d47aa189dfb8f6ec187dd465cb92af36df8d1edaca2102eafed4899ebffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ty_python_semantic/src/types/class/static_literal.rs:1568-1574 | crates/ty_python_semantic/src/types/class/static_literal.rs:1637-1643 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/class/static_literal.rs:1568\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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d30542a933507c2003233a3268b1f753c118c087d5e8bef7ddd50224b84788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ty_python_semantic/src/types/diagnostic.rs:4727-4733 | crates/ty_python_semantic/src/types/diagnostic.rs:4776-4782 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/diagnostic.rs:4727\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":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":4727}}}],"partialFingerprints":{"codehealthFindingId/v1":"c518aa999316d972fba97a5a07eb13143baac290e6d3c1122b0a46fe587104b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ty_python_semantic/src/types/display.rs:1230-1236 | crates/ty_python_semantic/src/types/display.rs:1792-1798 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8684cce83f5d6c7f59ba929962566378ddfceb1d427839ea316ead4379d5f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs:304-310 | crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs:351-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs:304\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/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fc8cd10b5b778510a708b1bb45df23cfa013c597804c1001bdc17d871b539d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:447-452 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:459-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:447\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a72a8105aacfc0796aeafb7ab22a4ecf52c05f06aa372aa7f14d60ca1d5b0b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2917-2923 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2943-2949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:2917\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"221512e1964199e7f5c43113c5091aa0a458591e51eeb2d9f92529c4b91b1543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ty_python_semantic/src/types/method.rs:714-720 | crates/ty_python_semantic/src/types/method.rs:740-746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/method.rs:714\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ty_python_semantic/src/types/method.rs:737\u0060 calls \u0060positional_only\u0060, \u0060Some\u0060, \u0060new_static\u0060 and \u0060crates/ty_python_semantic/src/types/method.rs:712\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/ty_python_semantic/src/types/method.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"39874603833cdee12b4c20333cd4683fe918abf4410cec02c4b0b6546807507b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ty_python_semantic/src/types/relation.rs:648-654 | crates/ty_python_semantic/src/types/relation.rs:727-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/ty_python_semantic/src/types/relation.rs:648\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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"8638b3f5bef5a9559653a900450985b509b84ee27b35fbd337e7100402fd3a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/signatures.rs:3121-3128 | crates/ty_python_semantic/src/types/signatures.rs:3135-3142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/signatures.rs:3121\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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3121}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b7887ee2c400342bb99f9ede01f446f9d97202493b0b15f63667f1216a5335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/ty_python_semantic/src/types/class/typed_dict.rs:237-242 | crates/ty_python_semantic/src/types/class/typed_dict.rs:296-301 | crates/ty_python_semantic/src/types/class/typed_dict.rs:406-412 | crates/ty_python_semantic/src/types/class/typed_dict.rs:678-683 \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/ty_python_semantic/src/types/class/typed_dict.rs:237\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/ty_python_semantic/src/types/class/typed_dict.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4a2e65c299cf8d2871b2b4101f0a84b5307311033ba613f9bbead04a64caaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/ty_python_semantic/src/types/constraints/sequents.rs:978-983 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1016-1021 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1085-1090 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1111-1116 \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/ty_python_semantic/src/types/constraints/sequents.rs:978\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9af27013ffab5e52e1c12a76065eb6c3bc0d6c478911b6c63eb3559a2e216c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/ty_python_semantic/src/types/infer/builder.rs:709-714 | crates/ty_python_semantic/src/types/infer/builder.rs:766-771 | crates/ty_python_semantic/src/types/infer/builder.rs:824-829 | crates/ty_python_semantic/src/types/infer/builder.rs:905-910 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ty_python_semantic/src/types/infer/builder.rs:715\u0060 calls \u0060extend\u0060, \u0060iter\u0060, \u0060copied\u0060 and \u0060crates/ty_python_semantic/src/types/infer/builder.rs:911\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"99da58701084080ea02a711076fabdf388118fc947d28c81d04b9cf1ef40f237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ty_python_semantic/src/types/display.rs:1230-1235 | crates/ty_python_semantic/src/types/display.rs:1249-1254 | crates/ty_python_semantic/src/types/display.rs:1792-1797 \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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"028718de243e59b526f391c329e9443ad3e607dd905ec21fa90f753118d31d43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_dev/src/generate_options.rs:28-33 | crates/ruff_dev/src/generate_ty_options.rs:71-76 \u2014 before extracting anything, compare \u0060crates/ruff_dev/src/generate_options.rs\u0060 and \u0060crates/ruff_dev/src/generate_ty_options.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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 \u0060crates/ruff_dev/src/generate_options.rs:28\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/ruff_dev/src/generate_options.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d6a77f09303655ab5d694bcd1d5c7db71181b282445b00f320b1eefc3dabf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/open_file_with_context_handler.rs:69-74 | crates/ruff_linter/src/rules/flake8_simplify/rules/open_file_with_context_handler.rs:98-103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_simplify/rules/open_file_with_context_handler.rs:69\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/ruff_linter/src/rules/flake8_simplify/rules/open_file_with_context_handler.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82ef3f86e6ab16faa5c10e6162d9d3c025a9c96886d847041d541c01ba8a4c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/repeated_equality_comparison.rs:100-106 | crates/ruff_linter/src/rules/pylint/rules/repeated_equality_comparison.rs:108-114 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/rules/pylint/rules/repeated_equality_comparison.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ee97586d985b55eaa2a86de494248482e4b91e1cf9e7458df74bab9a7bc5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:164-169 | crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs:186-192 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs\u0060 and \u0060crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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 \u0060crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:164\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":"crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ba58e6e65c658f4cf8ae57a531c3a67f415dc24024dd5ceda9d3c78b8e3bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_macros/src/map_codes.rs:158-163 | crates/ruff_macros/src/map_codes.rs:177-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_macros/src/map_codes.rs:158\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/ruff_macros/src/map_codes.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ac209196605ec05727f6605742b08c77f3f7db5147c1fb5ddef2e48d737adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_python_formatter/src/comments/placement.rs:1606-1613 | crates/ruff_python_formatter/src/comments/placement.rs:1776-1781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/comments/placement.rs:1606\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/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7534ad4319e4f6d2ae14303c8e2a902e76a0614b5ed6aea9fb45c7a3cc16c355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_python_formatter/src/expression/mod.rs:421-426 | crates/ruff_python_formatter/src/pattern/mod.rs:199-204 \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/ruff_python_formatter/src/expression/mod.rs:421\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 \u0060f\u0060 to \u0060\u0026mut PyFormatter\u0060 in one and \u0060\u0026mut Formatter\u003CPyFormatContext\u003C\u0027_\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruff_python_formatter/src/expression/mod.rs:418\u0060 calls \u0060fmt\u0060 and \u0060crates/ruff_python_formatter/src/pattern/mod.rs:197\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/ruff_python_formatter/src/expression/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5300866e3ed1f055ca4028e9aec77472336c97fa4fd0b5c9f1fcc354fdad68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_python_parser/src/lexer.rs:1323-1330 | crates/ruff_python_parser/src/lexer.rs:1363-1368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn re_lex_string_token_in_interpolation_element( \u0026mut\u0060 in one and \u0060crate) fn re_lex_raw_string_in_format_spec(\u0026mut\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":"crates/ruff_python_parser/src/lexer.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cac115765aab9cb25d9e2ba5f6d0a4d8cd47176baedaf61a09eb604d5393c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_workspace/src/configuration.rs:1119-1124 | crates/ruff_workspace/src/configuration.rs:1164-1169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_workspace/src/configuration.rs:1119\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/ruff_workspace/src/configuration.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"233872cb0ed95aa1e81779ae68f59359746bf77408bf5acc454bad7ca082bb82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_ide/src/call_hierarchy/incoming_calls.rs:35-41 | crates/ty_ide/src/call_hierarchy/outgoing_calls.rs:35-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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/ty_ide/src/call_hierarchy/incoming_calls.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d291baa93666a86494979be26d04ff71b2c122df078816487b3285fb526d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_core/src/builder.rs:1925-1933 | crates/ty_python_core/src/builder.rs:2003-2008 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_core/src/builder.rs:1925\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/ty_python_core/src/builder.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abf97b05f92323afb4a799b19e4a095cc7a909f40ee4bb038d58d846f18a103"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/class/dynamic_literal.rs:569-577 | crates/ty_python_semantic/src/types/class/enum_literal.rs:37-45 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ty_python_semantic/src/types/class/dynamic_literal.rs:567\u0060 calls \u0060anchor\u0060, \u0060recursive_type_normalized_impl\u0060 and \u0060crates/ty_python_semantic/src/types/class/enum_literal.rs:36\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/ty_python_semantic/src/types/class/dynamic_literal.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0dc2e08a6761cfc1b5d4f79c399ef39fa311212f15eea865f597d9c509c0b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:1180-1187 | crates/ty_python_semantic/src/types/constraints/sequents.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 \u0060crates/ty_python_semantic/src/types/constraints/sequents.rs:1180\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"929d5871c8a055235cea8233a6342ebc3e9ff76b3a7b37f52e01b2fda0941d44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:1215-1222 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1320-1327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/sequents.rs:1215\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4eb537fae937ad87ae7224f050ab01e3555ae9ba4182fecd1552d348c6e1c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/equality/enums.rs:784-789 | crates/ty_python_semantic/src/types/equality/enums.rs:804-809 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/equality/enums.rs:784\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/ty_python_semantic/src/types/equality/enums.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa899b7871b6915c7ee8dd5b346f0fc483db4db94319df98e12d6bf069ae4f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:700-705 | crates/ty_python_semantic/src/types/infer/builder.rs:755-760 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c717199b4cc44d2a3eecaf8883f7573ce231b1d3c00a0fc9d15eea4e06c861dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/method.rs:818-823 | crates/ty_python_semantic/src/types/method.rs:839-844 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/method.rs:818\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/method.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"85818bb332c36204b4f221b260afc4ae4fd115464b9fb0df1d72f3d6c480e375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/relation.rs:1484-1489 | crates/ty_python_semantic/src/types/relation.rs:1697-1702 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/relation.rs:1484\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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"691e8aed932515b040dea9cc6e475a1fefeaf1b13c8d36f84d7b6559ed18525d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/set_theoretic.rs:110-115 | crates/ty_python_semantic/src/types/set_theoretic.rs:194-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/set_theoretic.rs:110\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/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1518b9f67fc48c0f3c91dedf88e2a3855397d5aac7c93496a08eb47d2c7fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/ty_python_semantic/src/types/class/typed_dict.rs:428-435 | crates/ty_python_semantic/src/types/class/typed_dict.rs:606-610 | crates/ty_python_semantic/src/types/class/typed_dict.rs:623-628 | crates/ty_python_semantic/src/types/class/typed_dict.rs:679-684 \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/ty_python_semantic/src/types/class/typed_dict.rs:428\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/ty_python_semantic/src/types/class/typed_dict.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa208829c7ef46fa8b6ecc75b9b6660c800e728914829aac6fa9bc0eefb6d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/ty_python_semantic/src/types/infer/builder.rs:709-713 | crates/ty_python_semantic/src/types/infer/builder.rs:766-770 | crates/ty_python_semantic/src/types/infer/builder.rs:824-828 | crates/ty_python_semantic/src/types/infer/builder.rs:863-867 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ty_python_semantic/src/types/infer/builder.rs:706\u0060 calls \u0060extend_cycle_recovery\u0060, \u0060extend\u0060, \u0060iter\u0060 and \u0060crates/ty_python_semantic/src/types/infer/builder.rs:862\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"699edc1fd35f5abda893e09a7cd34ccbac958950e2ecf51b4b9b032cc13cc77c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruff_annotate_snippets/src/renderer/source_map.rs:72-76 | crates/ruff_annotate_snippets/src/renderer/source_map.rs:101-105 | crates/ruff_annotate_snippets/src/renderer/source_map.rs:117-121 \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/ruff_annotate_snippets/src/renderer/source_map.rs:72\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/ruff_annotate_snippets/src/renderer/source_map.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c246b946aa0d2acb3553a95f252ff9739842c68a7394c2db7474c4d45311e167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ty_python_semantic/src/types/set_theoretic.rs:146-153 | crates/ty_python_semantic/src/types/set_theoretic.rs:1166-1173 | crates/ty_python_semantic/src/types/set_theoretic.rs:1192-1199 \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/ty_python_semantic/src/types/set_theoretic.rs:146\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/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd754bd5663c0e7cadcb78d7642dd5c181500059382587cd762c4e7a3805b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:702-706 | crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:728-735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_annotations/rules/definition.rs:702\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":"crates/ruff_linter/src/rules/flake8_annotations/rules/definition.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"7202d8976a1c5a273b5cba285b37410e40753847afd7d109513a083a002d5618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs:138-144 | crates/ruff_linter/src/rules/flake8_async/rules/long_sleep_not_forever.rs:143-147 \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 \u0060crates/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs:138\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/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e675b9f1ef937bdf3fd0ad9b0ca158c17e77a270077ddfd1256c76a638790f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_return/rules/function.rs:660-664 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_assign_before_yield.rs:128-132 \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/ruff_linter/src/rules/flake8_return/rules/function.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"f893d83ee20797b0270c4e584c120c34fc9494125aacda983efb051af86c0619"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_type_checking/rules/empty_type_checking_block.rs:70-76 | crates/ruff_linter/src/rules/pyupgrade/rules/useless_metaclass_type.rs:68-74 \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/ruff_linter/src/rules/flake8_type_checking/rules/empty_type_checking_block.rs:70\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/ruff_linter/src/rules/flake8_type_checking/rules/empty_type_checking_block.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02b5c0dd630327e4acd2cc79941e7129193d649b717eb2c1024a56c7bd9757c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs:683-687 | crates/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs:802-806 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/rules/pydoclint/rules/check_docstring.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd76c0dfee49bbf507b8e2f65b19448c62db71f302a09a27510285005a187db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff_macros/src/map_codes.rs:368-372 | crates/ruff_macros/src/map_codes.rs:375-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_macros/src/map_codes.rs:368\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/ruff_macros/src/map_codes.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"62971746dcc54c5a6cee18092bcc623fd829d661eae4e84242aee9ad89d16330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff_python_formatter/src/comments/format.rs:565-569 | crates/ruff_python_formatter/src/comments/format.rs:614-618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/comments/format.rs:565\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, \u0060crates/ruff_python_formatter/src/comments/format.rs:613\u0060 calls \u0060rev\u0060 and \u0060crates/ruff_python_formatter/src/comments/format.rs:564\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/ruff_python_formatter/src/comments/format.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"9961cfb133ec7aa9a20e1c944e1e9b4bd1a35cf2dc5c7d19cf1dfa91c41d230c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff_python_formatter/src/comments/placement.rs:1334-1338 | crates/ruff_python_formatter/src/comments/placement.rs:1738-1742 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruff_python_formatter/src/comments/placement.rs:1733\u0060 calls \u0060start\u0060, \u0060end\u0060, \u0060dangling\u0060 and \u0060crates/ruff_python_formatter/src/comments/placement.rs:1330\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/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fafd29b99be11f4315886b769ea3c489e16d9d7b61de4d43705769762d597d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_python_formatter/src/statement/stmt_global.rs:14-19 | crates/ruff_python_formatter/src/statement/stmt_nonlocal.rs:14-19 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_formatter/src/statement/stmt_global.rs:14\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 \u0060item\u0060 to \u0060\u0026StmtGlobal\u0060 in one and \u0060\u0026StmtNonlocal\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":"crates/ruff_python_formatter/src/statement/stmt_global.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cd378bb46fc7e2c25a358972f070e9ed42de4ddf5ea8829d32e6a0c2cdecb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_ide/src/goto_type_definition.rs:15-19 | crates/ty_ide/src/type_hierarchy.rs:38-42 \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":"crates/ty_ide/src/goto_type_definition.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfd1cb3497b11917877e6bb19c52e0288f463676605b32fd822fdb1de41a0b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_core/src/definition.rs:1047-1051 | crates/ty_python_core/src/definition.rs:1108-1112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/definition.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db93f206bbf29536981f99126f2dbff4e80b92f3af4a8c158392705550b8447"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_core/src/place.rs:709-713 | crates/ty_python_core/src/place.rs:752-756 \u2014 both copies are in the same file, so extract the block 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/ty_python_core/src/place.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f77f9da478c70f2893256ba52422e598a54251bf410f9dc7d69290510b3acb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/class/typed_dict.rs:308-312 | crates/ty_python_semantic/src/types/class/typed_dict.rs:693-698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/class/typed_dict.rs:308\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/ty_python_semantic/src/types/class/typed_dict.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab669ee15b1c64933093d606fc734a14a106dbc6b4d6a127c2027e3726864011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/class/typed_dict.rs:408-415 | crates/ty_python_semantic/src/types/class/typed_dict.rs:597-601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/class/typed_dict.rs:408\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":"crates/ty_python_semantic/src/types/class/typed_dict.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0199cab29ad55e3c39748f9fffa7abbc72c40635abd9955e4b0906c7fd05e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:1499-1503 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1784-1788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/sequents.rs:1499\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb11421b13ea66cf76f288078f039d835a8ac63cb755eb1a79bce39d1d3907ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:1528-1533 | crates/ty_python_semantic/src/types/constraints/sequents.rs:1587-1592 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/sequents.rs:1528\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"89782bdd3a5899d37b703a1e0cc21b9759adbd3ff67a6ecf5a53c3262eb79575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/variables.rs:1171-1177 | crates/ty_python_semantic/src/types/constraints/variables.rs:1324-1330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/variables.rs:1171\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/ty_python_semantic/src/types/constraints/variables.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf0d4584d53d8b8c05a2688079f1fb24d0695b944286cc3840ef32544c72887"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/dedicated/pydantic.rs:891-895 | crates/ty_python_semantic/src/types/dedicated/pydantic.rs:987-991 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/dedicated/pydantic.rs:891\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/ty_python_semantic/src/types/dedicated/pydantic.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"1161259e51b57dc5aed1dcfa06ff933bf82c50904e4c12dfcfaa3e3a11469688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:10281-10285 | crates/ty_python_semantic/src/types/infer/builder/subscript.rs:1753-1757 \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/ty_python_semantic/src/types/infer/builder.rs:10281\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":10281}}}],"partialFingerprints":{"codehealthFindingId/v1":"92afb965933b8e7de140e48cb926b5b12f2e1b566c8bc774a83744cef5c236d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/subscript.rs:653-658 | crates/ty_python_semantic/src/types/infer/builder/subscript.rs:1060-1065 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/subscript.rs:653\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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6703da6d615290779d523099203119da450af75488b0253a01982428f1bf372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_python_semantic/src/types/literal.rs:142-150 | crates/ty_python_semantic/src/types/literal.rs:157-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/literal.rs:142\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/ty_python_semantic/src/types/literal.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6331c4923cd09e9ae0178ab9bba3da6743dffcf330a63257ffdfcab5c036f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/method.rs:699-703 | crates/ty_python_semantic/src/types/method.rs:735-739 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/method.rs:699\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, \u0060crates/ty_python_semantic/src/types/method.rs:741\u0060 calls \u0060positional_only\u0060, \u0060Some\u0060, \u0060new_static\u0060 and \u0060crates/ty_python_semantic/src/types/method.rs:705\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/ty_python_semantic/src/types/method.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55bbf508753a52e9f4f83dfee1cf4bcec41dacf56ceb2c5e4f0106ece682ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/narrow.rs:5261-5267 | crates/ty_python_semantic/src/types/narrow.rs:5294-5298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/narrow.rs:5261\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/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":5261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e001ecb497ecfd2fb094fed3a64e2c01466ac65f09349cdc95c55301fb5b3adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/overrides.rs:1495-1499 | crates/ty_python_semantic/src/types/overrides/attributes.rs:754-758 \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/ty_python_semantic/src/types/overrides.rs:1495\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/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"4486cad343a10f89a75f70e85cacb76b00fc025bad5178a7c8e020e0d26f8d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/type_alias.rs:252-256 | crates/ty_python_semantic/src/types/type_alias.rs:290-294 \u2014 both copies are in the same file, so extract the block 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/ty_python_semantic/src/types/type_alias.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4839fb5af02cbb96d14153bca9a65f5a2ead7522b5ec9c114cecb47d19f67813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruff_formatter/shared_traits.rs:69-96 | crates/ruff_python_formatter/src/shared_traits.rs:74-101 \u2014 before extracting anything, compare \u0060crates/ruff_formatter/shared_traits.rs\u0060 and \u0060crates/ruff_python_formatter/src/shared_traits.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060crates/ruff_formatter/shared_traits.rs:69\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/ruff_formatter/shared_traits.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e200a39e40988f87c47a261788154917e29e913c99158f23fec65bcd686707a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68 lines \u00D7 2): crates/ruff_server/src/server/schedule/thread.rs:41-108 | crates/ty_server/src/server/schedule/thread.rs:41-108 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server/schedule/thread.rs\u0060 and \u0060crates/ty_server/src/server/schedule/thread.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060crates/ruff_server/src/server/schedule/thread.rs:41\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/ruff_server/src/server/schedule/thread.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b9156d018a2945b3e4a0679163e12ff97bfe3bdd888cb64df4c8a1aa8a5576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (180 lines \u00D7 2): crates/ruff_server/src/session/request_queue.rs:17-197 | crates/ty_server/src/session/request_queue.rs:17-196 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/session/request_queue.rs\u0060 and \u0060crates/ty_server/src/session/request_queue.rs\u0060 as WHOLE FILES: 99% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060crates/ruff_server/src/session/request_queue.rs:17\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/ruff_server/src/session/request_queue.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"da085e527b67b82a2b785ebe98aa78899093e8adaf4fa5e3a3419385dd45ebe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff/src/args.rs:917-924 | crates/ty/src/args.rs:564-571 \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/ruff/src/args.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd6799bc39aeab7ba6020c42cf19c8b8c1f8a200d66ad0c3452e734054a6dc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff/src/stdin.rs:5-9 | crates/ruff_python_formatter/src/main.rs:11-15 \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/ruff/src/stdin.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1477289c1a6e396a210999ecea1b4328e6642837c51f09a0f2f9289e6f22fabc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/mod.rs:645-649 | crates/ty_python_core/src/builder.rs:3476-3480 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060impl FnOnce(\u0026mut SemanticSyntaxChecker, \u0026Checker)\u0060 in one and \u0060impl FnOnce(\u0026mut SemanticSyntaxChecker, \u0026Self)\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":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4002abcfe5eb9922f1df6e00ae0622e0047044176297c23c6115d7b047ae846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_async/rules/blocking_path_methods.rs:156-173 | crates/ruff_python_semantic/src/analyze/typing.rs:943-960 \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/ruff_linter/src/rules/flake8_async/rules/blocking_path_methods.rs:156\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060semantic\u0060 to \u0060\u0026ruff_python_semantic::SemanticModel\u0060 in one and \u0060\u0026SemanticModel\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":"crates/ruff_linter/src/rules/flake8_async/rules/blocking_path_methods.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9aafbf863a4fff9ddbb76d9b9b94942ba3503bc09ce00c80ce36879a23dac7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_async/rules/blocking_path_methods.rs:198-204 | crates/ruff_python_semantic/src/analyze/typing.rs:968-974 \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/ruff_linter/src/rules/flake8_async/rules/blocking_path_methods.rs:198\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060semantic\u0060 to \u0060\u0026ruff_python_semantic::SemanticModel\u0060 in one and \u0060\u0026SemanticModel\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":"crates/ruff_linter/src/rules/flake8_async/rules/blocking_path_methods.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b345c892277a69eef4f763034437c6f6474e922c6a5491d33a8e1b12a64fe89e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_bugbear/rules/return_in_generator.rs:147-155 | crates/ruff_python_parser/src/semantic_errors.rs:2261-2269 \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/ruff_linter/src/rules/flake8_bugbear/rules/return_in_generator.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe924247f8cdb8bd7c239a9375ccf9032dfad4dba14940de576e9656c2f3fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_datetimez/rules/datetime_min_max.rs:121-126 | crates/ruff_linter/src/rules/pylint/rules/nested_min_max.rs:119-124 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut std::fmt::Formatter\u003C\u0027_\u003E\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":"crates/ruff_linter/src/rules/flake8_datetimez/rules/datetime_min_max.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e3f808d0ae22f0ae3b3940dc3bafdb51f5e8697b10b7b04deddb6e4211c00f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_return/visitor.rs:213-218 | crates/ruff_linter/src/rules/ruff/rules/unnecessary_assign_before_yield.rs:232-237 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_return/visitor.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1ce5515d35782b96ee8c1ac04d0bee1d93925310076604b9e9e55d2d092754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruff_linter/src/settings/types.rs:117-122 | crates/ruff_python_formatter/src/options.rs:368-373 | crates/ruff_python_formatter/src/options.rs:419-424 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut fmt::Formatter\u003C\u0027_\u003E\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":"crates/ruff_linter/src/settings/types.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0e85bdd2d124d7d35359a8e58effa8b8dc5efa4cef35b436c1f501379fc52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_linter/src/suppression.rs:1354-1361 | crates/ty_python_semantic/src/suppression/parser.rs:128-135 \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/ruff_linter/src/suppression.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d368dcdf258d283a077295dd1d242f37fea702f57cf62a06826c28c255fac47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_linter/src/suppression.rs:1363-1372 | crates/ty_python_semantic/src/suppression/parser.rs:137-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/suppression.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"953c1ff4936fd44038e823e5bc11b0209504423de7a90c117763ac15912b95a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_ast/src/visitor.rs:647-656 | crates/ruff_python_ast/src/visitor/transformer.rs:640-649 \u2014 before extracting anything, compare \u0060crates/ruff_python_ast/src/visitor.rs\u0060 and \u0060crates/ruff_python_ast/src/visitor/transformer.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 538 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 \u0060crates/ruff_python_ast/src/visitor.rs:647\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/ruff_python_ast/src/visitor.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a92bc3df843111893ebff6fa3b3445ae6a939bbd922c2f0996ce47840b17eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_python_formatter/src/expression/mod.rs:629-640 | crates/ruff_python_formatter/src/pattern/mod.rs:357-368 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060count\u0060 to \u0060u32\u0060 in one and \u0060usize\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":"crates/ruff_python_formatter/src/expression/mod.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c29d0a55804372468ff93c088f823f86fd7b8d07192258fed6e0fbbc78166e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruff_python_parser/src/lexer.rs:1547-1555 | crates/ruff_python_stdlib/src/identifiers.rs:35-43 | crates/ruff_python_trivia/src/tokenizer.rs:139-147 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/lexer.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"f591df189b93b4a3bd0322b48dad0681e15faa769e75852107c0c5e56caf2794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff_python_parser/src/lexer/cursor.rs:48-52 | crates/ruff_python_trivia/src/cursor.rs:59-63 \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/ruff_python_parser/src/lexer/cursor.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"998b6dfe76f243762f314ad1294aa07206916a49096079db46ad6d6e7ebeb4e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_parser/src/lexer/cursor.rs:113-122 | crates/ruff_python_trivia/src/cursor.rs:116-125 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn eat_char2(\u0026mut\u0060 in one and \u0060\u0026mut\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":"crates/ruff_python_parser/src/lexer/cursor.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad015c36e563065432e9abe4e5c7e61d0300bd78762dd95e8b8054500eb022d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_server/src/edit.rs:35-41 | crates/ty_server/src/document.rs:65-71 \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/ruff_server/src/edit.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"518e0215c61b900cd7594ca896fb64838652f064f0918721b30f30b7e97e3590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_server/src/edit.rs:93-103 | crates/ty_server/src/document.rs:171-181 \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/ruff_server/src/edit.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb39983e8bb5de3195c0e239927a5f95caa47307586cb7098ebaac4ebf6a938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_server/src/logging.rs:86-94 | crates/ty_server/src/logging.rs:81-89 \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/ruff_server/src/logging.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"008a909ed628a2cfa117713452b1770f1fdbeee5808574817029410f41a775fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_server/src/server.rs:131-140 | crates/ty_server/src/server.rs:177-186 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server.rs\u0060 and \u0060crates/ty_server/src/server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 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":"crates/ruff_server/src/server.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40607c079b3bd4e8e7dbf5123b813c414160aacd285d17f205b205c0aa00500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_server/src/server.rs:423-432 | crates/ty_server/src/server.rs:249-258 \u2014 before extracting anything, compare \u0060crates/ruff_server/src/server.rs\u0060 and \u0060crates/ty_server/src/server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 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":"crates/ruff_server/src/server.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2cfbfc90436bd71ef746c2ff6190a85a06010f30d438e16c6b7fe2b41ae676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_server/src/server/schedule.rs:39-45 | crates/ty_server/src/server/schedule.rs:39-45 \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/ruff_server/src/server/schedule.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e72ff97dea7f27a48e463976efb67b3d4f0f592f7005a389769bd02b042849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_server/src/session/index.rs:98-103 | crates/ty_server/src/session/index.rs:62-67 \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/ruff_server/src/session/index.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58d53e38290c11ddd5d912bd6dcb74747daa199127eb5dfc8ad64cbc72e604a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_server/src/session/index.rs:515-520 | crates/ty_server/src/session/index.rs:261-266 \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/ruff_server/src/session/index.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b986eb6b665f297f5b701281a24292fce3bc15b9c8e8d6f330ff7b30fe9678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_server/src/session/index.rs:536-541 | crates/ty_server/src/session/index.rs:282-287 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060crate) fn as_text_mut(\u0026mut\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":"crates/ruff_server/src/session/index.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88748ca81e78c0b80d18c2dd83771b744c8106bf6da5182f288f8bf466ec9d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_wasm/src/lib.rs:137-145 | crates/ty_wasm/src/lib.rs:1259-1267 \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/ruff_wasm/src/lib.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaff63a1c1b4710e0ae9760caeb1f1544c719d6f8c9086d46a9c67b30b3d33ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_wasm/src/lib.rs:257-265 | crates/ty_wasm/src/lib.rs:98-106 \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/ruff_wasm/src/lib.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"154006b074eab0453134212ff1459c971245d982cd6f551335beb924ea78f922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_ide/src/docstring/document/google.rs:451-456 | crates/ty_ide/src/docstring/document/numpy.rs:363-368 \u2014 before extracting anything, compare \u0060crates/ty_ide/src/docstring/document/google.rs\u0060 and \u0060crates/ty_ide/src/docstring/document/numpy.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 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":"crates/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"3542c0d3483a22f9b29cbb90ceacc2dc240bc71ff6cd4ca8be91f0c114ca4117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_ide/src/docstring/document/google.rs:463-473 | crates/ty_ide/src/docstring/document/numpy.rs:376-386 \u2014 before extracting anything, compare \u0060crates/ty_ide/src/docstring/document/google.rs\u0060 and \u0060crates/ty_ide/src/docstring/document/numpy.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 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":"crates/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"2955d0224ac6a189386f616132e59f45f52605490786b93a865a6aac4b61ffa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_ide/src/docstring/document/google.rs:623-628 | crates/ty_ide/src/docstring/document/numpy.rs:559-564 \u2014 before extracting anything, compare \u0060crates/ty_ide/src/docstring/document/google.rs\u0060 and \u0060crates/ty_ide/src/docstring/document/numpy.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 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":"crates/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fd8fb3a61670395c03a86dc114a2b22c8d1879caeec5e84dcf88cd39173e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_ide/src/docstring/document/google.rs:630-634 | crates/ty_ide/src/docstring/document/numpy.rs:566-570 \u2014 before extracting anything, compare \u0060crates/ty_ide/src/docstring/document/google.rs\u0060 and \u0060crates/ty_ide/src/docstring/document/numpy.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 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":"crates/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7073ae3ed550904bd8747d124b1efb5d0706acf7b640236a4cc00c7bdb92af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_core/src/reachability_constraints.rs:116-120 | crates/ty_python_semantic/src/types/constraints.rs:2378-2384 \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/ty_python_core/src/reachability_constraints.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"746b0ea95ccf7746728634173092de03280c2f354d889783f914980fad912004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/class/static_literal.rs:537-542 | crates/ty_python_semantic/src/types/function.rs:434-439 \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/ty_python_semantic/src/types/class/static_literal.rs:537\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn find_known_decorator_span(\u0060 in one and \u0060super) fn find_known_decorator_span(\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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57a519f9573d608d24f85f6ba72a9522f7d58e619ca65e8bebda33b5869ce62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ty_python_semantic/src/types/narrow.rs:4933-4939 | crates/ty_python_semantic/src/types/unpacker.rs:720-726 \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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":4933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e542c1a45f7ba86a7464dd5221016f07965e850aaa9cb71eac921da815506e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_linter/src/noqa.rs:690-695 | crates/ruff_python_parser/src/lexer.rs:1379-1384 \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/ruff_linter/src/noqa.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d64adca93ab97439f1fd7a1d0a0cebd60526a577545d2fa5e55f375c3639037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_async/rules/blocking_http_call.rs:74-85 | crates/ruff_linter/src/rules/flake8_async/rules/blocking_sleep.rs:54-65 \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":"crates/ruff_linter/src/rules/flake8_async/rules/blocking_http_call.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ec68652f1f65e67a3c2b64b4a536d21fac4efc95413d42c401a12210aded52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_bandit/rules/try_except_continue.rs:66-72 | crates/ruff_linter/src/rules/flake8_bandit/rules/try_except_pass.rs:62-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_bandit/rules/try_except_continue.rs:66\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/ruff_linter/src/rules/flake8_bandit/rules/try_except_continue.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec8f2df2b4e5e6520203a0284dc860a4e76933c629dd8f10b4ba6ab1e4892e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_set.rs:138-144 | crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_list_call.rs:134-140 \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":"crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_set.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61a23ba6adaee2a62b6fa79c21519bd6c8940e1d7bdd9dfd9e53d3c19e4d8d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/too_many_branches.rs:244-255 | crates/ruff_linter/src/rules/pylint/rules/too_many_statements.rs:76-87 \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 \u0060crates/ruff_linter/src/rules/pylint/rules/too_many_branches.rs:244\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/ruff_linter/src/rules/pylint/rules/too_many_branches.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2005b50bdfa6764e64aaec0e2c3549037ebcf3a5366e67642c53e750c8f413c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_python_formatter/src/expression/expr_bytes_literal.rs:38-46 | crates/ruff_python_formatter/src/expression/expr_string_literal.rs:71-79 \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 \u0060crates/ruff_python_formatter/src/expression/expr_bytes_literal.rs:38\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/ruff_python_formatter/src/expression/expr_bytes_literal.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66494f8242d568f704293e8acb722f0218aa273e383e28a93ba43991a547eea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_ide/src/docstring/document/google.rs:227-235 | crates/ty_ide/src/docstring/document/numpy.rs:137-145 \u2014 before extracting anything, compare \u0060crates/ty_ide/src/docstring/document/google.rs\u0060 and \u0060crates/ty_ide/src/docstring/document/numpy.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 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":"crates/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"148c6f3408317cb1e33b20c00f14bf9f8d368ed1e7ad5872da7059e66b7c3320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_ide/src/docstring/document/google.rs:237-247 | crates/ty_ide/src/docstring/document/numpy.rs:147-157 \u2014 before extracting anything, compare \u0060crates/ty_ide/src/docstring/document/google.rs\u0060 and \u0060crates/ty_ide/src/docstring/document/numpy.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 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":"crates/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba0a9948a54470bd57bfba1fca0f30d4ae869d04abe8f98ff480a43fd3ce371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ty_ide/src/symbols.rs:1183-1191 | crates/ty_python_semantic/src/dunder_all.rs:204-212 \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/ty_ide/src/symbols.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62c714f3ba082903dc17b1664e01d3e890ea59c80da6371da5fccb3c1685b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/class/dynamic_literal.rs:169-174 | crates/ty_python_semantic/src/types/class/typed_dict.rs:933-938 \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":"crates/ty_python_semantic/src/types/class/dynamic_literal.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4052bf1bf74af57dffcd4f9b12f74965bd03c916a12ea925e4bf0a1cf4cc9356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/class/dynamic_literal.rs:177-182 | crates/ty_python_semantic/src/types/class/typed_dict.rs:941-946 \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":"crates/ty_python_semantic/src/types/class/dynamic_literal.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"16135feb7a567e9ab9f61977dc75e67eb0b734daf84cb93ccc271dbd992f4f98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/class/static_literal.rs:625-629 | crates/ty_python_semantic/src/types/function.rs:462-466 \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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adb76ff7554f5711360c751dc5d2a16c7677ea35a651f1ef2e840bb900eeb50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruff_python_parser/src/parser/statement.rs:799-817 | crates/ruff_python_parser/src/parser/statement.rs:1791-1814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_parser/src/parser/statement.rs:799\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/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2175c429942e2ab6517ab26ee78c7929609f22aa803205a39b9270aecb765f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:51-70 | crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs:66-88 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 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 \u0060crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs:51\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/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f13d364e06baa489021990446d590df84d6af2d2de7068f8fd6d98704011315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_rename.rs:90-109 | crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_replace.rs:93-112 \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 \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_rename.rs:90\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/ruff_linter/src/rules/flake8_use_pathlib/rules/os_rename.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec632ffc3f5552c66a53749040565ca291158566c02969111b24c22f6cd13e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ty_project/src/metadata/options.rs:1887-1901 | crates/ty_project/src/metadata/options.rs:1903-1917 \u2014 both copies are in the same file, so extract the block 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/ty_project/src/metadata/options.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae98990b827bcfbbcced06ccc19c41d5adc91a6673d4c08138db58be33ad279"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruff_server/src/edit/notebook.rs:94-108 | crates/ty_server/src/document/notebook.rs:119-133 \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/ruff_server/src/edit/notebook.rs:94\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/ruff_server/src/edit/notebook.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adc64b0cf0607c2deb65ec74fe567d1ffd28de737cad7f1d9b68ab9efd07f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/diagnostic.rs:6087-6099 | crates/ty_python_semantic/src/types/diagnostic.rs:6111-6125 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/ty_python_semantic/src/types/diagnostic.rs:6100\u0060 calls \u0060annotate\u0060, \u0060secondary\u0060, \u0060header_range\u0060 and \u0060crates/ty_python_semantic/src/types/diagnostic.rs:6126\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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":6087}}}],"partialFingerprints":{"codehealthFindingId/v1":"c380795abc68f8e0f00dbf12f18e424c788f444dc0c88339c763611e7021a965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:3362-3374 | crates/ty_python_semantic/src/types/infer/builder.rs:3447-3460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:3362\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":3362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcbb78a44e3b012cc71790f84b2ab90c250cb041538f31db3bc5c0c40df923a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_python_formatter/src/other/parameters.rs:155-167 | crates/ruff_python_formatter/src/other/parameters.rs:194-203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_formatter/src/other/parameters.rs:155\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/ruff_python_formatter/src/other/parameters.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"01819ddf488d85ed45d367729682e056f34af57c6a09fbc532066ee1de41aede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_python_codegen/src/generator.rs:683-695 | crates/ruff_python_codegen/src/generator.rs:697-709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_python_codegen/src/generator.rs:683\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/ruff_python_codegen/src/generator.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"082e4caee2d4a4b7467f25827c49e2840a3c659c564c7facc01faf1855c30535"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pyi/rules/bad_version_info_comparison.rs:119-131 | crates/ruff_linter/src/rules/flake8_pyi/rules/unrecognized_platform.rs:104-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 \u0060crates/ruff_linter/src/rules/flake8_pyi/rules/bad_version_info_comparison.rs:119\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/ruff_linter/src/rules/flake8_pyi/rules/bad_version_info_comparison.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98e7bec16b8965739136c823b8f1aac7c8e0e07253875134246b596678a5ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:3849-3861 | crates/ty_python_semantic/src/types/infer/builder.rs:4266-4278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:3849\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6226f28427c0d40f8c258f5ac317bbdfd6480faba01b5bc62e8668222a2939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/compare_to_empty_string.rs:81-92 | crates/ruff_linter/src/rules/pylint/rules/compare_to_empty_string.rs:99-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pylint/rules/compare_to_empty_string.rs:81\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/ruff_linter/src/rules/pylint/rules/compare_to_empty_string.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17ba86887561f2b53721af254c6bbda154490ec5c8f937de7f66ac2bf75320d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty_python_semantic/src/types/class/static_literal.rs:2741-2752 | crates/ty_python_semantic/src/types/class/static_literal.rs:2758-2769 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/class/static_literal.rs:2741\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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f9fc0a5a48edb6a1b853b64959f8d27b1ecb1f5d35bd41d813758cf5910b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/assertion.rs:560-571 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/assertion.rs:577-588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_pytest_style/rules/assertion.rs:560\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/ruff_linter/src/rules/flake8_pytest_style/rules/assertion.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdc012df44b3fa21a8f807db5b5462920f0bdd2db9cdf86b708d57196bfc993"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff/src/lib.rs:392-403 | crates/ruff/src/lib.rs:419-430 \u2014 both copies are in the same file, so extract the block 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/ruff/src/lib.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4225cba8e15eba7e73689479c10daadc9460a47105955cd5bd5a95b58501a98e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/subscript.rs:2128-2137 | crates/ty_python_semantic/src/types/infer/builder/subscript.rs:2398-2409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/subscript.rs:2128\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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f4a0ed4a02888f34a00191f7579d2d80af5d909a16eb0e87cbc7b6f3e0f93e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2219-2230 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:3114-3124 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:3133-3143 \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/ty_python_semantic/src/types/infer/builder/type_expression.rs:2219\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7262004097ea8ed0a235123d51eec6397b19ed24149fefc7e952d806f4f3c055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_fromtimestamp.rs:89-100 | crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_now_without_tzinfo.rs:85-95 | crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_without_tzinfo.rs:84-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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_fromtimestamp.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":"crates/ruff_linter/src/rules/flake8_datetimez/rules/call_datetime_fromtimestamp.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9838e83eb42981114600c561f04a2a828f0c1a891b7b7263170ca1edc27a61c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs:112-123 | crates/ruff_linter/src/rules/pylint/rules/singledispatchmethod_function.rs:98-109 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs\u0060 and \u0060crates/ruff_linter/src/rules/pylint/rules/singledispatchmethod_function.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 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 \u0060crates/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs:112\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/ruff_linter/src/rules/pylint/rules/singledispatch_method.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"687bd86e609a34238d06b6268704668e7adc09e1acc10cf4e16cfecbb25d4bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:1486-1497 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:3093-3103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:1486\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":"crates/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4b416646233085373f1672d485b5ad8b991d791f3a0e655c19cd76888927e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/subscript.rs:2222-2233 | crates/ty_python_semantic/src/types/infer/builder/subscript.rs:2488-2499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/subscript.rs:2222\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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":2222}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b333d52833676366ed1524b326892ec822ea75a68735c441d861a1377a9741"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types/overrides.rs:1926-1937 | crates/ty_python_semantic/src/types/overrides.rs:2205-2214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/overrides.rs:1926\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/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"267d670d300441ae07634005312995c3bd9d30bef0330ee491e2ea1fdaeda3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/replace_stdout_stderr.rs:65-76 | crates/ruff_linter/src/rules/pyupgrade/rules/replace_universal_newlines.rs:55-65 \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 \u0060crates/ruff_linter/src/rules/pyupgrade/rules/replace_stdout_stderr.rs:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyupgrade/rules/replace_stdout_stderr.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbf0fd9e42c251afadbccec80053f60764092a000a94a9bbba601619052ad84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruff_python_semantic/src/model.rs:1340-1351 | crates/ruff_python_semantic/src/model.rs:1391-1402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_python_semantic/src/model.rs:1340\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/ruff_python_semantic/src/model.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef091c8dada343a3d3ad2df0c562bd5aba95f450b67cd3c8c39cad4e892d974"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_project/src/metadata/options.rs:1352-1362 | crates/ty_project/src/metadata/options.rs:1424-1434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_project/src/metadata/options.rs:1352\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/ty_project/src/metadata/options.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc4d813e6f1cba7d76f1193fd4ad3ff04b994b21e46f30fb4040e6b4550b7bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs:108-115 | crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs:118-128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/typed_dict.rs:108\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/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8c689e33d03ce0daac91da371bbb24b6d2f71c5765c1e81328416a68f5f7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_dev/src/generate_ty_cli_reference.rs:33-42 | crates/ruff_dev/src/generate_ty_env_vars_reference.rs:38-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_dev/src/generate_ty_cli_reference.rs:33\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/ruff_dev/src/generate_ty_cli_reference.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"94575b4ae1d1bcc214b72ce1e8b3bf6c2381a42fca461131c935eeae10214a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:722-732 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:1016-1026 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:722\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"053abc5e7642fe3888f139c156a4596aaf9779c265ae006e3afc8bea5f4e0c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruff_linter/src/rules/pyflakes/rules/raise_not_implemented.rs:79-89 | crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:86-96 | crates/ruff_linter/src/rules/pyupgrade/rules/typing_text_str_alias.rs:73-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/pyflakes/rules/raise_not_implemented.rs:79\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/ruff_linter/src/rules/pyflakes/rules/raise_not_implemented.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"285f66f29714ac1d4532def2e4a393bbd9c5609c668ed1f7be1010b8301ce939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:10994-11004 | crates/ty_python_semantic/src/types/call/bind.rs:11220-11230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/call/bind.rs:10994\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":10994}}}],"partialFingerprints":{"codehealthFindingId/v1":"0065b5eb1f4904aa6cfe61a3ad52f4bbaa039b3b758e9a1f04aa1da56a9525dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_dict_call.rs:61-70 | crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_list_call.rs:70-79 \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 \u0060crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_dict_call.rs:61\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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_literal_within_dict_call.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ad4bcf519abbe87cbe4b16a22f968d6d43eb9e84b5babfaadc880ae15da33b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_annotate_snippets/src/renderer/render.rs:379-388 | crates/ruff_annotate_snippets/src/renderer/render.rs:407-416 \u2014 both copies are in the same file, so extract the block 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/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"03805cefdef4c0f38d86607ed5697961318f63fe838fc9ac1e241734b7cdb6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs:432-441 | crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs:774-783 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs:432\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/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e91e66588a88000b3e893a436b30d6f0e492fcebfc682118093839ba639c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2062-2071 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2074-2083 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2086-2095 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2098-2107 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2110-2119 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2122-2131 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2134-2143 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2146-2155 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2062\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d9439aa53c888dddf38e26b9945469d4904cc5249f3767e83bd1caa8f24b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_core/src/member.rs:325-334 | crates/ty_python_core/src/member.rs:340-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_core/src/member.rs:325\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/ty_python_core/src/member.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3c92adba931091d8fb86d938823a572263e9ef16f67086c9ea866fde278b12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2062-2071 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2074-2083 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2086-2095 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2098-2107 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2110-2119 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2122-2131 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2134-2143 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2146-2155 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:3184-3193 \u2014 all 9 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:2062\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d8b79c5646db528b8cd836b9e2fa7314955da85ac2fd8b49406ca873525d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:4825-4834 | crates/ty_python_semantic/src/types/call/bind.rs:4839-4848 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/call/bind.rs:4825\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4825}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d0a7ca23ecae8e7e6bf03a93a68718db5acf90ab15b779918fe727e2ad52f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs:106-113 | crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs:117-126 | crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs:130-139 \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/ty_python_semantic/src/types/infer/builder/typed_dict.rs:106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs:141\u0060 calls \u0060annotate\u0060, \u0060secondary\u0060 and \u0060crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs:114\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/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e121dbadaab6ca74a606131f7ef498714fc13640dadacc6a283f7fcf46a8c3c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_workspace/src/configuration.rs:1131-1140 | crates/ruff_workspace/src/configuration.rs:1179-1188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_workspace/src/configuration.rs:1131\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/ruff_workspace/src/configuration.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"662f05cdadb0a3679040f6362754631362dbe2bec4856f4afc202f1e70336c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs:121-130 | crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs:189-198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs:121\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/ruff_linter/src/rules/flake8_simplify/rules/reimplemented_builtin.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc70bc7ef1c54e6772b29217af4013b88681cd8b6eed9cc0ac175deaf9757961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_linter/src/rules/pydocstyle/rules/triple_quotes.rs:96-104 | crates/ruff_linter/src/rules/pydocstyle/rules/triple_quotes.rs:110-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/pydocstyle/rules/triple_quotes.rs:96\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/ruff_linter/src/rules/pydocstyle/rules/triple_quotes.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"624e48efeda5dd2066b1fb1466ebc090ce5a6c5234d43971c5f813a90f023f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:238-246 | crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs:292-300 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs\u0060 and \u0060crates/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 125 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 \u0060crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs:238\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/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3da87a3f46f1d0c1ed70ef3422d616c833a001fd10eec4b0ea0edb59c13f15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/ty_python_semantic/src/types/relation_error.rs:270-277 | crates/ty_python_semantic/src/types/relation_error.rs:288-296 | crates/ty_python_semantic/src/types/relation_error.rs:298-305 | crates/ty_python_semantic/src/types/relation_error.rs:322-329 | crates/ty_python_semantic/src/types/relation_error.rs:347-354 \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. 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/ty_python_semantic/src/types/relation_error.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a1402f60134b866eb51b9e8072c8af1bebedf78497753d17273a786a2acb2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:813-820 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:1051-1059 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:813\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:1048\u0060 calls \u0060help\u0060 and \u0060crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:810\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"22aeb84dc7a4d3309d7c16026e3ff98d51bad29bcf25153fda99e2491b4056ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:134-142 | crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs:147-155 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs\u0060 and \u0060crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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 \u0060crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:134\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/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f3c6336e4fc1111f5c86ceedf88aa0b89e3ad53d602566f419d0c185531569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs:82-90 | crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs:100-108 \u2014 before extracting anything, compare \u0060crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs\u0060 and \u0060crates/ruff_linter/src/rules/pyupgrade/rules/timeout_error_alias.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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 \u0060crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs: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":"crates/ruff_linter/src/rules/pyupgrade/rules/os_error_alias.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"375f3fd75d866dcb221e0da8a9677d15c9badb6e69a4fcc84536885eed852e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder.rs:10802-10809 | crates/ty_python_semantic/src/types/infer/builder.rs:10839-10846 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder.rs:10802\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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":10802}}}],"partialFingerprints":{"codehealthFindingId/v1":"301bc381f3fb55fdde2736d1de5085806b16d6373c75f57e6fcc689c2705fcf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2241-2248 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2253-2260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:2241\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca42bc11086114c2bf8f732470a363636554a2dae6d8c278238a7e6710350e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_dev/src/generate_json_schema.rs:22-29 | crates/ruff_dev/src/generate_ty_schema.rs:22-29 \u2014 before extracting anything, compare \u0060crates/ruff_dev/src/generate_json_schema.rs\u0060 and \u0060crates/ruff_dev/src/generate_ty_schema.rs\u0060 as WHOLE FILES: 88% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruff_dev/src/generate_json_schema.rs:22\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/ruff_dev/src/generate_json_schema.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b435b873e52a06f569a0c1de0fbbd4cf278729386fd1fcfc8959a10d28b2cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs:386-393 | crates/ruff_linter/src/rules/flake8_simplify/rules/ast_unary_op.rs:272-279 \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/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs:386\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/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e913bbefc4a0f39ba1acc2ecc942efef294eaa26bc25f53b1b3be81ba1fc5179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/post_inference/typed_dict.rs:537-544 | crates/ty_python_semantic/src/types/typed_dict.rs:1762-1769 \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/ty_python_semantic/src/types/infer/builder/post_inference/typed_dict.rs:537\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/ty_python_semantic/src/types/infer/builder/post_inference/typed_dict.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"967f3cbf42766962b8ab23339105e27971448d6b60772dca15a9175be7bbca9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ty_python_semantic/src/types/diagnostic.rs:2532-2538 | crates/ty_python_semantic/src/types/diagnostic.rs:2719-2725 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/diagnostic.rs:2532\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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":2532}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafd282159d733a93e5e98edd1751f7a70d00c3bd6b3a8a82fa3171cba1b59ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ty_python_semantic/src/types/typevar.rs:1783-1789 | crates/ty_python_semantic/src/types/typevar.rs:1805-1811 | crates/ty_python_semantic/src/types/typevar.rs:1826-1832 \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/ty_python_semantic/src/types/typevar.rs:1783\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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"40816210dac4152492b15ddc3974053035048580bdcd6c304fdf986c9b8be146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/assertion.rs:572-578 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/assertion.rs:589-595 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/rules/flake8_pytest_style/rules/assertion.rs:572\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/ruff_linter/src/rules/flake8_pytest_style/rules/assertion.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"10db5f1865c56c9c658204b5700840e487401e50aaf6c5d70335a32f52764cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff/src/main.rs:69-75 | crates/ty/src/main.rs:41-47 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/main.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e42f055ac9fc3ebcaff4839c9b5758d04ba1417f58f5985e46e0139aae4d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs:384-390 | crates/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs:426-432 \u2014 both copies are in the same file, so extract the block 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/ruff_linter/src/rules/flake8_pytest_style/rules/unittest_assert.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9466e8ebf8649470ec8a9d0e8af011952b755866a30c260ec213f23cb4db6344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_linter/src/rules/numpy/rules/deprecated_function.rs:86-91 | crates/ruff_linter/src/rules/refurb/rules/subclass_builtin.rs:123-129 \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/ruff_linter/src/rules/numpy/rules/deprecated_function.rs:86\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, \u0060crates/ruff_linter/src/rules/numpy/rules/deprecated_function.rs:85\u0060 calls \u0060add_primary_tag\u0060, \u0060try_set_fix\u0060 and \u0060crates/ruff_linter/src/rules/refurb/rules/subclass_builtin.rs:123\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/ruff_linter/src/rules/numpy/rules/deprecated_function.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f80510ca34e2b49b98f1bb3d783eaa87d2dfd5876d166fff3839e8a4e9f2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ty_python_semantic/src/types/typevar.rs:1786-1792 | crates/ty_python_semantic/src/types/typevar.rs:1808-1814 | crates/ty_python_semantic/src/types/typevar.rs:1829-1835 | crates/ty_python_semantic/src/types/typevar.rs:2214-2220 \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/ty_python_semantic/src/types/typevar.rs:1786\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, \u0060crates/ty_python_semantic/src/types/typevar.rs:2211\u0060 calls \u0060typevar\u0060 and \u0060crates/ty_python_semantic/src/types/typevar.rs:1783\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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"139fa5c721be3407c65aa8b8c613bc8b270eb7de3b66cba5c3967e813aab02e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_bugbear/rules/map_without_explicit_strict.rs:66-72 | crates/ruff_linter/src/rules/flake8_bugbear/rules/zip_without_explicit_strict.rs:59-64 \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 \u0060crates/ruff_linter/src/rules/flake8_bugbear/rules/map_without_explicit_strict.rs:66\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":"crates/ruff_linter/src/rules/flake8_bugbear/rules/map_without_explicit_strict.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9c41aee08dc2677bd04c693b2b1d0230fc26f6b407ea1f8a58704cc3e49464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruff_python_ast/src/nodes.rs:1328-1334 | crates/ruff_python_ast/src/nodes.rs:1372-1378 | crates/ruff_python_ast/src/nodes.rs:1883-1889 | crates/ruff_python_ast/src/nodes.rs:2300-2306 \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. 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/ruff_python_ast/src/nodes.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e33a6b1282cae1f380b2cc1807f9fc21fd09775b61bfce8174c7b3c69734ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/sequents.rs:193-202 | crates/ty_python_semantic/src/types/constraints/sequents.rs:206-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/constraints/sequents.rs:193\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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d431cf5847a27f8138ce61af065a954a7db6a6ecd305d1bffd5b2b34e7993a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:978-982 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:1038-1043 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer/builder/type_expression.rs:978\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:1037\u0060 calls \u0060is_starred_expr\u0060 and \u0060crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:977\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dade2ee2d5d550b1592a624354de56218a6a47f04a750cdb04ed059f5ad0a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/call/bind.rs:10917-10922 | crates/ty_python_semantic/src/types/call/bind.rs:10940-10944 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/call/bind.rs:10917\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":10917}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72e7041408b7e41668963ce913e81370b76f09463803346ad86bebf9149229e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/infer.rs:428-433 | crates/ty_python_semantic/src/types/infer.rs:776-781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/infer.rs:428\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/ty_python_semantic/src/types/infer.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f853b41800290212bd285ec6cf9b66f7d595f71c718d09b5fc3789cf6e5f25f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2240-2245 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2252-2257 | crates/ty_python_semantic/src/types/infer/builder/type_expression.rs:2285-2290 \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/ty_python_semantic/src/types/infer/builder/type_expression.rs:2240\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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc8485411c0eb24822b88eb412033a84d01dea72295a0e7347d750bdd923797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff_linter/src/rules/pydocstyle/rules/sections.rs:1260-1264 | crates/ruff_linter/src/rules/pyupgrade/rules/unnecessary_builtin_import.rs:54-58 \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/ruff_linter/src/rules/pydocstyle/rules/sections.rs:1260\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/ruff_linter/src/rules/pydocstyle/rules/sections.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"383c89dae38dd94bc99a300b9442fa3e17cba507bb96ea60afa8fcfe2ae30d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruff_linter/src/checkers/ast/mod.rs:2035-2040 | crates/ruff_linter/src/checkers/ast/mod.rs:2080-2085 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ruff_linter/src/checkers/ast/mod.rs:2035\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/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3302c801a6082b1043e490e845a3ddf04fe80e947a67d28b50822807dfa1f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruff_linter/src/rules/flake8_pyi/rules/ellipsis_in_non_empty_class_body.rs:65-69 | crates/ruff_linter/src/rules/pylint/rules/useless_return.rs:118-122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_pyi/rules/ellipsis_in_non_empty_class_body.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12b89f5539b8921d99c3d714a338491a270abf4efb8f05788dfb206c67cf90d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_project/src/metadata/value.rs:78-82 | crates/ty_server/src/session/options.rs:267-271 \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/ty_project/src/metadata/value.rs:78\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/ty_project/src/metadata/value.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dc5cceea3b7c4a57c3b2e0c9df5f39c5dca5ff0f7da16210313783151460b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types.rs:8706-8710 | crates/ty_python_semantic/src/types.rs:8742-8746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types.rs:8706\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/ty_python_semantic/src/types.rs"},"region":{"startLine":8706}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3edba7bc2c9e411f71d2ea643a4b260a0d2967f9679cd8fbeb0ca0d3339b43e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/ty_python_semantic/src/types/call/bind.rs:2252-2256 | crates/ty_python_semantic/src/types/call/bind.rs:2270-2274 | crates/ty_python_semantic/src/types/call/bind.rs:2300-2304 | crates/ty_python_semantic/src/types/call/bind.rs:2321-2325 | crates/ty_python_semantic/src/types/call/bind.rs:2341-2345 \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 \u0060crates/ty_python_semantic/src/types/call/bind.rs:2252\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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c144d8ea5f0fe6f31ba3462d825f629400005da818071869117f4363a14fd3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints.rs:1470-1474 | crates/ty_python_semantic/src/types/constraints/owned.rs:104-108 \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/ty_python_semantic/src/types/constraints.rs:1470\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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aea76afe466da60217bebd4991da49aad943e043eb0464ef85e0c8f2473a537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ty_python_semantic/src/types/constraints/paths.rs:630-635 | crates/ty_python_semantic/src/types/constraints/paths.rs:649-654 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/ty_python_semantic/src/types/constraints/paths.rs:630\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/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"5703521f5fb6b76a08d08290950dc22f3cdee844bc18c2c1583775ad199e12d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs:1075-1079 | crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs:1091-1095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs:1075\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/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"937aa71e1fe5281444a9732a98c517bc5943b3acad77a6a5dd0c18fc189921b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruff_linter/src/rules/ruff/rules/test_rules.rs:120-127 | crates/ruff_linter/src/rules/ruff/rules/test_rules.rs:159-169 | crates/ruff_linter/src/rules/ruff/rules/test_rules.rs:201-214 \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/ruff_linter/src/rules/ruff/rules/test_rules.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79a4b1fd1a63810aac92eed51ca057ca515630c37a18deb2d7aabc542d605b7"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project mdtest: mdtest has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"99ce9311739f79b4382ba47d58bc11577d5cb1c96a158e9336b7a28eee919906"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project ruff: ruff has instability 0.90 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e375cf17f3d5390ce9fe80e611ed627398b3f02fb2109d18d8dd20bf5d0bd414"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project ruff_server: ruff_server has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"012e47580ced27db8def8633c82834b2a8eaffc4a46aff9ecfb21748077dd86d"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project ty_server: ty_server has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"061904b668673285406214da5fc3b4a7f22af8f38d914e93be484dd56156ef20"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruff_memory_usage: ruff_memory_usage: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0f9c61309806eba1dbedc70c455d5ba5d595ebfedf75ccaf0765fc71858bc6c6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruff_annotate_snippets: ruff_annotate_snippets: abstractness 0.03, instability 0.00, distance 0.97 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"78da2900a9e4021dd46ed866501e78cf815863fd1ac925aec4e91018cb50f99a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruff_diagnostics: ruff_diagnostics: abstractness 0.00, instability 0.08, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 12 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6b06f9371d5a2264dfc887be7ea61e591d69b621354d177093177bf17992787b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ty_static: ty_static: abstractness 0.00, instability 0.13, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"71c19c9b451f108b3836fe3ca2a95473bb56ca6f6d5c735053f60bcbbc0727d6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruff_source_file: ruff_source_file: abstractness 0.14, instability 0.04, distance 0.81 \u2014 zone of pain \u2014 concrete and depended on by 22 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"526ed177e139e71dacb3a2de55760d04cf2c077c1b81e320b79db2b4efe85be2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruff_python_ast: ruff_python_ast: abstractness 0.05, instability 0.15, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 29 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7bf88585902000433fccf9943442cb688362d85370dc6b61a567ed3182a91f6a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruff_ranged_value: ruff_ranged_value: abstractness 0.00, instability 0.21, distance 0.79 \u2014 zone of pain \u2014 concrete and depended on by 11 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"33091932cbf4ef330850ba5e3b58141e8061bbf3df33d74c1c9b45efc03c0ccf"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruff_python_trivia: ruff_python_trivia: abstractness 0.11, instability 0.11, distance 0.78 \u2014 zone of pain \u2014 concrete and depended on by 16 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9750561722673465dd3a50a2f8ddd68c4884f52a8ceb4f7862c097ab60ee7c87"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruff_python_parser: ruff_python_parser: abstractness 0.04, instability 0.21, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"771a4b5299d9ffe66823dac244bdc06220223626b0e654b6af6d5e4b5ab4f3a6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruff_options_metadata: ruff_options_metadata: abstractness 0.29, instability 0.00, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"be46eef3790a55fe2408a74d06138c373cff1745d523b6339aab67003325d3b5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UnionType (LCOM4 11): UnionType\u0027s methods fall into 11 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 11 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/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ec3f594bee61662fef127a11f52fd4d0164da72013e24bbde259e4cc6bec1f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Project (LCOM4 8): Project\u0027s methods fall into 8 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 8 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/ty_project/src/lib.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56c84be247b5bc47ad417dfca0997d77e9a34774fcfd0abffd9df5e0fbeb1fd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Specialization (LCOM4 8): Specialization\u0027s methods fall into 8 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 8 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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be3f07761588b64024e5e32fa7217b423874f5a94d467b69dadd87bce28e58a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ProtocolInterface (LCOM4 8): ProtocolInterface\u0027s methods fall into 8 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 8 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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff80c8fdb4ebd68fa8b85c73c5a91cb7e37981cf2e2039b041d0f481976f2c3c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IntersectionType (LCOM4 7): IntersectionType\u0027s methods fall into 7 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 7 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/ty_python_semantic/src/types/set_theoretic.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"402a2364fbf03d9d78418ac6cafc033fa32fdf670810fe9d4df0512544f8afb8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TypeVarConstraints (LCOM4 7): TypeVarConstraints\u0027s methods fall into 7 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 7 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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7117055329dcd0a761b7ab02e7da8a442cd03ff353410f2c4c6be69dbff1d22"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PropertyInstanceType (LCOM4 7): PropertyInstanceType\u0027s methods fall into 7 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 7 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/ty_python_semantic/src/types.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7c7620717bab62fc7e12e375720a2cf957796b1a8fa6479e706168d09ce3de"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: File (LCOM4 6): File\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_db/src/files.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7024a874604727556951cccd5f48016aca83651c3fd0a12a7c645ed660b48f3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OsSystem (LCOM4 6): OsSystem\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_db/src/system/os.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"20288a493a1477ed8dac33447cb46638d4aa1a498d454c3f932560ac1ca29b07"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ProjectDatabase (LCOM4 5): ProjectDatabase\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/ty_project/src/db.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f07f6af08e880aac7cae08d0a1f90998944ccd83241b583894a252faa8a7e4b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StaticClassLiteral (LCOM4 5): StaticClassLiteral\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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bc44c4cefdd96d009e2be7f2a738c71ddd116a98d8abf1480888057648fc2d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GenericAlias (LCOM4 5): GenericAlias\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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af05ac84236ab73ef77351590bd3a6a35b0168b4e83eebbbc7fbb2455180943"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Rule (LCOM4 4): Rule\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":"crates/ruff_macros/src/map_codes.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c72e16396ad21041a09167c8a00ca8d39fa3b0e63b3e9581a0f5330a7a7cfc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CellOffsets (LCOM4 4): CellOffsets\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":"crates/ruff_notebook/src/cell.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"423a1fe25ac22ad89184de6d98b95c4c907529ce82312f25e27347907de23122"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Workspace (LCOM4 4): Workspace\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":"crates/ruff_wasm/src/lib.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36540b0c366e933301828dc819c995cb184c31fb7150c45482eadeb3d0e37ec"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DynamicClassLiteral (LCOM4 4): DynamicClassLiteral\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":"crates/ty_python_semantic/src/types/class/dynamic_literal.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfa118c38545bcc8ca244697c3818174edce3f07025e05f1c66a24e2a35bdcf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DynamicEnumLiteral (LCOM4 4): DynamicEnumLiteral\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":"crates/ty_python_semantic/src/types/class/enum_literal.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9203c826bb5b71522d80fb650fb97a073e45fd82bf6ca59b5cdf0cb37c7b732"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Support (LCOM4 4): Support\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":"crates/ty_python_semantic/src/types/constraints/support.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8999f35b9b482c60297f9a63cabfd39928fbf0c4a297099dd1bb434f3f4b352a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BoundMethodType (LCOM4 4): BoundMethodType\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":"crates/ty_python_semantic/src/types/method.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"334041327ced7d1c8106a0eb1754e12ef03ade8e6a60a28c086e27498a65861f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ProtocolClass (LCOM4 4): ProtocolClass\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":"crates/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cd03e3ce4c54a5d894b719a885ab1396ad83cf6bb22cc8aedb3c4e38448ee5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UnionTypeInstance (LCOM4 4): UnionTypeInstance\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":"crates/ty_python_semantic/src/types/union_type_instance.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4be5f64d815f9a8776820fd1a5b79f9c95d99bb10d7b404be3a0de19e7102c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/mdtest/src/lib.rs: 45.0% line coverage (204/453)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mdtest/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05da1920097014a11b49e70ae59748e6d3cc5531a0d8a08900c9ec9b7c8704a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/commands/add_noqa.rs: 0.0% line coverage (0/72)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/add_noqa.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f84e48e9495beafa4a41c8b8980af87f520cc6f3e329fd44b1917e226dc08ee"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/commands/analyze_graph.rs: 0.0% line coverage (0/176)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/analyze_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68834301fabb3352a667d1e377c07aa217c20d1fb2b9f636e6f246b24174235"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/commands/clean.rs: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/clean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93dee74d994c8418b7c47b762bd0e6b704a4f9868addcc1e8e8d715916053e6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/commands/completions/config.rs: 23.5% line coverage (20/85)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/completions/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f04be840ea5c4474a94c825cb1d2dd7a35f2b811dd1248330591fe3a4f6301"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/commands/format.rs: 37.3% line coverage (266/713)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5949ac7cc5dc3e22c689f234840b925c89cf95b3a46823448b16bb784919369"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/commands/format_stdin.rs: 49.4% line coverage (41/83)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/format_stdin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4316322c86f8ab9c8d947da81758bc89173c8e1fd1a838ecd026a22ede15bf8d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/commands/linter.rs: 0.0% line coverage (0/34)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/linter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02830342a67a18aa4f1face0f6d66cbc18efb3f83e56e4d75a64910c62aa3edf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/commands/server.rs: 0.0% line coverage (0/7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32453746c5f7c63e9f46db3862defe5f1edb8d07653362469dd58af8142f33d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/commands/show_settings.rs: 0.0% line coverage (0/22)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/show_settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2c283b664b7bb2c0742ca9e305769c1c69f2ce9b71ae541ec2c50d3b5db111"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/commands/version.rs: 0.0% line coverage (0/8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/version.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d959708faf907aee7e5cf2387b71996ac6794ec29f2f0d552b1d42985cfd32d7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/main.rs: 0.0% line coverage (0/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81eb86af003c9968055cdc789ba5c0b538b6723a1439ec88bad03878cf19fd05"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff/src/stdin.rs: 45.5% line coverage (5/11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/stdin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b93abc3bfff09033f644783ac502c21358db208e990ff118d2434d7dcda6a29"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_annotate_snippets/src/lib.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_annotate_snippets/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e576b1da7350a20965e5ae6d2be6ac127a8093cc8136d5ac581623d7ba38aa77"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_cache/src/globset.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_cache/src/globset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"625e8a910a8ae4b3f395879bca3b109bb994be948438a5cf2488b153f816160c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_command_line/src/lib.rs: 12.0% line coverage (3/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_command_line/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"857ba226c7e91601f15ddd8576571414c746d5456d4259660cfeb4bfae9874d3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_dev/src/format_dev.rs: 5.3% line coverage (26/488)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/format_dev.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e866ab9493d6f08b75ed6e24112df9a3530a2b0cb0be9b401379312f109b1e2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_dev/src/generate_default_rules.rs: 0.0% line coverage (0/47)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/generate_default_rules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf086d3035566bd27f917b25948caf5265e67d986d2fb9b03b3a6008bad8af5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_dev/src/generate_docs.rs: 27.7% line coverage (43/155)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/generate_docs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3117083c71874849406b5e91120033a9d58a108ccc6d670462bdb8aecc0c1932"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_dev/src/generate_options.rs: 0.0% line coverage (0/131)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/generate_options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03db6eb878c7a19111610af7bae3839af0a37582187a3e15ea3d4ad1bf9a84a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_dev/src/generate_rules_table.rs: 0.0% line coverage (0/141)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/generate_rules_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96892858591c20c32cafdf0e38898c2fac965bf7a8a25f579b5d0895c3028b4b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_dev/src/generate_ty_env_vars_reference.rs: 0.0% line coverage (0/64)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/generate_ty_env_vars_reference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8490af55198e241c0f15afe40bf623fe74859441c6fb027224048c216023aa"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_dev/src/main.rs: 0.0% line coverage (0/32)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1838ed9d7aed8125197e135ff3235cf2c4f161267f2e645485d269433929ba33"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_dev/src/print_ast.rs: 0.0% line coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/print_ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd24a3a5c20508dbb1728048a8391304c01c6066a225e0c7e3db0754e3d333f4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_dev/src/print_cst.rs: 0.0% line coverage (0/8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/print_cst.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"368657cbc5fd5f091f4b6c6a5eee0cff3f5536aea609c9611f89fe48d2b4e48b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_dev/src/print_tokens.rs: 0.0% line coverage (0/13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/print_tokens.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe1cbd746cfec4458833b67b60ee7c38d9cdf03785f57b8b20006eff6a7430d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_dev/src/round_trip.rs: 0.0% line coverage (0/8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_dev/src/round_trip.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f729448790ed6993093806d759162192bd4d5ac125e0f91499b1a62914536a06"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_formatter/src/diagnostics.rs: 5.9% line coverage (3/51)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_formatter/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e899be7d7db4d3b432c1a5401e1b936ea55b603329728352fbd8ab29a0f39a83"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_formatter/src/printer/printer_options/mod.rs: 32.1% line coverage (18/56)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_formatter/src/printer/printer_options/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e646357c15009223e0a0c377f78131f7bb0bb2bb91bccf0eea10771176fec6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_graph/src/collector.rs: 0.0% line coverage (0/95)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_graph/src/collector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"068f3b9d3adcece41d51f02937c2a740ac00567f5b9ab9b4ebd902c455bbc29d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_graph/src/db.rs: 0.0% line coverage (0/41)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_graph/src/db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e0a2a9e6b6235c77aa90c1b8a34f0ac33c1e137254ada32ba697b52e0d4f9b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_graph/src/lib.rs: 0.0% line coverage (0/67)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_graph/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cce86838b0ea6b957d834509fef0489ffa2792223e0ba572c1484c17d4b757"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_graph/src/resolver.rs: 0.0% line coverage (0/83)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_graph/src/resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f24c9ec45c787fc642ba89ca92d0a906e0f7d6ce65ead2ff020d7eadd763be"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_index/src/slice.rs: 46.5% line coverage (47/101)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_index/src/slice.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"679b5f524e7344d8abed3a960dd7f15a6fcc7bb9c06654675722f21aa89b6871"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/flake8_boolean_trap/settings.rs: 0.0% line coverage (0/4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_boolean_trap/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94c6ba8dcae6447594dd053b0ce43ef6586a6223efc2912342eb0e10572fadd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_symlink.rs: 29.0% line coverage (18/62)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_use_pathlib/rules/os_symlink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1d3852904d5ef6f574fc7fed54868ceb675b21f63c2be2d11f86fb889196e6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/pycodestyle/rules/errors.rs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pycodestyle/rules/errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e4624f17ed57a9734b29e79756c63b8a0f4299d45d3c795a4b94fbe1bce4f3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/pydoclint/settings.rs: 0.0% line coverage (0/4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydoclint/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3893119d1ad61ac39d21de1d4cd33c3a5043e6ee8d112f07116b4125daad798f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/pydocstyle/settings.rs: 47.0% line coverage (39/83)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pydocstyle/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"884380fd2a18f58e5b27ce9e5428edd2ef27b3dc26509581417e8540d5fb5716"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/pygrep_hooks/rules/deprecated_log_warn.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pygrep_hooks/rules/deprecated_log_warn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02aab994b6a6fa1dfe39ef1a9dc2c9355393098dc7c7dab7146706892cd9c27e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/pygrep_hooks/rules/no_eval.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pygrep_hooks/rules/no_eval.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c85e900909aed9350d0710e87e289b5788f2ea3527f36ab60372092d6bf2dd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/pylint/rules/and_or_ternary.rs: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/and_or_ternary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47060b9c818c362188e139adf0ea13e9ed8d8734d0907daa8ae1e7b062cc5b21"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/pylint/rules/repeated_isinstance_calls.rs: 0.0% line coverage (0/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pylint/rules/repeated_isinstance_calls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baae374ec613963bd2f83e6ba7300fb911fff23b2ac03af0913f616338b9671b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/pyupgrade/rules/unpacked_list_comprehension.rs: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/pyupgrade/rules/unpacked_list_comprehension.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f56403d177f0f13d1723f365620e9277f6bf181cf4474ecd0f6b7c6fc3b202"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/ruff/rules/static_key_dict_comprehension.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/static_key_dict_comprehension.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dfd0a49a9abe4866a9b672661f469c2603e739b723c53c260af150f3b273ee"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/ruff/rules/unsafe_markup_use.rs: 0.0% line coverage (0/4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/unsafe_markup_use.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe00746d77272dcd93e155846c29856876dbc831c76ce37e176d31f78207981b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/rules/tryceratops/rules/reraise_no_cause.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/tryceratops/rules/reraise_no_cause.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dca9d46596b67508f3488f7c4e91b9fc06e280327253f4e3445a4574dd2d948"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/settings/flags.rs: 21.4% line coverage (3/14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/settings/flags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09b622bd3e377c42a1b11cedc15e1fd80f215d569c39972aecaf00f425ae768"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_linter/src/upstream_categories.rs: 0.0% line coverage (0/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/upstream_categories.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac3de6955dbe53933c6a9ebcb231b1e4246f6cd2fa2b4a5fbd47b8d59b24513"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_python_ast/src/relocate.rs: 22.1% line coverage (25/113)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_ast/src/relocate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9286bf5f3cd3d01ca4f3d2bc0398240952b3279396cf9d7fe654b85a36150f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_python_codegen/src/lib.rs: 0.0% line coverage (0/7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_codegen/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0b1607a990dcbbc56c730dab2f2b349f432223c588074d41bcea45acd4c1c5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_python_formatter/src/cli.rs: 0.0% line coverage (0/48)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c946bc8df1aafe2450d7ac317fb55ff6ae88b19baab4569d2817fb148f8720"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_python_formatter/src/expression/expr_ipy_escape_command.rs: 0.0% line coverage (0/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/expression/expr_ipy_escape_command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8998595aa1c9e4f00517e37b440d97183f00ff86ca7a918c6953d138d436f9f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_python_formatter/src/main.rs: 0.0% line coverage (0/31)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"855e3124bf0f4eddf2ee09aba003c6c3b937c5944c1eef8439ff88371273c48e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_python_formatter/src/module/mod_expression.rs: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/module/mod_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b956e8f446a649cbeebb8d48e2f900b6024c827621c4109433426dfedb762d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_python_formatter/src/other/elif_else_clause.rs: 0.0% line coverage (0/11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/other/elif_else_clause.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb7dfab02f77b01c2aed7494522c25c405df938917bad1ecfe8a8d7c0ebf568"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_python_formatter/src/statement/stmt_ipy_escape_command.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_formatter/src/statement/stmt_ipy_escape_command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"651fd961c3dd99b91c2603f46edcd266f828454465b5899e9d6b0cfadcc2bf06"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_python_parser/src/lexer/keywords.rs: 4.6% line coverage (3/65)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/lexer/keywords.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6937f6d7e6f0b38dba564e2d52e634273735e2dc066a137a69ef89ddb94add"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/edit.rs: 46.9% line coverage (45/96)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/edit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74eb42ff22d3ebb1b2de368f64066609205286f115b44ffcc13d4a555944e961"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/format.rs: 28.0% line coverage (63/225)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"568a9f05b9c3d181fcc8ca6eef4a5fb6d4e392c67893329836c727089fee3e42"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/lib.rs: 13.0% line coverage (3/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1744b49c6422ce46708204e2e408117062ad774a2a3e789fdb252535027b7f9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/server/api/notifications/cancel.rs: 0.0% line coverage (0/7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/notifications/cancel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b088e6f66529aaf0a024aed18962a2cbdaa8030b67520a3c14667d0b223da896"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/server/api/notifications/did_change.rs: 0.0% line coverage (0/22)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/notifications/did_change.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dedadbcb6920ed389920b5d47939fbaaf2f33b770c7a6fe83ed65799a6a6a73"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/server/api/notifications/did_change_configuration.rs: 0.0% line coverage (0/7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/notifications/did_change_configuration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"580aa63e27482a913dbcb099da818b292d989ea9b7829aeb89cdefbab773d1e5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/server/api/notifications/did_change_watched_files.rs: 0.0% line coverage (0/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/notifications/did_change_watched_files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"971e57a62125c964680ccf45312ca3ef097451ce157d1b66fae7cce06043b654"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/server/api/notifications/did_change_workspace.rs: 0.0% line coverage (0/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/notifications/did_change_workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f24d8f10790aae3388705b157b0878585269a6d3a96e0d801820c4eeddacd9e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/server/api/notifications/did_close.rs: 0.0% line coverage (0/16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/notifications/did_close.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"291598bac9d98a0172a48f98960f8c64b310c14ceb052949934a06c0d5e61aab"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/server/api/notifications/did_close_notebook.rs: 0.0% line coverage (0/14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/notifications/did_close_notebook.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f408bcdf5c7644349e5a4f1db8dcfd778d82ea3543579a1c72e9ec3b3ede83"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/server/api/requests/execute_command.rs: 0.0% line coverage (0/137)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/server/api/requests/execute_command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"584ef216dcf90ce69ab7a9b65719f88780e20d6936a0143c8eb972204d436201"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_server/src/session/client.rs: 39.4% line coverage (50/127)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/session/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"715f9d42f215304086a293fb286dd5feaca70e89ee61668754699ce3778441b7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_text_size/src/schemars_impls.rs: 0.0% line coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_text_size/src/schemars_impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceef345bc96d1d0aacc50122842ba72c0d17aae1fddf8a5b639ee3e276b95c6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_unicode_names2/src/jamo.rs: 22.4% line coverage (26/116)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_unicode_names2/src/jamo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa9cc9c38a314fd317433dc3f510ce61c406deb56ebf975882dc2ee41f2f124"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_unicode_names2_generator/src/formatting.rs: 0.0% line coverage (0/33)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_unicode_names2_generator/src/formatting.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e236f40ce1769f18ec21adcc25e069d2d48591e7ed32f9a9b73875efc7f8a391"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_unicode_names2_generator/src/lib.rs: 0.0% line coverage (0/267)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_unicode_names2_generator/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e5f3c2d613e23820231928125cb03d14d0bc1f90fd5003707955afdcc497ce"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_unicode_names2_generator/src/phf.rs: 0.0% line coverage (0/79)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_unicode_names2_generator/src/phf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea55599b5207556653b486834dab8977a0f9fbc9c23e20df098305959a8822b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ruff_unicode_names2_generator/src/trie.rs: 0.0% line coverage (0/64)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_unicode_names2_generator/src/trie.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7169c115fe9fb73b058cb82350e792a95dfedb8fd019813ca442aa24c03e15ea"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty/src/args.rs: 21.2% line coverage (33/156)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f1339d5d4c4564c1b3cd7da11f20185493516dfca3973da6cd9ab28fc54ecd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty/src/lib.rs: 0.0% line coverage (0/564)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb81321b43009890862c843a7c5972309da36a585b3054573c09faf59ffbb9bd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty/src/logging.rs: 0.0% line coverage (0/145)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/logging.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fc5851147cff0eb035eeccde978a16e01d219fdb0c97519718003fe7091e5c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty/src/main.rs: 0.0% line coverage (0/17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc708994e07062b95f65007c3156c578e17c5d2d47ad700e0ebc25d55986bf23"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty/src/printer.rs: 0.0% line coverage (0/92)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/printer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1018eff89cf0a0617023beb9ef9a343509e76871e1041e4e692b39b9b0c1f3d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty/src/python_version.rs: 0.0% line coverage (0/27)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/python_version.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6909a3af9428fc69dd540653c06640a09e729c8bfea5281ff42a072de5a07980"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty/src/rule.rs: 0.0% line coverage (0/44)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/rule.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c5170c3e7c7d67ff91f15554599ed2c48ad5def7b63d680ed087c4605f10d7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty/src/server.rs: 0.0% line coverage (0/43)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1986cb655f8274c8544a01828f9fcde2ef4974712db7a70669ae4bbeac8e85a3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_completion_bench/src/main.rs: 0.0% line coverage (0/81)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_completion_bench/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"595427c27ed4c387e076cc27f78de65e8045b50946a07bf1aa2bf35973da01ec"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_completion_eval/src/main.rs: 0.0% line coverage (0/313)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_completion_eval/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b608cbb0cecd2333350c539ba7d4709550dee5a0786a81830dd9adaadb399b0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_project/src/baseline.rs: 44.0% line coverage (92/209)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_project/src/baseline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63f2781ef52a00a9df8b8a9c93970b0fa36f01f72e2d394672fe7b797d326fa"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_project/src/metadata/settings.rs: 49.1% line coverage (52/106)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_project/src/metadata/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d17352466127c4f3353d5b7d37de5bfb54ce5ef7f53f91d7509290845889c90"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_project/src/uv.rs: 36.4% line coverage (12/33)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_project/src/uv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82649fd30ca5c55ea12f9510664c16c6996ebbb7a000f1aa0f067202fcb5acf7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_project/src/uv/command.rs: 33.0% line coverage (33/100)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_project/src/uv/command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20954a3d4b743d80356588a8b26f4319f59bf5d152b449c0931c95cf2d63507"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_python_core/src/statement.rs: 40.0% line coverage (6/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3460b0ccd24e77137cd4996129b3c6914766842fb23aa7f894346b536ae96095"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_python_semantic/src/types/dedicated/django.rs: 7.7% line coverage (24/312)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/dedicated/django.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faab571d23310eec0714a5fd3adae656505222dffbcbbc6110d2a12327d968f0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_python_semantic/src/types/dedicated/pydantic.rs: 3.9% line coverage (41/1044)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/dedicated/pydantic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff0561b5ce7cd313e16b39bb0f4a15affe6e0044b935ad86be896aa2cf1ba09"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_python_semantic/src/types/property_tests/setup.rs: 0.0% line coverage (0/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/property_tests/setup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4eb7130fcecc94e2ef52d1a2c78819ffaab607902e9a4cf12462c6c40c45f10"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_python_semantic/src/types/property_tests/type_generation.rs: 15.0% line coverage (69/459)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/property_tests/type_generation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8841a944ca84b604ae030c177435b12442b79d5eee7968dbeda0e0347b9a3321"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_server/src/lib.rs: 0.0% line coverage (0/40)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6214ed2e04d5146a8f246b6377065477f36f1929ace1b573776b34b00f723580"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_server/src/server/api/notifications/did_close_notebook.rs: 0.0% line coverage (0/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api/notifications/did_close_notebook.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"900792bf81cd587d423deef845b720c92bb5500d254bee7ea1a89dcb153b4c84"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_server/src/server/api/requests/doc_highlights.rs: 0.0% line coverage (0/41)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api/requests/doc_highlights.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78e8ad27231f34dbdfcd40426102964d4cac6ffe56085d1d3179f047fef65b6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_server/src/server/api/requests/document_symbols.rs: 39.2% line coverage (31/79)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api/requests/document_symbols.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3281af47d1ba631ebdcb30a6612be364c3b1456221176148b228aa16a7fb62"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_server/src/server/api/requests/goto_declaration.rs: 0.0% line coverage (0/40)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api/requests/goto_declaration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab62374f287bcbe4e396dc085b6393c750103e7dce2b1e35cac161fda68f0f03"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_server/src/server/api/requests/goto_type_definition.rs: 0.0% line coverage (0/40)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api/requests/goto_type_definition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d6c56a520e304b093527bffedeaabb083dbe96667590b87b0fcf7c291c5f96"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_server/src/server/api/requests/references.rs: 0.0% line coverage (0/33)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api/requests/references.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7319dddbf724debeaa97fc1117dc7049b3780a1a4c5fdf797dd679ddd2ecc19a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_server/src/server/api/requests/selection_range.rs: 0.0% line coverage (0/42)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api/requests/selection_range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8d3b58e5264880baf3be6d448afc6fe6b5d720e62e1db8650748dbdf74d7d1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_server/src/server/api/requests/semantic_tokens_range.rs: 0.0% line coverage (0/34)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api/requests/semantic_tokens_range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ddb6157ed8b99adfb95a1ba7287f5da94b968b9d7f1f377ba299415060a1e6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_server/src/server/api/requests/workspace_symbols.rs: 0.0% line coverage (0/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/api/requests/workspace_symbols.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"650e4b30acef5a8a2ebb71f4675aa4a5a501a059fd7ad60929d32d72b6fadff3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_server/src/server/script_progress.rs: 34.5% line coverage (20/58)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_server/src/server/script_progress.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da1df6dc2e5b3890cfb4e1a68b864240455f4b8cd7e77b66368bb654f518907"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/ty_test/src/external_dependencies.rs: 0.0% line coverage (0/140)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_test/src/external_dependencies.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5e29d34110afc0fbc0fc474b57bcfc505c9d9594b60210f6b84356b381ddff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/call/bind.rs: crates/ty_python_semantic/src/types/call/bind.rs changed 90 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 254 in Bindings::evaluate_known_cases at line 1715. 4 of those changes were fix/bug commits, and the other 86 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/call/bind.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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"839c52a649dc8ff8e7aaaac0eaa17c5d0cd37b8a6e68ee8ca7ed923a4d0a04da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types.rs: crates/ty_python_semantic/src/types.rs changed 120 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 131 in Type::member_lookup_with_policy_and_receiver at line 6051. 10 of those changes were fix/bug commits, and the other 110 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":6051}}}],"partialFingerprints":{"codehealthFindingId/v1":"aceee51e741bdb112f56a0dc2706e0288e0f8036f96dc925789d68605eae12d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder.rs: crates/ty_python_semantic/src/types/infer/builder.rs changed 137 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in TypeInferenceBuilder::infer_call_expression_impl at line 9652. 6 of those changes were fix/bug commits, and the other 131 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder.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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":9652}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b936988e295fa4421e0bb2bc47d01aa6b0e2a8ebcc165cb3cc595d0a365f877"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/signatures.rs: crates/ty_python_semantic/src/types/signatures.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 236 in TypeRelationChecker::check_signature_pair_inner at line 3100. 3 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/signatures.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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3100}}}],"partialFingerprints":{"codehealthFindingId/v1":"707444bba62f72d6a0e39eab27916a812f9147bfad63f6a2f757ab3ceead713d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/relation.rs: crates/ty_python_semantic/src/types/relation.rs changed 61 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 192 in TypeRelationChecker::check_type_pair at line 2058. 8 of those changes were fix/bug commits, and the other 53 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/relation.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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00be5f2fa6218d262de6b53d8fe02b201f1a2b5eb5f1fe16feef46e75b9b779"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/generics.rs: crates/ty_python_semantic/src/types/generics.rs changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 122 in SpecializationBuilder::infer_map_inner at line 4147. 5 of those changes were fix/bug commits, and the other 67 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/generics.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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd389691e6c1f81b81e1e1b25b436afd9dc17b07db0393f4f84f2ba643948974"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_core/src/builder.rs: crates/ty_python_core/src/builder.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 172 in SemanticIndexBuilder::visit_stmt_impl at line 3896. 3 of those changes were fix/bug commits, and the other 30 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_core/src/builder.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/ty_python_core/src/builder.rs"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0ef8265bea017d1d4e50ebbc73416ab14fa717b018c23dbb62dad3798c22d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_linter/src/checkers/ast/analyze/expression.rs: crates/ruff_linter/src/checkers/ast/analyze/expression.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 431 in ruff_linter::checkers::ast::analyze::expression::expression at line 25. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_linter/src/checkers/ast/analyze/expression.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/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38ee4ff8238a48f4aa98ef0ddbc5a388f0a1451bcb27ff92482ce692047e183"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/type_expression.rs: crates/ty_python_semantic/src/types/infer/builder/type_expression.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in TypeInferenceBuilder::infer_parameterized_special_form_type_expression at line 2564. 3 of those changes were fix/bug commits, and the other 28 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/type_expression.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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43567484ac3f48a220aa97852845e9e83af29b130730011f4fb9cfcd9154ffb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/narrow.rs: crates/ty_python_semantic/src/types/narrow.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in NarrowingConstraintsBuilder::evaluate_expr_compare at line 4047. 4 of those changes were fix/bug commits, and the other 39 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/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":"crates/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":4047}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c9e1d2e686adaa0dd85316224c497d19b1c2b42550238dfdca5c1c990d010e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/class/static_literal.rs: crates/ty_python_semantic/src/types/class/static_literal.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in StaticClassLiteral::own_generated_member at line 1868. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/class/static_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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"126e596b4c0174206b9f986911d39f621fa639aeb0ed5b1636e84f47d1ffb2ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs: crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in TypeInferenceBuilder::report_redundant_condition at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.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/ty_python_semantic/src/types/infer/builder/suspicious_conditions/diagnostic.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"757b91125a2e1af2e6a0825822948a4cc902725df691eadf6ad82f3c979766c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs: crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 168 in ty_python_semantic::types::infer::builder::post_inference::static_class::check_static_class_definitions at line 144. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/post_inference/static_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":"crates/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"167ea3b92a9fcd609c0f4666fe25e373d8697ea4f3481b5d2a4b2879375b4d77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/overrides.rs: crates/ty_python_semantic/src/types/overrides.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in ty_python_semantic::types::overrides::check_class_declaration at line 729. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/overrides.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/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d2a5d40eaa440cf333f505ee94382ad7e3b711531b68be3aaa3df91ae6489b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/display.rs: crates/ty_python_semantic/src/types/display.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in DisplayRepresentation::fmt_detailed at line 1183. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac04987af52c8c01f75b24a6bae9c38a2e2958528a07ee6b807ca37a7b4645c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/function.rs: crates/ty_python_semantic/src/types/infer/builder/function.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in KnownFunction::check_call at line 1627. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/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":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"6311126fd18399836f7eae06380729b133c1cf9d6993f777356b5dec656926bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/subscript.rs: crates/ty_python_semantic/src/types/infer/builder/subscript.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in TypeInferenceBuilder::infer_explicit_callable_specialization_impl at line 627. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/subscript.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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc37948f3cc02b43b66381040c0254fcfdd2f5ee9f3d554908d4158bd118a6ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/set_theoretic/builder.rs: crates/ty_python_semantic/src/types/set_theoretic/builder.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in UnionBuilder::add_in_place_impl at line 812. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/set_theoretic/builder.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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f789cb21cedc643d7f0ddc53203babf8f1c5d1def33a3cd277b113a906bc3ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_linter/src/checkers/ast/mod.rs: crates/ruff_linter/src/checkers/ast/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in Checker::visit_expr at line 1781. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_linter/src/checkers/ast/mod.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/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b5bfc2761da2e03e60b6ddb722688f3eb5c2099bb3f2c99580edae932d414f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/diagnostic.rs: crates/ty_python_semantic/src/types/diagnostic.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ty_python_semantic::types::diagnostic::report_incompatible_method_override at line 5277. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/diagnostic.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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":5277}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c44b515a39d4195efa44b68816483a2d3e2617ad08aaafb8cac3d58789a37e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_ide/src/completion.rs: crates/ty_ide/src/completion.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in ImportStatement::detect at line 2698. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_ide/src/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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9352f579b7a7a939eb0f1fcc8fa3f2122a6df8b841dec023e367a2f6bfe778d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/constraints.rs: crates/ty_python_semantic/src/types/constraints.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in CandidateSolutions::compute_simple_bound_conjunction at line 3887. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/constraints.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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":3887}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cdd7567eb2b42777f141000d6666417564b847b81c3ec7e640213c5ad3be64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs: crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in TypeInferenceBuilder::infer_binary_expression_type_impl at line 470. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/binary_expressions.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/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4085fc7bcc683eb20e9933c854c712f6f2672b3d78ad6a28e027fd611e20299"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/callable.rs: crates/ty_python_semantic/src/types/callable.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Type::try_upcast_to_callable_impl 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/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":"crates/ty_python_semantic/src/types/callable.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f448162f168bf4354313d2eed733746287315090636f099fc15983516a7287d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/comparisons.rs: crates/ty_python_semantic/src/types/infer/comparisons.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in ty_python_semantic::types::infer::comparisons::infer_binary_type_comparison_inner at line 840. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/comparisons.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/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e3388ccec85d2bafe130096ee7604b953de47b1e445ed37ac73f73c0a2d188"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/class.rs: crates/ty_python_semantic/src/types/class.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ClassType::own_class_member at line 1916. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5caca9184c213d39187295019670a7952e1b793ee91d235f2bdea77dc4b87a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/typed_dict.rs: crates/ty_python_semantic/src/types/typed_dict.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in TypeRelationChecker::check_typeddict_pair at line 717. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/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":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"a143a9ffcda1835383bef5b901c26f5fa8329165dc5e1b7d4ab1c83b8de30401"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/instance.rs: crates/ty_python_semantic/src/types/instance.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in TypeRelationChecker::check_type_satisfies_protocol at line 822. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/instance.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/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"7087af9e50563e5c822e1b57ce658e12b68facfa7ed2f80993ecbe00e841a12a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty/src/lib.rs: crates/ty/src/lib.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in MainLoop::main_loop at line 364. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty/src/lib.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19caa0910f3a43a9cc5afdbaaf682e8eaa472712e59c53d3e8c0c2a989e21aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/protocol_class.rs: crates/ty_python_semantic/src/types/protocol_class.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TypeRelationChecker::check_protocol_member_read at line 2745. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/protocol_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":"crates/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dbf2ffa572e2b3f5438717b1ec229312fe74f333af136767fd74f5ad5d4ee3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/tuple.rs: crates/ty_python_semantic/src/types/tuple.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in TypeRelationChecker::check_variable_length_vs_tuple_spec at line 460. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/tuple.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/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"669e9e4d0f08da4ca55690816fa263e6593d77f65fb42480a98f20f89471c254"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/reachability.rs: crates/ty_python_semantic/src/reachability.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ty_python_semantic::reachability::analyze_single_pattern_predicate_kind at line 1736. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/reachability.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/ty_python_semantic/src/reachability.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"3072e2018b7efdd2eface0287136de6941b3238b3dafb326ee6867975f11708d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/equality.rs: crates/ty_python_semantic/src/types/equality.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in ty_python_semantic::types::equality::evaluate_structural_comparison at line 709. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/equality.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/ty_python_semantic/src/types/equality.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9743d6873e81d7b2fc7eb9c153617c77dab90ad7bbd92cab2a508c01ab756dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/bool.rs: crates/ty_python_semantic/src/types/bool.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in Type::try_bool_impl at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/bool.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/ty_python_semantic/src/types/bool.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"172f1051eef38834a1eaca5b737d9212043a359198bcd712f2ba7d666fe9537b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/typevar.rs: crates/ty_python_semantic/src/types/typevar.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in BoundTypeVarInstance::apply_type_mapping_impl at line 1378. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/typevar.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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"37038e9e10eb27a119cf2829682538c36e8c32e8a3a5215fd53d4733e507ae23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/function.rs: crates/ty_python_semantic/src/types/function.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in OverloadLiteral::raw_signature at line 614. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/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":"crates/ty_python_semantic/src/types/function.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31710b14ed9fb10b703dd74d48fd981cd7e7bf2e497ea494ff5b263e1b18f54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/subscript.rs: crates/ty_python_semantic/src/types/subscript.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in Type::subscript at line 647. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/subscript.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/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deed5dfe660ac70f1d8efb9cb0339051c2b175562fc40fffa09569aa8b58c47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/constraints/solutions.rs: crates/ty_python_semantic/src/types/constraints/solutions.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in SolutionWalker::validate_constrained at line 1142. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/constraints/solutions.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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4131119e9691babf29b08ede4c03d3725a347ae191bb36fc86dbe213cc886ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/bound_super.rs: crates/ty_python_semantic/src/types/bound_super.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in BoundSuperType::build at line 527. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/bound_super.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/ty_python_semantic/src/types/bound_super.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc81eaa83725f4b0421ad02992afffeb64529697f657631ecaf489d9ee7da70e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs: crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in AssignmentAttributeWriteEvaluator::evaluate at line 275. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/attribute_assignment.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/ty_python_semantic/src/types/infer/builder/attribute_assignment.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3094dea7377c5bfa0038f06917b458969462cc691a200d834ae6486994d24d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_project/src/db/changes.rs: crates/ty_project/src/db/changes.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in ProjectDatabase::apply_changes 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_project/src/db/changes.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/ty_project/src/db/changes.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a02b008fc10743dc1e49da838d162b693f17e85d20248fdfa130f656d05c78f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/dedicated/pydantic.rs: crates/ty_python_semantic/src/types/dedicated/pydantic.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in ty_python_semantic::types::dedicated::pydantic::lax_input_type_impl at line 1144. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/dedicated/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":"crates/ty_python_semantic/src/types/dedicated/pydantic.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b31c1bc52b317a3f6806db2ba0663b3a2ead723d4d6ec8653560a75797bfc92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/attribute_write.rs: crates/ty_python_semantic/src/types/attribute_write.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ty_python_semantic::types::attribute_write::attribute_write_requirement at line 344. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/attribute_write.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/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8f6ff1afa4d320e0ced37c1e0e9c19464d64cebbbf0e7937d9bf67246c4731"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/class.rs: crates/ty_python_semantic/src/types/infer/builder/class.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in TypeInferenceBuilder::infer_class_definition at line 104. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/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":"crates/ty_python_semantic/src/types/infer/builder/class.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7503c55b6afac7b8f927f19a0538ec0145e34092a44fff66ac890845275f4d8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs: crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in TypeInferenceBuilder::infer_typeddict_call_expression at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/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":"crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"764ee5c2142d09b8d6c41a9774c34996da45a4e9a24f6da663d24201c9e7d23c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/overrides/attributes.rs: crates/ty_python_semantic/src/types/overrides/attributes.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ty_python_semantic::types::overrides::attributes::attribute_violation at line 457. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/overrides/attributes.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/ty_python_semantic/src/types/overrides/attributes.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fe4f32579957fb11214537ea6ab0678e4a5881c20b9da24f7fba08cef8196d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/class/known.rs: crates/ty_python_semantic/src/types/class/known.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in KnownClass::canonical_module at line 1525. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/class/known.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/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"e074c6548837d0c5928811a43a04284eb00bda2bfdb0c87a1a3a4d29fb8a2ddd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/class_base.rs: crates/ty_python_semantic/src/types/class_base.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in ClassBase::try_from_type at line 145. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/class_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/ty_python_semantic/src/types/class_base.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a141816882141b292c1df968b49106c5846cd14c86491f7369b6f201f9c7a32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff/src/lib.rs: crates/ruff/src/lib.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in ruff::check at line 237. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/lib.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c681f50139a8dbf4105231f8145dbcf43e564ef437526e64c427088aac6b0f20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/list_members.rs: crates/ty_python_semantic/src/types/list_members.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in AllMembers::extend_with_type at line 176. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/list_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":"crates/ty_python_semantic/src/types/list_members.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68454b8a728919c96e000b4a32e69c546024a27d43edd668e431ca3762d75b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/place.rs: crates/ty_python_semantic/src/place.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ty_python_semantic::place::place_from_bindings_impl at line 1799. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/place.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/ty_python_semantic/src/place.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bee122aa8320ab600540ad24f806b658e46578334d0eae0bb9fb6fb45022986"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/known_instance.rs: crates/ty_python_semantic/src/types/known_instance.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ty_python_semantic::types::known_instance::walk_known_instance_type at line 308. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/known_instance.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/ty_python_semantic/src/types/known_instance.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a1ddb4faca3ae7474944b4273af083745f957bf33b9313a41098fa68983b8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/visitor.rs: crates/ty_python_semantic/src/types/visitor.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ty_python_semantic::types::visitor::dynamic_content_impl at line 505. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/visitor.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/ty_python_semantic/src/types/visitor.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"3051b9a99fa0178d524e4f555229839343c5d01cef9d376a56908b11e8c6d1b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/mod.rs: crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/mod.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in TypeInferenceBuilder::check_boolean_test at line 1013. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/suspicious_conditions/mod.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/ty_python_semantic/src/types/infer/builder/suspicious_conditions/mod.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1769d433cb96f8efa41e6e7d35fd8ae6a2569aedc332d399d849bbb0736464b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/iteration.rs: crates/ty_python_semantic/src/types/iteration.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Type::try_iterate_with_mode at line 240. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/iteration.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/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fa9f24ef1674090125c59fd56d788d45aa95361a1dd4856cdc562edfcfd26b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/annotation_expression.rs: crates/ty_python_semantic/src/types/infer/builder/annotation_expression.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in TypeInferenceBuilder::infer_annotation_expression_impl at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/annotation_expression.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/ty_python_semantic/src/types/infer/builder/annotation_expression.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ad606a0affb6e1c7b098f0b43fd6054311929870ecfc2a35caae9843a3593b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff/src/commands/format.rs: crates/ruff/src/commands/format.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ruff::commands::format::warn_incompatible_formatter_settings at line 1084. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff/src/commands/format.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/ruff/src/commands/format.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f24a011dc57b735806aff6d11ade7fbf75647d63c4f68d71dfde5fcacd8bb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/place_load.rs: crates/ty_python_semantic/src/place_load.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PlaceLoadResolutionProcedure::resolve_enclosing_scopes at line 636. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/place_load.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/ty_python_semantic/src/place_load.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"250b8d252ca3565f84d418ff0aaf5a57a51a47ca5982fdc59530467b2bb192b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/class/implicit_attributes.rs: crates/ty_python_semantic/src/types/class/implicit_attributes.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in StaticClassLiteral::implicit_attribute_impl at line 114. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/class/implicit_attributes.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/ty_python_semantic/src/types/class/implicit_attributes.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"190f6e89da929e78ac55b45d5c2a41c9d37bbb4b691550bf1b8acffd3b897285"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_test/src/lib.rs: crates/ty_test/src/lib.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in ty_test::run_test at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_test/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_test/src/lib.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0874476eed1aaf0ea099cb5210db6c4e5fcadbff470d81ee359114732c8eb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/mro.rs: crates/ty_python_semantic/src/types/mro.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Mro::ancestors_of_static_class at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/mro.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/ty_python_semantic/src/types/mro.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2a00f3f4f5fa239b583b553bb68481d7df921f9749457f135b1a7d214d7efe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/fixes.rs: crates/ty_python_semantic/src/fixes.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ty_python_semantic::fixes::fix_all at line 80. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/fixes.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/ty_python_semantic/src/fixes.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80a86393f9403f71f044bc3f1db1f93ebae9e7a336673ce1b3d40aea07de165"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/match_pattern.rs: crates/ty_python_semantic/src/types/match_pattern.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ty_python_semantic::types::match_pattern::definite_match_pattern_type_for_subject_impl at line 770. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/match_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":"crates/ty_python_semantic/src/types/match_pattern.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cb240e85070797960ad789cd1028ebfef39b1f6b3ba9d175b5b613d6ae6970"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_project/src/uv/metadata/dependencies.rs: crates/ty_project/src/uv/metadata/dependencies.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in UvMetadata::dependency_metadata at line 17. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_project/src/uv/metadata/dependencies.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/ty_project/src/uv/metadata/dependencies.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f3442064c767dc430d91fa840d4896956be58456c73109ecf28babf67be555"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_python_ast/src/comparable.rs: crates/ruff_python_ast/src/comparable.rs changed 2 times in last 90 days, max cyclomatic complexity 64 in ComparableExpr::eq 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_python_ast/src/comparable.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/ruff_python_ast/src/comparable.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"873e0144ca12ff452aff7c59e05343d75288b92c4d8ea5b262fecb9a6812acea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_python_ast/src/helpers.rs: crates/ruff_python_ast/src/helpers.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in ruff_python_ast::helpers::any_over_expr at line 257. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_python_ast/src/helpers.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/ruff_python_ast/src/helpers.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e438d13fcf871491c8ce5de71acb0fa006e27abab5114eec7941607329b4ee9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/abstract_methods.rs: crates/ty_python_semantic/src/types/abstract_methods.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in AbstractMethods::annotate_diagnostic at line 42. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/abstract_methods.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/ty_python_semantic/src/types/abstract_methods.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f53f188659b2ba89cc34760dba1d758a87d1c43d8958e9fd373aa037408696"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/infer/builder/imports.rs: crates/ty_python_semantic/src/types/infer/builder/imports.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TypeInferenceBuilder::infer_import_from_definition at line 470. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/infer/builder/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/ty_python_semantic/src/types/infer/builder/imports.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4748c1d8291bb2214f4ab07abdb3fa60a6f28a98ab91773bc27689a40f7fbf8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/relation_error.rs: crates/ty_python_semantic/src/types/relation_error.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in ErrorContext::render at line 251. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/relation_error.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/ty_python_semantic/src/types/relation_error.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d8449efbb939f887a1e3efdcd01d510be210666ed844dd6420800be59d8d5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_python_ast/src/visitor.rs: crates/ruff_python_ast/src/visitor.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in ruff_python_ast::visitor::walk_expr at line 362. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_python_ast/src/visitor.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/ruff_python_ast/src/visitor.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea4b203db7852b6c041bba100b86a85a428cfdb558c470ca706ef1bb3542de1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_linter/src/checkers/ast/analyze/deferred_scopes.rs: crates/ruff_linter/src/checkers/ast/analyze/deferred_scopes.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in ruff_linter::checkers::ast::analyze::deferred_scopes::deferred_scopes at line 12. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_linter/src/checkers/ast/analyze/deferred_scopes.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/ruff_linter/src/checkers/ast/analyze/deferred_scopes.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4181aa1764ccde5bee84971a66acb006c18544774b69122da57c1c3d988613"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_python_parser/src/parser/mod.rs: crates/ruff_python_parser/src/parser/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in RecoveryContextKind::is_list_element at line 1472. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_python_parser/src/parser/mod.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/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf821987b626ba9bc518726c85c76243fada4bcd0dd35d1273a61961389b137"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_ide/src/hover.rs: crates/ty_ide/src/hover.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ty_ide::hover::hover at line 21. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_ide/src/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":"crates/ty_ide/src/hover.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaea2c942e0ccaa964d294ee44e9a548d6bf64039714378059981ee3db610a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_python_parser/src/semantic_errors.rs: crates/ruff_python_parser/src/semantic_errors.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in SemanticSyntaxError::fmt at line 1384. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_python_parser/src/semantic_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":"crates/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8163d26d896abe763687255c3c5cc480c0695e9826272d3a6039f7b729c9d30c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_server/src/server/main_loop.rs: crates/ty_server/src/server/main_loop.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Server::main_loop at line 16. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_server/src/server/main_loop.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/ty_server/src/server/main_loop.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"554c444a05e383af08e558f2fcbd5bd04b239038507b8e018f449944bbbd3e92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: playground/ty/src/Playground.tsx: playground/ty/src/Playground.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Playground.Playground 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- playground/ty/src/Playground.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":"playground/ty/src/Playground.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f843d9c2c0e8575f15e4b3b01f0699c345bfb9513ebf3d04dbed569a6aea94b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs: crates/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ruff_linter::rules::pycodestyle::rules::literal_comparisons::literal_comparisons at line 207. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.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/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62c402f33604589ab0c1c7a071667e59c6386902a739a2ad31f6ddc6c4e7f61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/types/set_theoretic/generic_gradual_intersections.rs: crates/ty_python_semantic/src/types/set_theoretic/generic_gradual_intersections.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ty_python_semantic::types::set_theoretic::generic_gradual_intersections::base_top_intersection at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/types/set_theoretic/generic_gradual_intersections.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/ty_python_semantic/src/types/set_theoretic/generic_gradual_intersections.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c10eb0a04b1c2cafc49c964505dacc873a38c7dd0c7c5924bdfe3181b306d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_dev/src/generate_rules_table.rs: crates/ruff_dev/src/generate_rules_table.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ruff_dev::generate_rules_table::generate_table at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_dev/src/generate_rules_table.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/ruff_dev/src/generate_rules_table.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55f56f3a483d4a77849b0412fc8d70d9435cc24b4c26071b1198f77247a1aaa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs: crates/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ruff_linter::rules::flake8_type_checking::rules::typing_only_runtime_import::typing_only_runtime_import at line 355. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.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/ruff_linter/src/rules/flake8_type_checking/rules/typing_only_runtime_import.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab2c86a01108cf8ed043c691be5cbdb7c2448d5afcb5c3165a8820aa620157a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_project/src/walk.rs: crates/ty_project/src/walk.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ProjectFilesWalker::collect_vec at line 154. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_project/src/walk.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/ty_project/src/walk.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"083c96b85e2879d9a6a30dcc1e126367640b51cf3cf59a17c0092fe80d85274c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.rs: crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ruff_linter::rules::pyupgrade::rules::deprecated_mock_import::deprecated_mock_import at line 287. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.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/ruff_linter/src/rules/pyupgrade/rules/deprecated_mock_import.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"602077e1020d874cbb5e4ef9e70a39bbdaae834306f2dcab289c9f2592cf8c5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs: crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ruff_linter::rules::flake8_simplify::rules::if_else_block_instead_of_dict_get::if_else_block_instead_of_dict_get at line 86. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_dict_get.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ac548bc312e1ab7b600238fcd7a8b2f8ebd7d16c8f487aca36859833ea2bc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_linter/src/rules/pylint/rules/if_stmt_min_max.rs: crates/ruff_linter/src/rules/pylint/rules/if_stmt_min_max.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ruff_linter::rules::pylint::rules::if_stmt_min_max::if_stmt_min_max at line 86. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_linter/src/rules/pylint/rules/if_stmt_min_max.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/ruff_linter/src/rules/pylint/rules/if_stmt_min_max.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34475721f45c10a8f236c08223fc4343d330f8242ef98e38504b53ef5c308ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_server/src/lint.rs: crates/ruff_server/src/lint.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ruff_server::lint::to_lsp_diagnostic at line 371. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_server/src/lint.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/ruff_server/src/lint.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"212811c0c75011e9592e129439f78826ab41c3232f8e018170206b5c3178d803"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_db/src/diagnostic/render/concise.rs: crates/ruff_db/src/diagnostic/render/concise.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ConciseRenderer::render at line 20. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_db/src/diagnostic/render/concise.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/ruff_db/src/diagnostic/render/concise.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"900fdb79f7e7034801e213158850f7f055371a3676e430ae1c3208f522cef868"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ty_python_semantic/src/suppression/unused.rs: crates/ty_python_semantic/src/suppression/unused.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ty_python_semantic::suppression::unused::check_unused_suppressions at line 20. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ty_python_semantic/src/suppression/unused.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/ty_python_semantic/src/suppression/unused.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f737d3a5e5f5d69b5d259ca8303ea7164cc0d6fd6279da216ab41af9c9f279"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_python_literal/src/escape.rs: crates/ruff_python_literal/src/escape.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in UnicodeEscape::display_escapes at line 243. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_python_literal/src/escape.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/ruff_python_literal/src/escape.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a5e6b1243033601c254d7592fb02424895ce69b9fdfc1f72082723c9622a9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_linter/src/fix/codemods.rs: crates/ruff_linter/src/fix/codemods.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ruff_linter::fix::codemods::remove_imports at line 42. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_linter/src/fix/codemods.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/ruff_linter/src/fix/codemods.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee0c68becf3ceb336e04eb71b9166b79c6d370da3f24eb0da02b2337361ef73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruff_db/src/diagnostic/render/github.rs: crates/ruff_db/src/diagnostic/render/github.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in GithubRenderer::render at line 22. Frequent change and high complexity in one file compound: schedule 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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_db/src/diagnostic/render/github.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/ruff_db/src/diagnostic/render/github.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb8f064fe3b3caa2a4c8102d9b4077b0ef486bcce3ad73eec1948f0c3d8f634"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruff_linter/src/rules/pyupgrade/rules/pep695/non_pep695_type_alias.rs: crates/ruff_linter/src/rules/pyupgrade/rules/pep695/non_pep695_type_alias.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is ruff_linter::rules::pyupgrade::rules::pep695::non_pep695_type_alias::non_pep695_type_alias_type at line 129), 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: \u201C[\u0060pyupgrade\u0060] Remove mentions of variance related to fix safety (\u0060UP040\u0060, \u0060UP047\u0060) (#29592)\u201D; \u201C[\u0060pyupgrade\u0060] Preserve grouping in multiline \u0060UP040\u0060 fixes (#28164)\u201D; \u201C[\u0060pyupgrade\u0060] Make the fix for \u0060UP040\u0060 always unsafe (#28526)\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 22:46:48 \u002B00:00\u0027 --until=\u00272026-11-13 22:46:48 \u002B00:00\u0027 --full-history --no-merges -- crates/ruff_linter/src/rules/pyupgrade/rules/pep695/non_pep695_type_alias.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/ruff_linter/src/rules/pyupgrade/rules/pep695/non_pep695_type_alias.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f21b4324b5d15604c421b0600877f28cc058c87496741c9fc86427799b76ba"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 20 significant file(s) lose their only recent owner: crates/ty_python_semantic/src/importer.rs, crates/ty_python_semantic/src/types/definition_resolution.rs, crates/ty_python_semantic/src/types/infer/builder/post_inference/function.rs, crates/ty_python_semantic/src/types/class/implicit_attributes.rs, crates/ty_python_semantic/src/types/infer/builder/post_inference/overloaded_function.rs, crates/ty_python_semantic/src/types/infer/builder/post_inference/typed_dict.rs, crates/ty_python_semantic/src/types/abstract_methods.rs, crates/ruff_python_index/src/indexer.rs (\u002B12 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"37bc62fd79247d4576a104d44e2fbdc0a90e0a09b166a3a8fb993c81f33e58b3"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 14 significant file(s) lose their only recent owner: crates/ty_ide/src/docstring/document/google.rs, crates/ty_ide/src/docstring/document/numpy.rs, crates/ty_ide/src/docstring/document/rst.rs, crates/ty_ide/src/docstring/markdown/structured.rs, crates/ty_ide/src/docstring/markdown/general/inline.rs, crates/ty_ide/src/docstring/document/syntax.rs, crates/ty_ide/src/docstring/markdown/structured/rst.rs, crates/ty_ide/src/docstring/document/preformatted.rs (\u002B6 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"07082c5df4c28fca7b3f02e47b03bd2b64850895b6fa3b9396fd6f8142f45109"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 11 significant file(s) lose their only recent owner: crates/ty_project/src/script.rs, crates/ty_server/src/session/file_watcher.rs, crates/ty_project/src/glob/portable.rs, crates/ty_project/src/glob/exclude.rs, crates/ty_project/src/watch.rs, crates/ty_server/src/server/script_progress.rs, crates/ruff_python_trivia/src/name_matcher.rs, crates/ruff_python_parser/src/parser/scratch_buffer.rs (\u002B3 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2e3ed49f02c1c8c833e8c28aef638a8c1c7b8e457ce45811ef681268b5665e29"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 10 significant file(s) lose their only recent owner: crates/ruff_unicode_names2/src/lib.rs, crates/ruff_db/src/diagnostic/render/rdjson.rs, crates/ruff_linter/src/rules/ruff/rules/access_annotations_from_class_dict.rs, crates/ruff_linter/src/rules/ruff/rules/noqa_comments.rs, crates/ruff_unicode_names2_generator/src/phf.rs, crates/ruff_linter/src/rules/pyupgrade/rules/replace_str_enum.rs, crates/ruff_linter/src/rules/flake8_implicit_str_concat/rules/collection_literal.rs, crates/ruff_db/src/diagnostic/render/pylint.rs (\u002B2 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"747b207144770f43ac2c39f73d0b50220bd9267c02f1325c7df47bfae41f2fc7"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 3 significant file(s) lose their only recent owner: crates/ty_project/src/uv/metadata/dependencies.rs, crates/ty_ide/src/markup.rs, crates/ty_project/src/uv/metadata/string_interner.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"16bc0cc5698d24d3949a63160e83c8787dc88e8f72f0c2d82fb0d38606670191"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 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 (61 single-owned of 1433 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; 1433 of the 2875 production source files in this repository met that bar). They are anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/ruff_annotate_snippets/src/renderer/source_map.rs, crates/ruff_python_literal/src/cformat.rs, crates/ruff_db/src/system/walk_directory.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove the suppression comment when https://github.com/openlawlibrary/pygls/pull/635 has been released"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ty_benchmark/src/benchmark/lsp_client.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82c376fde5ff0d46a6d50f5ceb7effa7ae042a8749b051eab450d74a4bc8d48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove the suppression comment when https://github.com/openlawlibrary/pygls/pull/635 has been released"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ty_benchmark/src/benchmark/lsp_client.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdc1af7901a5f797bb29102807be44e502fb4df892bb53e568f162ef96152cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This is not a performant way to check the length but the whole \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/ruff-ecosystem/ruff_ecosystem/check.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa46ea718005c341cde7e5695f0b87b75f12446f64caee1a1a27cf5239fbd7e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zanieb): We take the \u0060max\u0060 here to avoid division by zero errors where \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/ruff-ecosystem/ruff_ecosystem/check.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96b7a013937a7cfa409e8010d4febd8992c5fd9ba0c76d43c66b1cf2c3e264f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove the need for the max() call 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":"python/ruff-ecosystem/ruff_ecosystem/check.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6d9b51273997b093a2a909af457021265867853b28ba384e2eb3e932301191"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zanieb): There has to be a cleaner way to express this 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":"python/ruff-ecosystem/ruff_ecosystem/check.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1c00be8a72e63926c9312c698acd93cbed06b7f0eb7619c38fbe2ae19b1b5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(brent) Remove this workaround when human-readable rule names are 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":"python/ruff-ecosystem/ruff_ecosystem/check.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c83439ea18faa2891584f8bd5dbd7493bcf37b90e927c423d589723f14132d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(brent) Remove this workaround when human-readable rule names are 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":"python/ruff-ecosystem/ruff_ecosystem/format.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"864b5f53b5e916ffc0c85101296adda17254613deedb4a4dd8e9cb9ac532d0ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(brent) Remove this workaround when human-readable rule names are 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":"python/ruff-ecosystem/ruff_ecosystem/format.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfc689c260ed729fec2693a66cf86c3567b0a96242039980606fdae0ba6162c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Support non-default \u0060--targets\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":"python/ruff-ecosystem/ruff_ecosystem/cli.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabc8b4b8182a6607675f8d72538d8f7f3a250f4d7d58c62902749e6f6fce367"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zanieb): Consider exporting this as JSON and loading from there instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/ruff-ecosystem/ruff_ecosystem/defaults.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b9ecfb7298f2210ea46407d7b3c817bf4c40d4b189c2d36769978475a85e67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Re-enable Sphinx once https://github.com/sphinx-doc/sphinx/issues/14364 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/ruff-ecosystem/ruff_ecosystem/defaults.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4f7ebd674b80e1f3549fc0a26d9feb1229e2f82e619853ef3730da281ea076"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zanieb): GitHub does not support coloring with \u003Cspan\u003E it seems like the 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":"python/ruff-ecosystem/ruff_ecosystem/markdown.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8647892b6b26409e36d933edb251ef089f575bc617bc9d6a7a0289d289774f8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(brent) Remove selector normalization when human-readable rule names are 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":"python/ruff-ecosystem/ruff_ecosystem/projects.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"065942ac48d0fc669556d5fd952b854053c47315a173579bd9d4c991dacefb63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(micha): It\u0027s unclear why this field is required for monaco but not VS Code. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/ty/src/Editor/Editor.tsx"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"539ac391a4089f5655f73fee531eaf8179bbad7ee97ec11c19c380bb40b7dedf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Provide a way to configure 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":"crates/ty_wasm/src/lib.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3d57e64da921191c5066abc9b9c7469836b2676726f74aa708bd22515d8278"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For now list_modules does not partake in desperate module resolution so \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_test/src/lib.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6293975c1c8c5303378f98d64821c537f20af3f7b7acda27760ea793288f075"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this with better shim support, e.g. pyenv \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_site_packages/src/lib.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d54175d81f1dff6a7d92dcdcfd0efbe7bd93a29ca35f946aef6c48ed70260ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it would be nice to include a \u0022we know the python name\u0022 fastpath like 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":"crates/ty_site_packages/src/lib.rs"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9d9923ab2fa7c09a346ec14220e814f2468a0069a44f9a0da9324a7ed90d53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This test currently only verifies a single capability. It should 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":"crates/ty_server/tests/e2e/initialize.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8c7d7f60cf8d1d3883053a533ef07b4d0e9ede216bfd2db128b3441dd9830b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should probably be configurable to test concurrency 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":"crates/ty_server/tests/e2e/main.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"43914bb2e6fab5c3eed9dc982dcbaf94722236cba45e0d1c41a43fdf44c3f91f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should probably be configurable to test concurrency 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":"crates/ruff_server/tests/e2e/main.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b06b4b2e39ebe8db993fdbe0e94f8ec997c869f900a00f6a7881340805e4b43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Revisit this check before routing a notification that can target closed documents through \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_server/src/server/api.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"74146e7e5b4aa06b0855c4d7a06eeebe435c504beff50f888a6c7205a41ce48e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Windows has QoS APIs, we should use them! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_server/src/server/schedule/thread/priority.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"05beac04de4e8787ad5eda9995f66f370fe9093a0096c7906babdadff3f817dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Windows has QoS APIs, we should use them! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_server/src/server/schedule/thread/priority.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba7402e285bc7fce0908ade313da1cb9ed6f72bb669505dcfb732237168c703"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Hash only the source snippets used by the rendered output. Hashing the entire \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_server/src/server/api/diagnostics.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b474fc9a3a6b773f29109383d4947d8e27dda5e5568dc63a2af8389ed3a970da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Preserve \u0060Final\u0060 when a later public assignment re-exports a private import, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/place.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a394c4afdd7e4fde9168aa5efafc94fa093c9461e615fd7842f6b6868df22ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We probably don\u0027t want to report \u0060AlwaysDefined\u0060 here. This requires a bit of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/place.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86937f48f28e64b3457567feb776a2b3b7478ab74ccbdfa1263587321bbd71d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (ticket: https://github.com/astral-sh/ruff/issues/14297) Our handling of boundness"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/place.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74fb63b93e53944eba06ca1633fd122208df0294d06e9835fd49e2692735104"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: actually analyze guard truthiness \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/reachability.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8a52be293e59c848bf9f89ddc568d267a7ba3ec5cae1d7fec3bf6949b94170"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1637): semantic tokens is making this crash even with"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/semantic_model.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"57139934e0277e3aba12d3cd49df8c82529946df3c274046d0ad79c2f058506d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Arguably this does not deserve to be a member lookup policy; instead, 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb21c7f1ecf522304f150dc3645d363ec52c703d87c4226a2645d84985f7e094"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: consider replacing this with \u0060Callable \u0026 Instance(MethodType)\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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8e31af0d3bdbb41a11ebd33b995c398d6a9d0d36a3b710160ae5f820baeea7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: consider replacing this with \u0060Callable \u0026 types.MethodWrapperType\u0060 type? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f50c26bb769fd5da626570ae5afd8db95a0a411f8dc530ef4cd73e303c0470"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Similar to above, this could eventually be replaced by a generic \u0060Callable\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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":2117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc45d655e33b100ad1fa37082bb853e888f44b2d6d55aaddcff21edd32344e5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this once synthesized protocols have a precise meta-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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":4555}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fd583a4e627998d3d3cb9d9d849d2ca0d4542238229c48c97eae6dad43ef29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we currently don\u0027t model the fact that class literals and subclass-of types have \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":5038}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e197c0121fd52791b68f41b347446439efc13450c5d7002b2bc907c20745289"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Discover data descriptors in intersections without decomposing 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":5529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d344545851f4511b9c68f4a5ce9f8fff920d63b17424de66caec5bbfd5dbaf87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Emit diagnostic for non-integers and negative integers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":6964}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb94968f2391ddde9c9d29dd65c58755371234d781d3455320138584e9d2a1b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: emit a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":7002}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72fd8080107a526b328fd4d2604a08f996671f0c241c957d35fe5ac07f1bd92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: emit a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d8b194d6fc6d93e28af4362945af377844d7fdd6f4b5e2fa079d41fb8290b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: emit a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec0a302bf4cafc75ac5e7a12a9c03fb60812bdc8543a09270558f3f3e32b279"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: emit a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b21dbed51340cdc5cfbe17a55ce52dc12b9b668c5c9de47dd0eeedbb1f168c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should probably also check the original return type of the function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":7301}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bc33339d4d5e74a0d410970cc1b138351d635c2467c46bc7f8c0662cbb086c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: some \u0060SpecialForm\u0060s are callable (e.g. TypedDicts) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":7656}}}],"partialFingerprints":{"codehealthFindingId/v1":"8462e4044163405842f3d4127b26802c0c7e4a83231820168ef4029c7142d885"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this should be called from \u0060constructor_bindings\u0060 for better consistency \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":7723}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f2c96b0c5038c83e35b81570f0fc3320068157082151fbba5d6dbd24247c15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Some of these cases date back to when we didn\u0027t even support overloads yet; see 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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":7736}}}],"partialFingerprints":{"codehealthFindingId/v1":"36948dd9c9b6f24bb73af9a38e0d464d6222ce308c3710512c277a8d62f04506"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // call that for \u0060ClassLiteral\u0060 types, so we need a permissive fallback here. TODO Ideally \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":8176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbdba0a5f341465848cd7ac76940e98e0b413c64b6c75e2223efc1726860020"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // functional syntax for creating enum classes. TODO we should ideally check e.g. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":8198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2648e3b8fba9e0284476163772ab1d9d69d33205517565a0741bd54f290b9b07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally, we would first try to upcast \u0060self\u0060 to an instance of \u0060Generator\u0060 and *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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":8866}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee2a95d61cb1e5d30280f1fbf514d273b745caab5548c0cd32984ae9767777b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Emit an invalid-type-form diagnostic and recover to \u0060Unknown\u0060 for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":9412}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31920973165559889bd178d725135bb9022533f9650f28637f1071c772e64db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For some of these, we may need to try to find legacy typevars in inner types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":10731}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f40ff83c2ed314667911c63f04eddb86c2f34d471546c6537f6796598b8263"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle more complex types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":10876}}}],"partialFingerprints":{"codehealthFindingId/v1":"9045d2f4ce48c0b9b9c97477fa362ad9d39c80595dbf9fe51d4d224e508fa4b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle more complex types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":10903}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78b1266e861206e2ada2d6a6cca2ee2c9424dc7bfaa80d99abbf69f01fed0f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we might be able to remove this after fixing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":11278}}}],"partialFingerprints":{"codehealthFindingId/v1":"187568ea0f97323e55ce06a9b0e9e0621525428e16a80db6bd8bc0d1011dd565"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we are only showing one of the errors here; should we aggregate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":11341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ff3e604403400811b93f7fe9f42e1d3194308c23f9a8bd86ff1b99eaeb3497"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do we need to replace self? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":11462}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a36fb261256e6c005e216dd5b7eae92882bc9a72f542e0f3278c63e641ff98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Once we implement \u003Chttps://github.com/astral-sh/ty/issues/1711\u003E, this variant might"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":12000}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d929a501da8f2d0a165eac99e5c7f065a7109cfca707fde8437933f26f7b04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This variant should be removed once type variables are unified across nested generic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types.rs"},"region":{"startLine":12005}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d6c1966c78798c408264f38d6dee187a8c22cc8135742bb93fd12742bc8773"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: this is a bit of a hack. \u0060infer_type_expression\u0060 should really return a \u0060Result\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":"crates/ty_python_semantic/src/types.rs"},"region":{"startLine":12014}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c27faf3919ab72aafb89fbe74d2d6a7adfdccf3a8b27033af1450793fcd19dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle negative intersection elements. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/attribute_write.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d434ada3dbe6d68f85e6f305c6af81ca64d15d5c00a5e1fe16831ac2771cda6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: with regards to tuple types, we intend to emit a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/bool.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c892cbc15507c3b442b0e3388c2a68aab41d49b386868d0262546da43c3cdbd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should report a diagnostic similar to if return type of \u0060__bool__\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":"crates/ty_python_semantic/src/types/bool.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff063b38a41955b28b80ba3d41d519d85ad5276f1664d6b065a18a5a9918e646"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: errors during a \u0060__len__\u0060 call (if \u0060__len__\u0060 exists) should be reported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/bool.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"22158ba083ed1327920aa4449f576010527e2c2070392b3f6db4993ba45238ef"}},{"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":"crates/ty_python_semantic/src/types/bool.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"086e153308d91a96bce33560d46d79e09459ef7beab44d548010831615b9421f"}},{"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":"crates/ty_python_semantic/src/types/callable.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa217be7fa99822d893f2e3a801584b86d24059295ed0e2293981359993a2ba"}},{"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":"crates/ty_ide/src/inlay_hints.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"4149fcddbbafea8847c7ec49ee816d1030bbb058cbd2ecc42aff63bb3a1c9609"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It would be nice to create an annotation here for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/bool.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df8ac2d466bb3f2a0cc201e88026f50f9c00281ddb4d6c8f9252d3903e904d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Here we are hard-coding that __class_getitem__ is the only member defined 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":"crates/ty_python_semantic/src/types/bound_super.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d37904faa245de6624e500f497f8626bf3edfe7a37de3eef99a4a3dbaef7979"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if \u0060rhs_reflected\u0060 is possibly unbound, we should union the two possible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acf9b7f682a069152388eef3ee74b8ee7349c0b26ae54345f6f6ad28725794f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Preserve \u0060Self\u0060 while validating the receiver against each constraint. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/callable.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e23c270bd73f712c99c61660a487fb88ae2d6939ce52c0dae79fa39663f5509"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is unsound so in future we can consider an opt-in option to disable it. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/callable.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ede4f52448b26c017e2749b30105f0584e63a9d2b08ff963dc9fb9f44309a81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Should this be made private...? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f784e3749570ee317985d3aa4c4b448a5d72a454a5097fb17710080dbdca64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Should this be made private...? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fab8a9ce211429d7d46bb1c3eb9752c2f332940980c9a98a90480e0b32f935"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This mimics a lot of the logic in Type::try_call_from_constructor. Can 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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"87208c697589a5875e38993dc630a87f24da361dfd09702bc8e2b647c45427fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this intentionally diverges from step 1 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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":2388}}}],"partialFingerprints":{"codehealthFindingId/v1":"839bc0f1d0827f74c886312aa7ab744a23f7cf75c3229dfc97b491a80441561c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could raise a diagnostic here if there are conflicting 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":"crates/ty_python_semantic/src/types/class.rs"},"region":{"startLine":3211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f46a2b50bceab7211a9683f5d45b3c4e9ce597be50794d58ef2bd9796e3430"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Intersect \u0060instance\u0060 with \u0060type\u0060 once equivalent representations are unified: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":3501}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ee6ebe0350afa3fb9a80fe6f9821bd9248af58f6cefc6bc1ea22ae9ed77591"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO -- handle \u0060__mro_entries__\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":"crates/ty_python_semantic/src/types/class_base.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6cc555888130ca221a24c4d09a5924198e7f635c8cd927257f583008315a4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Classes inheriting from \u0060typing.Type\u0060 also have \u0060Generic\u0060 in their 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":"crates/ty_python_semantic/src/types/class_base.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8d40f677ff08a3e007dd71bd3f4d44ab151ca01b5d088e8a273f533b4047bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: We are considering creating a single builder in \u0060TypeInferenceBuilder\u0060 that would 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":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"839b66ca6262ba271689d880a42481a4338210952acff84d81db3b8e31a6fe77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: A future reduction can handle this remaining \u0060if_true == if_false\u0060 case by \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":2260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0d252bc3f97af119d1dfc3f34d3ea8b5d0a0fce1b54236cf402560ec686901"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Construct a common behavioral supertype where possible. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":4254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded0d134fe076beafd18443626a7a81cec2c95acb8b0f2f3bddcc8b268bdec88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: We _don\u0027t_ currently get a consistent result for each permutation. Right now, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":6402}}}],"partialFingerprints":{"codehealthFindingId/v1":"33df5a4419de01105fed323634599697fc0ecf45e2aa6da8cd821087e7c01dd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Many of the tests below should hold for _all_ constraint sets. They should really 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":"crates/ty_python_semantic/src/types/constraints.rs"},"region":{"startLine":6782}}}],"partialFingerprints":{"codehealthFindingId/v1":"430224f479580e36af92f65c71e9612d02d3df578ed450a1b026d301ab362a68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Don\u0027t emit the diagnostic 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":"crates/ty_python_semantic/src/types/context.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1852b87225687afc4377fbf299786a458127da2da6240478b47f1cdaffb7339"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make use of Protocols when we support it (the manager be assignable to \u0060contextlib.AbstractContextManager\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":"crates/ty_python_semantic/src/types/context_manager.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"db547105d2584eff1b054a240ee6f00b90c9915969a4e1ff8c23e6222bf126f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use the \u0060exit_ty\u0060 to determine if any raised exception is suppressed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/context_manager.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa184cbe40f70e48dded40a2706ae2e481e6479a7a3895c58bce9f60fe692988"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use more specific error messages for the different error cases. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/context_manager.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"480cbca4a28798c32424924651c81783ac6190a64e2c82a3c14dfc5cdac15567"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The current algorithm doesn\u0027t return definitions or bindings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/definition_resolution.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1ca137a514f6e5cad83aace067519a5b1ccbf404ebbfdb0b84841737b523a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally we would not emit diagnostics for \u0060TypedDict\u0060 literal 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":"crates/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":2485}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc18b10e25bfab4da430051b8f15183edce8bf49213715291156f3687e5d1a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally we would not emit diagnostics for \u0060TypedDict\u0060 literal 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":10649}}}],"partialFingerprints":{"codehealthFindingId/v1":"978e7390b05ad864f991d0110b38c5d582278023b12ac7a03be58c5eb2542b08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO the typing spec isn\u0027t really designed as user-facing documentation, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"7833c74598e0e4cd9dc74e975cd17154d4830055d0dc9fa600b4ea86fab574d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // See TODO in \u0060report_bad_argument_to_get_protocol_members\u0060 above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":3868}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6578524cdb18bffebeb5a6f7d5944d61b15bbdbfb705b5d0ef5388d197b66eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: determine what version they need to be on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":6229}}}],"partialFingerprints":{"codehealthFindingId/v1":"435581ef802876552e8b9c8d78421cb507317c8335ab31dc2588ef12875e0cc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also mention the platform we\u0027re assuming \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":6230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc61186985a6d54bc8ea473b69e42b8a9312b455d3249ef9ed7b0bea8461ce6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: determine what platform they need to be on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/diagnostic.rs"},"region":{"startLine":6231}}}],"partialFingerprints":{"codehealthFindingId/v1":"76eb2ac079bf748ba5f02fe2d8ac029b61c9540cad786bee3ea75f69611bfa9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: How to display overloads? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1cb26eff2f6440b1743a0f011fb7b3090f4bff22446fd12e3fd953bd4a299b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: How to display overloads? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"746b108a19a0a8feb3c77923293fc291c380179f457fa2852f8c07829883a443"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: How to display overloads? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"255b554d14a9b81690fa2af88c2889e315dbeb5135cef25a809f74e12090bc1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should ideally have a TypeDetail but we actually \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cddf5e1291791dda53ac082b415a54c96fd987c90f1a52a73727029112b98de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should ideally have a TypeDetail but we actually \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"511dd6b913bf619260fc9308e130e78a1015f1f980c5f9a42c97084809994269"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should ideally have a TypeDetail but we actually \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7df0e9f7bc25371127fe960b7aaeb62751752b280fca8227daf0be4b23a31f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove \u0060...\u0060, always display all the 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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"824beca48b006383267925368af5034d72ddb856dc9c41e08da9a1f46f9562b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove \u0060...\u0060, always display all the 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":"crates/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2923}}}],"partialFingerprints":{"codehealthFindingId/v1":"c627e97ebd20d5bbeae0736eaf1ffdd39f82e6a01d17f903416b8a238d5148f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support the list-variant of \u0060_ignore_\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":"crates/ty_python_semantic/src/types/enums.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a55dd9bab04e3d5fa302e1ccb5465af8ef1710c2eeb8bedf6ccce507d6d4025"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! - TODO: Some functions don\u0027t correspond to a function definition in the AST, and are instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/function.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ef2b62dc81c651ff157385bdfc6d61201cb7aed7a77a5b6db55ef58b9348fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: We should rename this function to \u0060signature\u0060 and use it almost everywhere where \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/function.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07f5b7a37f0b6194c42a52b5eb1538841424241fe2a7473ee20b48bc7b83bd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Infer return types for async functions and generator functions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/function.rs"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb90ca1dbe855a8a4db2f186222d66bbe5925e580883d23e8d795c468bd2978"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: specialization here is important for a case like \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/function.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e905cce141e7c2e3482c688c163034a6e5738b60f9888d1f432f9ce0f3ad73c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Handle nested specializations better, with actual parent links to the specialization of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d83ce5e4948fb184bbd386de4885a590f9de04e0756226375b47c6dc0b6427"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Resolve that issue so we can compare top/bottom 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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b29f5fe7304d51da27fed39beb4ba820903ea7d3285766d7ee343468c158ceb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Correct bottom materialization for gradual tuple arity, including required prefixes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e32a4c2a292fe028d63187bdbe517e51aea659e3c28778e70ff149e8a522433"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rank incompatible failures by their diagnostic usefulness, or report them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":2701}}}],"partialFingerprints":{"codehealthFindingId/v1":"719366ffd7a8b5091605dcb0c8cc11b0aab8bc8db7c12feaa5246edfada6cf03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Distinguish a ParamSpec binding lost to budget exhaustion from missing evidence. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":3049}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2457a6b96bea25e9be3454e0fb01a6ae20720e3286e74eb662a1775992ec424"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this shortcut once merging ParamSpec solution alternatives is 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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":3052}}}],"partialFingerprints":{"codehealthFindingId/v1":"91800ee44f5e479ed6341250c1a4e1bab6a624a28c68fc8ac81afec4eb9cc0b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move \u0060TypeVarTuple\u0060 handling to the new constraint solver. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":3088}}}],"partialFingerprints":{"codehealthFindingId/v1":"be391094db948f836ff8ac6fda84849e0a1dfa136e9a0aa5dcee64bcd6521345"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This projection / solve can be expensive for large-union collection-literal 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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":3098}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ff436dcc8456570d49e6907f472baad024fa699a1c5e22e8a08d21f342b9ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is a solution-level projection. A more principled version would live in 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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c403f47ef5e1c8f6a97ce58e7b15d3120657dae8b7d20c6cd2153e8b2761e6dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The spec says that when a ParamSpec is used multiple times in a 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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":3459}}}],"partialFingerprints":{"codehealthFindingId/v1":"008599108eca935ca7ebc8aff551d6354bfc6a992f31e67d702bd98ff451ebd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually, the builder will maintain a constraint set, instead of a hash-map of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4155}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bd6fab6e40938bb572c8cbc2a53671a8fbfcc5aecb8dda395f6fb17a4cfd8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Apply full polarity once TypeVarTuple inference is migrated. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4231}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa92fa72abefff3acd7bcd3faad900eccf93886fde9f3aba99064ea60e01130b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove these heuristics once the solver handles the remaining inference cases. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4308}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ab7915f7f3953122a21d0505a94958acde24e11c4dbcae3bfa6e6d5bef1430"}},{"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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4370}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed06f9524a42e3f610443af710adbf3a2eee58fe1817a7517619e007994e375"}},{"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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f142bffd5ffc1ea2c464fb27338484e219637413fd6f6c6853012d41832005"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this compatibility path once gradual materialization evidence \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4659}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7ac0d2f33433c286fc37d8b26dd5fa83e83b45afb8f5d89a43f41949a21e1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Failed inference can modify both \u0060self.types\u0060 and \u0060self.pending\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":"crates/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4672}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba355a990bff016a5a4d79a131ba6d9e5c8ed4e5f205440d791fcc543f3a1c30"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This will only handle protocol classes that explicit inherit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":4847}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac78dd98dd9dae3b7ea8d552c5bb6e6e1ffa7978e7bdbc59b6ad3435f074540"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add more forms that we can structurally induct into: type[C], callables \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":5046}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06f3181395b0d170c79627027472b6f7dad85312d8cddd3e80e833c7cb54e66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove the async check once return-type inference supports async functions, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6600e535349ee8b7bbdd9eaa6c28c6160b9ac32cb605acb579a01c0c7e6bdd1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Generalize this once call binding records the interpretation selected for each argument. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c713c0899416e8795b40f771d354b706142f72a0ac323fbec423d3d40cba2cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove the Python 3.13\u002B extension 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":"crates/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"72beac8b5551910d8944616e300b96558efd48cdf7b6afac7427f6e64571439b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: a protocol \u0060X\u0060 is disjoint from a protocol \u0060Y\u0060 if \u0060X\u0060 and \u0060Y\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":"crates/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6099f2d97e5f647dda170a00b395336da31fd479f5207c43bd5fdda7866c4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we can and should do better 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":"crates/ty_python_semantic/src/types/instance.rs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f40dc5df1be005fb26e8594c11b65438dd8926bcae41f7cff8a7badb3259ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider removing this special case, and instead hide the indexing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"249763982211e3ae74331c05ad517315324676217d1cda9746ed1918ed3c64c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: __anext__ is bound, but is not properly awaitable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cea7768b5e4736060027f3e1f12406b0b646927aed6ba93b0acf1d3510ee65d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: for all of these error variants, the \u0022explanation\u0022 for the diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/iteration.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1ac7bef07f69147989e19d97eff25c65e09ed299f5be205975a3586f9f9876"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For some of these, we may need to apply the type mapping to inner types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/known_instance.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf2624cda8a532ce9cce6e044089eac7f202bf68fe2b3c9394cde3010868c57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should not need to calculate inferred type second time. 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/ty_python_semantic/src/types/member.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"931019fcda1dbc3bbb338ffd32fd378c12692768b13a2e8b528653bea4f03cf7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider merging these synthesized signatures with the ones 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":"crates/ty_python_semantic/src/types/method.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61c37c1003d5cd46ad986b10da103b1e45d6f10e16321a2e0f3bfa07c1cc7d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Consider merging these synthesized signatures with the ones 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":"crates/ty_python_semantic/src/types/method.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"9782fdc542909d51185fa65e1880e79e5d77368a883d1bc8a85aba5ad5afe9a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This narrowing is not fully sound: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"c231db50515a795acecd3ca514d682b4dffdf1721ad14c8fd3fb3e74d0f572f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Restructure this helper to return the key-presence constraint and apply it 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/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":5300}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b86a2be8a8caf9822d4c07079a74e45db1ea89fe3ac97208b9680463d483b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Extend this to subtypes of \u0060Mapping[str, object]\u0060 whose membership and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/narrow.rs"},"region":{"startLine":5321}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a12804ad586e26e9010e241df2dd89475a858b5e1c7c9295cd88b7871cefe8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support dynamic class literals. If we allow dynamic classes to define attributes in 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/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"201dc586f3ee1a027b852ae685cecf941730098930320bc8896866d2964b23d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Include synthesized methods when checking inherited conflicts. For example, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ebcd5bf5504627b5d4637294e3aa28841865ddd43695938e578e88f230c9ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO ideally this would be a syntactic check that only matches on literal \u0060...\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":"crates/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34855d63ad2ece802d12f284a64534ad6aacc76a40a1616e505aa6926322427"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060@final\u0060 should be more like a type qualifier: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b52bd70f8992918215de419e6119ace872990a7d1f87dfa4165af8b87cd55a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Compare overloaded mixin methods within each overload\u0027s explicit 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":"crates/ty_python_semantic/src/types/overrides.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"286b2b2cceae9dbdf45b5f024dadb3a47bbe6c72cd12c27c85eb2ada0201ace3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Create a issue with some example failures to keep track of it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/property_tests.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b34da18733d315116c334d2679dd39b0d678c5eb7ad3c1b818077c714c1033d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Support recursive type aliases and descriptor writes with unrepresentable domains. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e75d2d7f8c9c2617425837bb18696c980d740cdb314f6b6f005946b44f7255"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Validate protocols with inherited members too. This single-base pattern skips \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"333d4c8f6673285c6b47723d0c5f00919010fd39b0d9de9322259c60c7384e08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Passing \u0060None\u0060 binds the method without a concrete receiver 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":"crates/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ebef45915675373c4e6a4198e97d2447468f805e10b7d2179f0969197cee1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check if using \u0060Unknown\u0060 here is correct \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"f265a0c910986b91e2b652ac741c69d20c4db15153669df2fc1b2c1b21af4f08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check if using \u0060Unknown\u0060 here is correct \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":3243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4426bc9f05925e5def620aa45e9ac9f22b387b6d1ace36115b3bbef87ec305"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check if using \u0060Unknown\u0060 here is correct \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":3249}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c7d7343b10cbf925088c8903bf11e02193c5a91de737ce8c7b7128250149e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Recursively-specialized structural types can encode context-free languages, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"187365fba0c7b1ffc23b5e8a2d377fbc248472d260b19ce751b3ff217af1b2db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: record the unification constraints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":2654}}}],"partialFingerprints":{"codehealthFindingId/v1":"937b933f3579b045067827cd890735f38d3e2ef4105a2523fb2ab0bf4949081b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: record the unification constraints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":2701}}}],"partialFingerprints":{"codehealthFindingId/v1":"802f5ac9bc977fd07b0f82744a5daab0627aab5563e6a36c45854438ef7e3d8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Infer specializations 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":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57062bc26108dd7ebdea2edd4b3dff0d8d57b52538466b464bb401dc6d8bafe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Infer specializations 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":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":3908}}}],"partialFingerprints":{"codehealthFindingId/v1":"8433f235e8f27a4c142f3af726349c5f1a83d80b3f501edc2c0e4740a3157314"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement subtyping using an equivalent \u0060Callable\u0060 type. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":3149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adcb388f480282e3b60674f0f2074171d126c476608cad58427c2f84e4ae86f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement disjointness for general callable type with other types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/relation.rs"},"region":{"startLine":4717}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0c286eb2555de555aee8ec303c7443939053a24d0317f6c3e35a167d65f98e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This might need updating once we support \u0060Concatenate\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":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c652d6fcc665c9e9dae035dbafee6d685a193bea794799d0fea26fe2e2b1e2c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: possibly need to replace self \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a150ff26289f9dfee8a7ee6d8c61395316893e66d2e923b56f196f8405df10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Binding a receiver through a variable-length unpacked tuple needs to account for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"077c8ca29aa9b21785342d4928bdeb2d221c959045c43cafd61b1c8facc3922d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Also intersect nested receiver type variables, such as the \u0060T\u0060 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":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"904e23f6ddbdb25fdd124fa7bbb3e2cbc9134bb84f3cfa094d90a140f5340f01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: References to \u0060Self\u0060 inside of bounds or defaults should not generally be permitted \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cd10f6dfd4797ff1f6499327c0526ab8881759202efd21596a31f82635b581"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Oof, maybe ParamSpec needs to live at CallableSignature, not 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":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed41f4964fa532f3194e5de7b90164b42044222cc352b56b5a7124ab0eff7ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Adding proper support for overloads with ParamSpec will likely require some \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb6854e960baf32e12e88ed132d16cc6825316e4564fd1dcd6dbcdc4ebc738a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Similar to how we do this for unions, we should collect error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bb94caf5ad498f0b8017199dbe5d42179b4beec9c4319fdf42d21abfd3ddca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Similar to how we do this for unions, we should collect error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9b36273131237ab1153d5b0e462479052cca31cd2940d59c0b4c40d5f37800"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Similar to how we do this for unions, we should collect error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8958bc3a9c846d4cf9bb42fe78a4ef0dd079bd9a41d32bbdb46573d9f14120d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally, the constraint solver should use the return type constraint \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e92a21e2cc1b3a6c376b58778d4707d8865aed4bfc34b5d78e29b173e96704"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this special case once \u0060ParamSpec\u0060 inference correctly handles captured \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":3092}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12b58b876cf45f7a88bf144a54136aebb883e24e6e07e59dafaf00338d90d66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Given how the current structure is laid out which needs to follow certain invariants \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5040}}}],"partialFingerprints":{"codehealthFindingId/v1":"3782dcc6e3ff87aa652c70c19b3b4feff4e50a6ffb2ab261f1be2b16876c2145"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use SmallVec here once invariance bug is fixed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5045}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b4520d9d3d5701ff343607446cc9dc0cdb559c1e5e086cb66d12cbce1a72d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently, we accept both positional-only and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8844f1a704a9c5636b3b8c641f4fdc98319a0c7296c544d2edd0c15c723e942"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make expansion an explicit operation for consumers that need it. 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":"crates/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5728}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a8033e5af503c8a321b39b13bce9ebf19fe49b18cdb310d258ddae69eae225"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This also expands unsolved packs, producing positional suffixes that call binding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":5855}}}],"partialFingerprints":{"codehealthFindingId/v1":"301af25a19847792ec52127a0d954b18bb6624f1a044291ce245bd0b25d061be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO actually implement support for calling them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/special_form.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8ae8b77b02e731e0a8c5374ea34a8618ca5e26e34893ae90b8787e160082e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is quite imprecise \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/subclass_of.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52ba5e4a1ee40b25ae90be819a74113520fb46424e9fd0d26d4990ac14a10d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Emit an invalid-type-form diagnostic for runtime subscripting of \u0060Unpack\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":"crates/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74cb82f412b921d5f26220c4b85f03730c38288732b461812a59cc3a2ea86e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: lots of classes are only subscriptable at runtime on Python 3.9\u002B, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b915f8a03b4a4602351c8b33818928b60fb419fae64bef7f4e1e3127cb291ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: specialize the generic class using these explicit 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":"crates/ty_python_semantic/src/types/subscript.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eee4d874562d0c85b838cf807c7ae3b1461ac8bd684b430d930f5efc93173f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Extend lazy inference for mixed gradual tuples: let gradual segments \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb83b3dccd436f3041f8369b8585aaab5cc5a3542c5db64134fc4765e1e8284"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: just grab this type from typeshed (it\u0027s a \u0060sys._ReleaseLevel\u0060 type alias there) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/tuple.rs"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefff8143cbe5ec21f636cee42bf304cf63f33efbb64ebfa22233ef94e218a80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Materialization of gradual TypedDicts needs more 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":"crates/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"e302be6c45fdc3351a2046d4e25fa49d0662280ca70d35330fa83a727d3751fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider validating the first positional argument too, without producing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/typed_dict.rs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"60211a7212931d5886c8b2f31dd755ddf885e31e271b930fa1edfcaa9fab2a92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Explore whether other type-variable visitors can safely inspect alias 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":"crates/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8258e88a4bdcfa44aff04ad863d35ffc1ad20ad68138094293b15ef43472aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should also check for non-forward references. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"26807d3a7a3c36c85c2022cc5a0629150da043e33376e3dbd5e6903848fcb45a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Choose the correct top type once we support TypeVarTuple in constraint sets \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"7448c18e2c125f57a697e7f22def0627169a33955dd81347ccf2215a12e9189c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Choose the correct top type once we support TypeVarTuple in constraint sets \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/typevar.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e753fde1864ead63b667064d75addd8be8171e9daa1083bdfc03f4d459229a8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060into_value\u0060 when control_flow_into_value is stable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/variance.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cf5e6cc0f6fbf48e15a370dcfc790ee5254ee6f229c9aa13ca2614a7887f70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This processing is specialized for \u0060AlwaysTruthy/AlwaysFalsy\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":"crates/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"87732555107db89a1ef4d94e3cab7a93dbf90fa8c240b4a32284172e77738c01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // leave out the recursive alias. TODO surface this error. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/set_theoretic/builder.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"189fcb53fa9ba417878c98f2d2c85ca692fb55f27dcf3b550ddc9bef46fae901"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: We should add some variants that exercise generic classes and specializations thereof. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/property_tests/type_generation.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb42045a71fc66f7087dc8a0a77499fcfb7ec41e4c2e1f88b17e89cc13ffbe9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Re-enable tuple types once they are fixed, and change the modulus back to 6. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/property_tests/type_generation.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b1c28535f4a8b7b007c26f881a61d44216505d1a2b2291f3bae1977697de65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Store projected constraint sets directly here instead of specialized receiver types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd36fb3c9c870836ee85f3e4a0e0b6c96e82a43a64f692eb23e136f35a2f2dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO point out the conflicting declarations in the diagnostic? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5eeb1caf458503d632b83da704e5c0153145c3dda5b16ed3d7bd4553abd8ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060infer_with_statement_definition\u0060 reports a diagnostic if \u0060ctx_manager_ty\u0060 isn\u0027t a context manager \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"9702a2d3d3ab5ee9aaed62e2027e97f6c2432d093b726fdb311f0dad5d1d39b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle valid handler expressions that are opaque to the structural helper \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffc6f9dc0aaf526704150cddfb1abf8069fb7186db9b098f399a4b23ebf1182"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this once we handle all possible assignment targets. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":3584}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3ffa7ca510cb50238b7cb85c7e84177014bee7ed57b620aecc32419d58bd22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060infer_for_statement_definition\u0060 reports a diagnostic if \u0060iter_ty\u0060 isn\u0027t iterable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":5466}}}],"partialFingerprints":{"codehealthFindingId/v1":"48beee28639174b6340d0fa52436fb9065c4a82a298b98a953c4752380edf5a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this special case once the new constraint solver can preserve \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":5884}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c55e68ae823a752f71d5d524dc6141f188f68cc1cc1d3c41bd970d92d9387b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could also attempt an inference without type context, but 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":6299}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caa4dfbb1fe4e8fa3405b7b8e292fd5fd30a63aff2ba454c89254ade751ff83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Re-infer splatted arguments with their type 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":6643}}}],"partialFingerprints":{"codehealthFindingId/v1":"369044336c664e35a67e9174c8454ad19240df871c6eb6ea6007eabcb16b5dc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The constraint-set assignability rules should already 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":7107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca82b013ceb89360947d06799f45e12d1f3ca784226104ac45ecf78e966c5cac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ignoring r/R prefixes for now, should normalize bytes 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":7422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace597e647b78baf59f703da2922b682f47cf075d0126a051eedc7b3727321c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle format specifiers by calling a 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":7467}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1ba106f0700b6057eba50b0365826b874bb587c24cf6711af3a668f79ea9a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is a simplification 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":7684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e32ec7766a4d9d5e5dbd440ddf818476f2d43248a330907530078d4a05b90df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060infer_comprehension_definition\u0060 reports a diagnostic if \u0060iter_ty\u0060 isn\u0027t iterable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":8974}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec061621b0aeaaed359a94c8c38bdef027fb3ac3ff9b6acac8cee423d1d25fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could perform multi-inference here if there are multiple \u0060Callable\u0060 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":9208}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce8d404c1fce102d1b5532fe6db64f3ddb4b86076f2262f9d446912fe348fea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could similarly perform multi-inference here if there are multiple overloads. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":9218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7511029220678090dbaca008578619ad6f0943fcdc10f7f63757f511d7f3b490"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Useful inference of a lambda\u0027s return type will require a different 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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":9326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b36cb76bc08399cedb95f8c103a21c33645c15db65e56b8d167208f519d25a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should not be needed once we use constraint sets to track the usages of each \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":9514}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa146f30ab176c46c1dbbe365d9e92677b6fff6be64157f5748274be0e19b8e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The argument types have already been inferred and stored in \u0060call_arguments\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":"crates/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":10300}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b6fd6227cdc5544cc69108bffcee08f5e79b1f1b7434f54e16f161ffc230b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The argument types have already been inferred and stored in \u0060call_arguments\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":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7b14ae87c50f100abfdeb5a9d8a6c7954640782a467444c3ad881173858824"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We expect to replace this with more general support once we migrate to the 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":11823}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73f1bada458456ea92cad3d8b95bb3f898b11f0664c91e9abf58396920a2ac3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We expect to replace this with more general support once we migrate to the 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/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"619345227d107e170462df14f6f224ad7ddbfbfd879bf67b823027f5c92d98d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support return type inference for async functions and generators \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":12630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab80970aa781716cd828f131ec6b215679a04ff0ad5d9f76d87982e9de7156ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// pyright. TODO: Other standard library classes may also be considered safe. Also, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":13754}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb3a966ca627ea5f48884f5b86794dcfc4deb4c2215e77b8f0b3e68f762a15a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should, whenever possible, pass the range of the left and right elements \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/comparisons.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3906f23b1f4c969f2fb317fe3e2c7bce18c87a506e5d9fadb564b96ec494b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could theoretically attempt to narrow to every element of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/type_context.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3b9fcf2525ccea6a9600c5f5c4719a53b049b648089d2d52e7b02747aaf563"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO diagnostic? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"674dd001bc043baec1d4ae8f8c79c6e3980cfb0b035358f355dbd8be9e1fa36d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is overly aggressive; if the operands\u0027 \u0060__or__\u0060 does not actually return 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/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b20f34e161c72a0c32671cdbed34d85da04bf1ab9cf83647ff6338f2ee3cd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When we support passing \u0060tcx\u0060 through generic method calls, we can remove 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":"crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0944c04eaffc32bb5fc57f8bdbc5eac7b84132ed7ae3961d9c3aeaf11cd1edec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We expect to replace this with more general support for handling constrained TypeVars \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/binary_expressions.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d52a6942a81f29e41e8b0586dbdbeb7cbba4eb16c8ded33ff46272fd91bc34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use the full assignment statement range for these diagnostics instead of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/final_attribute.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"609221a2fc08d21137a2ae22f99e03e9fa21352af95df698fc6aec8ca0915d0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060AsyncGeneratorType\u0060 and \u0060GeneratorType\u0060 are both generic classes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ab2be2512fa1f69df9b88e3c75887ca2406a6566fccd2cf89dd78b443b812d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If there are multiple applicable overloads, we could attempt multi-inference. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/function.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ec268548f00034d218109ade6aa4db47964e71bff216a3b7ad910b8ac74c4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider loading _both_ the attribute and any submodule and unioning them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/imports.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b222bff564f131196167efcc942660e00b7aa03bbc92f52c7fb529ec4b00ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Model \u0060kwds\u0060, especially \u0060{\u0022metaclass\u0022: Meta}\u0060. \u0060types.new_class()\u0060 uses 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":"crates/ty_python_semantic/src/types/infer/builder/new_class.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e843870e520c9235c12c057685410be2b82889788880f59e5f729c5cec7ac4"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK ALERT: If we are subscripting a generic class, short-circuit the rest of the \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":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"b424990c814a57f832b9c0608a5c1327ddb0b8dcecdede421a97092294c1822f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move this logic into a custom callable, and update \u0060find_name_in_mro\u0060 to return \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e401d6ff84ce18df9b45b681321078265a271b7dced3b11fcfcb5ed9507db7af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO consider just accepting the given specialization without checking \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"5827dbe159a184142485f67858de6d97c6a4f24f52ed5453f342cbcc7cb6247c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is wrong, the given specialization needs to be assignable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"69607e18faa29ea675de4a1aaaf8ef3fd34de5252e97f34b7862fb8d06539ee0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060Unpack\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":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"d342199caa269ea98ea5668d767e6e4a585272747c819d97d1ce47963347714c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add proper support for \u0060Concatenate\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":"crates/ty_python_semantic/src/types/infer/builder/subscript.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7ec909690a8e11ac2a5e486b9466de13c1a3980c845f8dd33390c12c47134f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: validate other keywords against \u0060__init_subclass__\u0060 methods of superclasses \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/type_call.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2412053db456936a4535fda0a1caa01f64689fe72cbd5d7cfffc0ac9f4a7f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When this case is implemented and the \u0060todo!\u0060 usage \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafacbed388070d2f12afb2774bfd4dc0f676ce9fdb3937e97a9b0c140e9db4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support the union of a \u0060TypeVarTuple\u0060\u0027s elements. Until then, reject \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":2600}}}],"partialFingerprints":{"codehealthFindingId/v1":"8403c661581cda1f32fda7e0f3c34da1035631f73e957f5ce9aa706e6576531e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: What type to store for the argument slice in \u0060Concatenate\u0060 because \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/type_expression.rs"},"region":{"startLine":3523}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c937292e63557d50013d27156f6b2c4499d20f91571dc3638540b58a78c8eb6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Remove this gate once ordinary generic call inference can safely handle 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":"crates/ty_python_semantic/src/types/infer/builder/typed_dict.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"43375c9bc9d363b6c4c710ab136f1a6822a6ec479220d6bce1c3b46adbe8f0b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle these cases in shared variance inference so both checks can account for them. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/post_inference/function.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfceda0037fc0af27f402119b1fb4f60f32de786b2759463d45b806bba941f4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Account for that coverage in shared variance inference before \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/post_inference/function.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf7bbb8e3628dcdd0ed21124b7fa36f384ac379401c4f79768d4eb39d0aeb10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Account for those relationships instead of just composing each occurrence\u0027s variance. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/post_inference/function.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9652f30a6d283ae4fea732d039f79182a7fb83f4750c59911198b070e334d9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this temporary non-generic restriction once overload implementation consistency \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/post_inference/overloaded_function.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"224028fccc0c74bf2f46abcca63900f8cfb9feba099921c52186163117584ab9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: validate that passed arguments here are annotation expressions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ee45117dbe966c40a735117fe82c9feeccc305ef2a153cfb4d6ac74800c02c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The fields should be displayed in a subdiagnostic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/infer/builder/post_inference/static_class.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"301be66fd05eb349c8a918900294c347b982c9e1807d9d57b3dfb33a8f3e3cef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if we ever report sub-ranges separately, the inner range could be Unconditional. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/ide_support/unreachable_code.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbeb0217fb0b75f3b07779123dc2819e4df6696fe9766e72614f6efd49820574"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The \u0060x = 1\u0060 binding is also unused, but we currently mark it used because it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/ide_support/unused_bindings.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0e2c8e3930cf02048b15681dc7e1b87738def36cab87536160f97b3081a2c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Deduplicate source-order constraints when constructing a \u0060ConstraintSet\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":"crates/ty_python_semantic/src/types/constraints/owned.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39686d5465c583e2247ce581cad6140f3a9ff612578720aefa3f765130a0d93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is very naive at the moment, partly for expediency, and partly because 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":"crates/ty_python_semantic/src/types/constraints/paths.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"161899b906e3a0830aae8565a41d9ab781fd006f1f6326d7af15327162010955"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should handle the most common cases. In the future, we could handle arbitrary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/constraints/sequents.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde23925a3f7e384a1d6c222875f1bab8ba0e40a7fe382e79554e968cdb3fa4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// We will check these solutions against the declared upper bounds (TODO and constraints) of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aeee73664579546fff48babb0fe5aa0d84149350d843861e185dd170130608c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#29027): Scoped quantifiers may allow this check to be expressed more directly by"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3e10735c634b16d6158bf1436145c758b26fefe79419b8d0e31f4149019718"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ParamSpecs can capture generic callables whose type variables need to be solved \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb053d6ab69b5516406ebabcd7e2968cfdcd9a913b9c295647595e35cb6d09c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// bound (TODO and constraints) of all relevant typevars. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd65607cad29c9127eb5493fe7ea47ab619752d1694d890423a90e8db183b063"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // solution satisfies all of the typevars\u0027 declared upper bounds (TODO and constraints). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ebeef61bedff6b5109f1583109e87b5b8bc255f7d83f4c9659b9abf8fa50fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(dcreager): I consider this a bug in the sequent map, which should be addressed in its \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9bdbd16ef1aa4b034adf2c8407b00817cf6adf2761800789a20936547b27de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Having already determined that a satisfiable path violates the declared upper bounds (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":"crates/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"6168833a5462e26ef40cb990b3e5aa580111076ccfa94f2b56ad36f289363b96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider calculating this at construction time, so that here we have a fixed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/constraints/solutions.rs"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e1fa22dc2e6ddbd4981abd34c039b3ba1d75a62e8d1fa04d5b275ee8349261"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Potential diagnostics resulting from the iterable are not reported. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/class/implicit_attributes.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b492eabd90d423e2a876838a30e58c5180a27b92ee0dfc9b3a1d9cdb1d41c31c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Potential diagnostics resulting from the iterable are not reported. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/class/implicit_attributes.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd74c84f10adcda6f2ebc295a11f98da6db15aff443c51aed5d41e0f29597e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Other keyword 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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc09452492a9a2c4672c8b172fabec1eab892c05b8fba0f3c5e5f87ef578bf25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we should also check for binding errors that would indicate the metaclass \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"717a088a079bdacb542a283741172f6bf15f8c2b069a818e26d0a99312a8bdb4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could be \u0060Self\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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5266339f957f6d869db2e7f1e1a20f9a64da110f15290cf4a22d98069298d5a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could be \u0060Self\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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"941b78d98a468f2f1b50bfac0ec18e5c9bbeaa0048d1a632d4834cff23b60d43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could be \u0060Self\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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b169188ab7d6c325ad5508cc883c4b7172621b79d77003f1943548013bae24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There are many things that are not yet implemented 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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":3151}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1fb03cca795494e19ef5c49e5b841fb35f428c1db924edc9272c243f59666e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // not considered here, since they don\u0027t use field types in their signatures. 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":"crates/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":3679}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c948b6682a1f7a6ae61397ed774313c1f739b653cfb3df442086d0874722b62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For types inferred multiple times with distinct type context, we currently 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":"crates/ty_python_semantic/src/types/call/arguments.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec3b1a3eacc703ad0369d676138f684858c83b41c08e3e38e25a20a00fa0d92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For types inferred multiple times with distinct type context, we currently 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4097}}}],"partialFingerprints":{"codehealthFindingId/v1":"48387189cacf5ed80baf78dda59ea80e9e43b6083087ca5ff4488c37c2b831f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This only recognizes overloads within the same callable binding, ignoring intersections \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef61957b62dfd2ea2952eab6896e1810e78a1496c7588a7d881f33ddcca86da6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: for generic converters, we currently use the 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b346381ad9891961714f09783b30b4ed3ddad324eb2aa807d8e5add0b18a068"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could emit a diagnostic here (if default is not set) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":2596}}}],"partialFingerprints":{"codehealthFindingId/v1":"b501c1b2a4f47412d59644ec94924df9aa70f6727143dba0a2d892181fd7cd7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Emit a diagnostic if a dataclass flag is not 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f1bcace0b482eea5f48a06f6e7e5beb8be21952ed34c26093e3a6a14f72a3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Preserve intersected parameter lists when synthesizing partial signatures. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":3845}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d556e75a73400bccc83b7d2cc58fc89d4fa22403fe3620f9b7cec8eff761cff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove \u0060Keywords\u0060 once \u0060**kwargs\u0060 support is added \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4093}}}],"partialFingerprints":{"codehealthFindingId/v1":"817fe28c33fb4299df7f1326aaa78b3ea4e0f6485301013f8ffed7e7c38d533f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For an unannotated \u0060self\u0060 / \u0060cls\u0060 parameter, the type should 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4424}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4b32373feda8e80af1fb6fe242c7aba69305f781c87409737a323770be3542"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should probably be adapted to handle more \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4862}}}],"partialFingerprints":{"codehealthFindingId/v1":"524fea2bc6aa6d66967104f0a44c1529dd457f48e09987efe18023f7b0e7b88c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check matched tuple elements even when required elements are missing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":5679}}}],"partialFingerprints":{"codehealthFindingId/v1":"141d6afe1eff26b8ea669a36ed50a513e5e366f26beb2d00f90a573d567b9a01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check matched tuple elements without inferring from excess 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":5691}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e20468569fe948658ebeeb7bbfd532495a4e7d800536f191e94eeade8ce373e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Once specialization inference fully owns generic argument validation, this field can \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":5811}}}],"partialFingerprints":{"codehealthFindingId/v1":"af962072fa1721336b6374439f3f5d29acc01f297dd0d75a8aeab4d91a8f5767"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Note that specializing parameter types for type context using this specialization 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6044}}}],"partialFingerprints":{"codehealthFindingId/v1":"71518ea657f586ce619334969f4da56796ca4ec76cc89e79145ad43f434c379f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Diagnostic recovery can sometimes solve a type variable 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6072}}}],"partialFingerprints":{"codehealthFindingId/v1":"517f121f07f48e7798b02fc5ce8d676ae084c271c3aa123b30cb10dbacf4c4df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Track which callback supplied the inferred parameter list. With repeated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6300e78944d574d27ca0f32d465f12af325532cdbe8a3a4816bbddbef73182ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Project correlated alternatives through constructor stages and partial signatures. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6572}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdbee4a006a2edb4fa6342c943c447cd40763238ca892772bcb3efa9e291ed3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Account for parameter-list and variadic-tuple bindings when refining returns. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d4c9ff515052234754e590c7a5ba0d13af3da23a5dc1ba23e8520b14051605"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could attempt to intersect the alternatives that are compatible with 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6676}}}],"partialFingerprints":{"codehealthFindingId/v1":"980d12f5a005f93777ca161921e5d01cb5c04718afdc7fb375fa0c177cca6afc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If the constraint solver tracks internally which paths depend on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1d84a644f214659c1c0ced74f6598528d8dc3ad2c061c86d6a1b08c60d0f0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ordinary callable subtyping can match a later, shadowed overload. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6763}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a82bce674915615ee584abcce51fe9feaacfeb9eecdd6e9f6b83ad1a5fecac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This method should go away once \u0060ParamSpec\u0060 and \u0060TypeVarTuple\u0060 are migrated to the constraint solver. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6969}}}],"partialFingerprints":{"codehealthFindingId/v1":"81551006ea43d36433b9f3868aa423dfb6f967c2df49814760e728876d0d5ce8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove preferred-type extraction once ParamSpec and TypeVarTuple use 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":6995}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dd43f049343b7a987f4dfa7104dcf124c367480ffb7b4ac74bb5a2bdbf05a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Remove this guard when the new constraint solver can represent and solve both bounds. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":7548}}}],"partialFingerprints":{"codehealthFindingId/v1":"56639c5c3da7004a14c4eb3ed578bcb730891c407338cd8c032298a7e9225e76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this special case once argument checking preserves correlations between \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":7785}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edbf67b7f0a041b83ee81c9884b5ea2c4ae9d86a0a48ffb7d2318a267c16148"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Soon we will go further, and build the actual specializations from 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":7832}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71553979d29b933d8e8be9aed71a52c239d7a57493901425f162811d4599f1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this workaround once call binding can infer a \u0060TypeVarTuple\u0060 from \u0060*args\u0060 and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":7910}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29f97ad6fd93d6ba4876eedb5114b764b8f1ed9408150e4c1b6ccecfc972320"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should also update the specialization for the \u0060ParamSpec\u0060 to reflect \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8202}}}],"partialFingerprints":{"codehealthFindingId/v1":"495595dee8010e30550ca8f60e6035005aec8fc0aad376db5c4279ea52fe2f8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should also update the specialization for the \u0060ParamSpec\u0060 to reflect 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":8208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1aba7feed774484f0983cfcfee1bf2e03dc46d9b548c6407d9926746316c676"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The concrete portion of a mixed parameter type such as \u0060tuple[str, T]\u0060 should still \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":9146}}}],"partialFingerprints":{"codehealthFindingId/v1":"306166f5ec164f0983f284010621a2aee484cf8e9b36050ae752c2af89c973b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Express the distinction between regular and constructor bindings in the type system. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":9390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65412d5d5f93b8a60e90c0572b2c2012fe077a0ca595a50ed8102bc22a2bff3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally reuse of a \u0060ConstraintSetBuilder\u0060 across any inference scope would 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":"crates/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":9491}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7aaaf4167f9693b8a518a33d7425dc167ffe194ddc87aa98b551250206b86c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could expand this with an enum to specify why the overload is unmatched. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":10408}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04074cf2d03c5e7f155eb54d9062d3e2eb2aacea014d7b5c11a3dcf844f7ec8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should actually be safe to index directly but isn\u0027t so as of this writing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":11484}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a2ea34cf52066208486b5f551b5cbfae2ab0abfbe67a772808e159a6a01114"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace this with an mdtest once callback revalidation exposes the correlated return. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":11722}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee11444516b924c58bb53fa3d39b8ac64f5facc3c5ea900302003ff061e4258"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Model the nested constructor chain if we want to support class objects assigned 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":"crates/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4ad84aecdeee8df39980d495ad606d83dc7ac97b9c767f2765738925bae30e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If the metaclass \u0060__call__\u0060 return type in this scenario is explicitly annotated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c296d7b765f5700aab325cd64dae9656b0134653f32dd681a7c15b904f4c925"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO All this handling of return-specialization vs self-specialization is a hacky \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bca8bc1a249f765128e6f882044912d5bebe7d69b60e1a45d46571f5a18e9d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // end 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":"crates/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a6b0b66459eb4f9343e592f257c53b78e635b48355ea327707182c4dcf392a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This could be made simpler if we more clearly marked unsolved typevars in 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/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55a5fc420734c2deede1df695f9f93d52fc061ad539fa1d3f8d1e174e4205fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO may need to handle \u0060Type::KnownInstance\u0060 here as well? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d4cfbf7842a88e981636f749fda857a696ac60383dc0adbf863124e193094b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO currently this is also true for explicit annotations that resolve to \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":"crates/ty_python_semantic/src/types/call/bind/constructor.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b4a8dede0fb6dd7891046e57fb7f24d54cfc113cbe2871156bf50c29647e75"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it would also be nice to tell them how we resolved their virtual environment... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/diagnostic/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5563fa5761a429b2f3dffddd79bd229ffb1ceb905f0cb7e0ca5f339114fa7d57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it would also be nice to tell them how we resolved this Python installation... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_semantic/src/diagnostic/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b350ff790836e1a11a1b3b5818ea0856e1c3830a8de9446abf0963bf25fd54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(T130415563): Line numbers don\u0027t match up with 3.10 base compiler \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/resources/corpus/58_async_for_break.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b28fd236884973cad0152d868295e18df3894286443194f1d9fc6e56ebbe321"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: cross-scope alias narrowing support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_core/src/builder.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0863b644209ba30fb13c14278ded3c5d83b5699824e54d1003c990e6779b161e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cross-scope alias narrowing is not supported yet. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6246566064d6a85a2db3b5241e85a259dd7eef5c7bcabdbcbb1957f8213f8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Bindings in eager nested scopes also need to be recorded. For example: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f6b04a3539f169d73b3e58fa208a17a81fc211f3f7987b0ab882290047b95d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support uses that refer to multiple definitions. This currently seems to lead 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":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a517a6c1e742107c75b31e4120400d05993a4a45db5a34ba13b979dfc3e4b4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Although we synthesize place expressions for each dictionary key, the 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":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46d7ae54d9e2a6b7a9ac093837a666f9aeead4a58d1598e62db51e1955f3d46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could be more precise here by delaying invalidation until inference 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":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"9194af8633d856a71316599b2f2ad86c0c55ef3fa930a57618b28f48ee759ea2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO create Definition for PEP 695 typevars \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_core/src/builder.rs"},"region":{"startLine":3048}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e7e4642334df77668db24257c8b7554eeeb68cc96c2788a9cb357260850ee7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: nicer API \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":3799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaf25de630e38c2e369d737fe9a3de00d6fd71f6abbb0348aa7c3495f872850"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there\u0027s lots of complexity here that isn\u0027t yet handled by our model. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_core/src/builder.rs"},"region":{"startLine":5252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b648bb766d314dd8b20c2f4ee2679d42d577b0e9e2a1a19736384101647e1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // only. See the corresponding TODO tests in \u0060terminal_statements.md\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":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":5328}}}],"partialFingerprints":{"codehealthFindingId/v1":"214d87cdc1c5c5b05c02a8294a17878325c608432364394c6440a80e029bb17f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brent) The long-term fix for this is for \u0060YieldOutsideFunction\u0060 not to apply 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":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":6017}}}],"partialFingerprints":{"codehealthFindingId/v1":"96598d4c252e14e1ffe84513cb8319730b90da37351c80d4e96a465006a6c04b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We only return the \u0060TextRange\u0060 of one of the \u0060nonlocal\u0060 or \u0060global\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":"crates/ty_python_core/src/definition.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a84558430ccf0c4a7982e41e0ae8cdee5812b7cd39ecf16f6108282bdc650a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We only return the \u0060TextRange\u0060 of one of the \u0060nonlocal\u0060 or \u0060global\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":"crates/ty_python_core/src/definition.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7b1525f3673556d9bc435d3cf135d4a3f6a63fb5784b527456318af1243c25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: currently we don\u0027t model this correctly and simply assume that it is in a scope outside the comprehension. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_core/src/definition.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"115d50a3fb0d2542afbe8e807e8900cb5c7828b8139adc5bf6eed00dc5681517"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: /// XXX: There\u0027s a fourth case that we don\u0027t (can\u0027t) handle here. A variable that\u0027s bound or \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_python_core/src/symbol.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba782adcdd361a12efdf0c55d48850e1e71c3b03058754514f6f04e5d4fa9af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We haven\u0027t implemented proper boundness analysis for nonlocal symbols, so we assume the boundness is bound 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/ty_python_core/src/use_def.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3200fe95bd357c84ed6bfb3180948bd255a2856d040f1995e092023b6a582be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Handle \u0060nonlocal\u0060 bindings from nested scopes somehow. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder/loop_bindings_visitor.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"849f8571b1df4751d13a3a4654fa8283a03c8f9e7a04916af3c717aff430a754"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use the \u0060program_settings\u0060 to compute the key for the database\u0027s persistent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_project/src/db.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"42da38a645165ed85f979079c1d171e98be24eb3c37f6eb0f3d7c8a29ce6a7ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider using a diagnostic 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":"crates/ty_project/src/metadata.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b375778f3e6edadee641ff6e5d7d808c04135a9a4f1bb5998d8813b21f3c7cc2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Log a user-facing 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/ty_project/src/watch/project_watcher.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"56129ffffc0d99756bb0120edbcde28aadf26600a9967e5bc727e4c118efca7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: notify_debouncer_full matches the \u0060RenameMode::From\u0060 and \u0060RenameMode::To\u0060 events. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_project/src/watch/watcher.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"06961967a0728121d6e437a992193c976f572c2e778799fd3a01a698552a9ce9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add a note if the value was configured on the CLI. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_project/src/metadata/options.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"de14273b2e2da403613ab80c73f3cc413a2488006e314749ab1e80c35a971e7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(konsti): \u0060regex_automata::dfa::dense::BuildError\u0060 should allow asking whether \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_project/src/glob/include.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83dfc0d6117327b34cd01ac1295b2eea1d48393aaab53d070570065b373de37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be removed once the incremental checker is ported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_project/src/db/changes.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c720db236401bb0d5b0395685a604a0470364cdff6f5b3cafb38d12687b42dbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check what other type checkers do. It seems like this (and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_module_resolver/src/list.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3041d4d128c4a3256080e38c78613bdb7c6cda512c2a289c8c6c88e94db6da5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: the validation done here is somewhat redundant given that \u0060site-packages\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":"crates/ty_module_resolver/src/path.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d0e08b058cde4e4f01ec4679db952f0e41037eb0f5a4f1fe2eb2369b64b628"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO vendor typeshed\u0027s third-party stubs as well as the stdlib and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad2dc09acd42fbb37e03cf0d9b4474616aa4922e44b0b2fe916a231a674bae6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It might be useful to warn when a concrete package or module shadows a legacy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7047c89c1cbecf46dda3493e631a3e0e8678d8d6ae8ba48e27e06389cf1ee8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: offer a diagnostic if there is a first-party module of the 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":"crates/ty_module_resolver/src/resolve/search.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4cc58eda2bbc2a5acb81b77c12a0d9f08f2792ad2b3bb768b26b6f9964ded1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060importlib.abc\u0060 is available whenever \u0060importlib\u0060 is, so qualifying \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/code_action.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"0531be1d0d81c377bbf6b2a11d91fb4551b01197ce241d8aadad052dc361bb11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle PEP 728 that adds two extra keywords, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/completion.rs"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c237e3bf598e4603a60ac47256b710a602fde8b70335023397529942d54b05c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should include \u0060foofoo\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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":4005}}}],"partialFingerprints":{"codehealthFindingId/v1":"832a43b1f60ae81c22101833ded221310f9bed8e33013ee6443112b8cf42d0a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should include \u0060foofoo\u0060 (but not \u0060foofoofoo\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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":4137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f2a96c28b2a0f5c8e3790b5b16906e68338fa61cf838291a44d0e589238b5b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should include \u0060foofoo\u0060 (but not \u0060foofoofoo\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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7333bfca034e255a813a7ae5f55dd9f98556c5ff4b519b84b66a66fac4f2302"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should include \u0060foofoo\u0060 (but not \u0060foofoofoo\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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":4175}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d6963b4a0a5fa58e5cb2bb165f321f48012c171524112c52b77bb737200f89"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should include \u0060foofoo\u0060 (but not \u0060foofoofoo\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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":4195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9982cd68057115f6fa0b5693a852e563a064f33a1235412fb305fd318bf63a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should include \u0060foofoo\u0060 (but not \u0060foofoofoo\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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":4216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8655adf13cc983af4b257f9c1d2fc8fd9bbdb76799fe916f207c5686328d0e0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it would be good if \u0060bar\u0060 was included here, 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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":4248}}}],"partialFingerprints":{"codehealthFindingId/v1":"95abb9a4b550495317808474b1c5606a7826133ac263733ad0b11349ff80bd17"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should include \u0060foo\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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":4382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1deade0a6339ee774129ca2c54563d870cd8b9b64e285b9cedb56ecc45d32afa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should include \u0060bar\u0060, \u0060quux\u0060 and \u0060frob\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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":4474}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f2d049c692cba10f4d6fa95fe9c39a937f0ba5fa1c14e3effaef54cca3fabf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should include \u0060bar\u0060, \u0060quux\u0060 and \u0060frob\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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":4494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1651a298f33d2475608faab1bd2ffbea44bc10210046a1ba6739cea6d2007ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This test documents a known limitation. When completing attributes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/completion.rs"},"region":{"startLine":4769}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fc8e8ae902b2a0c552e18ca8899cf0063124a1fb65e9a49d9d8bf88f62a2b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should NOT include \u0060foo\u0060 here, since \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/completion.rs"},"region":{"startLine":5770}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95b86579b569ea8d755fdce87c4b9f438feb32a2d385ad06189f5892e5bdbc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ideally, \u0060only_available_in_this_branch\u0060 should be available here, 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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":5843}}}],"partialFingerprints":{"codehealthFindingId/v1":"198104102d843b02d0341ef6e3e3c03e324a4e2e2bcf6fb51fe1273bc7ca4689"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Suggesting False doesn\u0027t make much sense 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":"crates/ty_ide/src/completion.rs"},"region":{"startLine":9631}}}],"partialFingerprints":{"codehealthFindingId/v1":"8137731d2ff06980d3d09ae0035636eb0c34a033c4440d1bee36a33e8f841c80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should not contain False as we\u0027re expecting an iterable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/completion.rs"},"region":{"startLine":9718}}}],"partialFingerprints":{"codehealthFindingId/v1":"164b82650ae2a07976b8a8edb347eee8b0ffa3661778e9460d374ba860aff186"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should in fact suggest the namespace package itself (not just its descendants); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/completion.rs"},"region":{"startLine":10732}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e0b082022895b6e91f003d0c2f0fa4566a2abe48289faecfe7ee10ede0157f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should only highlight the last use and the last declaration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/doc_highlights.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1baf623c99bd2ed01835fc3cbef577b0fc5385ea54a370b11e72256b815eab2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(submodule-imports): this should light up both instances of \u0060subpkg\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":"crates/ty_ide/src/find_references.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"39de7383e0deaa7fdfa48787c1806368367c712b58a676e26da4d5e6de1c24ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(submodule-imports): this should light up both instances of \u0060subpkg\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":"crates/ty_ide/src/find_references.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"6060473aa7ea63fc4ab900fcd5b4a8b1efaa23575079e69c0a2f0242a682728d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should only return references to the last declaration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/find_references.rs"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a911e7c0b452070d27c2460621a02abfb911fa1c0ad625e34675e120dd8689"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: It might be better to move this logic into the AST \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/folding_range.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ec1922e6f5352416ada9f660f6244ede1107e48ff73b05dfa181cd11e449d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support identifier targets \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/goto.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94995e04bfa2475c33105c985f8f5894ec2b2033b542a07d1c5fc9d1bb8ff7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(submodule-imports): I don\u0027t *think* this is what we want..? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/goto_declaration.rs"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"be64a5d94c1f709942a88f3a7fb2af54a1949867e903bb7f9d3dd8dee2dd10df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should only return \u0060a: int\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":"crates/ty_ide/src/goto_declaration.rs"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ad1eca67b3d1f84bb088c989dafdca5d8cbfb31a9420102a642f590ef3f660"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: this currently doesn\u0027t work right! This is especially surprising \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/goto_definition.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e7ddd6983f512d3ebab03bce4ad8473f884b5429533b2fd43f48a88ed78045"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should only list \u0060a: int\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":"crates/ty_ide/src/goto_definition.rs"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c3e3989d78ef1441a6f6f47c29ff035fc1d6fbf67321a61d50d2677d04b4c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the receiver is a \u0060Protocol\u0060, so implementations should be determined by structural \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/goto_implementation.rs"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a96defb0ec27a995cacfc8a8c36b35cf7f89e10d486757278995ed7d133f8b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should jump to \u0060str\u0060 and not \u0060int\u0060 because \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/goto_type_definition.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a80befb59047a2b74e2231756589cd12249298afac8c96d7a95bbf2b9285f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should just be \u0060**AB@Alias2 (\u003Cvariance\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":"crates/ty_ide/src/hover.rs"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b051df1355171add28b7b789a112edf85a6fb3b6a0566a7f6d7770eb123924"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should this be constravariant instead? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/hover.rs"},"region":{"startLine":4442}}}],"partialFingerprints":{"codehealthFindingId/v1":"6843474b915b57e312465e9a92304a34e02c8841219d2e434533a20485d4c32c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should only show the matching overload 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":"crates/ty_ide/src/hover.rs"},"region":{"startLine":6560}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a3eba4104c5c7320392330ac997a58314ea9615e4293498d5550caf4e2b2a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test (and the one below it) aren\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":"crates/ty_ide/src/importer.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc31271f4d35ade364f8bfed6017a57fc879c1aed68048f9ed44aae27ab5d2bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test (and the one below it) aren\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":"crates/ty_ide/src/importer.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5dc1c932bce88f231368c90c7f9d15c74ead6140c46c3c8f1c748db276a707"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test (and the one below it) aren\u0027t quite right. 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":"crates/ty_ide/src/importer.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71591d60fa5b0743755e7c9d1c9a68292d9d830f875eb19e63c7383a96cb1f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Filter out TODO types because they are different between debug and release builds. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/inlay_hints.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f74905bcbfb9c3120e97d30e701afe23a27ba3a5cf2065063fd27655c18288"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Filter out TODO types because they are different between debug and release builds. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/lib.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bde50ee7427ce8e9816e10a2818a932ca24718e054377fdd46876d31e375c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Show a \u0060str\u0060 return-type hint once async return-type inference is 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":"crates/ty_ide/src/inlay_hints.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f35f6bca2127fac716575b43d1706a638f2dbd1238561a25a5a5376c85b4db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Ideally this would be rolled into \u0060CursorTestBuilder\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":"crates/ty_ide/src/lib.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d2513e02ac2ddab5a96b2710786ba658f5d5ecac136ad780c78676ee9d7c69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(submodule-imports): we should refuse to rename this (it\u0027s the name of a module) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/rename.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca21f4084793a024c637f1c59d56379c51a3d817b32bd6d7db64fe220afedc3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should rename all attribute usages \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/rename.rs"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9ffbb6159bd7d1130d21692615dbbcef38848de07d5a9c9ee840bad93ac1f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should not rename the first declaration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/rename.rs"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a91e013f8e8f955dcd8d13e34f83e5b2c9cdd039a297895c9bfef5dbd30754"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Need to handle semantic tokens within quoted 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":"crates/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5490931986757b3a06427314d5ce7eca2034aa70f628ee08ce17f6966719b377"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Properties (or perhaps more generally, descriptor objects?) should 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":"crates/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c572f822d74e39d31eefd5320889ea8daf3990a571b219aeecd25b07d419e90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Special forms like \u0060Protocol\u0060 and \u0060TypedDict\u0060 should probably be classified \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea2fd6f58bbef124e7392542d5511f322c20466fef7e43e17f12494f1bb38db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Type aliases (including those defined with the Python 3.12 \u0022type\u0022 statement) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43aa8305dd118e1f3c04915c3fde9b2a982aea9aa852d7521cb7f2ad1232faf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Additional token modifiers might be added (e.g. for static 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":"crates/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"97151bb1c53f49a5533deb06a8a498f8b90e77ad37a795b9be924137ca86caf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We don\u0027t call \u0060walk_type_param\u0060 here, because, as of today (20th Oct 2025), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/semantic_tokens.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56f0a674b23ff6f9b221210e505a6206abb46ba74b49614adf796f8f2cc6d88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We may want to add special-case handling for calls to 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":"crates/ty_ide/src/signature_help.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad03bf31fb88dc27e14750131436aa82dbd44f406cf03dc3283136280246860"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We\u0027d ideally include the names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/symbols.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"e421b3c1c8ac7f3a30d895077c0c4dc009da1b2a9738aef619298c930619c4d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should do this without copying every \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/symbols.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"18627a65fd342eef0b35e9773dad795280462e1aa78ba274c3f80f1eb8749be1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We don\u0027t currently try to evaluate \u0060if\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":"crates/ty_ide/src/symbols.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a6865e4cf9cf14851823b349901e0eb7203ae61a40576ca82e159a86ed7232"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This shouldn\u0027t include \u0060bar\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":"crates/ty_ide/src/symbols.rs"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb95730d76a9feb6d093ba5c4bbc61413379c7292958cfd4ef51001332ed889"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This shouldn\u0027t include \u0060bar\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":"crates/ty_ide/src/symbols.rs"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa15db7daa121f3c3a8dfccf7e5d877930d9a98865d2a41dea96377c0c901ce0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This shouldn\u0027t include \u0060bar\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":"crates/ty_ide/src/symbols.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1745020296bfb0077752e26e196d9ecf979751dbf7d0e064d87b9b521c2322"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there is a convention that \u0060singletick\u0060 is for items that can \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/docstring/markdown/general.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe5e4cf2d4f3f384a100125734ba4e8da983bea616e970db89989b4507c6a33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should remove all the trailing blank lines \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/docstring/markdown/general.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ade5c4e8fe1ed2c70d37b6b0490334fa75cc75c75656d4e5c569c6821b0455"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should we not do this if the \u0060line.is_empty()\u0060? When would it matter? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/docstring/markdown/general.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c80777bed1fee1bb0e4ce051d708fb2513dfba77e8f5a30d5f94e5a893b3de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is there something more specific? \u0060pycon\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":"crates/ty_ide/src/docstring/markdown/general.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c8013e2fb8929075dcd1a85145803a260a688a70502eecc71d08094b744f73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: would the raw unicode codepoint be handled *better* or *worse* \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/docstring/markdown/general.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80f584bc3e4c6ac946ec9f4ac21fbc0ae46d683febcc928b1d46916f3b25c48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we parse \u0060\u0060hello\u0060\u0060\u0060there\u0060 as (hello)(there) which probably isn\u0027t correct \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty_ide/src/docstring/markdown/general/inline.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1527b9da15f13fd2a3d62a90ae3e0fd4302d0fa94c55731d69f24fbd7454514"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: bound methods don\u0027t preserve type-check-only-ness, this is a 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":"crates/ty_completion_eval/truth/import-deprioritizes-type_check_only/main.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e7a1d53c5688df9c2f6e8636694ae40a7e13b32e43546d7e0a486304854815"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: auto-imports don\u0027t take type-check-only-ness into account, this is a 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":"crates/ty_completion_eval/truth/import-deprioritizes-type_check_only/main.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ec49a3517066ae0dc1f3b9d125d5cf6429955945ee9025b4056b5a0fca4842"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Invalidate program settings when a \u0060site-packages\u0060 directory is renamed. 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":"crates/ty/tests/file_watching.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c1eb255f02df6b9cd81120944c7d9b4fa5a6d9330c15e633ebcd22fc4e5af8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Emit a diagnostic for options that are not allowed within scripts. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty/tests/cli/scripts.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"27022e981ac64fd25eb698fb65b6f232f5cbbc995f826f017d3c8cc65482c9be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Either support (when calling \u0060ty check \u003Cscript\u003E\u0060), or raise a diagnostic that this option is not 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":"crates/ty/tests/cli/scripts.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b183976bac7f7329453c7f0ef78e6fc0d832b3c950a6fcde1722a1d8a9f7728"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should have an official flag to silence workspace diagnostics. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ty/src/lib.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c3ed074516f477b8a0c54a207d101b2f9283b438732280269a9e0feb05f23f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Respect gitignore. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_workspace/src/resolver.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"965a2f0c5fe729f91c8c3f8b805a00cb7062a4fc4906514a13204e1558573bf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): Support Jupyter Notebooks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_wasm/src/lib.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ba3c39e7ac96f7fd8758bf320b0d0a24d8e72369ce177d780881219852d67d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(konstin): Add an options for py/pyi to the UI (2/2) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_wasm/src/lib.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e8f7df6c04916a5d383fb10e790761dc6ae46d841b3de1ed95b7f75b6d4471"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK for const fn: math on primitives only \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":"crates/ruff_text_size/src/range.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdd562c1d529c996e930c5c3ed2d9962ff080022e76935fc8ceb1526e133cc3"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK for const fn: math on primitives only \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":"crates/ruff_text_size/src/range.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eff5628fb0ac9584d5290a25aa69e626c8440420699f6de88804351dbd475c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jane): Re-enable versioned edits after investigating whether it could work with notebook cells \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_server/src/edit.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96cd5baacb68b5d4e9923509166ea8a8a9dfdeca6c1f3d719286e72dc47043c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jane): Find a way for workspace client settings to be added or changed dynamically. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_server/src/session/index.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4371b45f6b399c250eb5002dafb976082a15716c678ba3e72f9deb5e6616773"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jane): eventually this will be important for caching diagnostic information. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_server/src/server/api/requests/diagnostic.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa3fe4bbd997f2fceb3b45f3ad13944d95426ac3a4fe3bd27738ed721da057e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we only use the first argument i.e., the first document that\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_server/src/server/api/requests/execute_command.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0120a2e50544312555cb5b6688211b13221abf83d06995e318e1e9617b6a2f09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jane): get this wired up after the pre-release \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_server/src/server/api/notifications/did_change_configuration.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"945dab9c73c1550e38191e0927dddd121f5c2fdc77aab42de21fd11faabe959a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Pass in a slice. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_semantic/src/model.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b75e0a97f4618aa6d0b7d38de77550b7ad8d66202d6a565565cbfca5cb251b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(charlie): Replace with [\u0060ruff_python_ast::AnyNodeRef\u0060]. This requires migrating \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_semantic/src/nodes.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5e9b175507aec35f6d8077329fe1e29de16386b65648c9a685aeb2a519c28d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can probably be removed, the places it is used seem to be able \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/error.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a99bdf2539d782adfd30c61401b5ece4c2348cab233bf2dd904c2adf9a64c76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle possible mismatch between BOM and explicit encoding declaration. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/lexer.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b1e4d83a119fc51ee2077de18c3ecc1dbd70b860e65cffcdfb3dc61e988297"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brent): With multiple diagnostic ranges, mark both the named expression target \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/semantic_errors.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4755631dc5c5bd360957cf874b4dbac05725114b2ceaa60341320d48d19d899a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check when this error case happens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/string.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f365ca9dc9840d9142d1e77f9fc1eba51e8c7c5fa244b93c933f483e69b0ce58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): Parser shouldn\u0027t drop the \u0060parsed_expr\u0060 if it\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"301203c282eb650919c84bd541868f9cbc783877c92556784a2d4dabbc003fe0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): This is not an ideal recovery because the parser \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a3d461c936ac3be14f75cc4f70eca099b058f78d54fe9f125e4375d68b1861"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): Parser drops unterminated strings here as well \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1caf639a3e9c4e84ea4521d12cf70f3188d01538fc5aa10f08fd9cedc4740d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): This requires making some changes in lambda expression \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fce01f8a2a6e275c7b80d335766d4a29a15a5876b2b1b78d39002227d42b1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): Avoid dropping this token \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b71f8e579dd0415ec7b7fb7ddf6d65be3358b2127ff4e88aeb8371a96d42af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): This requires some changes in the lexer. One of them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dca42e305beb88ff21d8209b2579841fc13758ec2cdc7310bac9a5c92edeca9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): Can we remove \u0060parse_func\u0060 and use \u0060parenthesized\u0060 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":"crates/ruff_python_parser/src/parser/expression.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cbb6f0a93752794b13e614cb0b75eb06312dc934d164f2538276a6dbef755f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): How should error recovery work here? Just truncate after the expression? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36d47b03b1e2292f664fb79aa655910e6a7d8c9ea576951a33becad45132d40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO consider re-integrating lexical error handling into the parser? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee70e87d82013633cc39411f17aaf00356ac2b73be62ed5f629e46a4d745321"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): This range depends on whether the missing node 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":"crates/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d49ab1f975f7a631d7afac53e0d814e058c85d30103a77cab5e7a646f42b33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO explore including everything up to the dedent as part of the body. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcbe3b156b7c992044f5a397f84552c0cb29abf85a1e8cd4c8f972f53273008"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(micha): Including the semi feels more correct but it isn\u0027t compatible with lalrpop and breaks 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":"crates/ruff_python_parser/src/parser/mod.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb78d67fb4fa32710a799c746a270bd116470b07ab517f8f86bbe6fb480e9f70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): It\u0027s not possible to retain multiple double starred \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/pattern.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"324d6a7a593a6341561655335d14fce7a72dc2c977b75f40c301a106b5ea9879"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): This recovery isn\u0027t possible currently because \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/pattern.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"27342b2717534bf5a95d71a8dc1940ddc8994d21e0e634d29c56f031430a4eb8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): Should we expect \u0060Dedent\u0060 only if there was an \u0060Indent\u0060 present? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":2761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bae142f52b003917cba2fb473115a7361dddc2c29bcdc59673ae65e345b6c36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): This has the same problem as \u0060parse_match_pattern_mapping\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":"crates/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf6379eda15fc8627330709302325723676c63945ab8f62d66b7ab8be635e91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): The AST doesn\u0027t allow multiple \u0060vararg\u0060, so let\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"031cc674f90944f227970b3e0235d300de0eaab67d552df768480d0673b4a3b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): Pyright seems to only highlight the first non-default argument \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":3558}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5448289a4c324c6b1ccdfbd3c332416386fa53b14752b74462909e2a5b716c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): CPython throws an error if \u0060TypeVarTuple\u0060 or \u0060ParamSpec\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":"crates/ruff_python_parser/src/parser/statement.rs"},"region":{"startLine":3668}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9698ac3f32d83889678ae2dab12e559fdb0a1d828ce205eb03e5fa5cae46cc5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The type param related error message and the parser recovery are looking pretty good **except** \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/resources/invalid/statements/function_type_parameters.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38480b90e23ce3f67a8723064967d8a505272d52ca28590b6b4619358a6eb39"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME(micha): This creates two syntax errors instead of just one (and overlapping ones) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_parser/resources/invalid/statements/if_extra_closing_parentheses.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf69b10931060e15aab35a300f5898a042f67f34ae0eed701e8c2a06da779a74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dhruvmanila): This test case fails because there\u0027s no way to represent \u0060**y\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":"crates/ruff_python_parser/resources/invalid/expressions/dict/double_star_comprehension.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1e2d85a103ca2aa72b687fd78a58c6fb06e880e4fdfd34379cdd6b2766090d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_python_literal/src/cformat.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed47ae73b0342e10562663dcf0cd53960ad2b80be4fc6a53bc2608e4c110c19f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rewrite using format_general \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_literal/src/float.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"416ea6fd8501ffde5e1bb751cc3a1b9dc152b4025c791aa98cb20e2cace25e47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this error with a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_formatter/src/options.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"106d39bda37d438380b10433cd071acd3e8defcf5807d4af92d398ab2e91bcdd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this error with a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_formatter/src/options.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d574c7e7eca6603450294bf1bb8d463ccb0e24b029e1b3f395683aa26fd5b4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): We already identified this comment as such in placement.rs. Consider \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_formatter/src/other/parameters.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9884ad8a7543e404a710335c9aa9fbb2520fd2fe9600b561f563307bc451419e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Make these dangling comments on the \u0060ExprDict\u0060, and identify them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_formatter/src/expression/expr_dict.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddabb6be05375f24a177384f9a00b55045f81bc621ab6e6499cf6fef8be0591"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(konstin): We don\u0027t have the parent, which is a problem: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_formatter/src/expression/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ad4501109f08ad9475455e3249dd96485c6a346551a733c1ea0648c746fe9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dylan): Once the fluent layout preview style 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":"crates/ruff_python_formatter/src/expression/mod.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7bcb542c120834cc99d4d76eb990ab879e25906c6cf8f9f084221d36e4aedb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Assert that there are no bogus tokens in these ranges. There are a few cases \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_formatter/src/comments/placement.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f74d117527f25d3fe73526727d3518bd1457edaecde4f678a2b9471c71bcdba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Visit and associate comments with identifiers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_formatter/src/comments/visitor.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6525c290bbfb2f55ec55c329aa0b162013557cfd518462f01b2610e2bb319ffa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dylan): the documentation about 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":"crates/ruff_python_ast/src/nodes.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb31ee446dd15b80b48a351f59b1ba508da29fc1dfb2d80c285905657de9ac2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: refactor this to work without a parent, ie when \u0060stmt\u0060 is at the top level \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_python_ast/src/traversal.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fcf3cd52cdc882be5071287b30d38a209f6437cfc7d95106235eff67914fd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support code blocks nested inside block quotes, etc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_markdown/src/lib.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1c279e78deda1b7900333cf512da8323652c899a099fe4a80745cf090c206c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Why do we do this here _and_ in \u0060rule_code_prefix::expand\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":"crates/ruff_macros/src/map_codes.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b3fb4707b3f0908cfca3226a7f5ab4d30721bdfc516f47f9fe4192f01ba8d8"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// The directive\u0027s kind: HACK, XXX, FIXME, or TODO. \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":"crates/ruff_linter/src/directives.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6df1422dcbe7bfb06fd436c7fb190f9f351c8c879f48df87dd2e25c48db5263"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): Add support for Jupyter Notebooks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/linter.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"24da86af9e2696093c2a1b3e5a893b0c5c58dae61c15c083065fcb3a8eca57d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brent) Remove ecosystem selector normalization when stabilizing human-readable rule names: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/preview.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"69eb1a3927c71eac12f1232988d374df45985d9e36f864e98ebfd459e2aeee9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Remove by 2023-02-01. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rule_redirects.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"367def924aebae38f6a25912027eb556d5eee8aa6ed0d98244c630501b775662"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Remove by 2023-02-01. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rule_redirects.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2c50084d905a878c7ac528ca0494d31d8e44073723da052d4b774ba1bd5419"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Remove by 2023-02-01. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rule_redirects.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc5e46fc91aef0e117676cdb2b9e6c21d74d5d70ba1a59d88854ae78a7420f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Remove by 2023-01-01. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rule_redirects.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeb40879c8ce3f405edb42bb49fdf40392ae9b58c51851cdd0fac958e909052"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Remove by 2023-04-01. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rule_redirects.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab29dc9f1c1d0dcdab0116c8b6db73cabee2b45a534ac17f73fb8639e81c34d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Remove by 2023-06-01. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rule_redirects.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff406801ea67c97168e6c0e03ff0da35982fc0f3d700be892ad188bc4f680276"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(zanieb): We ought to put \u0022ALL\u0022 and \u0022Linter\u0022 selectors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rule_selector.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fff4f2deab153ec94f953f61d77843218e7669561112e1a7a9f79a7cb6cf518"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(martin): tell the user how to discover rule codes via the CLI once such a command 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":"crates/ruff_linter/src/rule_selector.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3bf8239137fa720fa1d37b34cc655831064f3bd94f90a5ffe5709effe02359"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(micha): Move \u0060fix_title\u0060 to \u0060Fix\u0060, add new \u0060advice\u0060 method that is shown as an advice. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/violation.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"947559ef1fb0dbe02d3ec0193d708185b31783b808108c212da886bb2ad10527"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Type parameter 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":"crates/ruff_linter/src/rules/ruff/rules/class_with_mixed_type_vars.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45efa027de6ad1b3d5734abf976969e7caed5704827c4f4f41944f1e1155c87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///     # TODO: Remove this in v2.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/ruff/rules/duplicate_entry_in_dunder_all.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f7a19c3ced0603b2695c65de4ca7de8787998872ad575fbbc21563fe014858"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(konstin,micha): https://github.com/astral-sh/ruff/issues/4571"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/ruff/rules/invalid_pyproject_toml.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3cd7728a3aa9f8eb1420ca115fc7a779e64e6a21dccce00ad1bc0541a51a62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Preserve indentation, to remove the first-column requirement. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/pyupgrade/rules/convert_named_tuple_functional_to_class.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6f35e87454c14c635597df99d8040213386683061bb9eefa79a0b1145643b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Preserve indentation, to remove the first-column requirement. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/pyupgrade/rules/convert_typed_dict_functional_to_class.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf21660833ea03655a79f913a2365d6053432b927cd497fa1804b7b41268120"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): What case is 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":"crates/ruff_linter/src/rules/pyupgrade/rules/printf_string_formatting.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae77ca11f9f7ad56d098d65ed73e8e7d9b27a96df05ff549fcd613501323131"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): As an alternative, we could remove both arguments, and replace one of the two \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/pyupgrade/rules/replace_str_enum.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf46a29cd408b1be68831adaa6dad67fe04993479ee4474b5ef6421731c9be63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): If the expression requires parentheses when multi-line, and the annotation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/pyupgrade/rules/use_pep604_annotation.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2afbb99d573919527e395a84547569b5fe8bfedd9974f140e448b39b4624717"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brent) handle methods, for now return early in a class body. For example, an additional \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/pyupgrade/rules/pep695/non_pep695_generic_function.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e485d31959d247680de26bdf023916eca2b88aff188cdc15a8ed7413e33f15fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve with type inference \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/pylint/rules/repeated_equality_comparison.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e0e2df4f5fd41e55ef914c937f19e11b2b95c98bb633711a91f2676d2b06df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Extract globals recursively (such that we don\u0027t raise F821). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/pyflakes/mod.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6785ca5a1cc64620028771002b38696022a1f0b6b58c5b5029021604118d9b37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Support nested deferred string 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":"crates/ruff_linter/src/rules/pyflakes/mod.rs"},"region":{"startLine":4433}}}],"partialFingerprints":{"codehealthFindingId/v1":"794529491ed118d731b76f37623b14ae529cf7e35d4834154ad0c67a32608e9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Store the \u0060WithItem\u0060 in the \u0060Binding\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":"crates/ruff_linter/src/rules/pyflakes/rules/unused_variable.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf8a0e9bf54cf97cc4dd72386d3269b2aa914f2fd1e2e8cabb9ee2acc4ce726"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Respect \u0060noqa\u0060 directives. If one of the operators has 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/ruff_linter/src/rules/pycodestyle/rules/literal_comparisons.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"86400e43d7f9300c4f2a629e2481b73f5d9b4f74be13638dfbecc1cf56cf029d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this test case when the fixes for \u0060perf401\u0060 and \u0060perf403\u0060 are 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":"crates/ruff_linter/src/rules/perflint/mod.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be52f1890b1905689ff4f578f0318ace7720a387222cfaf5b92789c670b6056"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): If there\u0027s an \u0060else\u0060 clause, verify that the \u0060else\u0060 has 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":"crates/ruff_linter/src/rules/perflint/rules/manual_dict_comprehension.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a965fd531cb58caa31a10921ab6579f32dfd8e4399c236ffef6674cb2eb258c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: once this fix is stabilized, change the rule to always fixable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/perflint/rules/manual_list_comprehension.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ea6f982afd0594c0a4205d2e118cbc4c29c09be59de2e91c0b146412e9f446"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brent) See #19359."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6509e5e2107435cff45478911428cd589f0aa0d1fae11f9736d58231e87a84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should check \u0060reference.in_annotated_type_alias()\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":"crates/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84bab32f0a0dbb8c348847339b53ea6a70ce46d0e21b4b8e532a07f13a18bb6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # FIXME(ruff): this should get fixed! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f5fc845894d4e1e0712d27631c098997fb62e7e6a42636efaacef1981ee963"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(ruff): this is now fixed! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"663c227bc0292ec425e64299a921fa9e43b116a520464be5ef5e95612f1c1f32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO: should assign an author 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":"crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8089f667989f0c17e053fbdac60e1ac99ea2d8f627e6366aee66baf41dd89504"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie): now an author is assigned \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"df417731ee25b71000689a131a12dd1163f0cfd142d96401f859ba72ca732705"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO: this link has no issue \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c997f488848bd590959ac493787a069a746b19f8976330582a5540e2a34238d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie): this comment has an issue link \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b03de13805c198dac3d738547f4fbf290b396fef525c3e2fa9615bfcd493619"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie): this comment has a 3-digit issue code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b94b659c46489987ec25862a9a9e8b4052be84a6ec103606f4c3f9b9aa26327"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie): https://github.com/astral-sh/ruff/issues/3870"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51f8f199b4edb9f8f54f0e976da7dba3329ccb4c60ddf01934736a0e26e83c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie): #003 this comment has a 3-digit issue code"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf878f5d39e5c5743faf7d66e28efec461c27451e46b1621e8f37af6231e7fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie): this comment has an issue code (matches the regex \u0060[A-Z]\u002B\\-?\\d\u002B\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":"crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40145ca83e775be569a0baf730ab0e6bfdca36848875ca8c2f0bafeaca7b0bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie) fix this colon \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ed99fe76abefea9998e9b3f2da71595f291bacb6dc17b6353d56ff95d522d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie): colon fixed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3188b3d98ee96b97fb2f3799ad8f9424d2835c740f5d178e8b1d600c7c7a3417"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab544f8a9b4ee9eab4972c73f51f9492d51e2522f9e19707d95bb2f5ae5ab7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie): fix some issue \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"df59eedb085ba7f9bc3e94cbc388a181ffc1ee48bd67bb67efe255eeb1a18a5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # todo(charlie): capitalize 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":"crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e4aa6fe8a8dfebb26b9789797d4d3df4067efae2ad2d1ce1e90cc30c528e85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie): this is capitalized \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e50351b30f6f4f8e09749c75e56fcec875d6ecdf5ca6ddc140c88a079260aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie):fix 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":"crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81ad9b462a08c66b62fc62dc7ac6a1cbe65cb251ecc8f6f168e0565d36a0a7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO(charlie): fix 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":"crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"350cb42e889b30c07fd0b70bd14c797c75f21f371e9e423d4c65f1fa84630df2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // flake8-todos doesn\u0027t support HACK directives. \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":"crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5337f4dabf6dc2c3d357882090abdcec6cd0ce59f3fd9d5bfb3d728fc9075b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): There should be a way to go from \u0060ExprName\u0060 to \u0060BindingId\u0060 (like \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_simplify/rules/enumerate_for_loop.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b1a877537fcf2c30980983dc7908af1023ed99a58e9e9df558a19bb1c4e2f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Fix precedence handling for yields in generator. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_simplify/rules/if_else_block_instead_of_if_exp.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e6d02cd5fe4ba3a08481feb26f60472c2ceb2d2ec63a72497f5764e9d1c9ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(charlie): Remove the extra [\u0060Stmt\u0060] here, which is necessary to support statement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_return/visitor.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec8b9cd54be2cb9dfbbbe20906d19628da6def8a0176b7f28019eaf32be1422"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dhruvmanila): Support checking for escaped quotes in f-strings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_quotes/rules/check_string_quotes.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5036ed49954fae4fda3f97fe8987908a1487898ebde10a3ef2b7f9354d371233"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Replace this with a common utility for selecting the appropriate source \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_pyi/rules/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"498918596e4b85da5c91100c215e93c8cae2010fd73f72c848f7e056cd56f301"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dylan): decide how to count chars, especially \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_pyi/rules/string_or_bytes_too_long.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"590daa17e0a233202ac25260701bb8455de84188b60c05ee80729e11d9a32b4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///     return f\u0022Hello, {name}!\u0022  # TODO: Add support for custom greetings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_fixme/rules/todos.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"849fa2ee0f5df8554328fb0834e2a3d43fe6520ec86e092191bbaba0f23ec33f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: ///     return distance / time  # FIXME: Raises ZeroDivisionError for time = 0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_fixme/rules/todos.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"841cf79fbddce56f3633b1edcc3473de196b3428e765894a9e974442a09f4668"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: ///     return distance / time  # XXX: Raises ZeroDivisionError for time = 0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_fixme/rules/todos.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70adeb0f7c9d178e84f5e1bfc9fba59da3f7bec43ce5d1fabb392a159880ec2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// def running_windows():  # HACK: Use platform module instead. \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":"crates/ruff_linter/src/rules/flake8_fixme/rules/todos.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a525a65c7d0c0bc40501661a1f2e9929a16493723477d158d546bf49f578d49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Handle \u0022BaseException\u0022 and redundant exception aliases. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_bugbear/rules/duplicate_exceptions.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"967ddb17070bcb0573e327feda6c209f0433d54d87afdbc13e31c946c6557bed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dylan): decide whether to trigger 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":"crates/ruff_linter/src/rules/flake8_bandit/rules/hardcoded_bind_all_interfaces.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79cdda13aecf3e7e3dddd904d4f2be97d758fa7d042563621dfb23e3e2c4e31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dylan): decide whether to trigger 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":"crates/ruff_linter/src/rules/flake8_bandit/rules/hardcoded_sql_expression.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9266dc9f5b51c41570c9b725f696dd3f312a8ba1d32409e3410f2c4bfe7dbad5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dylan) - verify that we should skip these \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/flake8_bandit/rules/hardcoded_tmp_directory.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"db79994fb81545c2b55f21cb287ebeb6a86143f6f73873fef867c0770c3f27e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually we may want to allow dynamic values, as long as they \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_bandit/rules/unsafe_markup_use.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb85414e099844b062410695ab622866df92805ecc58322712e40ae8bbaa6fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ekohilas): Replace with Duration::from_days(1).as_secs(); when available. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/flake8_async/rules/long_sleep_not_forever.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a013d81c5b13750bd7f23b23161559c049e2a265df2520d401e0889d9d7eb7a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): This should be \u0060true\u0060 under aggressive mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/eradicate/detection.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24e2b819a7dec646ae430fddeb6554e0dedeb8a0cccae829f97183aed6ec386"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): This should be \u0060true\u0060 under aggressive mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/rules/eradicate/detection.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d67342442f8cc21bf6995f33586c9b1d80f6459d35aa075cf6dcfca66c1dd1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brent) We should instead set this flag on annotations for individual lint rules that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/message/mod.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aff113abd726eab0ada41857eb1396f64673d1266f6e66630d822093b126195"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): \u0060noqa\u0060 directives are mostly enforced in \u0060check_lines.rs\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":"crates/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5abb8b09d22afbe2b393f431b5ba5977f2586dd619aefb8d858ca2962c33f95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dylan) add similar method for t-strings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"250f06bb2a7dc209f116f4df64279666ec81e662d56515a817dff278ebd4c2b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It is a bit unfortunate that we do this check twice. Maybe we should change how \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/checkers/ast/mod.rs"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"634b98b289a7d11bc158909e04ec46501a3a5c9c1e7b5d1d5f4363af4409a9ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): This should be even stricter, in that an overload \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_linter/src/checkers/ast/analyze/definitions.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b053e32c62de48cfdbd03a986fa91ab66bb825191f3794def48e14cbc16c7b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider calling \u0060PythonEnvironment::discover\u0060 if the \u0060venv_path\u0060 is not provided. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_graph/src/db.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"790217fcbc0c0575847dd081211079cd1ea0527e54e09724bad6e0e251a9085f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(konstin): The assumptions between this script (one repo) and ruff (pass in a bunch of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_dev/src/format_dev.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4837755fdd46e22c6e91ec02439fdeb383556020e64b455cdf35afebaae35c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(konstin): Respect black\u0027s excludes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_dev/src/format_dev.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8926142ec1cbf3ed06eee40f839da0d1f5e0e002e6a33cc17c4bc68d262344"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(konstin): For the real version, fix printing of error chains and remove the path \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_dev/src/format_dev.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2de6ab22d53ffd58f4da04fe99d2d0eee5ac5212214a6e53f03932dad63e3f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This is an ugly regex hack that\u0027s necessary because mkdocs uses \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":"crates/ruff_dev/src/generate_docs.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c0fe7a175a4e103e0b691efe390004fc8fb41d9748c23dba6da68c077ec0e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(brent) update this usage in Ruff and remove \u0060is_file_level\u0060 entirely. See \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_db/src/diagnostic/mod.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"6717793d69d510fdb005f2dd25ceab6cee5c20d55e37478341468119574ffb3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO better schema \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_benchmark/resources/pydantic/types.py"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeffbb3af35fc0ff391bf0853e34de0d6d1896554892167037bba5e2b00193db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # assert not hasattr(ds1, \u0022keys\u0022)   # TODO: remove 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":"crates/ruff_benchmark/resources/large/dataset.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dd6212992f7ba0b9ffa83d6a716391f20b2570352d2c78c2380b5987f00de1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # assert not hasattr(ds1, \u0022values\u0022) # TODO: remove 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":"crates/ruff_benchmark/resources/large/dataset.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"38addae6de409e1f001eb60a50236b69f8dcfa9d8023d980f4bc8e1d70894c38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO redundant 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":"crates/ruff_benchmark/resources/large/dataset.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"c091b02206c80ee81c478a526dbef0b32ebbbef715eafe1bec30512370fb4d08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove in 1.5.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_benchmark/resources/large/dataset.py"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"88150ff3572d002927774ffaed1bea08fd6e2c8cf6c19f0f517bc8b749a97f73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove keepdims in 1.5.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_benchmark/resources/large/dataset.py"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d01418a579e0b6c28a3c512ed8b79c8f7f5773d5083c14f9cc14ed156e15178"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO replace _per_ 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/ruff_benchmark/resources/large/dataset.py"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dc990d536efd44d424366141d98b00713d71c2b693a8d9e6d45fc0092db85b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implement 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":"crates/ruff_benchmark/resources/large/dataset.py"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ad96f8e7af0ae61725e3f9503cacff03fe84ca7c8224628bb293f8e1777b83"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Figure out which error would be more helpful 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":"crates/ruff_annotate_snippets/tests/rustc_tests.rs"},"region":{"startLine":4195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c078ed9950fdcfbbedade386f93715300269be2bd485bddf16a00e685efdc4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: account for labels not in the same line \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"991d6d9ff7b1104c03cdb0b2aa148fd61a42c4efe0d03a9005c0462ba91f09ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: needed? Doesn\u0027t get exercised in any test. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"27969de14e6d8d3c314a02e847445d3a0cb450e522ff93572e504a20b2513ffe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060unicode_width\u0060 sometimes disagrees with terminals on how wide a \u0060char\u0060 is. 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/ruff_annotate_snippets/src/renderer/render.rs"},"region":{"startLine":2402}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a19592f279930deca642adf4d5b257a9f896e1c04776290e5942e0a409e2bb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(konstin): This should be a failure, but we currently can\u0027t track that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/tests/integration_test.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"41212add34ce12292d610148796416f92edc049f2d7fad3bea9ee40b99b14112"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Included in \u0060pyproject.toml\u0060, but not inherited. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff/src/args.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1a83d901e27e132df2302f687addfc9255561c986be764592709ac83e78f2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Captured in pyproject.toml as a default, but not part of \u0060Settings\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":"crates/ruff/src/args.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"80021b7b0e2723e88eef4a5ad41c9949281ba8c66df27fb44776a22a2383cca9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should reference the global preview mode once https://github.com/astral-sh/ruff/issues/8232"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/lib.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d786c4bed873605151cdc0112342d8f622fe55be43c29d68b3936c0e751283"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(charlie): Re-compute other derivative values, like the \u0060printer\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":"crates/ruff/src/lib.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e01ade12ee9015c2e96d0822f7c4684f1680e2568c25369d87fdec924de147"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(brent) this offset is a hack to get the header of the diagnostic message, which \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ruff/src/commands/format.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"5922b283df5bd1d2e60c686c070cd282dc69ac8f329a5507666bf6ddf7eb664c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the lazy parsing means that we sometimes won\u0027t report malformed assertions as \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/mdtest/src/matcher.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d387dee68b8fe92a5ab1738c89d9f53622715a094b5eb59453f7789f66c1ace"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060api\u0060 is runnable (a \u0060start\u0060 script in \u0060package.json\u0060) and neither \u0060playground/api/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":"playground/api/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"973c00acfb734994dae241726121968f4ca50773d018f0f6225dba159c863498"}},{"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 \u0060python/ruff-ecosystem/pyproject.toml\u0060 makes this repository a deployable product (line 11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/ruff-ecosystem/pyproject.toml"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fffb121aea3e9d0569b4c9d6d8745e42649685332845ea3272f27ede82fb468"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022all \u0022copy\u0022 buttons whose target selector is a \u003Ccode\u003E element\u0022 repeats the code it sits on: 5 of its 6 words (buttons, target, selector, code, element) are already in \u0060const elements = document.querySelectorAll(\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":"docs/js/extra.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10f09d96ad99f97cdc846aab2e4d60b6c89d26bf9351891cd323402c4ae6900"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 6 of 58 project(s) overshoot their size bounds, lowering Project Cohesion to 7.9/10. The most over is \u0060crates/ty_python_semantic\u0060 (217437 LoC, 330 module-visible types across 23 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":"fef09f7b2112f51476d6b0ea1d7a4d6f22dfeca9f201a5bbd9a4ee2be0820c85"},"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":"7f4d30c5b2a7751823d74babf638030f45b0be37fd0c270a19656de85c41fa75"},"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":"705fd59b85a29ac3d478e934d227d62ca373b6d86db1be71f486eeadbc527fa6"},"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":"fb17b69ec1007f3eb89be001fe1db8b9ff56d158ec30d9013887449d05d1f7a9"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"61d50eee172542849198dd05c8beadcc75c27a533ee7a1d408171a46c7b41153"},"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":"9588459c45fda6212fd4a417761e71b43fa93cf868b535bfe864f891a90f53f1"},"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":"f11009f8d4d6336122c3c8e873a1829c78f1577e93d818c80436ed6403f8bc69"},"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":"e34065df89fb56d5c28b41e2a56f7e62c7dfd4716b112f66612d1322d25d9ad2"},"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":"a5b49ce3c22a83e41e6ff70575880894c4dbdb03250c80bab2fff396c8794033"},"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":"84a06cea772de2c8234109db8eef2abfd7ba6da168c0784205dfea58786cfc3c"},"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":"6c083a5fc87af9ecbb4fdcb766c5649e0b0f166c781d7543d02453b22232c58c"},"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":"a3e637368cad506754994ad8a9f2f1b36e61aa649b1c9abd73bd83bd831b56a4"},"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":"571943bc74b6a2d9b3428d9061403110543086388dd2d2d3e038fc3e8da92538"},"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":"e16996616743feababc14eab688b027a4b0c78c70e53792a5407d8eaa5de9c5a"},"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":"eb14241482e4ef81fa91be215a2fc474c45cee03639901907cecaf7f25dd6f1a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d73f73c87e27aaf408346dc8ff4d59468d97e97d9f0ac5b41f2d839b07895730"},"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":"cd3e7b1a3aec8c457e9485b430dcde78d226639389a2dc3471688fd3c98d05a4"},"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":"f1944c53cef72755068323753206527a772ef2a6548c8f6a8b574613b391969e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7195cdb31001e2f57a3d2a31b206cab0b2bb141c721702161cd0745971d9b07"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a88cbd846c57a6878aef399d2075ceb762336589cfd298ce22a261f3d7db2fec"},"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":"236f34b72b6fbc185e65fb7925c9552fbbe6b95c37af7cf8b8e78556ed1465a1"},"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":"c4d360ebb50b204ac1660e067d65e7b13649689a8936f0df189b04eea7387497"},"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":"330e81c02d345cecf870278ec05e7182ed68355baa72c21c5b042a734210b1b7"},"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":"a3ad19f275c7ece5a22b502cdd34fe923372ee17ea2977dc5ed85d05047e4d61"},"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":"dd174b281f180ec11f09793d98730dc23df139fb2197d758160bc99840e56e44"},"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":"c5f97b4f771c65ec8ff32c249f2244a3591256cd09dcd4a36311fb9edf984400"},"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":"e5543f31b8d8857b7f744f0f278e978419c65072ec12b622d38fba26964f37ee"},"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":"783eb54a929b4746cace279a18bdb32e9fc73c07e09e5a85eaede537c16d48fb"},"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":"0bb3a0d9fc4f330830df562549c8bf158b99417108f873290afde9cbfd0afbd6"},"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":"66db8e1927bd965082c8a69384271c607257c1573e12a5e2d504f458e2e97838"},"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":"585c74ab7b8e1720db42064c299e27690f16d93d382b44117abb919d602aad21"},"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":"07a6aa53a73fbfcf23b2b57b86fe22354f97016a0f5273cd0962f0efc1f48454"},"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":"c009392ecc6e4cff97f9d631ac0e2ce4bad9d6b17d9c2b79045b8f22593b794d"},"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":"10b215e20a001e8089ad67e512663d529c83844d35a671213c154ba010752651"},"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":"1cff07e4933c6092d454a2e674a8db6b42601c15e12ddf3233f694bedc2a6380"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"93cd22d7ba769b9b7b861ff06355a1a9277e43c86e1030daa51b5d79d098600e"},"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":"9e6c6c10ffff2e1dbacb3f4ccd625bd15c6a949055d41496dc87372c1b4e3618"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"953f9055897a823a061085abf189df239ef4980e00b5b874b6e786672912061f"},"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":"e7d5ba7205205259b4e11431e73957390c17985cfe74942e8d86bd16689ee514"},"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":"18120f961a3444d4a0897cbe6db71954d429f5d81c54fe3c6af44799cf9d2954"},"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":"1d7fc01db1736e045dbd6ee2741929feb597a1340cc236e6124de0051a970a9c"},"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":"944d21fa8b86a7213ef530244ad44c7732d7094ed96fde4d4050e0cd31ab6308"},"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":"fab6e8a5725d1609542cf6c557c7692d54f6b2566c12193f496c202cfc492385"},"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":"c6ef2f316ca631b692d03c475bed7e473e93f3db6fa35d9ef86248c50808e234"},"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":"fd34071f0a37397b22950926e6e7d533f19a1ab2e35c80a3ec230eef7195ce4c"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"a5a94de598d5f66dcc4ccfd4adeb9bbd82d59e61120ddfa86a1354ef816f7094"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"94112b1d706b2f9d9118c577518290919c2d702aa0b944fa06a5bcbb51101185"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"5cd6ba725d4cfdefa0b9a1fc9a630396a4a700aff93699a8233f4a088607d6d7"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"5c802ec97e672feaa32f710e6686a62b890e325cf5a04a8fb4136422a8a2ef74"},"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":"e511d4aa9f4a8e0648920c4027b41b4a7f5a87483dd4c27f4e6d8c7005a5b11d"},"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":"b0c9b44ff1a7ba4933d3bcbabee2db51350f5cf83c9dd504f69735e26aea1355"},"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":"a77a628c056f00bc475a03de6d7c923f8e07a855e9b4fc652986cc61cd3be665"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"eaa991e27c368b8daecadf5547bf3191d11594140eebc1c6646e7d6472385133"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"0e9844509aac6c1cc8f68a0aa4f363efdfb95d6581f82a0b9461659111d83b27"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"6c668fda278b1e3f96d06b320aaee84004f1ac56935ced39d9e1754d9c5a729c"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"40359a1a68eaea2e8dc361c98edc2a0c569ae321941fc6412aa57865b6846225"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"ce4087d418c2fe9d10034c49004be207b9589786a119e329c0f6206c94e20e81"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"408ebbe315a8a9adb76cbfddf3d85e0f12e5a31095af4f07590d7ad012da3025"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"f1e69e114a50da4cf732ba8f7b824a5352e5cf23fd3e47d85ec4ca4c3596f26b"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"573daab483ba2a7f357ed886dae3f03a78423b09504e884f1842b62e513da6d1"},"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":"f65f5d67d5cdfa87fa3b03201bd8d29851f2e56c872e3d526c189237068254b6"},"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":"7e5482bdd0f63e80253d48a60bb71e64164382bd63a3e3cf7bd09d4f38f813e8"},"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":"e02ac32a68c20f8dc96c46a2e59659e38644c79fceb73e4bbe15b62478e278a9"},"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":"9fe7900b1507263949f4284af7dd6a6d6c4ca9ff4923bff70f5222abbc0a0c03"},"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":"e772d23b1d0628acd68daf76c0965991de89c5cb77c7d3e4c63a484ba59a7fe8"},"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":"9fc806bcb87540f176eacfaf2fd35adbe1e18dbbbd0f43507881075ed91fff96"},"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":"ca146dc8f2bd0262df84195218f92e6e1cfbd6b24ecd6ccb40d64f7f2f1026a9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f395c82cbaf44d1a146242e8b8a0d4f983ecbc687035a89e5b65f4fb0c603092"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ffd0dc2e1e3736472d9f33679a276d6d103edbd7fb78d75da9eecb21a098f09"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fae417b32cf4bb36c419d5ffc64fa714110f3257f8532f931c965d742214095"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bc8a54ea08cc820a67c8004a2fd3b38bb1e1229a986c8c1c2f20970b771ec44"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"88328c4ea99e344226a8e4933d7d7f7a3be08b7c1f0cf8aba09e519fa234c88a"},"properties":{"dependency":{"package":"dompurify","version":"3.4.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"d469c4cdd0b2892278c4ee90c01a5a8ea4872a98733c483777e04c904cfebdfc"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","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":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.5","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D31","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":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","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":"be9c57e2fb625c43c271d051f76b97f27b6976f4ec358ef8fea1d9cb5205f460"},"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"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","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":"becbc5502f94878197b05d70c7ef15f1353fd99a90efcb824b9c43f11ae5ce7a"}},{"ruleId":"D31","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":"9b15183b821b0d8f2a8a9a4a501e7e6d43815f083fe597ec3f99fb39c4628148"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 95 of 1433 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; 1433 of the 2875 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/ty_python_core/src/builder/loop_bindings_visitor.rs, crates/ruff_linter/src/rules/flake8_copyright/mod.rs, crates/ty_ide/src/call_hierarchy.rs, crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs, crates/ruff_linter/src/rules/ruff/rules/assert_with_print_message.rs, crates/ruff_linter/src/rules/flake8_todos/rules/todos.rs, crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs, crates/ruff_server/src/server/schedule/thread/priority.rs (and 87 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder/loop_bindings_visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"874b6e9588d7b60d935e0806204c40a17e08e6bb663cb18ceb9145bf252f9b3e"}},{"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/ruff_linter/src/rules/flake8_copyright/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c96161e32fcca90a3d8d55feaeeba5ceb68d53f6fc8b10d1f4299b2a946d01"}},{"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/ty_ide/src/call_hierarchy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f576c91c020a03f1f3d41398c0ba79d779f6ec53308cf2ea3115339c922681c"}},{"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/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec9b1c51857467d010cd76e68198a98b0cd66060512b68a32b911babfff7a28"}},{"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/ruff_linter/src/rules/ruff/rules/assert_with_print_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f40311d7ab9bb5b0bbba7fa2b819dae3c62756aa780fa4a1c67766121eca0d"}},{"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/ruff_linter/src/rules/flake8_todos/rules/todos.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7778e7cce683d95fe052016a172828a88f034e09f815cb65a46fda3e6ee1cb9"}},{"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/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cc1d36c385d44efbace36a2c314f48331e5c4c16722f4e638efc09f28c0ec9"}},{"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/ruff_server/src/server/schedule/thread/priority.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f571730a1675eee38256592652d356fa6077e3a47b1890efa46d5d90a4db8d2a"}},{"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/ruff_linter/src/rules/ruff/rules/invalid_formatter_suppression_comment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8253211fb6a3b2384cdc16ad08b379ce7fe5de772cec92bc9eb49c143badc3"}},{"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/ruff_python_semantic/src/cfg/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9992d4a798946a591e16d9ebd162c9252af00d6601a3a83b77bc7bacabd14552"}},{"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/ruff_linter/src/rules/flake8_async/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3bf15412bc12fcefc44805d6e01b6843a9a7431544e7768b832ea237c53dff"}},{"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/ruff_linter/src/rules/pylint/rules/non_slot_assignment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"669cc931cdb3c7d994303573df5bbf6e702289d8064fc0e718b734aad890004d"}},{"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/ruff_linter/src/rules/flake8_pyi/rules/unnecessary_type_union.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7629ff45c441751d85ab9aca06f307551eab38e926f93d42224e96b779a4da"}},{"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/ruff_linter/src/rules/airflow/rules/moved_in_3_1.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"490a8d67c3adbe765519ad504fabb12bf1aa1e1cb42ac92a0a40e35288b29de9"}},{"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/ruff_linter/src/rules/ruff/rules/needless_else.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba26af8e5c7962001c4c6b711c9304b124efb9ffef953fd4df016bf0f201ed9"}},{"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/ruff_linter/src/rules/ruff/rules/suppression_comment_visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4e84eca7320e85aaa205d2662f7504f7c1ca5bb5b69856e72f64767053b894"}},{"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/ruff_linter/src/rules/ruff/rules/useless_finally.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43788fb635ffd447aaa93c21835ad475ce9ce7349a6f8a2dc05bfba126cc64ad"}},{"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/ruff_linter/src/rules/pylint/rules/swap_with_temporary_variable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bccae940df91de7fb59e6682e353848c99d7ce3eaf7421ff45ae10cdd8bb3ca"}},{"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/ruff_annotate_snippets/src/level.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4520153bcb27cfb60b29a2383df255b6db53cc7aa09fd814f1707a4c1625c294"}},{"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/ruff_linter/src/rules/ruff/rules/class_with_mixed_type_vars.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5207600fa8a273cf7cfe8b7c7a5b0c9068092e2e0b644f7367248c9cf47cbfe3"}},{"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/ruff_linter/src/rules/refurb/rules/fstring_number_format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d6f906873150e7d76e9b7d5c6c1b2563a58dd7a90523998df2b5a29cca4dee"}},{"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/ruff_linter/src/rules/flake8_use_pathlib/rules/os_stat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d143edd35a63f534495a4e401436804701140d15cde837bf2c5be6f45c115d"}},{"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/ruff_python_semantic/src/cfg/visualize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26b9bb6157a2cae39fc94934d3080d261f2d7ed772220d5b68a422a5f8facd5"}},{"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/ruff_macros/src/rule_namespace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d5a6b31a97b1476e31edf24ab68b2b57efb4007a7e41e42d1b4dddfddfd9b5"}},{"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/ruff_linter/src/rules/pylint/rules/no_method_decorator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a43fea2408c7d3343be25b3bb06956b01c30411bf8a2d0618824fc3ad8bea9b"}},{"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/ruff_linter/src/rules/pylint/rules/redefined_slots_in_subclass.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"656b2feac46a24df031700836df09dd95d95456caaf384877d5061310692a638"}},{"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/ruff_linter/src/rules/refurb/rules/bit_count.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1039dbe9cfa95472c87293eedb29574892d2d88aad9e9eddc4b441dc88122b12"}},{"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/ruff_linter/src/rules/pylint/rules/dict_iter_missing_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3038ecc7f7e4e4703cccf6c0a1ba670b41a6acc214708fb2fccafed17fda8f"}},{"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/ruff_linter/src/rules/flake8_tidy_imports/rules/banned_module_level_imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5931c73ae52a64e536ca5eb31c61d205573d5904ec22dd492d0ced00af5b695b"}},{"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/ruff_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda5af907f31c314b48dc74c1a608a20feaf1bfb18d711f915d8271f937d403d"}},{"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/ruff_linter/src/rules/refurb/rules/list_reverse_copy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"184839f64dbbc495e2d6262b91c6729a1d1921b11df91b8f2947b24dff87548e"}},{"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/ruff_linter/src/rules/pyflakes/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46ec3b59a281d10e9c4ec187c320674bc0a990cd99e7e09c3c2d44e41933235"}},{"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/ruff_linter/src/rules/flake8_bugbear/rules/return_in_generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2663bb082767800be6c781651d6c4014c7acd7f6ad6484226e2678a90511d8"}},{"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/ruff_linter/src/rules/pylint/rules/self_or_cls_assignment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"080f442f90965a360ee8aa07db54ac9fe87ba8442b7c6e97766ee162accff4ea"}},{"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/ruff_linter/src/rules/flake8_bugbear/rules/except_with_non_exception_classes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bf5639376a23ebb84c0562dbda7a66462969738659774f084979fe1fb7c282"}},{"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/ruff_linter/src/rules/flake8_bugbear/rules/delattr_with_constant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feec347c25f255ed00813875bc6dbdc1a244dfdf2cf1e01432438dc548030d35"}},{"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/ruff_linter/src/rules/ruff/rules/redundant_bool_literal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26289eb0e2fb0bcdca423613c4069ee88495bba9aed03fa3f014a2d7617adba"}},{"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/ruff_python_formatter/src/expression/expr_yield.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d99687cfb73ccfd9ed81958f63396d40ffdabd61c4e7fbdb28a017a652a7f5a"}},{"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/ruff_linter/src/rules/flake8_pie/rules/unnecessary_spread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"785059cc1a13af3ade39d8083dd1cd2b1e0255e7e5d21f3f6317fb50fc2ed7a5"}},{"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/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7373e217c492413bd79981228dca0ec8a71fc880bb152c2afd038222a1d1c7b9"}},{"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/ruff_linter/src/rules/flake8_pyi/rules/redundant_final_literal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fbd47c02ba38d693e77c2c194a4a106f4228daad39810120a561bad7f6f864"}},{"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/ruff_linter/src/rules/pydoclint/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95084ab34c00f6f582469928176e089f4c407cb2ae6d2d4512fa6a3d0cc0bdc8"}},{"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/ruff/src/commands/completions/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d22691da3f2ecec11ee62064c7df1ac765df5a72ae357810bc52199d4b331b"}},{"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/ruff_linter/src/rules/refurb/rules/repeated_global.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d41337f526085f8eed4b08dc0a8f49d8c195558fca02b50bad0479b5d9e029"}},{"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/ruff_linter/src/rules/pylint/rules/too_many_nested_blocks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf7734ab75e25ad81568f63671674b4559faa8122424a2c898872c402746746"}},{"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/ruff_python_trivia/src/comments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7a7c0f9ff7ebb7c03e9ac91fe83b87933d014fbf8af486ff9541694909caf6"}},{"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/ruff_linter/src/rules/ruff/rules/incorrectly_parenthesized_tuple_in_subscript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89259301c58d15b0dbcc2c216bf5563c45abfcd1bfd54d28c966bf564b97169f"}},{"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/ruff_linter/src/rules/flake8_pyi/rules/type_alias_naming.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c90ca843a3f3871152ff7dc80f6853fdd75a17181e92dc1008e8ed20b9df2bd"}},{"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/ruff_linter/src/rules/flake8_bugbear/rules/class_as_data_structure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0e4497ca31d5a6c9cb31572c6892663fff92ed761fd00d630372d4145fdd4b"}},{"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/ruff_linter/src/rules/refurb/rules/readlines_in_for.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5fd92a9a4acc144687b2e763f6c3a8dc08dd90120da876d32f1a3682e8300a"}},{"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/ruff_linter/src/rules/flake8_datetimez/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9586906cc90553140f69220de321449c1a4661115ba10a79cd8759548f1b510c"}},{"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/ruff_linter/src/rules/pylint/rules/empty_comment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76bf5354dfd204e479b7eb5f4546fdf96fe66da6bf970d1b5dd3a0f6d4e9ddf"}},{"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/ruff_macros/src/rule_code_prefix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a07f533bacab774af07ee24fb75d7bd1fc6232d37bbcb3ccb8f103996da8a16"}},{"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/ruff_linter/src/rules/refurb/rules/int_on_sliced_str.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3e4c59c05cf1fea10e324e23a2ef6c3e1821551de91fe2702d15ce8020635b"}},{"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/ruff_linter/src/rules/ruff/rules/map_int_version_parsing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebe7b4e379391e2b7175b82994a53d6776a40d8dc43aad38d9003e790fcc18b"}},{"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/ruff_linter/src/rules/pylint/rules/super_without_brackets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8765d531c2ae82932934f126135291f6b3197dfec5410e149b370b4ca739a45c"}},{"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/ruff_linter/src/rules/pylint/rules/import_outside_top_level.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd21ed5088a9f2aeccd351d37cc759b8343b471228ef1c4cdd86d2731d84c53"}},{"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/ruff_linter/src/rules/refurb/rules/hashlib_digest_hex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"108c90fab4c467604bdc88ebc4e3afa4444b806debc311d393d688b14c707c4d"}},{"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/ruff_server/src/server/schedule/task.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d95d400c7fe5bf440b972d3f8aaa13226b602e4e2e8e7349f1709ada7086fad"}},{"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/ruff_linter/src/rules/pylint/rules/non_ascii_name.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac6457d007c558f81f0bf57f7d218790904054ae35ed2e12f1f278271bb153e"}},{"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/ruff_linter/src/rules/refurb/rules/regex_flag_alias.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbd9f24ebddb3138718909fe1e9ad8facea6273e3486e0f86b94bee25a868e9"}},{"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/ruff_macros/src/derive_message_formats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2b3e9945658770ed552b792dd98ff5165167ccfb218406258e4cca72be9a1c"}},{"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/ruff_linter/src/rules/pycodestyle/rules/multiple_imports_on_one_line.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"098fdf02f3464378cd148aab78a1f1bb8a8968641da21e15084285b8fd7d0988"}},{"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/ruff_linter/src/rules/pandas_vet/rules/nunique_constant_series_check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5c5578ab81a1e526c8dc51234cc8c64e0163eb658ca6c665d60f0c5e61183e"}},{"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/ruff_linter/src/rules/pylint/rules/nan_comparison.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe401943c942402723cd7256c681e71356b9780f67eb3fe3a38785704b8d5b2"}},{"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/ruff_linter/src/rules/ruff/rules/property_without_return.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1431f7dd4095a8573a8db8f717dab073430c4bbfb8b03fe111899a52e3a1f2"}},{"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/ruff_linter/src/rules/refurb/rules/hardcoded_string_charset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"164088b54aa98f6ede54b9144007e8a1b29501e3efff82296796238b0b2733de"}},{"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/ruff_server/src/session/capabilities.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c515be1ceacf425c8008e80947d88b181ccec08d95db8da3e8a8de4d1e0fe35d"}},{"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/ruff_linter/src/rules/flake8_pyi/rules/bytestring_usage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adac821005c7c5b1b53efefbc2daf89e5a16a5da2057e6fe757df8140641dc4"}},{"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/ruff_linter/src/rules/pyflakes/cformat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a4ee7429ca7d879cd007e03dfb9208a8a5ea64e99884e3b69fbdd8114f9c76"}},{"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":"fuzz/fuzz_targets/ruff_formatter_validity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"603ca36ecabdda8a4559fe0170f048db0d90cc71af673ec75102cf52b6954a5a"}},{"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/ruff_linter/src/rules/perflint/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdc0a8f8c754179baa447f7df3f049c9365edb0712520d0116abf66da0dfe75"}},{"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/ruff_linter/src/rules/pylint/rules/bad_staticmethod_argument.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"722cb760917a4bc9e9735843b7b39b94051d5d49208f2db4e9d957769b89b940"}},{"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/ruff_server/src/server/schedule/thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c085b62be0d11f019f5ce2aa6f582fcd0016f973b1a84835fe03930eacd9de94"}},{"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/ruff_linter/src/rules/pylint/rules/unreachable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41618d6dc666a9ddba95a300c7479ddc4423567d89ba2276d51a418ac2ca6ead"}},{"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/ty_server/src/server/api/notifications/did_change_workspace_folders.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eb8bed7fb00a0194e1109bbb446445a0198349a40137043fb2c95f91757a42"}},{"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/ruff_linter/src/rules/flake8_bandit/rules/django_extra.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9254a8a9b81aa6d3b8ed4619f4ca9bfefa0762b8bc16d267bee81f02bfbf842b"}},{"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/ruff_linter/src/rules/pylint/rules/too_many_public_methods.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caaab4c4b1f232d925a308a7e8476383ff286f0d8719a22ca3d5e84b3aba1364"}},{"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/ruff_linter/src/rules/pycodestyle/rules/logical_lines/redundant_backslash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"969c91b21198eea0fa807ef11149a1d2e57e1cd7a8ce420aa854e4f83d3c1e7b"}},{"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/ruff_linter/src/rules/refurb/rules/implicit_cwd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63aee693548e4de300322c620b8972d91d7498755a3d5fa3bd17ed36fbb52a0b"}},{"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/ruff_annotate_snippets/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1509b9476bb45bf34fad3664672e0d0d3d42611dcf2bda6dc814f11ff5d2dabc"}},{"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/ruff_linter/src/rules/airflow/rules/dag_schedule_argument.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83a3b6ce0bc25d697d1b89657a3a2e66ed68ec5fca1a0cf03eb70e596f7cac5"}},{"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/ruff_linter/src/rules/numpy/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3219d1faeadeffefdc359b5fe7dd857e165c62815d08aae25c9207b0bc29ee"}},{"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/ruff_linter/src/rules/flake8_simplify/rules/fix_with.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6a43c87fd21f99c7b9b0c3924a011d43e155168b4a26102ad8a9e2b765228c"}},{"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/ruff_linter/src/rules/pylint/rules/too_many_boolean_expressions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1240054d64747c41197d4207bd210cbd5571b29d0533a146c2f0fc8581efffce"}},{"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/ruff_python_formatter/src/other/alias.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec36409346bbe54f2ca8b04ca84fb69e5227276927520e7db2f848b0ccdb2fd"}},{"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/ruff_linter/src/rules/flake8_bandit/rules/ssh_no_host_key_verification.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7a5ff644139f99faa2304c9bc3785a7dcbc8c98d558753c19b25f36001b750"}},{"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/ruff_linter/src/rules/pylint/rules/redefined_argument_from_local.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45230e2a5f34ebdd131571a18e1227d17d8480064e8799c1936069193b0f0f9f"}},{"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/ruff_linter/src/rules/pylint/rules/shallow_copy_environ.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea78e116514116457a4d2e6080d780c6d5ee4177d116b751ba75e29d71bb61ff"}},{"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/ruff_linter/src/rules/ruff/rules/implicit_classvar_in_dataclass.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ece13d59f29558b1ce7cc1e9aada3d8d57c132b2520328ca457c7a2f12bfe2a"}},{"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/ruff_server/src/server/schedule.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea65ea1d556857f986453a3827892a326c272d2af64d44f41c10c59aea8239e6"}},{"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/ruff_python_formatter/src/other/interpolated_string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7732b8d55e17ba3d33159ac548809dac4dd32dc6a8bacadbd97fcb7da885a259"}},{"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/ruff_linter/src/rules/flake8_bandit/rules/tarfile_unsafe_members.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4074d2687c4f3d1d5cb56f7211beedf06afb8307da1a0fac4cb959c51e3c16"}},{"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/ruff_linter/src/rules/pylint/rules/continue_in_finally.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de24750729f7bcee015d978504173a70ddf884eb4b5fc949ed80bab5c254ced"}},{"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/ruff_linter/src/rules/pylint/rules/non_ascii_module_import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bec7d382900931929f8370389651b6072bca6ea0f908616208228b6c3477a7"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: db.rs \u2194 ty_check_invalid_syntax.rs: \u0060crates/ruff_graph/src/db.rs\u0060 (context crates) and \u0060fuzz/fuzz_targets/ty_check_invalid_syntax.rs\u0060 (context fuzz) sit in DIFFERENT parts of the tree yet change together 56% of the time (10 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060d6a7c9b4\u0060 [ty] Add \u0060respect-type-ignore-comments\u0060 configuration option (#22137); \u00609393279f\u0060 [ty] Limit shown import paths to at most 5 unless ty runs with \u0060-v\u0060 (\u2026; \u006099d0ac60\u0060 [ty] Track open files in the server (#19264) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_graph/src/db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"804286eb08fd861e6d60bb5fcf91109db0907c6536347f7499d01301cb33c7f6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: fix.rs \u2194 lint.rs: \u0060crates/ruff_server/src/fix.rs\u0060 and \u0060crates/ruff_server/src/lint.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 \u00600d804975\u0060 Lint TOML files in the LSP (#26862); \u0060d8bc7007\u0060 LSP: Add support for custom extensions (#24463); \u0060e0704ce3\u0060 Exit earlier in LSP when source type unknown (#23874) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_server/src/fix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"459629e836ce5df0381922d956c652bf6804dbbb82ad10d56350b894e1dab072"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: re_exports.rs \u2192 dunder_all.rs, class.rs, infer.rs: \u0060crates/ty_python_core/src/re_exports.rs\u0060 changes together with 3 other files \u2014 \u0060crates/ty_python_semantic/src/dunder_all.rs\u0060, \u0060crates/ty_python_semantic/src/types/class.rs\u0060, \u0060crates/ty_python_semantic/src/types/infer.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":"crates/ty_python_core/src/re_exports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b3602067088af05911b7859f475becad5724944be9aafa1fdf0e031e2b4e83"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: dunder_all.rs \u2194 class.rs: \u0060crates/ty_python_semantic/src/dunder_all.rs\u0060 and \u0060crates/ty_python_semantic/src/types/class.rs\u0060 change together 67% of the time (10 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 10 shared commits counted here, the most recent 3 are \u0060e2e1e647\u0060 [ty] Remove excess capacity from more Salsa cached collections (#25411); \u00604bd03427\u0060 [ty] Inline cycle initial and recovery functions (#22814); \u006083a00c0a\u0060 [ty] follow the breaking API changes made in salsa-rs/salsa#1015 (#21\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_semantic/src/dunder_all.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a251b4f6239d7811b5bde2623767ceed08a8d59896803d581b8580a435a62e3e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: requests.rs \u2192 lib.rs, capabilities.rs, server.rs: \u0060crates/ty_server/src/server/api/requests.rs\u0060 changes together with 3 other files \u2014 \u0060crates/ty_ide/src/lib.rs\u0060, \u0060crates/ty_server/src/capabilities.rs\u0060, \u0060crates/ty_server/src/server.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":"crates/ty_server/src/server/api/requests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96c6c118c9f7479d0eced9f633078aaefe8119c2b1bb0f51882904e944641d5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: symbol.rs \u2194 infer.rs: \u0060crates/ty_python_core/src/symbol.rs\u0060 and \u0060crates/ty_python_semantic/src/types/infer.rs\u0060 change together 61% of the time (14 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u00607d31eb42\u0060 [ty] Compute reaching definitions from inferred deferredness. (#29685); \u0060827456f9\u0060 [ty] more cases for the class body global fallback (at that commit the file was still \u0060crates/ty_python_semantic/src/semantic_index/symbol.rs\u0060); \u006041463396\u0060 [ty] Add a subdiagnostic if \u0060invalid-return-type\u0060 is emitted on a met\u2026 (at that commit the file was still \u0060crates/ty_python_semantic/src/semantic_index/symbol.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/symbol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6137f48786ff4f6c5482a763a064437ac7be9c219abf5086277c2594af1b54a8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: check.rs \u2194 test.rs: \u0060crates/ruff/src/commands/check.rs\u0060 and \u0060crates/ruff_linter/src/test.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 6 shared commits counted here, the most recent 3 are \u00601267effe\u0060 Use the shared diagnostic rendering order in Ruff (#30291); \u00607060eed2\u0060 Clean up \u0060Emitter\u0060 trait (#29680); \u00608cfeae89\u0060 JUnit output for \u0060ty\u0060 lints (#22125) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff/src/commands/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1298c94c541c71047029731785fc0c1aeec34904d07e55450c982d6acf7336ec"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: preview.rs \u2194 violations.rs: \u0060crates/ruff_linter/src/preview.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_use_pathlib/violations.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 6 shared commits counted here, the most recent 3 are \u006099d68da2\u0060 [\u0060flake8-use-pathlib\u0060] Add autofixes for \u0060PTH116\u0060 (#26460); \u0060bfb09024\u0060 [\u0060flake8-use-pathlib\u0060] Add fix for \u0060PTH123\u0060 (#20169); \u00600be3e1fb\u0060 [\u0060flake8-use-pathlib\u0060] Add autofix for \u0060PTH211\u0060 (#20009) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/preview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed52f876e26a6467da1c8c444d320ad1011fab25a6383466746b925cfa199d31"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: builder.rs \u2194 narrowing_constraints.rs: \u0060crates/ty_python_core/src/builder.rs\u0060 and \u0060crates/ty_python_core/src/narrowing_constraints.rs\u0060 change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060a5ef1f43\u0060 [ty] Add assert_never fixes for redundant final elif branches (#28178); \u00607e315717\u0060 [ty] Propagate narrowing through statically known branches (#27752); \u0060b708d72b\u0060 [ty] Add dedicated TDDs for narrowing constraints (#25834) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffe5f34568995e254a4572dc1338bbb5303598a20b555a5762f54ba0550868d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: expression.rs \u2194 codes.rs: \u0060crates/ruff_linter/src/checkers/ast/analyze/expression.rs\u0060 and \u0060crates/ruff_linter/src/codes.rs\u0060 change together 55% of the time (67 of the 121 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 67 shared commits counted here, the most recent 3 are \u0060ff1770df\u0060 [\u0060flake8-async\u0060] Implement \u0060pytest-raises-exception-group\u0060 (\u0060ASYNC401\u2026; \u006019c01a66\u0060 [\u0060security\u0060] Implement \u0060tarfile-ignore-zeros-true\u0060 (#28680); \u00609525a0c4\u0060 [suspicious] Add \u0060shared-clock-mock\u0060 (#29074) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/checkers/ast/analyze/expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48556b9db214989b42b6deaafe5f55013c75efa45797002005bf3f8b2d834fa0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: goto_definition.rs \u2194 ide_support.rs: \u0060crates/ty_ide/src/goto_definition.rs\u0060 and \u0060crates/ty_python_semantic/src/types/ide_support.rs\u0060 change together 54% of the time (19 of the 35 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 19 shared commits counted here, the most recent 3 are \u00609d07aa09\u0060 [ty] Support comprehension walruses in IDE features (#26476); \u0060986ea67d\u0060 [ty] Implement LSP \u0060textDocument/implementation\u0060 request (#25410); \u00600909c7ec\u0060 [ty] Follow aliases when resolving stub mappings (#25328) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_ide/src/goto_definition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0548e183a76b57728751be4a165a7c2a8095755d96f6b595fa6db62e493517c6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: testing.rs \u2194 options.rs: \u0060crates/ty_module_resolver/src/testing.rs\u0060 and \u0060crates/ty_project/src/metadata/options.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00601dcdf7f4\u0060 [ty] Resolve python environment in \u0060Options::to_program_settings\u0060 (#1\u2026 (at that commit the file was still \u0060crates/ty_python_semantic/src/module_resolver/testing.rs\u0060); \u006076387295\u0060 [ty] Move venv and conda env discovery to \u0060SearchPath::from_settings\u0060\u2026 (at that commit the file was still \u0060crates/ty_python_semantic/src/module_resolver/testing.rs\u0060); \u006088866f00\u0060 [ty] Infer the Python version from the environment if feasible (#18057) (at that commit the file was still \u0060crates/ty_python_semantic/src/module_resolver/testing.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_module_resolver/src/testing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c07e5559de219aa27c76d7d8dec9a649a675d4eddc91ff208f76053c1cd10f4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: testing.rs \u2194 program.rs: \u0060crates/ty_module_resolver/src/testing.rs\u0060 and \u0060crates/ty_python_core/src/program.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00601dcdf7f4\u0060 [ty] Resolve python environment in \u0060Options::to_program_settings\u0060 (#1\u2026 (at that commit the files were still \u0060crates/ty_python_semantic/src/module_resolver/testing.rs\u0060 and \u0060crates/ty_python_semantic/src/program.rs\u0060); \u006076387295\u0060 [ty] Move venv and conda env discovery to \u0060SearchPath::from_settings\u0060\u2026 (at that commit the files were still \u0060crates/ty_python_semantic/src/module_resolver/testing.rs\u0060 and \u0060crates/ty_python_semantic/src/program.rs\u0060); \u006088866f00\u0060 [ty] Infer the Python version from the environment if feasible (#18057) (at that commit the files were still \u0060crates/ty_python_semantic/src/module_resolver/testing.rs\u0060 and \u0060crates/ty_python_semantic/src/program.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_module_resolver/src/testing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23dbdf19a4f5b7ef21f3f6cbed21e827bf4ebd009e36b5509befe5ffaea3387"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: moved_to_provider_in_3.rs \u2194 suggested_to_move_to_provider_in_3.rs: \u0060crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/suggested_to_move_to_provider_in_3.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00607fee877c\u0060 [\u0060airflow\u0060]: rename \u0060AutoImport\u0060 as \u0060Rename\u0060 (internal) (#20563); \u0060c452a2cb\u0060 [\u0060airflow\u0060] Move \u0060airflow.operators.postgres_operator.Mapping\u0060 from \u0060\u2026; \u006099cb89f9\u0060 [\u0060airflow\u0060] Move rules from \u0060AIR312\u0060 to \u0060AIR302\u0060 (#17940) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/airflow/rules/moved_to_provider_in_3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c15f802758cc44097a2f1790356faad8707289be80e19c0ec0048ef5c95b84"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: preview.rs \u2194 mod.rs: \u0060crates/ruff_linter/src/preview.rs\u0060 and \u0060crates/ruff_linter/src/rules/flake8_simplify/mod.rs\u0060 change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 8 shared commits counted here, the most recent 3 are \u006051f179e5\u0060 Stabilize checking additional key expression types in \u0060SIM910\u0060 (#22976); \u0060c780e7b7\u0060 Stabilize the fix for \u0060SIM905\u0060 when \u0060maxsplit\u0060 is provided (#22975); \u00608a85a296\u0060 [\u0060flake8-simplify\u0060] Apply \u0060SIM113\u0060 when index variable is of type \u0060in\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/preview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df5d0925896a4ebc83fb65d9a3db51a3127fddf4fa7ed7ac7e912921308bd5b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: builder.rs \u2194 dunder_all.rs: \u0060crates/ty_python_core/src/builder.rs\u0060 and \u0060crates/ty_python_semantic/src/dunder_all.rs\u0060 change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 8 shared commits counted here, the most recent 3 are \u00603ac6b4c3\u0060 [ty] Represent uninhabited truthiness explicitly (#28843); \u0060e7f1c3bb\u0060 [ty] Introduce a helper to centralize logic for resolving modules ref\u2026; \u0060e2e1e647\u0060 [ty] Remove excess capacity from more Salsa cached collections (#25411) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b23e775af2b512b811025506bb117492f7d74a67fdb9910db3ef5f4e00087d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: removal_in_3.rs \u2194 suggested_to_update_3_0.rs: \u0060crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs\u0060 and \u0060crates/ruff_linter/src/rules/airflow/rules/suggested_to_update_3_0.rs\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060f055f393\u0060 [\u0060airflow\u0060] Add ruff rules to catch deprecated Airflow imports for Ai\u2026; \u0060d38a5292\u0060 [\u0060airflow\u0060] warning \u0060airflow....DAG.create_dagrun\u0060 has been removed (\u2026; \u00607fee877c\u0060 [\u0060airflow\u0060]: rename \u0060AutoImport\u0060 as \u0060Rename\u0060 (internal) (#20563) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_linter/src/rules/airflow/rules/removal_in_3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda932d236a6e94e3968b0a403b2408358e2dd4fc4fa8fc1d81fa70e746ad575"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: use_def.rs \u2194 unused_bindings.rs: \u0060crates/ty_python_core/src/use_def.rs\u0060 and \u0060crates/ty_python_semantic/src/types/ide_support/unused_bindings.rs\u0060 change together 50% of the time (6 of the 12 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 6 shared commits counted here, the most recent 3 are \u00602668df9b\u0060 [ty] Preserve declared types in exception handlers (#27817); \u006052637fc9\u0060 [ty] Store loop headers in use-def maps (#26266); \u0060dc3637d0\u0060 [ty] Track unused-binding captures across nested scopes (#25536) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ty_python_core/src/use_def.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d537ee55ef407fc4594a85847597683a991d9091e41d186c20f32272bae7c1a7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: source.rs \u2194 infer.rs: \u0060crates/ruff_db/src/source.rs\u0060 and \u0060crates/ty_python_semantic/src/types/infer.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006021ac16db\u0060 [ty] Avoid overcounting shared memory usage (#19773); \u00608f8c39c4\u0060 Simplify \u0060get_size2\u0060 usage (#19643); \u00605e29278a\u0060 [ty] Reduce size of \u0060TypeInference\u0060 (#19435) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruff_db/src/source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44fbbda7c21ec0488ee6a11c0e5eee52c559a27a849cd98a39d68603de92af8"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81615c33b45af56b87725abce47305a390dbef582ca664179f6bb59afa077157"}},{"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":"8d5ab6731845a415c74ad9d57def806236de78f2c523afb82a240320a3820d24"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/shared/src/Header.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a469c5d95868adfd610c83bb2527cb867ef38d4eeb9ef13da13593665a444f3b"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/shared/src/RepoButton.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5ec78c31ca8f06bcd4dc24f049b62c52bbb3c0af587f602edcc0e43a5a8340"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/ty/src/Editor/Files.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff33da8596dee16f6124c27c4e56518dc6ab794024c82a1d904b1fdfc00756d"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable role=\u0022button\u0022 that no keyboard user can reach: This \u003Cli\u003E announces itself as a role=\u0022button\u0022 and binds a click, but nothing can put focus on it: no tabIndex={0} in any spelling, no key handler, and nothing in this file moves focus or sets aria-activedescendant. The role tells assistive tech what the control IS; it does not make the control reachable, so a keyboard user cannot operate it at all (WCAG 2.1.1). Give it tabIndex={0}=\u00220\u0022 and an Enter/Space key handler, or make it a native \u003Cbutton\u003E. If a parent widget owns the keyboard model, that parent must move focus onto the active role=\u0022button\u0022 or point aria-activedescendant at it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/shared/src/SideBar.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7437f5b97d99961cf88063b224cb6a080bbd86f495c2eec12a605eaa6275f2f"}},{"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 25/29 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/ty_completion_bench\u0060, \u0060crates/ty_completion_eval\u0060, \u0060python/py-fuzzer\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060playground/api/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":"playground/api/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8ebeb5219f8abc28f9a13c1e17c1925664b5b2e3e6694ba848c4636c913ace"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://cdn.usefathom.com/script.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository. 2 such include(s) across the repository\u0027s markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/ruff/index.html"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e29b3c5fab0a31f88d78fa885c63e331d2ad6ed3b6a901d22bec96c54c5d7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060secondaryAnnotations.length \u003E 0 || diagnostic.subDiagnostics.length \u003E 0\u0060 appears character-identically in 2 files \u2014 playground/ruff/src/Editor/Diagnostics.tsx, playground/ty/src/Editor/Diagnostics.tsx. 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":"playground/ruff/src/Editor/Diagnostics.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf1f494482bb81b3a6dfbee1947c1c13f1ad26f9175e7a32013b885f341fe65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!cfg!(test) \u0026\u0026 colored::control::SHOULD_COLORIZE.should_colorize()\u0060 appears character-identically in 2 files \u2014 crates/ruff/src/commands/format.rs, crates/ruff/src/printer.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/ruff/src/commands/format.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffc4742baad35a8c4bee636e473b9c9c28c4a45a4d889ccfbf974ce2ed37ac4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!config.preview || config.prefer_rule_codes\u0060 appears character-identically in 2 files \u2014 crates/ruff_db/src/diagnostic/render.rs, crates/ruff_db/src/diagnostic/render/sarif.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/ruff_db/src/diagnostic/render.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"65368537fbe840c9154706bc22d7331234fe8f44d1e992bc7358d9615ff937ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!has_leading_content(stmt.start(), checker.source()) \u0026\u0026 !has_trailing_content(stmt.end(), checker.source())\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/pycodestyle/rules/lambda_assignment.rs, crates/ruff_linter/src/rules/ruff/rules/legacy_form_pytest_raises.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/ruff_linter/src/rules/pycodestyle/rules/lambda_assignment.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a87a0cd1f8b478bfca8d708e57cec98f4328170ab41e2ba73fe12306ed6f97"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!import_from.is_lazy \u0026\u0026 import_from.module.as_deref() == Some(\u0022__future__\u0022)\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/importer/mod.rs, crates/ty_python_semantic/src/importer.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/ruff_linter/src/importer/mod.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb90c8ae146e733d4c21c8c6333241b812d3bd54adc9a7bf5bcdf31b847b88da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!name.is_empty() \u0026\u0026 name.split(\u0027.\u0027).all(is_identifier)\u0060 appears character-identically in 2 files \u2014 crates/ty_ide/src/docstring/document/syntax.rs, crates/ty_module_resolver/src/module_name.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/ty_ide/src/docstring/document/syntax.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb0f78c848dfb3ea4c200f7201bc7337c57ebe338b9acb4cb9691c57335bde9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!node.is_terminal() \u0026\u0026 !self.interior_used[node.index()]\u0060 appears character-identically in 2 files \u2014 crates/ty_python_core/src/narrowing_constraints.rs, crates/ty_python_core/src/reachability_constraints.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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6268bd159b9c1503f7151aaf73218a4362906f3cbdd5901f213fc770fb8993"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a == b || (a.is_terminal() \u0026\u0026 b.is_terminal())\u0060 appears character-identically in 2 files \u2014 crates/ty_python_core/src/narrowing_constraints.rs, crates/ty_python_core/src/reachability_constraints.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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6d0800ca13db3a2b4dcefba62ecd0ecf311c3fa0d03e3cca0586fcad55afc1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attr == \u0022format\u0022 \u0026\u0026 value.is_literal_expr()\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/flake8_errmsg/rules/string_in_exception.rs, crates/ruff_linter/src/rules/flake8_logging_format/rules/logging_call.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/ruff_linter/src/rules/flake8_errmsg/rules/string_in_exception.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f483e0575c0e5a490698e67f7281630f373f0ebc769a2f0d38a1b841a44336"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attr_name.nfkc().collect::\u003CString\u003E() != attr_name || has_comments\u0060 appears character-identically in 3 files \u2014 crates/ruff_linter/src/rules/flake8_bugbear/rules/delattr_with_constant.rs, crates/ruff_linter/src/rules/flake8_bugbear/rules/getattr_with_constant.rs, crates/ruff_linter/src/rules/flake8_bugbear/rules/setattr_with_constant.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/ruff_linter/src/rules/flake8_bugbear/rules/delattr_with_constant.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"102197933037f16ca6939676c3957ad2ff4fe9232733ef186cc44324e5c3d4eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060binding.is_global() || binding.is_nonlocal()\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/pyupgrade/rules/yield_in_for_loop.rs, crates/ruff_linter/src/rules/ruff/rules/used_dummy_variable.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/ruff_linter/src/rules/pyupgrade/rules/yield_in_for_loop.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac836f7203948f11e1b6e86745d6acc1eca6897870807c8291614b8b19bbfbd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060chars.next() == Some(c1) \u0026\u0026 chars.next() == Some(c2)\u0060 appears character-identically in 2 files \u2014 crates/ruff_python_parser/src/lexer/cursor.rs, crates/ruff_python_trivia/src/cursor.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/ruff_python_parser/src/lexer/cursor.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2e8247dc3f7c25a3e32c21c96052aa390f331237ff01d2a5719373e3d18de2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060chars.next() == Some(c1) \u0026\u0026 chars.next() == Some(c2) \u0026\u0026 chars.next() == Some(c3)\u0060 appears character-identically in 2 files \u2014 crates/ruff_python_parser/src/lexer/cursor.rs, crates/ruff_python_trivia/src/cursor.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/ruff_python_parser/src/lexer/cursor.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a3b610de0245e490481e52ad3c75d08d389f06bc180246713f9262b4f98475"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060check_typed_exception || is_untyped_exception(type_, checker.semantic())\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/flake8_bandit/rules/try_except_continue.rs, crates/ruff_linter/src/rules/flake8_bandit/rules/try_except_pass.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/ruff_linter/src/rules/flake8_bandit/rules/try_except_continue.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd41ddf25bfaeccdc03c646b3d65e0574b98a1b8d1614c9f3a8705897151753c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060checker.semantic().seen_module(Modules::TRIO) || checker.semantic().seen_module(Modules::ANYIO)\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs, crates/ruff_linter/src/rules/flake8_async/rules/long_sleep_not_forever.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/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"237e2de2abb6e89a4df469f1192461bc5ac3fae8aa40f46619c9a18443443f41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060checker.source_type.is_stub() \u0026\u0026 checker.is_rule_enabled(Rule::DocstringInStub)\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/checkers/ast/analyze/definitions.rs, crates/ruff_linter/src/checkers/ast/analyze/suite.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/ruff_linter/src/checkers/ast/analyze/definitions.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ca48ea53f449748c61655dbe34a04185f4675f20fafc3de367451b70261bda"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060checker.target_version() \u003C PythonVersion::PY313 || !is_type_var_default_enabled(checker.settings())\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/pyupgrade/rules/pep695/mod.rs, crates/ruff_linter/src/rules/pyupgrade/rules/pep695/non_pep695_type_alias.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/ruff_linter/src/rules/pyupgrade/rules/pep695/mod.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7985ce6b9323bf277ec3a395f929be790bfb05ad53c17a2eb7c0b0a81572dce0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060definition.name(db) \u0026\u0026 Some(assigned_name.as_str()) != name\u0060 appears character-identically in 2 files \u2014 crates/ty_python_semantic/src/types/infer/builder/enum_call.rs, crates/ty_python_semantic/src/types/infer/builder/typed_dict.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/ty_python_semantic/src/types/infer/builder/enum_call.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"010b9e43da97033efb754bf73c436c5b435f7647ce080ca1db135c03f55344fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060diagnostic.severity() == Severity::Hint \u0026\u0026 diagnostic.id().is_lint()\u0060 appears character-identically in 2 files \u2014 crates/ty/src/lib.rs, crates/ty_python_semantic/src/fixes.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/ty/src/lib.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc0908e85721119605b868c82843fd0afa974bf1bdd6d273afa35efc14fc4f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.options().source_type().is_ipynb() \u0026\u0026 f.context().node_level().is_last_top_level_statement() \u0026\u0026 target.is_name_expr() \u0026\u0026 trailing_semicolo\u2026\u0060 appears character-identically in 2 files \u2014 crates/ruff_python_formatter/src/statement/stmt_ann_assign.rs, crates/ruff_python_formatter/src/statement/stmt_aug_assign.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/ruff_python_formatter/src/statement/stmt_ann_assign.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e2addf11f7e6725f0034a8d9cb3b94b1c32c8027b810d6eab26aa1caa53e67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060flags.is_triple_quoted() || flags.is_raw_string()\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/flake8_quotes/rules/avoidable_escaped_quote.rs, crates/ruff_linter/src/rules/flake8_quotes/rules/unnecessary_escaped_quote.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/ruff_linter/src/rules/flake8_quotes/rules/avoidable_escaped_quote.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"de399478f031f355053d2bb623892b693802603af643b0d17f52abc8ab362f14"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060flags.is_triple_quoted() || flags.prefix().is_raw()\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/flake8_quotes/rules/avoidable_escaped_quote.rs, crates/ruff_linter/src/rules/flake8_quotes/rules/unnecessary_escaped_quote.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/ruff_linter/src/rules/flake8_quotes/rules/avoidable_escaped_quote.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4eead9d44067e2f7f3a226285110ed8ae8fa6aae334e3c04bc7c5d8e8ca9ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060generator.ifs.is_empty() \u0026\u0026 !generator.is_async\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs, crates/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_set.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/ruff_linter/src/rules/flake8_comprehensions/rules/unnecessary_generator_list.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"768d371fe75fbfdf4ec58cdcb8b990c6cf5f1b921f6dddcd91eb79fa88072164"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ignore_names.matches(name) || ignore_names.matches(asname)\u0060 appears character-identically in 5 files \u2014 crates/ruff_linter/src/rules/pep8_naming/rules/camelcase_imported_as_acronym.rs, crates/ruff_linter/src/rules/pep8_naming/rules/camelcase_imported_as_constant.rs, crates/ruff_linter/src/rules/pep8_naming/rules/camelcase_imported_as_lowercase.rs, crates/ruff_linter/src/rules/pep8_naming/rules/constant_imported_as_non_constant.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/ruff_linter/src/rules/pep8_naming/rules/camelcase_imported_as_acronym.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d725ae177bb3e47345656f7ac64eb879db142a94968972675e4f97b2295b08cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index_name.id == \u0022_\u0022 || value_name.id == \u0022_\u0022\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/pylint/rules/unnecessary_dict_index_lookup.rs, crates/ruff_linter/src/rules/pylint/rules/unnecessary_list_index_lookup.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/ruff_linter/src/rules/pylint/rules/unnecessary_dict_index_lookup.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"db99d4ecba382a4781fc7594e40bf83b05b3f64da2d81d36e992c8e6f2d38a4a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_relevant_module \u0026\u0026 matches!(qualified_name.segments(), [_, \u0022sleep\u0022])\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs, crates/ruff_linter/src/rules/flake8_async/rules/long_sleep_not_forever.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/ruff_linter/src/rules/flake8_async/rules/async_zero_sleep.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"09467409ce8bfdaf61932874a7a6bd68cc138633b9a504e076cb8e8d0d46ddb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.trim_whitespace().is_empty() || line.trim_whitespace_start().starts_with(\u0027#\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/pydocstyle/rules/blank_before_after_class.rs, crates/ruff_linter/src/rules/pydocstyle/rules/blank_before_after_function.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/ruff_linter/src/rules/pydocstyle/rules/blank_before_after_class.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11a66f003c81b81c1a94ab4619fc6543ff5290a8d3f431e220d94d3255607e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.starts_with(\u0022__\u0022) \u0026\u0026 name.ends_with(\u0022__\u0022)\u0060 appears character-identically in 3 files \u2014 crates/ruff_python_semantic/src/analyze/visibility.rs, crates/ty_python_semantic/src/semantic_model.rs, crates/ty_python_semantic/src/types/class/static_literal.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/ruff_python_semantic/src/analyze/visibility.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"884807535def2a439538a6149a9acf64f5e141617a27bf1113666aac42b14e4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.if_true == node.if_false \u0026\u0026 node.if_true == node.if_uncertain\u0060 appears character-identically in 2 files \u2014 crates/ty_python_core/src/narrowing_constraints.rs, crates/ty_python_semantic/src/reachability.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/ty_python_core/src/narrowing_constraints.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4727dfdb78effd17026cf5dc199a0b5e52bc15aee13428fe8312b5d1afde0b73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.should_annotation_be_displayed() \u0026\u0026 p.annotated_type().contains_self(db, env)\u0060 appears character-identically in 2 files \u2014 crates/ty_python_semantic/src/types/display.rs, crates/ty_python_semantic/src/types/signatures.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/ty_python_semantic/src/types/display.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c5f5e27086d8a541d98bac0a456acf270a9bbee8e4ccdc28a6b804393db42c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parameters.vararg.is_some() || !parameters.kwonlyargs.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/fix/edits.rs, crates/ruff_python_codegen/src/generator.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/ruff_linter/src/fix/edits.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7bafc44a4a1be6e1f6dd02c30e433932eb5c0b7c667775d4a288c7cd9813ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060predicate(self.first()) \u0026\u0026 !self.is_eof()\u0060 appears character-identically in 2 files \u2014 crates/ruff_python_parser/src/lexer/cursor.rs, crates/ruff_python_trivia/src/cursor.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/ruff_python_parser/src/lexer/cursor.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0cc59237fdf1722afe8a00f569bb32105d30b5a89eb95cd868ca48bdd2ec05"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060preformatted_block_is_active \u0026\u0026 line_is_preformatted\u0060 appears character-identically in 2 files \u2014 crates/ty_ide/src/docstring/document/google.rs, crates/ty_ide/src/docstring/document/numpy.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/ty_ide/src/docstring/document/google.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"33da6b7cc2f02a9db30e4d0ed56663f5eb3d81541460e4a166d0b8c67bacabd7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reference.in_typing_context() || reference.in_runtime_evaluated_annotation()\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs, crates/ruff_linter/src/rules/pylint/rules/import_private_name.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/ruff_linter/src/rules/flake8_type_checking/rules/runtime_import_in_type_checking_block.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a571d5f4f4d69515fa3060c89b6cc453502a1174c431db26a28c7b679ab5f91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.call_chain_layout == CallChainLayout::Default \u0026\u0026 call_chain_layout.is_fluent()\u0060 appears character-identically in 2 files \u2014 crates/ruff_python_formatter/src/expression/expr_attribute.rs, crates/ruff_python_formatter/src/expression/expr_subscript.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/ruff_python_formatter/src/expression/expr_attribute.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0079bbae7ae5169a7e7e2d8bd5c2a7d8e8b423e9a56a84d12db6f91841e227"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.config.preview \u0026\u0026 !self.config.prefer_rule_codes\u0060 appears character-identically in 6 files \u2014 crates/ruff_db/src/diagnostic/render/azure.rs, crates/ruff_db/src/diagnostic/render/concise.rs, crates/ruff_db/src/diagnostic/render/github.rs, crates/ruff_db/src/diagnostic/render/gitlab.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/ruff_db/src/diagnostic/render/azure.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e5a21950ba95acc4cac394a4de7e12d3f533031a118b1620b403239686866d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.report_context() \u0026\u0026 result.is_always_satisfied(db, env, self.inferable)\u0060 appears character-identically in 2 files \u2014 crates/ty_python_semantic/src/types/protocol_class.rs, crates/ty_python_semantic/src/types/relation.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/ty_python_semantic/src/types/protocol_class.rs"},"region":{"startLine":3390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e414b69a4f97bbc065d84feb0045d39d0c55513f1cf2c9ba866819e0ca7268c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.report_context() \u0026\u0026 result.is_always_satisfied(db, self.env, self.inferable)\u0060 appears character-identically in 3 files \u2014 crates/ty_python_semantic/src/types/generics.rs, crates/ty_python_semantic/src/types/tuple.rs, crates/ty_python_semantic/src/types/typed_dict.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/ty_python_semantic/src/types/generics.rs"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d72a65b05135d2849a5d274f3fe4d833a6c75f88309afa8e6bec4a9d232f00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060settings.file_resolver.force_exclude || !resolved_file.is_root()\u0060 appears character-identically in 4 files \u2014 crates/ruff/src/commands/add_noqa.rs, crates/ruff/src/commands/analyze_graph.rs, crates/ruff/src/commands/check.rs, crates/ruff/src/commands/format.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/ruff/src/commands/add_noqa.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"169b96f47ff2c0598bdb53e33c6c08d9846d123d3e0a2547a1099903c1cdadc0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subscript.ctx.is_store() || subscript.ctx.is_del()\u0060 appears character-identically in 2 files \u2014 crates/ruff_linter/src/rules/refurb/rules/slice_copy.rs, crates/ruff_linter/src/rules/refurb/rules/sorted_min_max.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/ruff_linter/src/rules/refurb/rules/slice_copy.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4510a77fb18e6b3350c64c5ab5fcaa79b9ef8d81a9df9a48926edd0f7b2fdabe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060symbol.is_bound() || symbol.is_declared()\u0060 appears character-identically in 2 files \u2014 crates/ty_python_semantic/src/place_load.rs, crates/ty_python_semantic/src/types/infer/builder.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/ty_python_semantic/src/place_load.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1f58f4ef1689c7cb7505ea170b2e656bd7ef13ae8546bf9bf508fb2244a6f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typevar.is_paramspec(db) \u0026\u0026 typevar.paramspec_attr(db).is_some()\u0060 appears character-identically in 2 files \u2014 crates/ty_python_semantic/src/types/infer/builder/paramspec_validation.rs, crates/ty_python_semantic/src/types/signatures.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/ty_python_semantic/src/types/infer/builder/paramspec_validation.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eeb66a826fa729d6bfd7eaa85391e52c283592969efe87958128a6381cf2498"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/4 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: fetchPlayground: \u0060fetchPlayground\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":"playground/ty/src/Editor/api.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59a3de8d7969502cfafe2fdcd4b8942edcbb888d7c7df3118369b57e90691c7"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: savePlayground: \u0060savePlayground\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":"playground/ty/src/Editor/api.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab76aae28178203e524fe0c4f6c331b9bbff9580af28a191119991a97559991f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchPlayground: \u0060fetchPlayground\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":"playground/ruff/src/Editor/api.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"466d3d6bc5f6f2b77877ffbb79052d114e84df1bb8caa57d1dd58520b1506990"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: savePlayground: \u0060savePlayground\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":"playground/ruff/src/Editor/api.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7b74e246611225fca9b4aa7f4d3344186c1b105b04599a069369d7fe422d50"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 45 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: \u0060trace!(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/ty_test/src/db.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ef11f162ded18eb5fa5c31164d384915c7bbe610611d4ce03deecf8af26732"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 436 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/ty_test/src/lib.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5ce3d0532002f20782846ca74ad7e882c68ac52e6a32dd9f3554104ad76571"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 315 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/ty_site_packages/src/lib.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"29623ef955d8494d0b5308aadccf6fa1bf3d9e97a3af5a986c3b13bb34f9cc4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 343 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/ty_site_packages/src/lib.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae0244ecb06254e0f5fab1ac65361e4da93f6f001be838d82dfd7ee468cb23f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 403 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: \u0060trace!(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/ty_site_packages/src/lib.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4847a6dba82683f1661d9d59b2cd484db8e0c32be7c08e2853f13b8e0b72bbd5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 759 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/ty_site_packages/src/lib.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d590626220fa844be61e6ca893077a6e157ade810ca3690d79454fba19edc65"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 805 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/ty_site_packages/src/lib.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fc2cd472e2c5c147d33be32d615341f86dcd7618586a669a1ebd9a9445464f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 831 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/ty_site_packages/src/lib.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f30514e0e071945a6ad76624740b60767332b387754c9fbb8a2042c8944011"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 874 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: \u0060trace!(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/ty_site_packages/src/lib.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0b934a6cbbfcb5aa5176ef3f8beb42235807c378b2ad645813dd18c9435af1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 906 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/ty_site_packages/src/lib.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39ed24597febf74d2ecaec40b026c74081eb90b430944cc1f2ba907d1d445fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 930 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/ty_site_packages/src/lib.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"b946e55ba4a28b0e22f1b4114065cb3bba38344042bcf0da584d48ea1df6b7a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 935 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/ty_site_packages/src/lib.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e2e7785c9947168d9c92243c1625838840a54003cd541068e060f4a0916da3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 944 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/ty_site_packages/src/lib.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"7347949d360d41110f473337aa897b4d149ce0bceeb7c2f0d63bf2b1514f70da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 980 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/ty_site_packages/src/lib.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f537fa30629c3043c04945e1276faedd78950fa26ed5d00a5be1c01db57dc2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 990 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/ty_site_packages/src/lib.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23839634ddb10fd7d30e417f9303c884cb4901e8b42a51d2612008f2ea9d2f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1224 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/ty_site_packages/src/lib.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a89f07bf4800033cf876c11b64b80cb1f06a6d7e7f361b05e62424ed5a89b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1241 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/ty_site_packages/src/lib.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"9730723c5d0dd721e9da5332c803ae1b89c66fd6b2682f614330aa0c8d595e2d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1674 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/ty_site_packages/src/lib.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db68db5ad9937af29a5da4ac852da3e7b0d8beb1d6d37df6422b79c185c2146"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1823 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/ty_site_packages/src/lib.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2099a124cae2716263de4c0389dcc81f11f82c7339b416821cc5d2754c084f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\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: \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/ty_server/src/document.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d0bbbcbf067b3a1d668010e7a2d8fc97d4ea6077beb327b22f0beb2e4b7f99"}},{"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":"crates/ty_server/src/lib.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"66134e6c667660a9f8b35559fcb8097681974687308feb4a927ff003b565326c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 84 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/ty_server/src/server.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f99277a850557c9521c1885faec09152a8b746fd010d5720f7e9bf8b3ab91fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 87 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/ty_server/src/server.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f55d564a6f1a27b01161c29c0d1d56a5b836b6d0e2a817f160e4e22de23a61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 88 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/ty_server/src/server.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f3d7a18e04acb599151c2a889f4713775f8f89ce13d3299d23f802ed98c083"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 92 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/ty_server/src/server.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"63278b456b2e92d2329ec2e70f8a89533db41e063ce52075942a5d0071f91c21"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 99 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/ty_server/src/server.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee46323654c40bfe7d16b91a88dec4349be8edd7faa10de13da1fc947793421"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 144 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/ty_server/src/server.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee883fe1b455aad6cb69ff666f39ddc99b5290b0b37e7da5e3bad2cd1377b31d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 225 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/ty_server/src/server.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbccb00807a5c3305c6ef7d952c3a2e8860fc58dc827ea366431fa5febeaea75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 268 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/ty_server/src/session.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8673f0bb414d7158eeb73351cc9d1813126269d9c59a1773d61cd56af45bb8dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 291 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/ty_server/src/session.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"8980249f8faeea51c1ffb0278d6d063573f23cbb61c15e900d09b87c5aa56113"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 442 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/ty_server/src/session.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecbcc0d34a45e94b93188f52a81f9ef2b14271130170afb56ca328a55a1b583"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 455 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/ty_server/src/session.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff49a8f72bbd8bdde5b2f232726d378516bfc340f54603c7c92f2cc353a74898"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 720 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/ty_server/src/session.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31a17cf09fd2ebc3bad2af34cedcfcb2422657fe425419e4e9b500237e7ffd3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 723 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/ty_server/src/session.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe25d9725e9985e44176b06b296308fe79b471e4ba773e1b2e7b9700ae6a9b23"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 731 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/ty_server/src/session.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafc85440ba6d0dd719789b5f859c877fe6e363036543c887489c2cd7d83a9c9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 752 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/ty_server/src/session.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db9a92fa608fed448372a6d4eede8619c96ca325bf57d5a06e8292944f99f5f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 756 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/ty_server/src/session.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"112111960f1b5ef3d89308bbd85818ca91f4ec3c1667d51a9a30e14dc41aa547"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 825 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/ty_server/src/session.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad712648c08f9067501fcfff4e2c0b3097d02f8728b0e759d9255dcbb551562"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 960 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/ty_server/src/session.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc94e38ec36e0b48fb3a20c31a0b24837ef374c841010cfd3d9c58847d4f1c71"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 967 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/ty_server/src/session.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a53b0faa210bc835af87d32703e7fdfdad945743d3602e7b511764f38f8499"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 996 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/ty_server/src/session.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c2e2d8a242addfc082ba3920e6940eab0d6863a2839c3a705852cdd71ab37c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1135 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/ty_server/src/session.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"037f609ec540d0e45fcc9aebca28acd71e863543dab808788fb86929f6c2bf4e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1206 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/ty_server/src/session.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8f084d4bafb1d6f9810269aa516c4a8910a30d121caf2b30c7ac5b534738c9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1422 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/ty_server/src/session.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7e46c462c978c7e4589bf6a5b0a17dd7386274b7624d079b5074a5a15e41f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1615 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/ty_server/src/session.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ca8789ecf1565fc3a65f205e83cd350825a7052b7494e68f923455d5a975f4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2257 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/ty_server/src/session.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89a029fe3d8aeffa05b20f3258f99378c34d01e4db087a5137258e2d10379c3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2272 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/ty_server/src/session.rs"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"054d6613e0f4d07685abac9746ef77bd4a8e6dff918ac254dcd44ae8a90d0a29"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2299 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/ty_server/src/session.rs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fedb6fa03f48b1204ec562770fb5d63608abe90b044ba080e392fb2a12679a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\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: \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/ty_server/src/session/client.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03dfdb6d638deebb453c956f23d7dee360ab260312ae0575a90d06ac2bcfa72"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 130 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/ty_server/src/session/client.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"709ac064ba05d27019f1a1d7c7dd1401d91053e8cbbd4756c5475a04b1ffec9c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 164 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/ty_server/src/session/client.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"76269baea37b988efb7d71cd6bf99135e6a2b91d8eee261c837ef46bd7422022"}},{"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":"crates/ty_server/src/session/client.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc142e9b7aaa58bc39d5c46b9a173ac9d34f29fe4ba030728a3bedc0152e81a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 280 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/ty_server/src/session/client.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcf94b9dfe461d5d08d941f812206a891f0c0cebd6876e623c9d8aaef076f1e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 313 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/ty_server/src/session/client.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1056c329203990c55f5b33d38f43fb5831a9c0b89afd6e1862003dee3bd8aa8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 323 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/ty_server/src/session/client.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1a90e398953e1da5e573b46e177e91101e6c6f6373089fa36063db8d3f672a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 161 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/ty_server/src/session/file_watcher.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"439cf22911d5f68742970c8f05bdeab7c14c0d230fec9366faf1e0bd66c0d557"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 268 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/ty_server/src/session/file_watcher.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"292fc71f9ed7b3442a96bc29ae623193235885a4402453d5a89b68add26c8a39"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 115 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/ty_server/src/session/index.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b31095272274f1d0b3e19ff03ede41ec253c6043b0cf23b4f5da876ddffaea2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 144 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/ty_server/src/session/index.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc438034cbf3cd780259cc0db3b57b89bfcbc2388032568e1877124f49c589ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 173 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/ty_server/src/session/index.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c5435485470e48a80c32d9d640cc9b5f02af743ec23a0726a31f4dabaf6ff2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 321 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/ty_server/src/session/options.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"870edbf4638ce43f3265ee94e2d5757978e6339896ac67f70230f09ea761be8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 329 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/ty_server/src/session/options.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f400c12eb96e49e7f6d01b489b415c9887f9ded8bc888f763a7eff3a9203fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 365 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/ty_server/src/session/options.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"8202d867c870d6f9aacdf83eb404e36d2e21222b64bec22f51cfeeb0c2c63a84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 157 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/ty_server/src/server/api.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5a3e02627a45a9b3d7139f06944e9a11f1569d2222465bdcc5be76f6ad24c1"}},{"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":"crates/ty_server/src/server/api.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d10babcdafd84cc967b57b1965c6faabcd7f9c71980772a8bf99c7f751b7734"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\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: \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/ty_server/src/server/api.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"371e745bb02355d51a7f71ae4540974d82878b11380afdb6047aca4a53649c54"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\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: \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/ty_server/src/server/api.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"13640b579e70d29b5ee29626a7912d25a11c04adb89121e9efeb2deb05cf5c17"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 286 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/ty_server/src/server/api.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a432d05be79d57202bf84d976b38c7e4273662f63e47785565020a679f9c6780"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\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: \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/ty_server/src/server/api.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7059d79f10c2b8f663144f5c3fe36802e6b8d82ec6e395e80485dedd28044b02"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 354 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/ty_server/src/server/api.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"686e77834bc9f7f7abca7e10de6cc4ceb1d3ee3f4dddaae137679a36434fde63"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ty_server/src/server/api.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc6e77ef4f0186499efd5690a975e57c19e5b05ac97deb7fc49fd4c9b3321dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 396 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/ty_server/src/server/api.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87c3589a74b2c1f1ce3d336ebbd01df32053833c56431a39cd1109a2052ac14"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 422 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/ty_server/src/server/api.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"386cd84c706ee2e518a58e78c8aac6f08c4d952b1338f1b7029487a2aa6ae231"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 457 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/ty_server/src/server/api.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1357153493b9f808fb17e575019be905c29664736daab3ffe4cafc026e5f4d9c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 474 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/ty_server/src/server/api.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34347d31b499fe6e7e881634d16459062b6994e2a6cec831f02591ce8027b21"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 481 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/ty_server/src/server/api.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"468489c8c1edf74e1c4a50e19ac4370941c675eeeebb49ac1ceb2b536cc6c402"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 529 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/ty_server/src/server/api.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"9348638380aeb5ec1091c8b595fda2025e4315436033b8349111ecb73caece0c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 48 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/ty_server/src/server/main_loop.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce1fde6d42493723e49e512ecbc9feb75ff417218123a5b4cad512f86eaee39"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 90 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/ty_server/src/server/main_loop.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"522b5bfd6f5661bfb401e3d72178213deac7ea17545dedea3aed7074df7eaa60"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 115 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/ty_server/src/server/main_loop.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5873538aec2ef2ffa8121eb9954ecc6946aa0344c04e9458f24f3ccf2e29cb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 133 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/ty_server/src/server/main_loop.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0d2a1d7b9683291373e284484f5d70c92bc669389784b823ce73d1dc8b8cba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 183 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/ty_server/src/server/main_loop.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbedbf7d0daef3a53a4e47324fc0787d4c6e04a1132605bfabd037fef3dc2407"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 186 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/ty_server/src/server/main_loop.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5405567b3ee2010a5a0395455523532009b615786b816dfcab5c55fc220ef60"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 189 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/ty_server/src/server/main_loop.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02d1c9fc0851431b4377792fe90d1322bc2753320f72dbb8120e14e3eb65106"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 80 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/ty_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0cea52f3d61d5cb71d859245173ff15baf6419ce29ac79b0a9b6a24873efac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 82 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/ty_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"635b703121ce7cee312db091287eeb6f1b63778a3baff3deab29d0657ac82f12"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 86 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/ty_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ba548ad979969ff5a8c4fef31b8d0e8478282726e2080064f37afa69b7250b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 90 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/ty_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d118850656bb67a3fb4462a2c082227dcd8cb0860cfff1f7bb8fd975cb3e8972"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 240 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/ty_server/src/server/api/diagnostics.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc155b9baa3260cdcbff768203ca36df55761109844c8c200a65a1df479d6b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 335 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/ty_server/src/server/api/diagnostics.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"21494fbd3051e64db9f63b10d5ec671eb61b53ab7b305a86f013eb767b269bc4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 116 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/ty_server/src/server/api/traits.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e795e7cf1b6a5ac02715b664d243e300b2dfbc0701c3ec683067f53a38c5214e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 163 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/ty_server/src/server/api/traits.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c71006ee25a16ee69680c23ed384b1d9f315ce5bd71058415ad81074775bf8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 61 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/ty_server/src/server/api/requests/code_action.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"897ec1f54905cb3fe8c6512f746ab6fdcfe4e18ff599d66171e2c07fb417cdc3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ty_server/src/server/api/requests/completion.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1617d4407646db3f9df427b0af79d4a832008b4a7a2367cb3bfcc817f4e65797"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 88 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/ty_server/src/server/api/requests/inlay_hints.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8727bed93448d04287571ae6adbacb924be71b72dad4b9083d08d3b8ada431e6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ty_server/src/server/api/requests/workspace_diagnostic.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fb0de3d33ed86302d77cc37289eec8528ddc1c27932263a068e703d35f0a9b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 400 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/ty_server/src/server/api/requests/workspace_diagnostic.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa5d146279e29e52edabba146b9fa57931b8766ba63dbe4091bdad47a1301b9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 32 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/ty_server/src/server/api/requests/workspace_symbols.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc19e718e1c537ab147c7574d94f1575ac9eefbb31354f63b7df457ef122cb8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 47 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/ty_server/src/server/api/requests/workspace_symbols.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"707d1e0f76798c7413ff872e7561e10fc51bedbc331b1deb758c30227e5f55a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 35 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/ty_server/src/server/api/notifications/did_change_watched_files.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cc27dfa1d1d895b4c56c3cb1d54369f1edbf5f2bb888ea5c8ac749bbb71068"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 79 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/ty_server/src/server/api/notifications/did_change_watched_files.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb147e7e24e115c25bceb033682c14f7d46730acafcd6059394f4984aa31815"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 31 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/ty_server/src/server/api/notifications/did_change_workspace_folders.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"456c3a045ced1e30a5cd1ca3393afd319b3d801801946aac99e0c2fceacb0158"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ty_server/src/server/api/notifications/did_change_workspace_folders.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1664c3b12309826ee7117182fea095dca8aae3d4fd298e00e9971530fc8dc20f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 50 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/ty_server/src/server/api/notifications/did_change_workspace_folders.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b57455b801c268e9e02bb19d04b9b1d2f4f4c62f43d812bdae0cdbf4626d84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 70 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/ty_server/src/server/api/notifications/did_change_workspace_folders.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d0cf9d0e4ad1ee8a1776d51a606b8a297d9fd02d30ad25a664b568d052debf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 81 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/ty_server/src/document/notebook.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4482679a079a5b66060831f03a7fc8948f8511d9381075caca8154eb3ff38e6f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 85 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/ty_server/src/document/notebook.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d173e146ec98380fd2a6c43db9d571083b2c3b70022618eae15d9792e58475"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 386 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/ty_server/src/document/range.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e46eda8b9dbd221b929a22cfcc7a2f7489d07d3d3ecf715dbbde30fffac0bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 397 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/ty_server/src/document/range.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"522163fb81a8141103c30002af313491ee84d02ab433003fb820898106a33e77"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 223 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/ty_python_semantic/src/dunder_all.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d7b35a6c159197d1dd2241874d124a31dd744e8495fbb5abe4ef9f0e41cb53"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 129 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/ty_python_semantic/src/fixes.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a985c789021389502c2d1e76f806dbe2db473ec9d6d97e776dbfcaf11992f9f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 142 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/ty_python_semantic/src/fixes.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e2a3a012a9e7b69a489d0ec5400617b1cee511129ba7ee7e9d45f1b4b9ec19"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 149 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/ty_python_semantic/src/fixes.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3640cb8f24cf412ece1ba6a269c894b68e737a7bf7b49e084d0a226e9ad180"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2071 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: \u0060trace!(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/ty_python_semantic/src/reachability.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa62c7110556288919db607d03c04a5c22549d28f5d558942d01a36d6c82c42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 216 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/ty_python_semantic/src/semantic_model.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a520c97908cbfa99f9d8becd2d3e83761c2d5d8dee0124a10078cd1e5502ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 240 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/ty_python_semantic/src/semantic_model.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d7d502514dc5ad65f40bc07e08bb1462ac9e499861bd495c1b840b54f6a8b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 258 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/ty_python_semantic/src/semantic_model.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f8d36d6a5e10fb40926d008e6dfc19206fff3358787d59eed96d6563be6555"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 205 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/ty_python_semantic/src/types.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4036dbea1452f4ef468e37043e2b890ff4adad07f7e4a040c6f84a2610c16b3e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 275 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/ty_python_semantic/src/types.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"de45a254774cca828215775f531550e960231513f8337d9533e3788664adc618"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4519 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: \u0060trace!(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/ty_python_semantic/src/types.rs"},"region":{"startLine":4519}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45fa6d8457ab68e8aacf0677d36c3ea1ea1ffaed7a3e288be6eff10d8c4f449"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 5327 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: \u0060trace!(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/ty_python_semantic/src/types.rs"},"region":{"startLine":5327}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ba1afe6dd553006dd791110a18ec6215f2855dc35cabba9589de70a47ce603"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 6195 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: \u0060trace!(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/ty_python_semantic/src/types.rs"},"region":{"startLine":6195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5db807e55534da259612b5c3aa97ebb215cebd7d647c47ae5981ab89f106151"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 11448 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: \u0060trace!(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/ty_python_semantic/src/types.rs"},"region":{"startLine":11448}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbe1abeb4876024440bf993a5d50114eaee36cbb441cd78e20be63da11c4f9b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 11578 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: \u0060trace!(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/ty_python_semantic/src/types.rs"},"region":{"startLine":11578}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56d32eb14e99cf87e3d8152c976f1a09d924c5126580edf2a7c8d1e8aa32d28"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 548 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: \u0060trace!(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/ty_python_semantic/src/types/class.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abf4127e4e8942a338a286dc1d81bb55dd419dcc66a676a9ef78978e2a89a32"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1719 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: \u0060trace!(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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceb86a185f7db4a6f484de96ed965ba15107d6cf9bcbc6a7fbd05a694f33a4f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1742 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: \u0060trace!(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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8fcb0604fd20d065d9d8981127add778c425845a14a853311ff445d6b71a34"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1752 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: \u0060trace!(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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f203f84ea9bb6c4010b66365b6c169324e02921ebdeb31df0e4379ecb3746a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1755 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: \u0060trace!(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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31e4a5d71a35cc8c13a3e45e38a1a485c1a7edd44690a8dbc3e944a25fe4c31"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1771 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: \u0060trace!(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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f7690cd0b232d4b628bc6fef254fcd5ab0027cc3b7f705003f13883ed09488"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1775 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: \u0060trace!(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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7b283b2fdd096254b7223c89f43ed467c750c6d8bf8dc90804125fe0a68c70"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1800 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: \u0060trace!(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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c10798c8a20eabf4a1a246eb66ed69f552eac41cc23589983d03594c6fca356"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1836 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: \u0060trace!(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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66d43327ad899a88be9a198dd570cee9d3243a8efe8e5e6f089474a968af24f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1846 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: \u0060trace!(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/ty_python_semantic/src/types/ide_support.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ad902c7b972b9fdf99af21e8d482343623687a7a1942fbe76efd3318c0685c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2572 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: \u0060trace!(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/ty_python_semantic/src/types/signatures.rs"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"2666d8dc66848af32908efb9d24edc13bbd7bd22b857d970d2194c3f56ec5a1c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 12341 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":12341}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2379a3e021d50f39764f497ec58a374e44ecdef0d6b0e8ed23da004a5ce7a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 12350 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":12350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f9cd87574388e1e6e378f2ac063dbe7d5092ee6eaf02b76afa9ab456a5b0ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 12585 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":12585}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0a01bc6a0088ea0800801a2adbfe8078efe30aaa6e11eb10c994d1a34de168"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 12594 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":12594}}}],"partialFingerprints":{"codehealthFindingId/v1":"7577f7eddb233d5c83217ef39e2aedd6b15e7d383635cf6288331c3f2db2e035"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 13055 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/ty_python_semantic/src/types/infer/builder.rs"},"region":{"startLine":13055}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b1d127ceb8a90a24e8557eeaf821453adc2503699b8b0701e31d33dfca2979"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 424 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: \u0060trace!(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/ty_python_semantic/src/types/infer/builder/imports.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3a46e4027d880e330b94ad011b6b02bda3170477682bbb88728705d240e19f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 443 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/ty_python_semantic/src/types/infer/builder/imports.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"943f6fcd1228c3943e9544ca7d6e8150969b7950994c1cee39c8393dff0fb8d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 451 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/ty_python_semantic/src/types/infer/builder/imports.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fde13d2de5072434dbf578f87c07de9377720e47ae50396333cd3f5425f99b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1326 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/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc49489a5f616b4b222473014288f8561e87e4f1fe0ba169b520bb1d1e3fe81"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1430 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/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab8c0613d82d45d7c560371f67fd4abc0222aa8fb443f57c8c59d195ea4f9e1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1432 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/ty_python_semantic/src/types/class/known.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a484622763f58f9cf0d951021bb4194c87ba0b43ba8fc9750f2426d4d15576"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 714 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: \u0060trace!(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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d376b50801b063293d524cd970dc809bf9655d1b41d566b56301ca4c7ba913"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 824 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: \u0060trace!(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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d7f4a3811cf0e32cc5e5799db2332760f402da41ed8d66f8a1201f20b5a6eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 978 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: \u0060trace!(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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f32fa88fabe7e0e222fa2230dc002661f94659c9c3e1367c81b2a063cedbcd6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1332 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: \u0060trace!(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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"03784721920cfcbaab3581accf922ba43c43c66ac6ce8cd98752c63b2c5b8e8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 3462 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: \u0060trace!(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/ty_python_semantic/src/types/class/static_literal.rs"},"region":{"startLine":3462}}}],"partialFingerprints":{"codehealthFindingId/v1":"3706da998c20e3a91ca3bcc2339ae3e12ab8b17ae653fa64e861b081fabcf1b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4144 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/ty_python_semantic/src/types/call/bind.rs"},"region":{"startLine":4144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8d00e7862e2a993fe93ddbe5f6b4a32a4fc42a81173ebdb1cacb71d65bf9f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 178 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: \u0060trace!(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/ty_project/src/db.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca72d452020b03cd74022502899a868bb5f83a3f1d461023ffb7a00101fd6e38"}},{"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":"crates/ty_project/src/db.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada106ef9dd80a50aa832701d9daa6043361ad4c47853386b39a779aebc86214"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 313 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/ty_project/src/db.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2dde52723072f6988255909d23dc1fbc49e216173c58718cf760cb60c06f93"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\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: \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/ty_project/src/db.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a776824bdab2108533be6ece8a261de8f76f5be39f604fad93015eea1aedba70"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 292 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/ty_project/src/lib.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1724b70cc200a4a949c89cbb414faa586feda83b500a87a15b2b6a320d0c31b2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 416 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/ty_project/src/lib.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e464e60f1deef9e1a03ac0d5ff32336d2328fbeedf77469f60d596de87369ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 433 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/ty_project/src/lib.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d681ff00956f3cecda429ac7942af03f69169c3c8434ec532e542576c82ce885"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 446 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/ty_project/src/lib.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8596a2f0b481a90945f5c53bc263e34dd2f9d327ae99040782c867a578ccc17"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 526 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/ty_project/src/lib.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a70728543dbb0dd761409e2e7384fca00f0d8ebef88da88cd905c8c8c51fb60"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 586 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/ty_project/src/lib.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33e648314cb862f341ab3a6e7f855c1ce00e65f4c7637d110172cf4815a62a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 594 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/ty_project/src/lib.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"95acbfa1f14a4acdfeebfe3d3e97dacc38846bba326ef7d6bccfe983503b9359"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 603 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/ty_project/src/lib.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda7494c427b533e3431b8e899d6692d5c8d3b0fe4a96fbafc6565b7cd12601c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 613 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/ty_project/src/lib.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdeeb0dc903fb90e6cc324e22feebda64af33dfe4e9c4d1f8ada195a91b3cd10"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 664 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/ty_project/src/lib.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd653b011d10669bee0aba74cd655ac87f396716176dd23a68d42b2bcacd9660"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 688 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/ty_project/src/lib.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"7987ee6635e011fe50b5ae68d5274ef87fbcd5d799e8901af856fad5f0a792aa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 754 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/ty_project/src/lib.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf1345358843a88caab299eb485018532b82951ffffe9ed11fad87dee69929f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 808 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/ty_project/src/lib.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"696307d8cefa6033b251a27d3315394f77efa12b0e98ec5ac25db304194021de"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 842 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/ty_project/src/lib.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"553555bf7b05c53ae6794495efb193912084629ca0909b1a5ef50a326da8f7f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 955 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: \u0060trace!(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/ty_project/src/lib.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a446062f303bf214e26c94af57a7cb2d9fef7fab3525832ac2aacc74d8af059"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 963 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: \u0060trace!(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/ty_project/src/lib.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1fdb59ad103485eddc2915608261e9ddc19fc4e65795e0d204b218dced8fa4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 987 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: \u0060trace!(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/ty_project/src/lib.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ce287cbf776ff013019f25a359254988329092675217d6103ef1886b2b5e87"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 99 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/ty_project/src/metadata.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfb3e1a0c2f54d9314bb92c9818566d59428c961a9ff3133eb1b167b01e373f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 161 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/ty_project/src/metadata.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f5bcf79f3998d68237643d953c36a23e472fe2d2bf3f499cd42cee481a33af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 188 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/ty_project/src/metadata.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df6352135698b50ce5fc76948bf5445347e8f51681dc1c4db6fabec127d5f1c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 202 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/ty_project/src/metadata.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a715381d765d915830fe43c4d70ba8b9d25d79818d650d8da5e10e1714ddf40e"}},{"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/ty_project/src/metadata.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac526faedd1049988cc61c0024add6996d7c0ff070365e6bf097d94f33cb945"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 249 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/ty_project/src/metadata.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cbe42adb5fa76ffc849adfef7194d85b69cf4c707b7268480c2e4e9eda1cb1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 312 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/ty_project/src/metadata.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c6068f0d22cd9189c9e022a4b0f57e07f3ddd82eec7ff867382434cb9daccf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 515 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/ty_project/src/metadata.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"605d2f2d71e1e8aeed905e35c2f7ac8c8ae82f1f33d69ce85f7cf72b4f19f75c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 218 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/ty_project/src/walk.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcdf87db2731714211fa757eaa47459473ab5ba54fe1e25aeeb9764e1c91869"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ty_project/src/walk.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7f86a099daa978e0b5084b6f59e4f071e07ed1996bbc542a28960b6df0844e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 251 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/ty_project/src/walk.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f080acdf2a1f62f1d39f170e10ac430c6875e190fa90441fd5779dcc6f9de85"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ty_project/src/walk.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d9e6481398720d5ffa8898cd7b47508b03bd5b5387b4ecbe9256a99b02227f"}},{"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":"crates/ty_project/src/walk.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4aaee31180fd1f769b7cae452be7cebde556efa122296fea624e33b59483ca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 92 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/ty_project/src/watch/project_watcher.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cc7f2e27621ca6d4b69bd4b8b06c4b026d601298641ee057f594901379e072"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 103 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/ty_project/src/watch/project_watcher.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc9148246c8c7c6dc1b0a04b84d2d1d232b34daddf4c5d119e40ace0ed58dcb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 123 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/ty_project/src/watch/project_watcher.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4cf1eb307c816b01318360de0b05b5d150c6873ced9fe9af5ac9b49dec63c9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 129 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/ty_project/src/watch/project_watcher.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"777b3ba47f3476af5ec9e85a68320a1a3ed37c8c3e80cf3354843c49e27a8641"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 170 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/ty_project/src/watch/watcher.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e20ebf4ad20bbd8188b2d3432af0f29e81c4c6fdd9f28a0a419afa0547b026c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 175 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/ty_project/src/watch/watcher.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8909070afe1f6c31eb68731533b562bf02e3b3c1babfa26e670e8be7fb92084c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 198 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: \u0060trace!(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/ty_project/src/watch/watcher.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d899c1c1b5b0398fbfa42ab7a72e537236fd7fbc981f68473ea45128c3631dbd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 211 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/ty_project/src/watch/watcher.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81dec093483a2c7a47fbcd053b9307cf709a9f463c17a67683af3129bd04b8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 233 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/ty_project/src/watch/watcher.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a383f5818e4ee28104ec523e92851b00376b9db2ad079c78464e2683938e807"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 240 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/ty_project/src/watch/watcher.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3906f6890d11ba0c446a7717196a37e5ea03d6b632889fd8c9187807da909c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 384 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/ty_project/src/watch/watcher.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"18500313b7d6465bb6a20c0ea21f464b1c201c5a0b300610d0aa70e97056be32"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ty_project/src/uv/command.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc86c049e9f8a28d77e076b66d08786904b46f26892210e3e5b9cd777b649c1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 83 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/ty_project/src/uv/command.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"486d24343b0f93dc8854bb247fc7a015f84a55565cd701796ec355538c97db31"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 150 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/ty_project/src/uv/environments.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"46431aeed7779dcbef12d9caf5a9e9fd8c7fc881b8d5ad2ef00717ddb7370424"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 253 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: \u0060trace!(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/ty_project/src/uv/environments.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b655529ec8f49fb64390825d77f78c3d081a418f54140f087faca89d04358e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\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: \u0060trace!(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/ty_project/src/uv/environments.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37f67fd38612c0935b6c1ae0cfae917a01af00a493f95ef2c77f316931a34f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 269 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/ty_project/src/uv/environments.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5a4fa25fd792526c07f2076397dd3524a8ca201578d0829a0cba237663230e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 292 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/ty_project/src/uv/environments.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"03045999c051da24df624a3a10cb18cd74c0efe1a6983976651186f25c913140"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ty_project/src/uv/environments.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e241b05352e9a8cab3182183c0cd418c3df67e36b98349580a8ed96ff87e19a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\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: \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/ty_project/src/uv/environments.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe531891fba838045ae8a9c7ed6adf3440a6f0c2a97ed232835ed22b6a08419"}},{"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":"crates/ty_project/src/uv/environments.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"9154a84d2c853fc266358db5aa25a233818b28ba6cebbd9d21fd84851de6b751"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 761 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/ty_project/src/uv/environments.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec0490a1185860fff4041cd3a4edef824400cfeb63cca1b28471a8773ffcf91"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 86 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/ty_project/src/uv/service.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"98992740c95a4a869c935863b1f2ab83534c06a3c5a5f7820e744d5a788c1df9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 240 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/ty_project/src/uv/service.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dd0dc9243dafd9b546cfd7f8a81c8ed9625abf6a2294b78cc01d5bea256790"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 302 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/ty_project/src/uv/service.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90a1df1f72636c68aed84d7117a8bdda2531e904bb2be37281876ab236dae9a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 305 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/ty_project/src/uv/service.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab660155d04b91589135635b796716d99bb76de5c7a36c485878187bd2b2c2f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 47 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/ty_project/src/metadata/configuration_file.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f707b96e2188a949d1ce2fc3cbdb3c8206935b43973f6b916f70344f003c418c"}},{"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":"crates/ty_project/src/metadata/options.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43707d599f8655730080469b7d964bebd7855e41f9b5f4cc63ab38329083c79"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 299 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/ty_project/src/metadata/options.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5518c147f6eb246032f40f6f5609beddecd5c77c5695874109b621fc47d6a7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 336 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/ty_project/src/metadata/options.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d734845cc70c421473de22bd58441b3e7cfe79b0f97b3c8cb73329412834ad3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 427 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/ty_project/src/metadata/options.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f890579fe437323b86f30c0dac0a35d0da6c154e2de938612525bfd291fd2bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 471 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/ty_project/src/metadata/options.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8a532a7eaa904e008522ea744d6e1863d5b1e60c0bea4a659e28fe9af66530"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 483 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/ty_project/src/metadata/options.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d3165495f15e3c79dee564adc60559af0addbad7edb6a4dff74668345dbc4b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 490 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/ty_project/src/metadata/options.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c3dccb0413835ef29dbe290ba67719abac628aa99472097c35a2aecaa14c5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 842 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/ty_project/src/metadata/options.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e6264478a34f32d32a3fb248be14b0f57724a93331e8109e7e256af1f78737"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 850 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/ty_project/src/metadata/options.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"3050c4d1ab0d3411aea92ad404f801d1f563668e2a8d11599c9e3850c0e41e43"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 75 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/ty_project/src/metadata/pyproject.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ac4cbb7aa211812d1b8d2a50c8c5b5db881c2d7544b357508da81fabe60bef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ty_project/src/metadata/pyproject.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79b0ef3158eaf8692497157e372b70815401750490e63d2ab8497c664ea6072"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 165 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/ty_project/src/metadata/settings.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8927ddbe16226d1638e549d54346b331445a0a96e6c4b482aabd3f63bd921a6c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 186 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/ty_project/src/metadata/settings.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a8abdf9f995d27caf3d7cccfb240eba407b59e3c273c2ac0aae0c78d4fd067"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 89 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/ty_project/src/metadata/value.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd4a94ebaca90ded2a498eff85e2dc1a9b0b32299d26458a69db4ca9b29d1f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 159 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/ty_project/src/db/changes.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab892daea91a90f352dcc833df4d24185abc039c34d576a4d9271142e31e9bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 390 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/ty_project/src/db/changes.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"95be67646711fa2aa86dcfe1e1a0f12bd631a22eb57df453c8e1d1a8606219d2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\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: \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/ty_project/src/db/changes.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8931b431060eb7e3289d8a4f9e2ac2cd50cab38dd032208a383db682d630938"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 266 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d104965639bfcd70bc90b6e747263d8de8a9cf487cb08e8cd10b1c4e3690c784"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 309 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecca224e2d99e297660b1d9ec3a66e6b51258b9e7007933f4d15cc6ce7e4ee15"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 767 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"de15aa8c60880886010e2ea615425d280882b3fa3ad0511b79b729c58dba54a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 772 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"393b3c31c668ee1f0d5900ffd81c72263d6f38106789a5485c48c2f083e9a7d9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 779 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb69504e7702d7842c39d1c808360cb9e1e039e369589f0264ac3f05dca1c0c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 784 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9d1af210dd2e7cc3cbe6b1ec1216f845cea183dd22d4dc778b96f5b4b25386"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 792 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f09db803dbf2d332d4c182bf05d2eb0bb7137335874fffc75eec8073e83aaf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 806 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f05ac9e310d263eb105c514eda02e93feb88eb49340e1a99e8b0f56d36683c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 825 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"047aafe83f93981055b9a260efcee254a29bfb525ed476b4414c20c7f829ebab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 838 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b50945d5174ef9ea6361d68a42f725090b3c917e32a2de5eabc8d575aec991"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 842 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8b62b01b8b472e5b803bc50b797a25ecf883f2d7ef5c46d5ea908665b1f96a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1010 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b5c052e7f97e1dccf7d80c87d2e70c065369ebb55136cf68081223216c9632"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1034 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"af37bd85254aa56d32f78d74aa55b1e742619e35d2a31d0928108fbf81a23bb8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1040 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab69cb9db0a2e21ba84130c8fa4cec2c20838e6f9aba0862c1ea1ccc4a4ee31"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1065 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4e13ffe0082e1a283282242d0b2e63ed2e5f4e4a0a8129b0e999e670817c6b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1135 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2013ac82042130e50d07178109bc661560cef820557f4af883f57f311fea44c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1333 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: \u0060trace!(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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c049e2d877f7c0c422d82a9052c553961baf237c5136287026156c692606834"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1338 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: \u0060trace!(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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3efee2bc27be7fdbc0960b095ddf36768ef2a2769a455f5cd0f99710970f8a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1352 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: \u0060trace!(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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ee5cf701e11e622df95b95c0d28583757e7ae14452a99565555f6a6fe376c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1409 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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cc65f40d8d58096487c3f3628fe71b18c44fa97a4069533f291554ec0d6cdf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1482 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: \u0060trace!(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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"af256e2ee8f7fbd74cb6347caa1545834c33e3895dafb112882efa9f697881d2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1501 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: \u0060trace!(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/ty_module_resolver/src/resolve.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"67faa87eb7a1c39d1b63d1a54d6106ec99b145d860d7b9770edea0ac46181227"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 982 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: \u0060trace!(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/ty_ide/src/goto.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"220879fdd86fe432c12a51e7a5f7e73e4a52fe250a31b86741d4184637ba3768"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1220 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/ty_ide/src/goto.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d028227009e835c62445fe22de7407d74d4ab822bf720ae22098d8ef160bc3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 21 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/ty_ide/src/goto_type_definition.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7d091b6f91412801f3f1afc0e4b9ec91d70edf97f02ae3f80c272ef4c422e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 122 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/ty_ide/src/hover.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75e1c8535daaecef46d6cc56f7653089045a59d91d9de54e19e42b1b61b8916"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 766 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/ty_ide/src/symbols.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15754eeedf8a75b8ef531a412946b455c95b7898043c0e80065a21f6fddd632"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 939 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/ty_ide/src/symbols.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"db114cf558fbf946225515b4810fb1317597191f8d9f73122a1662b5da7aadf7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1125 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/ty_ide/src/symbols.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"884f1e056e8e2da741b217ab923ba3c4ebce029f08d769d08380afdd78761706"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 115 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/ty/src/lib.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e8bba8e4231d2757bdb4897c9c82a3575833b64eaa348973e6601cb5dfbf00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\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: \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/ty/src/lib.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"505a5f14d48d852ae63b6a8e46910e63bac17c726bf3ba1b1b15420c220ab09a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 413 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/ty/src/lib.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48a62cf88f09d67978c1e3241e3e7be7ae85b0176a5f81f0e3d77e528a4ec45"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 425 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/ty/src/lib.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"337fb0bbb959d183220f5d3f228eb68b219619974324d201aa7a4bc643e7deac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ty/src/server.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"228ecf54c15893078335448b0e9bdf5984a9f31fb8ee9e7c4bc9ded0c13ab5ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 52 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/ty/src/server.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc4597356c264fd905251d9939ef0ae989b7ebdf9dfbc60c085cebeba2a1471"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 64 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/ty/src/server.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"27210c032012a8e292e8907c45f917fe55971f1f77b0d1796a32efee9d8b8c04"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 86 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/ruff_server/src/format.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acf8a544fc0cab5aa0912ff4fb5dbda8b94fe08d7c3ca052192d5e38f15f052"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 181 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/ruff_server/src/format.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4f182dae2fe87025a26a619d86a609ed243298314c27c2594edcc22c173014"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 337 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/ruff_server/src/format.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9408b24be39accacb9a9b3a7eb926a42ff59fb3e882c8426ff9c7b8ddd4a5ca9"}},{"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/ruff_server/src/lib.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e846cb4d07795ceb965af906dd03e0ba13a48288b6dca355d1b9c52178725fb2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 151 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/ruff_server/src/lint.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"db59eb9aa659bea5d1f26aefab03295b2bf79d571bde0494990e2a64cc214392"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 66 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/ruff_server/src/resolve.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9627fa07119f2d06871f5f196253779111dcd32bbc6f40bb4437ada6cf82507"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ruff_server/src/resolve.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d9ba1cf126145de3a87d80ff455256e85fac215b8cb614dc0d9bf442eb271e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ruff_server/src/resolve.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b19434a5593886f5a589e1f614bc9a0500ebd7c5daaa7f798f38dc8a01918a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 79 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/ruff_server/src/resolve.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42033ff95f0422c24036bbbf1c81c9f1f595a8e5e0f86dd742fcf28c9319a6f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 82 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/ruff_server/src/resolve.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a72ef0635581b8fe75efb014f2ca0ceff151d763c553fb47ac3979d7b16ea2e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 110 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/ruff_server/src/server.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"92796d7cc67d258b7d516deaefc1100fed8f92d43e0160381ebf6e61829f6fbb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 397 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/ruff_server/src/server.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb4336ec144b1dfe4d5d1be2df2b6d371ee55481a7b012e0c39f5f3c385686f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 20 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/ruff_server/src/workspace.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef766c83afd7c680a90570a48dd4dbd1afa43c247a405d7e7d5aff1be45b384c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 41 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/ruff_server/src/workspace.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e2f488bfb7eb48732c4b8e198548ef196d7b945fbf2dc670883e8572d37202"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 57 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/ruff_server/src/session/client.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"72eb5ed2b59d8f9bb587ac55fb6ed3b2157e298325472ead50352e026b4c251a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\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: \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/ruff_server/src/session/client.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b8cddff2fca9a549d768b734e91a6d5cf310d504c2d174b97fc18d610e8d34"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 190 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/ruff_server/src/session/client.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9065d5f42916f3fcad6b0640746f6c672f42189be0f35f76c943a77fada7ca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 202 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/ruff_server/src/session/client.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61e3f992b30328c9bf00e1202ad7401b59a51147280664bdffa3bbb1c2d516c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 210 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/ruff_server/src/session/client.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c4cce2bc3f0b303de5f54744eb44f2547d67e18c600fde2e809cccc5a86e6b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ruff_server/src/session/index.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"335a89f7a77600fc5bc98c3a77aa2852742fd77ef399e9a0ce6c2b8710ca1867"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\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: \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/ruff_server/src/session/index.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"92547bfbd20b8a8688a503ec8fc3c7dd22243c6193729643bd3bed58fa97c9bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\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: \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/ruff_server/src/session/index.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7ae9ccacddc322c11788f9a1eedf441e4e8c2cacc0abd2d35d0a7f1581d7e6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ruff_server/src/session/index.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c7db2106fe2a048d6b9b12ea9280ff62df9071a7fdb3b775b13c5035776258"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 424 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/ruff_server/src/session/index.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c7c0145f2ecc34e0acc91408b074d1ae9a7322bcbe76d86dcbdb9503868496"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 458 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/ruff_server/src/session/index.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9d2aca1c3d8128fda6de96d64e0c9bbe632659b3a4d8a2f1e91e138a56037b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 120 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/ruff_server/src/session/options.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0193a742507bc1dca1a9f5126581895ec81e2ab05c8c23abd803cf7b582a1306"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 353 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/ruff_server/src/session/options.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"62853d23551e7147a067bd742e521dfef8329046c5efde03c385f161178cfe38"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 79 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e5438b59ed04ad28a1c783ba65806823dab7c2d0bfcec023cf89e16d2caf14"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 91 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"666cf5f44beb25bd4c2cb98180b47dae94b86de2cfe5dc0ceb2d8d79eb8442b7"}},{"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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"45697b54ed307f086456d43904ffe783d9809643b383f2b407a5472fd43b07a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 141 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaf3c9d0a2484cdb9a8b9fafc16fac68db4b1179e64191d43368307b05ac7bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 143 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0625023a571729db28e2999862d645726ab4f399288ae427816530614f3f8dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 173 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f777238c7fa855dfb11e804d3092100f1babf784640f82417850cb7f73cabefd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 183 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a34fc4cdba4fd0fe61936bcf548117da1237c1a50e707a5827b9cafa6a2f9d9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 205 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d998082a70ffb66d5c4d1a5dba42517ad338165a07a5ab629cd8f97a39d55087"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 218 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1e282a183735a732733a8639e16d09ee9b23e16c4ddfe786297b7f29877acf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 236 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfebc81b6ea0dfcc48844e75974e132c31a2f5dea4ce66ff7333ec5f625de9a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 315 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc2ae16d553614425920c679d0e73b647e04f97694414da64b44eadc6cc766e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b60cb8b944e8d891086c6bb2aa80c60d229af3bc606ad9d6fd2259db00c1dcc"}},{"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":"crates/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ee82f135d236f5de84af8716bc8c4f2484e74cb09318acf1d6619241f0de47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 352 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f357589bdbbd0eec20720061c11dda0b2b1be4d818895673ec2cb7cb3c4a76"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 369 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"0237e0ba91a10a49db18f2894ce7dfb6a5e31f135c9844889beb795a2545e0a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 463 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdff3cbae08fcf0052222f0970561578cefee69174d67ff38422b6f5b24a6a9a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 470 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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8cc428469fd84e75d0532f0e528a0a785493f94c44c2570c5d5239ffc85ff1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\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: \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/ruff_server/src/session/index/ruff_settings.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac4f314b94a802d820c9a5c43cacbbff63f9ba783b87aecef9b67f19e192448"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 72 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/ruff_server/src/server/api.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e573f3b539d2175a480a1d4c12c5256bd4517489c26d62445e62450f7b5991d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 81 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/ruff_server/src/server/api.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b0177c46040ea7039b955c5eb9aab7d43feb9bdc0bf0f3ecfed6bbb7b09b47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 131 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/ruff_server/src/server/api.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c33e9830f111702742d9c46148f8da91d4808850add26496482e5a3775772a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 136 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/ruff_server/src/server/api.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3af78e7f0037591bbf61a719e69b204d7c998ec54a4bb8e75899238d923399a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 183 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: \u0060trace!(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/ruff_server/src/server/api.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"71610c834ccaba4cb747317831431d032e868d61942c4f6f2f3cccff748a9edb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 233 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/ruff_server/src/server/api.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c0eb23203bfa09399a5697535dfbcf5858e268d2db14810257eeef47fa8f84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 254 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/ruff_server/src/server/api.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"06987224ccd76e1854e4b0945ed84517ade5db565e4364a7ea23fe5c4580b965"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 281 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/ruff_server/src/server/api.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd725c2584788668375ec75a65275596b8dd68630a761cb226af99a7df77e26"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 330 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/ruff_server/src/server/api.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ce35c08198240fa8e84d37bb5ce0f267a1c07d1327d805bde2e2c6b4a89c42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 334 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/ruff_server/src/server/api.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc7f22b3c28201539afa0ad1a3fcce6dbaebed97aa46885dc3ddb1226d6ea1f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 342 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/ruff_server/src/server/api.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3076f6be5a0fb78fda4802cf1c76eb56678b877fe00e0a680d74e129c08ecf4d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 88 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/ruff_server/src/server/main_loop.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c388fc3eba83874d09d245f86d4e43290e894d7dc56cb9f3ee093372c812c78c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 113 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: \u0060trace!(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/ruff_server/src/server/main_loop.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c7197447cde0c463388f0ded173f1523839979ce5c8eff0044542c03813c78"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\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: \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/ruff_server/src/server/main_loop.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd495d802bd7c43c3cbe1040ef5129ab4733e434fbcc088ff9872f61e55578a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 84 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/ruff_server/src/server/schedule/task.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab697043ef01d5880c9b0ff9b75c5ea46d2220897ffc4bf18f23ee2b75ad7590"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 84 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/ruff_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c66b3ee24b224b9653a6ec3efe5b89186f0c0c4ca30e89c2b45e9760394821"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 86 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/ruff_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"195a96de883b8d8e18ca09e6f7a1fe4ca72b513cae3e7da0f72c321972472aed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 88 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/ruff_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33b2a326d880ef9d9cc41fc3afe5ed629e040d12dd144915a747b91e40edcd5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 35 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/ruff_server/src/server/api/requests/code_action.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f1db50498971b509ac39f88c965be946310b26ebb9540b1815009e0efe3f2d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 47 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/ruff_server/src/server/api/requests/code_action_resolve.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eff4da7ab239fe84d991b40d29efe2a64c70c5a4557180d1f717534bcadbfad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\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: \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/ruff_server/src/server/api/requests/diagnostic.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6e23db7a2f20ce5df4386a06ee93d1c2f97e5c4ca47f099e636acf50ff7b74"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 91 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/ruff_server/src/server/api/requests/execute_command.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d732181869f73dc8ed1a091e8879168452c364e649b3bf3f8bae81087e74595"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 160 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/ruff_server/src/server/api/requests/execute_command.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ea4109e8277b769b3ce499b0223643faba64efb579d302be524f36b8047141"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 33 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/ruff_server/src/server/api/requests/format.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"375cda72f3d0f1d3530ba7dcab9671fbb7066e0b9bde77b3577a5c0b35f99f17"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 28 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/ruff_server/src/server/api/requests/format_range.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"08495241693a0fac88405c3dcb551de01cad28ddf5d2382be6cad31c0afc4471"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 35 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/ruff_server/src/server/api/requests/hover.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb6b3f2145bbd605fbb0e733d56af16a541a8c6b51920955b9e3595683619bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 24 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/ruff_server/src/server/api/notifications/did_close.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9317bd30068d279cb33fcc1b20067b90c0b793bc8686456f3783f4df949485"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 247 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/ruff_dev/src/format_dev.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bc194577155776f485966ff866ba747c3dc1c97c563108db2f437a84aa6fc8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 252 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/ruff_dev/src/format_dev.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf71a1cf089866cdf9149caeb92daf66cab96470e4e1405daf9fb933f93b5c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\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: \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/ruff_dev/src/format_dev.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5510fe622e4b0dd731d8346b46f24b43bedeb5725a70d403b6f48c448eee83d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 349 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/ruff_dev/src/format_dev.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"687d333adaf05cb2458411cf1538d4ab50701f841dcb8309909a71a617a2c8c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 362 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/ruff_dev/src/format_dev.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4559141757cfd04f5856843b8f703ed27202a9ce51e0298644279d3b07997a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\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: \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/ruff_dev/src/format_dev.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f463ce86fa1155c74820c570c61569f31af89a084819f8142771aae2118c916e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 388 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/ruff_dev/src/format_dev.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4054f02a8457dcff4a823efabe4412ad80b855bcde76d1f6ff58cb42034f5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 399 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/ruff_dev/src/format_dev.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aff5f21bef37954ad22e0466f3a04058e814ffc90aea275853cb94c4f4c3e4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 438 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/ruff_dev/src/format_dev.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"66190e4baf1723824e37743222d474540c1dc78707f3358858e402b87de2b2f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 461 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/ruff_dev/src/format_dev.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbdef87ee14934c9c96786ee3ca427185a74682b7a4681249b0cb877a0831f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 516 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/ruff_dev/src/format_dev.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c658e394b2ebe638be20990452b38220a6a914b108ba3782ad6b5272d34dc41e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 927 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/ruff_dev/src/format_dev.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"39701d7d934262859c676aa54e3f9c0bf2a3466b5eec18cdf5dd2f2695cb89a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 938 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/ruff_dev/src/format_dev.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9e9825175ce0d5c409fbdb9c3ce33e2b599c8ce21de451a13c4d6dffa45bfb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 138 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: \u0060trace!(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/ruff_db/src/files.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"56836f62c1faeb6e59b00f0c7e51010acfac1a2eac17706add488f5ece230616"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 201 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: \u0060trace!(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/ruff_db/src/files.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda4d51acb2fd3d01227d76e5b7151ef7553a6a6b7ded6935ab6b05218f7048b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 222 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: \u0060trace!(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/ruff_db/src/files.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1f00bb9af4bd7c54218ea2be581cedf0c15854a338a638c22fe4dfa3005f9d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 526 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/ruff_db/src/files.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aca3a2418068ec95717608ad32c63d2b5ae65ffd679f5e054ab835f1097b4dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 532 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/ruff_db/src/files.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebd199517dcbbf3425fe6b4c11210fe74ea6cb0efd31aed0729bd026a32cd0f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 538 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/ruff_db/src/files.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a0f319806b3fb2cbd8cf91c6139066b83764f21992237a66a7c9ec07db02e9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 624 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/ruff_db/src/files.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3cad641da2c0d7ebf8c451f3e83f4e6dbcac9735e134eefcaecec69555c528"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 632 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/ruff_db/src/files.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"022a4d46b9ae5a511069be1708a1a5dae4b52e80740c267f8530cabadab3b1d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 149 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/ruff_db/src/parsed.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e1d1c1ca9170240cbafe3eb24651f7da423191e3378f759c0cad7d8409d5c9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 32 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/ruff_db/src/source.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a763a3f083163454cd3bcedb0ccc73ff3e9616d35166aee443bb5f0a92b2b9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 41 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/ruff_db/src/source.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c4b0e64dd67cb8106304f1f6e184f70c282193795cf1efc16c10cd8cc52e62"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\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: \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/ruff_db/src/system/os.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"61556c1889e85ebf8a973541a82f78adda7b9eeec4cda6a88c2c2ac8b6f2bbfb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 369 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/ruff_db/src/system/os.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9093ea6764f5997c6fc0cb8278660162389092f62897cbca1847fb5d762c2602"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ruff_db/src/files/file_root.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31dc282fa01d6ad8c652c681a97a646f6f5de735c0217c04980836d778a7a5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 65 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/ruff_benchmark/src/real_world_projects.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ced12f0012d57c1d36c5ff187afc553f2cb4633bfbad249975b069186f6fb5a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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/ruff_benchmark/src/real_world_projects.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e31d028604543d2cebc12b4ff6855288142254c1d9ce49ccf57cd448fb46e17"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 81 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/ruff_benchmark/src/real_world_projects.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c86c015ce7616a1baa629fb4affa02d564db9630f57396cbc1534ef1615b112"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 86 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/ruff_benchmark/src/real_world_projects.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb42ae547c2b36dbc1b2214e715cc91a9b77bc419d51dbef064437a532271928"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 174 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/ruff_benchmark/src/real_world_projects.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8844a34a09486a71e3ae1ffd13cc4dea08ad9b03cb75d30c9566f35cb23188e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 182 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/ruff/src/commands/format.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"214c0cfd31734580e2bb8bf2bb2114946d846df8e1c381ee21fa5de4ebae5ad4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 524 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/mdtest/src/lib.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"0762a6ad5ed991cafe0159bf53e5b735224ff701dcb17bfb0781621be95d03cb"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: 2/3 of this repository\u0027s type-checking configuration(s) turn on strict null checking (\u0060\u0022strict\u0022: true\u0060, or \u0060\u0022strictNullChecks\u0022: true\u0060). A configuration that states neither is counted as OFF, because off is tsc\u0027s own default; a solution-style one whose \u0060\u0022files\u0022\u0060 is empty and whose \u0060\u0022references\u0022\u0060 point at other projects is in neither number, because it checks no source itself. Where it is off, \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060: passing a value that is null compiles silently and throws on the first property access."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~0.7 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 5 assertion(s) across the 7291 source line(s) of the 43 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: playground/ruff/src/Editor/Editor.tsx (2), playground/ruff/src/Editor/SecondaryPanel.tsx (2), playground/ruff/src/Editor/settings.ts (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060show_files\u0060 turns every \u0060Err\u0060 into \u0060true\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":"crates/ruff/src/commands/show_files.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e89b524291670d889aba9810169ff1c3b92b1617e8e1808de46dda7e2b1a52"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060version\u0060 turns every \u0060Err\u0060 into \u00600\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":"crates/ruff/src/version.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8fed54b9e4d85902c666d7b562043aab2f5e8191b9c43e43691333687f1de5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060version\u0060 turns every \u0060Err\u0060 into \u00600\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":"crates/ty/src/version.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"df071051a6c677a7c52e381e3c2959cf6f9d7c5b46041d5a884cc06bbe8a7f53"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060code_actions\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\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":"crates/ty_ide/src/code_action.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fe01904fd01c13fcbd4d3fa70d338d00872c576729b4fa8c49f1423d3e7dfe"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"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-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-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":88,"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."]}]}